diff --git a/lib/kokkos/Copyright.txt b/lib/kokkos/Copyright.txt deleted file mode 100644 index 05980758fa..0000000000 --- a/lib/kokkos/Copyright.txt +++ /dev/null @@ -1,40 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER diff --git a/lib/kokkos/LICENSE b/lib/kokkos/LICENSE deleted file mode 100644 index 05980758fa..0000000000 --- a/lib/kokkos/LICENSE +++ /dev/null @@ -1,40 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER diff --git a/lib/kokkos/Makefile.kokkos b/lib/kokkos/Makefile.kokkos deleted file mode 100644 index 30ecec3364..0000000000 --- a/lib/kokkos/Makefile.kokkos +++ /dev/null @@ -1,377 +0,0 @@ -# Default settings common options - -KOKKOS_PATH=../../lib/kokkos - -#Options: OpenMP,Serial,Pthreads,Cuda -KOKKOS_DEVICES ?= "OpenMP" -#KOKKOS_DEVICES ?= "Pthreads" -#Options: KNC,SNB,HSW,Kepler,Kepler30,Kepler32,Kepler35,Kepler37,Maxwell,Maxwell50,Maxwell52,Maxwell53,ARMv8,BGQ,Power7,Power8 -KOKKOS_ARCH ?= "" -#Options: yes,no -KOKKOS_DEBUG ?= "no" -#Options: hwloc,librt -KOKKOS_USE_TPLS ?= "" -#Options: c++11 -KOKKOS_CXX_STANDARD ?= "c++11" -#Options: kernel_times,aggregate_mpi -KOKKOS_PROFILING ?= "" - -#Default settings specific options -#Options: force_uvm,use_ldg,rdc,enable_lambda -KOKKOS_CUDA_OPTIONS ?= "" - -# Check for general settings - -KOKKOS_INTERNAL_ENABLE_DEBUG := $(strip $(shell echo $(KOKKOS_DEBUG) | grep "yes" | wc -l)) -KOKKOS_INTERNAL_ENABLE_PROFILING_COLLECT_KERNEL_DATA := $(strip $(shell echo $(KOKKOS_PROFILING) | grep "kernel_times" | wc -l)) -KOKKOS_INTERNAL_ENABLE_PROFILING_AGGREGATE_MPI := $(strip $(shell echo $(KOKKOS_PROFILING) | grep "aggregate_mpi" | wc -l)) -KOKKOS_INTERNAL_ENABLE_CXX11 := $(strip $(shell echo $(KOKKOS_CXX_STANDARD) | grep "c++11" | wc -l)) - -# Check for external libraries -KOKKOS_INTERNAL_USE_HWLOC := $(strip $(shell echo $(KOKKOS_USE_TPLS) | grep "hwloc" | wc -l)) -KOKKOS_INTERNAL_USE_LIBRT := $(strip $(shell echo $(KOKKOS_USE_TPLS) | grep "librt" | wc -l)) - -# Check for advanced settings -KOKKOS_INTERNAL_CUDA_USE_LDG := $(strip $(shell echo $(KOKKOS_CUDA_OPTIONS) | grep "use_ldg" | wc -l)) -KOKKOS_INTERNAL_CUDA_USE_UVM := $(strip $(shell echo $(KOKKOS_CUDA_OPTIONS) | grep "force_uvm" | wc -l)) -KOKKOS_INTERNAL_CUDA_USE_RELOC := $(strip $(shell echo $(KOKKOS_CUDA_OPTIONS) | grep "rdc" | wc -l)) -KOKKOS_INTERNAL_CUDA_USE_LAMBDA := $(strip $(shell echo $(KOKKOS_CUDA_OPTIONS) | grep "enable_lambda" | wc -l)) - -# Check for Kokkos Host Execution Spaces one of which must be on - -KOKKOS_INTERNAL_USE_OPENMP := $(strip $(shell echo $(KOKKOS_DEVICES) | grep OpenMP | wc -l)) -KOKKOS_INTERNAL_USE_PTHREADS := $(strip $(shell echo $(KOKKOS_DEVICES) | grep Pthread | wc -l)) -KOKKOS_INTERNAL_USE_SERIAL := $(strip $(shell echo $(KOKKOS_DEVICES) | grep Serial | wc -l)) -KOKKOS_INTERNAL_USE_QTHREAD := $(strip $(shell echo $(KOKKOS_DEVICES) | grep Qthread | wc -l)) - -ifeq ($(KOKKOS_INTERNAL_USE_OPENMP), 0) -ifeq ($(KOKKOS_INTERNAL_USE_PTHREADS), 0) - KOKKOS_INTERNAL_USE_SERIAL := 1 -endif -endif - -KOKKOS_INTERNAL_COMPILER_PGI := $(shell $(CXX) --version 2>&1 | grep PGI | wc -l) -KOKKOS_INTERNAL_COMPILER_XL := $(shell $(CXX) -qversion 2>&1 | grep XL | wc -l) -KOKKOS_INTERNAL_COMPILER_CRAY := $(shell $(CXX) -craype-verbose 2>&1 | grep "CC-" | wc -l) -KOKKOS_INTERNAL_OS_CYGWIN := $(shell uname | grep CYGWIN | wc -l) - -ifeq ($(KOKKOS_INTERNAL_COMPILER_PGI), 1) - KOKKOS_INTERNAL_OPENMP_FLAG := -mp -else - ifeq ($(KOKKOS_INTERNAL_COMPILER_XL), 1) - KOKKOS_INTERNAL_OPENMP_FLAG := -qsmp=omp - else - ifeq ($(KOKKOS_INTERNAL_COMPILER_CRAY), 1) - # OpenMP is turned on by default in Cray compiler environment - KOKKOS_INTERNAL_OPENMP_FLAG := - else - KOKKOS_INTERNAL_OPENMP_FLAG := -fopenmp - endif - endif -endif - -ifeq ($(KOKKOS_INTERNAL_COMPILER_PGI), 1) - KOKKOS_INTERNAL_CXX11_FLAG := --c++11 -else - ifeq ($(KOKKOS_INTERNAL_COMPILER_XL), 1) - KOKKOS_INTERNAL_CXX11_FLAG := -std=c++11 - else - ifeq ($(KOKKOS_INTERNAL_COMPILER_CRAY), 1) - KOKKOS_INTERNAL_CXX11_FLAG := -hstd=c++11 - else - KOKKOS_INTERNAL_CXX11_FLAG := --std=c++11 - endif - endif -endif - -# Check for other Execution Spaces -KOKKOS_INTERNAL_USE_CUDA := $(strip $(shell echo $(KOKKOS_DEVICES) | grep Cuda | wc -l)) - -# Check for Kokkos Architecture settings - -#Intel based -KOKKOS_INTERNAL_USE_ARCH_KNC := $(strip $(shell echo $(KOKKOS_ARCH) | grep KNC | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_SNB := $(strip $(shell echo $(KOKKOS_ARCH) | grep SNB | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_HSW := $(strip $(shell echo $(KOKKOS_ARCH) | grep HSW | wc -l)) - -#NVIDIA based -KOKKOS_INTERNAL_USE_ARCH_KEPLER30 := $(strip $(shell echo $(KOKKOS_ARCH) | grep Kepler30 | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_KEPLER32 := $(strip $(shell echo $(KOKKOS_ARCH) | grep Kepler32 | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_KEPLER35 := $(strip $(shell echo $(KOKKOS_ARCH) | grep Kepler35 | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_KEPLER37 := $(strip $(shell echo $(KOKKOS_ARCH) | grep Kepler37 | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_MAXWELL50 := $(strip $(shell echo $(KOKKOS_ARCH) | grep Maxwell50 | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_MAXWELL52 := $(strip $(shell echo $(KOKKOS_ARCH) | grep Maxwell52 | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_MAXWELL53 := $(strip $(shell echo $(KOKKOS_ARCH) | grep Maxwell53 | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_NVIDIA := $(strip $(shell echo $(KOKKOS_INTERNAL_USE_ARCH_KEPLER30) \ - + $(KOKKOS_INTERNAL_USE_ARCH_KEPLER32) \ - + $(KOKKOS_INTERNAL_USE_ARCH_KEPLER35) \ - + $(KOKKOS_INTERNAL_USE_ARCH_KEPLER37) \ - + $(KOKKOS_INTERNAL_USE_ARCH_MAXWELL50) \ - + $(KOKKOS_INTERNAL_USE_ARCH_MAXWELL52) \ - + $(KOKKOS_INTERNAL_USE_ARCH_MAXWELL53) | bc)) - -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_NVIDIA), 0) -KOKKOS_INTERNAL_USE_ARCH_MAXWELL50 := $(strip $(shell echo $(KOKKOS_ARCH) | grep Maxwell | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_KEPLER35 := $(strip $(shell echo $(KOKKOS_ARCH) | grep Kepler | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_NVIDIA := $(strip $(shell echo $(KOKKOS_INTERNAL_USE_ARCH_KEPLER30) \ - + $(KOKKOS_INTERNAL_USE_ARCH_KEPLER32) \ - + $(KOKKOS_INTERNAL_USE_ARCH_KEPLER35) \ - + $(KOKKOS_INTERNAL_USE_ARCH_KEPLER37) \ - + $(KOKKOS_INTERNAL_USE_ARCH_MAXWELL50) \ - + $(KOKKOS_INTERNAL_USE_ARCH_MAXWELL52) \ - + $(KOKKOS_INTERNAL_USE_ARCH_MAXWELL53) | bc)) -endif - -#ARM based -KOKKOS_INTERNAL_USE_ARCH_ARMV80 := $(strip $(shell echo $(KOKKOS_ARCH) | grep ARMv8 | wc -l)) - -#IBM based -KOKKOS_INTERNAL_USE_ARCH_BGQ := $(strip $(shell echo $(KOKKOS_ARCH) | grep BGQ | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_POWER7 := $(strip $(shell echo $(KOKKOS_ARCH) | grep Power7 | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_POWER8 := $(strip $(shell echo $(KOKKOS_ARCH) | grep Power8 | wc -l)) -KOKKOS_INTERNAL_USE_ARCH_IBM := $(strip $(shell echo $(KOKKOS_INTERNAL_USE_ARCH_BGQ)+$(KOKKOS_INTERNAL_USE_ARCH_POWER7)+$(KOKKOS_INTERNAL_USE_ARCH_POWER8) | bc)) - -#AMD based -KOKKOS_INTERNAL_USE_ARCH_AMDAVX := $(strip $(shell echo $(KOKKOS_ARCH) | grep AMDAVX | wc -l)) - -#Any AVX? -KOKKOS_INTERNAL_USE_ARCH_AVX := $(strip $(shell echo $(KOKKOS_INTERNAL_USE_ARCH_SNB)+$(KOKKOS_INTERNAL_USE_ARCH_AMDAVX) | bc )) -KOKKOS_INTERNAL_USE_ARCH_AVX2 := $(strip $(shell echo $(KOKKOS_INTERNAL_USE_ARCH_HSW) | bc )) - -#Incompatible flags? -KOKKOS_INTERNAL_USE_ARCH_MULTIHOST := $(strip $(shell echo "$(KOKKOS_INTERNAL_USE_ARCH_AVX)+$(KOKKOS_INTERNAL_USE_ARCH_AVX2)+$(KOKKOS_INTERNAL_USE_ARCH_KNC)+$(KOKKOS_INTERNAL_USE_ARCH_IBM)+$(KOKKOS_INTERNAL_USE_ARCH_AMDAVX)+$(KOKKOS_INTERNAL_USE_ARCH_ARMV80)>1" | bc )) -KOKKOS_INTERNAL_USE_ARCH_MULTIGPU := $(strip $(shell echo "$(KOKKOS_INTERNAL_USE_ARCH_NVIDIA)>1" | bc)) - -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_MULTIHOST), 1) - $(error Defined Multiple Host architectures: KOKKOS_ARCH=$(KOKKOS_ARCH) ) -endif -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_MULTIGPU), 1) - $(error Defined Multiple GPU architectures: KOKKOS_ARCH=$(KOKKOS_ARCH) ) -endif - -#Generating the list of Flags - -KOKKOS_CPPFLAGS = -I./ -I$(KOKKOS_PATH)/core/src -I$(KOKKOS_PATH)/containers/src -I$(KOKKOS_PATH)/algorithms/src -# No warnings: -KOKKOS_CXXFLAGS = -# INTEL and CLANG warnings: -#KOKKOS_CXXFLAGS = -Wall -Wshadow -pedantic -Wsign-compare -Wtype-limits -Wuninitialized -# GCC warnings: -#KOKKOS_CXXFLAGS = -Wall -Wshadow -pedantic -Wsign-compare -Wtype-limits -Wuninitialized -Wignored-qualifiers -Wempty-body -Wclobbered - -KOKKOS_LIBS = -lkokkos -KOKKOS_LDFLAGS = -L$(shell pwd) -KOKKOS_SRC = -KOKKOS_HEADERS = - -#Generating the KokkosCore_config.h file - -tmp := $(shell echo "/* ---------------------------------------------" > KokkosCore_config.tmp) -tmp := $(shell echo "Makefile constructed configuration:" >> KokkosCore_config.tmp) -tmp := $(shell date >> KokkosCore_config.tmp) -tmp := $(shell echo "----------------------------------------------*/" >> KokkosCore_config.tmp) - - -tmp := $(shell echo "/* Execution Spaces */" >> KokkosCore_config.tmp) -ifeq ($(KOKKOS_INTERNAL_USE_OPENMP), 1) - tmp := $(shell echo '\#define KOKKOS_HAVE_OPENMP 1' >> KokkosCore_config.tmp) -endif - -ifeq ($(KOKKOS_INTERNAL_USE_PTHREADS), 1) - tmp := $(shell echo "\#define KOKKOS_HAVE_PTHREAD 1" >> KokkosCore_config.tmp ) -endif - -ifeq ($(KOKKOS_INTERNAL_USE_SERIAL), 1) - tmp := $(shell echo "\#define KOKKOS_HAVE_SERIAL 1" >> KokkosCore_config.tmp ) -endif - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - tmp := $(shell echo "\#define KOKKOS_HAVE_CUDA 1" >> KokkosCore_config.tmp ) -endif - -ifeq ($(KOKKOS_INTERNAL_USE_QTHREAD), 1) - KOKKOS_CPPFLAGS += -I$(QTHREAD_PATH)/include - KOKKOS_LDFLAGS += -L$(QTHREAD_PATH)/lib - tmp := $(shell echo "\#define KOKKOS_HAVE_QTHREAD 1" >> KokkosCore_config.tmp ) -endif - -tmp := $(shell echo "/* General Settings */" >> KokkosCore_config.tmp) -ifeq ($(KOKKOS_INTERNAL_ENABLE_CXX11), 1) - KOKKOS_CXXFLAGS += $(KOKKOS_INTERNAL_CXX11_FLAG) - tmp := $(shell echo "\#define KOKKOS_HAVE_CXX11 1" >> KokkosCore_config.tmp ) -endif - -ifeq ($(KOKKOS_INTERNAL_ENABLE_DEBUG), 1) -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - KOKKOS_CXXFLAGS += -G -endif - KOKKOS_CXXFLAGS += -g - KOKKOS_LDFLAGS += -g -ldl - tmp := $(shell echo "\#define KOKKOS_ENABLE_DEBUG_BOUNDS_CHECK 1" >> KokkosCore_config.tmp ) - tmp := $(shell echo "\#define KOKKOS_HAVE_DEBUG 1" >> KokkosCore_config.tmp ) -endif - -ifeq ($(KOKKOS_INTERNAL_USE_HWLOC), 1) - KOKKOS_CPPFLAGS += -I$(HWLOC_PATH)/include - KOKKOS_LDFLAGS += -L$(HWLOC_PATH)/lib - KOKKOS_LIBS += -lhwloc - tmp := $(shell echo "\#define KOKKOS_HAVE_HWLOC 1" >> KokkosCore_config.tmp ) -endif - -ifeq ($(KOKKOS_INTERNAL_USE_LIBRT), 1) - tmp := $(shell echo "\#define KOKKOS_USE_LIBRT 1" >> KokkosCore_config.tmp ) - tmp := $(shell echo "\#define PREC_TIMER 1" >> KokkosCore_config.tmp ) - tmp := $(shell echo "\#define KOKKOSP_ENABLE_RTLIB 1" >> KokkosCore_config.tmp ) - KOKKOS_LIBS += -lrt -endif - -tmp := $(shell echo "/* Cuda Settings */" >> KokkosCore_config.tmp) - -ifeq ($(KOKKOS_INTERNAL_CUDA_USE_LDG), 1) - tmp := $(shell echo "\#define KOKKOS_CUDA_USE_LDG_INTRINSIC 1" >> KokkosCore_config.tmp ) -endif - -ifeq ($(KOKKOS_INTERNAL_CUDA_USE_UVM), 1) - tmp := $(shell echo "\#define KOKKOS_CUDA_USE_UVM 1" >> KokkosCore_config.tmp ) - tmp := $(shell echo "\#define KOKKOS_USE_CUDA_UVM 1" >> KokkosCore_config.tmp ) -endif - -ifeq ($(KOKKOS_INTERNAL_CUDA_USE_RELOC), 1) - tmp := $(shell echo "\#define KOKKOS_CUDA_USE_RELOCATABLE_DEVICE_CODE 1" >> KokkosCore_config.tmp ) - KOKKOS_CXXFLAGS += --relocatable-device-code=true - KOKKOS_LDFLAGS += --relocatable-device-code=true -endif - -ifeq ($(KOKKOS_INTERNAL_CUDA_USE_LAMBDA), 1) - tmp := $(shell echo "\#define KOKKOS_CUDA_USE_LAMBDA 1" >> KokkosCore_config.tmp ) - KOKKOS_CXXFLAGS += -expt-extended-lambda -endif - -#Add Architecture flags - -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_AVX), 1) - ifeq ($(KOKKOS_INTERNAL_COMPILER_CRAY), 1) - KOKKOS_CXXFLAGS += - KOKKOS_LDFLAGS += - else - KOKKOS_CXXFLAGS += -mavx - KOKKOS_LDFLAGS += -mavx - endif -endif - -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_POWER8), 1) - KOKKOS_CXXFLAGS += -mcpu=power8 - KOKKOS_LDFLAGS += -mcpu=power8 -endif - -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_AVX2), 1) - KOKKOS_CXXFLAGS += -march=core-avx2 - KOKKOS_LDFLAGS += -march=core-avx2 -endif - -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_KNC), 1) - KOKKOS_CXXFLAGS += -mmic - KOKKOS_LDFLAGS += -mmic -endif - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_KEPLER30), 1) - KOKKOS_CXXFLAGS += -arch=sm_30 -endif -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_KEPLER32), 1) - KOKKOS_CXXFLAGS += -arch=sm_32 -endif -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_KEPLER35), 1) - KOKKOS_CXXFLAGS += -arch=sm_35 -endif -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_KEPLER37), 1) - KOKKOS_CXXFLAGS += -arch=sm_37 -endif -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_MAXWELL50), 1) - KOKKOS_CXXFLAGS += -arch=sm_50 -endif -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_MAXWELL52), 1) - KOKKOS_CXXFLAGS += -arch=sm_52 -endif -ifeq ($(KOKKOS_INTERNAL_USE_ARCH_MAXWELL53), 1) - KOKKOS_CXXFLAGS += -arch=sm_53 -endif -endif - -KOKKOS_INTERNAL_LS_CONFIG := $(shell ls KokkosCore_config.h) -ifeq ($(KOKKOS_INTERNAL_LS_CONFIG), KokkosCore_config.h) -KOKKOS_INTERNAL_NEW_CONFIG := $(strip $(shell diff KokkosCore_config.h KokkosCore_config.tmp | grep define | wc -l)) -else -KOKKOS_INTERNAL_NEW_CONFIG := 1 -endif - -ifneq ($(KOKKOS_INTERNAL_NEW_CONFIG), 0) - tmp := $(shell cp KokkosCore_config.tmp KokkosCore_config.h) -endif - -KOKKOS_HEADERS += $(wildcard $(KOKKOS_PATH)/core/src/*.hpp) -KOKKOS_HEADERS += $(wildcard $(KOKKOS_PATH)/core/src/impl/*.hpp) -KOKKOS_HEADERS += $(wildcard $(KOKKOS_PATH)/containers/src/*.hpp) -KOKKOS_HEADERS += $(wildcard $(KOKKOS_PATH)/containers/src/impl/*.hpp) -KOKKOS_HEADERS += $(wildcard $(KOKKOS_PATH)/algorithms/src/*.hpp) - -KOKKOS_SRC += $(wildcard $(KOKKOS_PATH)/core/src/impl/*.cpp) -KOKKOS_SRC += $(wildcard $(KOKKOS_PATH)/containers/src/impl/*.cpp) - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - KOKKOS_SRC += $(wildcard $(KOKKOS_PATH)/core/src/Cuda/*.cpp) - KOKKOS_HEADERS += $(wildcard $(KOKKOS_PATH)/core/src/Cuda/*.hpp) - KOKKOS_LDFLAGS += -L$(CUDA_PATH)/lib64 - KOKKOS_LIBS += -lcudart -lcuda -endif - -ifeq ($(KOKKOS_INTERNAL_USE_PTHREADS), 1) - KOKKOS_LIBS += -lpthread - KOKKOS_SRC += $(wildcard $(KOKKOS_PATH)/core/src/Threads/*.cpp) - KOKKOS_HEADERS += $(wildcard $(KOKKOS_PATH)/core/src/Threads/*.hpp) -endif - -ifeq ($(KOKKOS_INTERNAL_USE_QTHREAD), 1) - KOKKOS_LIBS += -lqthread - KOKKOS_SRC += $(wildcard $(KOKKOS_PATH)/core/src/Qthread/*.cpp) - KOKKOS_HEADERS += $(wildcard $(KOKKOS_PATH)/core/src/Qthread/*.hpp) -endif - -ifeq ($(KOKKOS_INTERNAL_USE_OPENMP), 1) - KOKKOS_SRC += $(wildcard $(KOKKOS_PATH)/core/src/OpenMP/*.cpp) - KOKKOS_HEADERS += $(wildcard $(KOKKOS_PATH)/core/src/OpenMP/*.hpp) - ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - KOKKOS_CXXFLAGS += -Xcompiler $(KOKKOS_INTERNAL_OPENMP_FLAG) - else - KOKKOS_CXXFLAGS += $(KOKKOS_INTERNAL_OPENMP_FLAG) - endif - KOKKOS_LDFLAGS += $(KOKKOS_INTERNAL_OPENMP_FLAG) -endif - -#With Cygwin functions such as fdopen and fileno are not defined -#when strict ansi is enabled. strict ansi gets enabled with --std=c++11 -#though. So we hard undefine it here. Not sure if that has any bad side effects -#This is needed for gtest actually, not for Kokkos itself! -ifeq ($(KOKKOS_INTERNAL_OS_CYGWIN), 1) - KOKKOS_CXXFLAGS += -U__STRICT_ANSI__ -endif - -# Setting up dependencies - -KokkosCore_config.h: - -KOKKOS_CPP_DEPENDS := KokkosCore_config.h $(KOKKOS_HEADERS) - -KOKKOS_OBJ = $(KOKKOS_SRC:.cpp=.o) -KOKKOS_OBJ_LINK = $(notdir $(KOKKOS_OBJ)) - -include $(KOKKOS_PATH)/Makefile.targets - -kokkos-clean: - rm -f $(KOKKOS_OBJ_LINK) KokkosCore_config.h KokkosCore_config.tmp libkokkos.a - -libkokkos.a: $(KOKKOS_OBJ_LINK) $(KOKKOS_SRC) $(KOKKOS_HEADERS) - ar cr libkokkos.a $(KOKKOS_OBJ_LINK) - ranlib libkokkos.a - -KOKKOS_LINK_DEPENDS=libkokkos.a diff --git a/lib/kokkos/Makefile.targets b/lib/kokkos/Makefile.targets deleted file mode 100644 index 009adb42c0..0000000000 --- a/lib/kokkos/Makefile.targets +++ /dev/null @@ -1,57 +0,0 @@ -Kokkos_UnorderedMap_impl.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/containers/src/impl/Kokkos_UnorderedMap_impl.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/containers/src/impl/Kokkos_UnorderedMap_impl.cpp -Kokkos_AllocationTracker.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/Kokkos_AllocationTracker.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/Kokkos_AllocationTracker.cpp -Kokkos_BasicAllocators.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/Kokkos_BasicAllocators.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/Kokkos_BasicAllocators.cpp -Kokkos_Core.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/Kokkos_Core.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/Kokkos_Core.cpp -Kokkos_Error.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/Kokkos_Error.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/Kokkos_Error.cpp -Kokkos_HostSpace.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/Kokkos_HostSpace.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/Kokkos_HostSpace.cpp -Kokkos_hwloc.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/Kokkos_hwloc.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/Kokkos_hwloc.cpp -Kokkos_Serial.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/Kokkos_Serial.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/Kokkos_Serial.cpp -Kokkos_Serial_TaskPolicy.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/Kokkos_Serial_TaskPolicy.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/Kokkos_Serial_TaskPolicy.cpp -Kokkos_Shape.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/Kokkos_Shape.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/Kokkos_Shape.cpp -Kokkos_spinwait.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/Kokkos_spinwait.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/Kokkos_spinwait.cpp -Kokkos_Profiling_Interface.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/Kokkos_Profiling_Interface.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/Kokkos_Profiling_Interface.cpp -KokkosExp_SharedAlloc.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/impl/KokkosExp_SharedAlloc.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/impl/KokkosExp_SharedAlloc.cpp - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) -Kokkos_Cuda_BasicAllocators.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/Cuda/Kokkos_Cuda_BasicAllocators.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/Cuda/Kokkos_Cuda_BasicAllocators.cpp -Kokkos_Cuda_Impl.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/Cuda/Kokkos_Cuda_Impl.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/Cuda/Kokkos_Cuda_Impl.cpp -Kokkos_CudaSpace.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/Cuda/Kokkos_CudaSpace.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/Cuda/Kokkos_CudaSpace.cpp -endif - -ifeq ($(KOKKOS_INTERNAL_USE_PTHREADS), 1) -Kokkos_ThreadsExec_base.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/Threads/Kokkos_ThreadsExec_base.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/Threads/Kokkos_ThreadsExec_base.cpp -Kokkos_ThreadsExec.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/Threads/Kokkos_ThreadsExec.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/Threads/Kokkos_ThreadsExec.cpp -Kokkos_Threads_TaskPolicy.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/Threads/Kokkos_Threads_TaskPolicy.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/Threads/Kokkos_Threads_TaskPolicy.cpp -endif - -ifeq ($(KOKKOS_INTERNAL_USE_QTHREAD), 1) -Kokkos_QthreadExec.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/Qthread/Kokkos_QthreadExec.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/Qthread/Kokkos_QthreadExec.cpp -Kokkos_Qthread_TaskPolicy.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/Qthread/Kokkos_Qthread_TaskPolicy.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/Qthread/Kokkos_Qthread_TaskPolicy.cpp -endif - -ifeq ($(KOKKOS_INTERNAL_USE_OPENMP), 1) -Kokkos_OpenMPexec.o: $(KOKKOS_CPP_DEPENDS) $(KOKKOS_PATH)/core/src/OpenMP/Kokkos_OpenMPexec.cpp - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) -c $(KOKKOS_PATH)/core/src/OpenMP/Kokkos_OpenMPexec.cpp -endif - diff --git a/lib/kokkos/README b/lib/kokkos/README deleted file mode 100644 index 85bd0142bf..0000000000 --- a/lib/kokkos/README +++ /dev/null @@ -1,126 +0,0 @@ -Kokkos implements a programming model in C++ for writing performance portable -applications targeting all major HPC platforms. For that purpose it provides -abstractions for both parallel execution of code and data management. -Kokkos is designed to target complex node architectures with N-level memory -hierarchies and multiple types of execution resources. It currently can use -OpenMP, Pthreads and CUDA as backend programming models. - -The core developers of Kokkos are Carter Edwards and Christian Trott -at the Computer Science Research Institute of the Sandia National -Laboratories. - -The KokkosP interface and associated tools are developed by the Application -Performance Team and Kokkos core developers at Sandia National Laboratories. - -To learn more about Kokkos consider watching one of our presentations: -GTC 2015: - http://on-demand.gputechconf.com/gtc/2015/video/S5166.html - http://on-demand.gputechconf.com/gtc/2015/presentation/S5166-H-Carter-Edwards.pdf - -A programming guide can be found under doc/Kokkos_PG.pdf. This is an initial version -and feedback is greatly appreciated. - -For questions please send an email to -kokkos-users@software.sandia.gov - -For non-public questions send an email to -hcedwar(at)sandia.gov and crtrott(at)sandia.gov - -============================================================================ -====Requirements============================================================ -============================================================================ - -Primary tested compilers are: - GCC 4.7.2 - GCC 4.8.4 - GCC 4.9.2 - GCC 5.1.0 - Intel 14.0.4 - Intel 15.0.2 - Clang 3.5.2 - Clang 3.6.1 - -Secondary tested compilers are: - CUDA 6.5 (with gcc 4.7.2) - CUDA 7.0 (with gcc 4.7.2) - -Other compilers working: - PGI 15.4 - IBM XL 13.1.2 - Cygwin 2.1.0 64bit with gcc 4.9.3 - -Primary tested compiler are passing in release mode -with warnings as errors. We are using the following set -of flags: -GCC: -Wall -Wshadow -pedantic -Werror -Wsign-compare -Wtype-limits - -Wignored-qualifiers -Wempty-body -Wclobbered -Wuninitialized -Intel: -Wall -Wshadow -pedantic -Werror -Wsign-compare -Wtype-limits -Wuninitialized -Clang: -Wall -Wshadow -pedantic -Werror -Wsign-compare -Wtype-limits -Wuninitialized - -Secondary compilers are passing without -Werror. -Other compilers are tested occasionally. - -============================================================================ -====Getting started========================================================= -============================================================================ - -In the 'example/tutorial' directory you will find step by step tutorial -examples which explain many of the features of Kokkos. They work with -simple Makefiles. To build with g++ and OpenMP simply type 'make openmp' -in the 'example/tutorial' directory. This will build all examples in the -subfolders. - -============================================================================ -====Running Unit Tests====================================================== -============================================================================ - -To run the unit tests create a build directory and run the following commands - -KOKKOS_PATH/generate_makefile.bash -make build-test -make test - -Run KOKKOS_PATH/generate_makefile.bash --help for more detailed options such as -changing the device type for which to build. - -============================================================================ -====Install the library===================================================== -============================================================================ - -To install Kokkos as a library create a build directory and run the following - -KOKKOS_PATH/generate_makefile.bash --prefix=INSTALL_PATH -make lib -make install - -KOKKOS_PATH/generate_makefile.bash --help for more detailed options such as -changing the device type for which to build. - -============================================================================ -====CMakeFiles============================================================== -============================================================================ - -The CMake files contained in this repository require Tribits and are used -for integration with Trilinos. They do not currently support a standalone -CMake build. - -=========================================================================== -====Kokkos and CUDA UVM==================================================== -=========================================================================== - -Kokkos does support UVM as a specific memory space called CudaUVMSpace. -Allocations made with that space are accessible from host and device. -You can tell Kokkos to use that as the default space for Cuda allocations. -In either case UVM comes with a number of restrictions: -(i) You can't access allocations on the host while a kernel is potentially -running. This will lead to segfaults. To avoid that you either need to -call Kokkos::Cuda::fence() (or just Kokkos::fence()), after kernels, or -you can set the environment variable CUDA_LAUNCH_BLOCKING=1. -Furthermore in multi socket multi GPU machines, UVM defaults to using -zero copy allocations for technical reasons related to using multiple -GPUs from the same process. If an executable doesn't do that (e.g. each -MPI rank of an application uses a single GPU [can be the same GPU for -multiple MPI ranks]) you can set CUDA_MANAGED_FORCE_DEVICE_ALLOC=1. -This will enforce proper UVM allocations, but can lead to errors if -more than a single GPU is used by a single process. - diff --git a/lib/kokkos/algorithms/src/KokkosAlgorithms_dummy.cpp b/lib/kokkos/algorithms/src/KokkosAlgorithms_dummy.cpp deleted file mode 100644 index e69de29bb2..0000000000 diff --git a/lib/kokkos/algorithms/src/Kokkos_Random.hpp b/lib/kokkos/algorithms/src/Kokkos_Random.hpp deleted file mode 100644 index 17f5e073c3..0000000000 --- a/lib/kokkos/algorithms/src/Kokkos_Random.hpp +++ /dev/null @@ -1,1692 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_RANDOM_HPP -#define KOKKOS_RANDOM_HPP - -#include -//#include -#include -#include -#include - -/// \file Kokkos_Random.hpp -/// \brief Pseudorandom number generators -/// -/// These generators are based on Vigna, Sebastiano (2014). "An -/// experimental exploration of Marsaglia's xorshift generators, -/// scrambled." See: http://arxiv.org/abs/1402.6246 - -namespace Kokkos { - - /*Template functions to get equidistributed random numbers from a generator for a specific Scalar type - - template - struct rand{ - - //Max value returned by draw(Generator& gen) - KOKKOS_INLINE_FUNCTION - static Scalar max(); - - //Returns a value between zero and max() - KOKKOS_INLINE_FUNCTION - static Scalar draw(Generator& gen); - - //Returns a value between zero and range() - //Note: for floating point values range can be larger than max() - KOKKOS_INLINE_FUNCTION - static Scalar draw(Generator& gen, const Scalar& range){} - - //Return value between start and end - KOKKOS_INLINE_FUNCTION - static Scalar draw(Generator& gen, const Scalar& start, const Scalar& end); - }; - - The Random number generators themselves have two components a state-pool and the actual generator - A state-pool manages a number of generators, so that each active thread is able to grep its own. - This allows the generation of random numbers which are independent between threads. Note that - in contrast to CuRand none of the functions of the pool (or the generator) are collectives, - i.e. all functions can be called inside conditionals. - - template - class Pool { - public: - //The Kokkos device type - typedef Device device_type; - //The actual generator type - typedef Generator generator_type; - - //Default constructor: does not initialize a pool - Pool(); - - //Initializing constructor: calls init(seed,Device_Specific_Number); - Pool(unsigned int seed); - - //Intialize Pool with seed as a starting seed with a pool_size of num_states - //The Random_XorShift64 generator is used in serial to initialize all states, - //thus the intialization process is platform independent and deterministic. - void init(unsigned int seed, int num_states); - - //Get a generator. This will lock one of the states, guaranteeing that each thread - //will have its private generator. Note: on Cuda getting a state involves atomics, - //and is thus not deterministic! - generator_type get_state(); - - //Give a state back to the pool. This unlocks the state, and writes the modified - //state of the generator back to the pool. - void free_state(generator_type gen); - - } - - template - class Generator { - public: - //The Kokkos device type - typedef DeviceType device_type; - - //Max return values of respective [X]rand[S]() functions - enum {MAX_URAND = 0xffffffffU}; - enum {MAX_URAND64 = 0xffffffffffffffffULL-1}; - enum {MAX_RAND = static_cast(0xffffffffU/2)}; - enum {MAX_RAND64 = static_cast(0xffffffffffffffffULL/2-1)}; - - - //Init with a state and the idx with respect to pool. Note: in serial the - //Generator can be used by just giving it the necessary state arguments - KOKKOS_INLINE_FUNCTION - Generator (STATE_ARGUMENTS, int state_idx = 0); - - //Draw a equidistributed uint32_t in the range (0,MAX_URAND] - KOKKOS_INLINE_FUNCTION - uint32_t urand(); - - //Draw a equidistributed uint64_t in the range (0,MAX_URAND64] - KOKKOS_INLINE_FUNCTION - uint64_t urand64(); - - //Draw a equidistributed uint32_t in the range (0,range] - KOKKOS_INLINE_FUNCTION - uint32_t urand(const uint32_t& range); - - //Draw a equidistributed uint32_t in the range (start,end] - KOKKOS_INLINE_FUNCTION - uint32_t urand(const uint32_t& start, const uint32_t& end ); - - //Draw a equidistributed uint64_t in the range (0,range] - KOKKOS_INLINE_FUNCTION - uint64_t urand64(const uint64_t& range); - - //Draw a equidistributed uint64_t in the range (start,end] - KOKKOS_INLINE_FUNCTION - uint64_t urand64(const uint64_t& start, const uint64_t& end ); - - //Draw a equidistributed int in the range (0,MAX_RAND] - KOKKOS_INLINE_FUNCTION - int rand(); - - //Draw a equidistributed int in the range (0,range] - KOKKOS_INLINE_FUNCTION - int rand(const int& range); - - //Draw a equidistributed int in the range (start,end] - KOKKOS_INLINE_FUNCTION - int rand(const int& start, const int& end ); - - //Draw a equidistributed int64_t in the range (0,MAX_RAND64] - KOKKOS_INLINE_FUNCTION - int64_t rand64(); - - //Draw a equidistributed int64_t in the range (0,range] - KOKKOS_INLINE_FUNCTION - int64_t rand64(const int64_t& range); - - //Draw a equidistributed int64_t in the range (start,end] - KOKKOS_INLINE_FUNCTION - int64_t rand64(const int64_t& start, const int64_t& end ); - - //Draw a equidistributed float in the range (0,1.0] - KOKKOS_INLINE_FUNCTION - float frand(); - - //Draw a equidistributed float in the range (0,range] - KOKKOS_INLINE_FUNCTION - float frand(const float& range); - - //Draw a equidistributed float in the range (start,end] - KOKKOS_INLINE_FUNCTION - float frand(const float& start, const float& end ); - - //Draw a equidistributed double in the range (0,1.0] - KOKKOS_INLINE_FUNCTION - double drand(); - - //Draw a equidistributed double in the range (0,range] - KOKKOS_INLINE_FUNCTION - double drand(const double& range); - - //Draw a equidistributed double in the range (start,end] - KOKKOS_INLINE_FUNCTION - double drand(const double& start, const double& end ); - - //Draw a standard normal distributed double - KOKKOS_INLINE_FUNCTION - double normal() ; - - //Draw a normal distributed double with given mean and standard deviation - KOKKOS_INLINE_FUNCTION - double normal(const double& mean, const double& std_dev=1.0); - } - - //Additional Functions: - - //Fills view with random numbers in the range (0,range] - template - void fill_random(ViewType view, PoolType pool, ViewType::value_type range); - - //Fills view with random numbers in the range (start,end] - template - void fill_random(ViewType view, PoolType pool, - ViewType::value_type start, ViewType::value_type end); - -*/ - - template - struct rand; - - - template - struct rand { - - KOKKOS_INLINE_FUNCTION - static short max(){return 127;} - KOKKOS_INLINE_FUNCTION - static short draw(Generator& gen) - {return short((gen.rand()&0xff+256)%256);} - KOKKOS_INLINE_FUNCTION - static short draw(Generator& gen, const char& range) - {return char(gen.rand(range));} - KOKKOS_INLINE_FUNCTION - static short draw(Generator& gen, const char& start, const char& end) - {return char(gen.rand(start,end));} - - }; - - template - struct rand { - KOKKOS_INLINE_FUNCTION - static short max(){return 32767;} - KOKKOS_INLINE_FUNCTION - static short draw(Generator& gen) - {return short((gen.rand()&0xffff+65536)%32768);} - KOKKOS_INLINE_FUNCTION - static short draw(Generator& gen, const short& range) - {return short(gen.rand(range));} - KOKKOS_INLINE_FUNCTION - static short draw(Generator& gen, const short& start, const short& end) - {return short(gen.rand(start,end));} - - }; - - template - struct rand { - KOKKOS_INLINE_FUNCTION - static int max(){return Generator::MAX_RAND;} - KOKKOS_INLINE_FUNCTION - static int draw(Generator& gen) - {return gen.rand();} - KOKKOS_INLINE_FUNCTION - static int draw(Generator& gen, const int& range) - {return gen.rand(range);} - KOKKOS_INLINE_FUNCTION - static int draw(Generator& gen, const int& start, const int& end) - {return gen.rand(start,end);} - - }; - - template - struct rand { - KOKKOS_INLINE_FUNCTION - static unsigned int max () { - return Generator::MAX_URAND; - } - KOKKOS_INLINE_FUNCTION - static unsigned int draw (Generator& gen) { - return gen.urand (); - } - KOKKOS_INLINE_FUNCTION - static unsigned int draw(Generator& gen, const unsigned int& range) { - return gen.urand (range); - } - KOKKOS_INLINE_FUNCTION - static unsigned int - draw (Generator& gen, const unsigned int& start, const unsigned int& end) { - return gen.urand (start, end); - } - }; - - template - struct rand { - KOKKOS_INLINE_FUNCTION - static long max () { - // FIXME (mfh 26 Oct 2014) It would be better to select the - // return value at compile time, using something like enable_if. - return sizeof (long) == 4 ? - static_cast (Generator::MAX_RAND) : - static_cast (Generator::MAX_RAND64); - } - KOKKOS_INLINE_FUNCTION - static long draw (Generator& gen) { - // FIXME (mfh 26 Oct 2014) It would be better to select the - // return value at compile time, using something like enable_if. - return sizeof (long) == 4 ? - static_cast (gen.rand ()) : - static_cast (gen.rand64 ()); - } - KOKKOS_INLINE_FUNCTION - static long draw (Generator& gen, const long& range) { - // FIXME (mfh 26 Oct 2014) It would be better to select the - // return value at compile time, using something like enable_if. - return sizeof (long) == 4 ? - static_cast (gen.rand (static_cast (range))) : - static_cast (gen.rand64 (range)); - } - KOKKOS_INLINE_FUNCTION - static long draw (Generator& gen, const long& start, const long& end) { - // FIXME (mfh 26 Oct 2014) It would be better to select the - // return value at compile time, using something like enable_if. - return sizeof (long) == 4 ? - static_cast (gen.rand (static_cast (start), - static_cast (end))) : - static_cast (gen.rand64 (start, end)); - } - }; - - template - struct rand { - KOKKOS_INLINE_FUNCTION - static unsigned long max () { - // FIXME (mfh 26 Oct 2014) It would be better to select the - // return value at compile time, using something like enable_if. - return sizeof (unsigned long) == 4 ? - static_cast (Generator::MAX_URAND) : - static_cast (Generator::MAX_URAND64); - } - KOKKOS_INLINE_FUNCTION - static unsigned long draw (Generator& gen) { - // FIXME (mfh 26 Oct 2014) It would be better to select the - // return value at compile time, using something like enable_if. - return sizeof (unsigned long) == 4 ? - static_cast (gen.urand ()) : - static_cast (gen.urand64 ()); - } - KOKKOS_INLINE_FUNCTION - static unsigned long draw(Generator& gen, const unsigned long& range) { - // FIXME (mfh 26 Oct 2014) It would be better to select the - // return value at compile time, using something like enable_if. - return sizeof (unsigned long) == 4 ? - static_cast (gen.urand (static_cast (range))) : - static_cast (gen.urand64 (range)); - } - KOKKOS_INLINE_FUNCTION - static unsigned long - draw (Generator& gen, const unsigned long& start, const unsigned long& end) { - // FIXME (mfh 26 Oct 2014) It would be better to select the - // return value at compile time, using something like enable_if. - return sizeof (unsigned long) == 4 ? - static_cast (gen.urand (static_cast (start), - static_cast (end))) : - static_cast (gen.urand64 (start, end)); - } - }; - - // NOTE (mfh 26 oct 2014) This is a partial specialization for long - // long, a C99 / C++11 signed type which is guaranteed to be at - // least 64 bits. Do NOT write a partial specialization for - // int64_t!!! This is just a typedef! It could be either long or - // long long. We don't know which a priori, and I've seen both. - // The types long and long long are guaranteed to differ, so it's - // always safe to specialize for both. - template - struct rand { - KOKKOS_INLINE_FUNCTION - static long long max () { - // FIXME (mfh 26 Oct 2014) It's legal for long long to be > 64 bits. - return Generator::MAX_RAND64; - } - KOKKOS_INLINE_FUNCTION - static long long draw (Generator& gen) { - // FIXME (mfh 26 Oct 2014) It's legal for long long to be > 64 bits. - return gen.rand64 (); - } - KOKKOS_INLINE_FUNCTION - static long long draw (Generator& gen, const long long& range) { - // FIXME (mfh 26 Oct 2014) It's legal for long long to be > 64 bits. - return gen.rand64 (range); - } - KOKKOS_INLINE_FUNCTION - static long long draw (Generator& gen, const long long& start, const long long& end) { - // FIXME (mfh 26 Oct 2014) It's legal for long long to be > 64 bits. - return gen.rand64 (start, end); - } - }; - - // NOTE (mfh 26 oct 2014) This is a partial specialization for - // unsigned long long, a C99 / C++11 unsigned type which is - // guaranteed to be at least 64 bits. Do NOT write a partial - // specialization for uint64_t!!! This is just a typedef! It could - // be either unsigned long or unsigned long long. We don't know - // which a priori, and I've seen both. The types unsigned long and - // unsigned long long are guaranteed to differ, so it's always safe - // to specialize for both. - template - struct rand { - KOKKOS_INLINE_FUNCTION - static unsigned long long max () { - // FIXME (mfh 26 Oct 2014) It's legal for unsigned long long to be > 64 bits. - return Generator::MAX_URAND64; - } - KOKKOS_INLINE_FUNCTION - static unsigned long long draw (Generator& gen) { - // FIXME (mfh 26 Oct 2014) It's legal for unsigned long long to be > 64 bits. - return gen.urand64 (); - } - KOKKOS_INLINE_FUNCTION - static unsigned long long draw (Generator& gen, const unsigned long long& range) { - // FIXME (mfh 26 Oct 2014) It's legal for long long to be > 64 bits. - return gen.urand64 (range); - } - KOKKOS_INLINE_FUNCTION - static unsigned long long - draw (Generator& gen, const unsigned long long& start, const unsigned long long& end) { - // FIXME (mfh 26 Oct 2014) It's legal for long long to be > 64 bits. - return gen.urand64 (start, end); - } - }; - - template - struct rand { - KOKKOS_INLINE_FUNCTION - static float max(){return 1.0f;} - KOKKOS_INLINE_FUNCTION - static float draw(Generator& gen) - {return gen.frand();} - KOKKOS_INLINE_FUNCTION - static float draw(Generator& gen, const float& range) - {return gen.frand(range);} - KOKKOS_INLINE_FUNCTION - static float draw(Generator& gen, const float& start, const float& end) - {return gen.frand(start,end);} - - }; - - template - struct rand { - KOKKOS_INLINE_FUNCTION - static double max(){return 1.0;} - KOKKOS_INLINE_FUNCTION - static double draw(Generator& gen) - {return gen.drand();} - KOKKOS_INLINE_FUNCTION - static double draw(Generator& gen, const double& range) - {return gen.drand(range);} - KOKKOS_INLINE_FUNCTION - static double draw(Generator& gen, const double& start, const double& end) - {return gen.drand(start,end);} - - }; - - template - class Random_XorShift64_Pool; - - template - class Random_XorShift64 { - private: - uint64_t state_; - const int state_idx_; - friend class Random_XorShift64_Pool; - public: - - typedef DeviceType device_type; - - enum {MAX_URAND = 0xffffffffU}; - enum {MAX_URAND64 = 0xffffffffffffffffULL-1}; - enum {MAX_RAND = static_cast(0xffffffff/2)}; - enum {MAX_RAND64 = static_cast(0xffffffffffffffffLL/2-1)}; - - KOKKOS_INLINE_FUNCTION - Random_XorShift64 (uint64_t state, int state_idx = 0) - : state_(state),state_idx_(state_idx){} - - KOKKOS_INLINE_FUNCTION - uint32_t urand() { - state_ ^= state_ >> 12; - state_ ^= state_ << 25; - state_ ^= state_ >> 27; - - uint64_t tmp = state_ * 2685821657736338717ULL; - tmp = tmp>>16; - return static_cast(tmp&MAX_URAND); - } - - KOKKOS_INLINE_FUNCTION - uint64_t urand64() { - state_ ^= state_ >> 12; - state_ ^= state_ << 25; - state_ ^= state_ >> 27; - return (state_ * 2685821657736338717ULL) - 1; - } - - KOKKOS_INLINE_FUNCTION - uint32_t urand(const uint32_t& range) { - const uint32_t max_val = (MAX_URAND/range)*range; - uint32_t tmp = urand(); - while(tmp>=max_val) - tmp = urand(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - uint32_t urand(const uint32_t& start, const uint32_t& end ) { - return urand(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - uint64_t urand64(const uint64_t& range) { - const uint64_t max_val = (MAX_URAND64/range)*range; - uint64_t tmp = urand64(); - while(tmp>=max_val) - tmp = urand64(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - uint64_t urand64(const uint64_t& start, const uint64_t& end ) { - return urand64(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - int rand() { - return static_cast(urand()/2); - } - - KOKKOS_INLINE_FUNCTION - int rand(const int& range) { - const int max_val = (MAX_RAND/range)*range; - int tmp = rand(); - while(tmp>=max_val) - tmp = rand(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - int rand(const int& start, const int& end ) { - return rand(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - int64_t rand64() { - return static_cast(urand64()/2); - } - - KOKKOS_INLINE_FUNCTION - int64_t rand64(const int64_t& range) { - const int64_t max_val = (MAX_RAND64/range)*range; - int64_t tmp = rand64(); - while(tmp>=max_val) - tmp = rand64(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - int64_t rand64(const int64_t& start, const int64_t& end ) { - return rand64(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - float frand() { - return 1.0f * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - float frand(const float& range) { - return range * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - float frand(const float& start, const float& end ) { - return frand(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - double drand() { - return 1.0 * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - double drand(const double& range) { - return range * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - double drand(const double& start, const double& end ) { - return drand(end-start)+start; - } - - //Marsaglia polar method for drawing a standard normal distributed random number - KOKKOS_INLINE_FUNCTION - double normal() { - double S = 2.0; - double U; - while(S>=1.0) { - U = drand(); - const double V = drand(); - S = U*U+V*V; - } - return U*sqrt(-2.0*log(S)/S); - } - - KOKKOS_INLINE_FUNCTION - double normal(const double& mean, const double& std_dev=1.0) { - return mean + normal()*std_dev; - } - - }; - - template - class Random_XorShift64_Pool { - private: - typedef View lock_type; - typedef View state_data_type; - lock_type locks_; - state_data_type state_; - int num_states_; - - public: - typedef Random_XorShift64 generator_type; - typedef DeviceType device_type; - - Random_XorShift64_Pool() { - num_states_ = 0; - } - Random_XorShift64_Pool(uint64_t seed) { - num_states_ = 0; - init(seed,DeviceType::max_hardware_threads()); - } - - Random_XorShift64_Pool(const Random_XorShift64_Pool& src): - locks_(src.locks_), - state_(src.state_), - num_states_(src.num_states_) - {} - - Random_XorShift64_Pool operator = (const Random_XorShift64_Pool& src) { - locks_ = src.locks_; - state_ = src.state_; - num_states_ = src.num_states_; - return *this; - } - - void init(uint64_t seed, int num_states) { - num_states_ = num_states; - - locks_ = lock_type("Kokkos::Random_XorShift64::locks",num_states_); - state_ = state_data_type("Kokkos::Random_XorShift64::state",num_states_); - - typename state_data_type::HostMirror h_state = create_mirror_view(state_); - typename lock_type::HostMirror h_lock = create_mirror_view(locks_); - - // Execute on the HostMirror's default execution space. - Random_XorShift64 gen(seed,0); - for(int i = 0; i < 17; i++) - gen.rand(); - for(int i = 0; i < num_states_; i++) { - int n1 = gen.rand(); - int n2 = gen.rand(); - int n3 = gen.rand(); - int n4 = gen.rand(); - h_state(i) = (((static_cast(n1)) & 0xffff)<<00) | - (((static_cast(n2)) & 0xffff)<<16) | - (((static_cast(n3)) & 0xffff)<<32) | - (((static_cast(n4)) & 0xffff)<<48); - h_lock(i) = 0; - } - deep_copy(state_,h_state); - deep_copy(locks_,h_lock); - } - - KOKKOS_INLINE_FUNCTION - Random_XorShift64 get_state() const { - const int i = DeviceType::hardware_thread_id();; - return Random_XorShift64(state_(i),i); - } - - KOKKOS_INLINE_FUNCTION - void free_state(const Random_XorShift64& state) const { - state_(state.state_idx_) = state.state_; - } - }; - - - template - class Random_XorShift1024_Pool; - - template - class Random_XorShift1024 { - private: - int p_; - const int state_idx_; - uint64_t state_[16]; - friend class Random_XorShift1024_Pool; - public: - - typedef DeviceType device_type; - - enum {MAX_URAND = 0xffffffffU}; - enum {MAX_URAND64 = 0xffffffffffffffffULL-1}; - enum {MAX_RAND = static_cast(0xffffffffU/2)}; - enum {MAX_RAND64 = static_cast(0xffffffffffffffffULL/2-1)}; - - KOKKOS_INLINE_FUNCTION - Random_XorShift1024 (uint64_t* state, int p, int state_idx = 0): - p_(p),state_idx_(state_idx){ - for(int i=0 ; i<16; i++) - state_[i] = state[i]; - } - - KOKKOS_INLINE_FUNCTION - uint32_t urand() { - uint64_t state_0 = state_[ p_ ]; - uint64_t state_1 = state_[ p_ = ( p_ + 1 ) & 15 ]; - state_1 ^= state_1 << 31; - state_1 ^= state_1 >> 11; - state_0 ^= state_0 >> 30; - uint64_t tmp = ( state_[ p_ ] = state_0 ^ state_1 ) * 1181783497276652981ULL; - tmp = tmp>>16; - return static_cast(tmp&MAX_URAND); - } - - KOKKOS_INLINE_FUNCTION - uint64_t urand64() { - uint64_t state_0 = state_[ p_ ]; - uint64_t state_1 = state_[ p_ = ( p_ + 1 ) & 15 ]; - state_1 ^= state_1 << 31; - state_1 ^= state_1 >> 11; - state_0 ^= state_0 >> 30; - return (( state_[ p_ ] = state_0 ^ state_1 ) * 1181783497276652981LL) - 1; - } - - KOKKOS_INLINE_FUNCTION - uint32_t urand(const uint32_t& range) { - const uint32_t max_val = (MAX_URAND/range)*range; - uint32_t tmp = urand(); - while(tmp>=max_val) - tmp = urand(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - uint32_t urand(const uint32_t& start, const uint32_t& end ) { - return urand(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - uint64_t urand64(const uint64_t& range) { - const uint64_t max_val = (MAX_URAND64/range)*range; - uint64_t tmp = urand64(); - while(tmp>=max_val) - tmp = urand64(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - uint64_t urand64(const uint64_t& start, const uint64_t& end ) { - return urand64(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - int rand() { - return static_cast(urand()/2); - } - - KOKKOS_INLINE_FUNCTION - int rand(const int& range) { - const int max_val = (MAX_RAND/range)*range; - int tmp = rand(); - while(tmp>=max_val) - tmp = rand(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - int rand(const int& start, const int& end ) { - return rand(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - int64_t rand64() { - return static_cast(urand64()/2); - } - - KOKKOS_INLINE_FUNCTION - int64_t rand64(const int64_t& range) { - const int64_t max_val = (MAX_RAND64/range)*range; - int64_t tmp = rand64(); - while(tmp>=max_val) - tmp = rand64(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - int64_t rand64(const int64_t& start, const int64_t& end ) { - return rand64(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - float frand() { - return 1.0f * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - float frand(const float& range) { - return range * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - float frand(const float& start, const float& end ) { - return frand(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - double drand() { - return 1.0 * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - double drand(const double& range) { - return range * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - double drand(const double& start, const double& end ) { - return frand(end-start)+start; - } - - //Marsaglia polar method for drawing a standard normal distributed random number - KOKKOS_INLINE_FUNCTION - double normal() { - double S = 2.0; - double U; - while(S>=1.0) { - U = drand(); - const double V = drand(); - S = U*U+V*V; - } - return U*sqrt(-2.0*log(S)/S); - } - - KOKKOS_INLINE_FUNCTION - double normal(const double& mean, const double& std_dev=1.0) { - return mean + normal()*std_dev; - } - }; - - - template - class Random_XorShift1024_Pool { - private: - typedef View int_view_type; - typedef View state_data_type; - - int_view_type locks_; - state_data_type state_; - int_view_type p_; - int num_states_; - - public: - typedef Random_XorShift1024 generator_type; - - typedef DeviceType device_type; - - Random_XorShift1024_Pool() { - num_states_ = 0; - } - - inline - Random_XorShift1024_Pool(uint64_t seed){ - num_states_ = 0; - init(seed,DeviceType::max_hardware_threads()); - } - - Random_XorShift1024_Pool(const Random_XorShift1024_Pool& src): - locks_(src.locks_), - state_(src.state_), - p_(src.p_), - num_states_(src.num_states_) - {} - - Random_XorShift1024_Pool operator = (const Random_XorShift1024_Pool& src) { - locks_ = src.locks_; - state_ = src.state_; - p_ = src.p_; - num_states_ = src.num_states_; - return *this; - } - - inline - void init(uint64_t seed, int num_states) { - num_states_ = num_states; - - locks_ = int_view_type("Kokkos::Random_XorShift1024::locks",num_states_); - state_ = state_data_type("Kokkos::Random_XorShift1024::state",num_states_); - p_ = int_view_type("Kokkos::Random_XorShift1024::p",num_states_); - - typename state_data_type::HostMirror h_state = create_mirror_view(state_); - typename int_view_type::HostMirror h_lock = create_mirror_view(locks_); - typename int_view_type::HostMirror h_p = create_mirror_view(p_); - - // Execute on the HostMirror's default execution space. - Random_XorShift64 gen(seed,0); - for(int i = 0; i < 17; i++) - gen.rand(); - for(int i = 0; i < num_states_; i++) { - for(int j = 0; j < 16 ; j++) { - int n1 = gen.rand(); - int n2 = gen.rand(); - int n3 = gen.rand(); - int n4 = gen.rand(); - h_state(i,j) = (((static_cast(n1)) & 0xffff)<<00) | - (((static_cast(n2)) & 0xffff)<<16) | - (((static_cast(n3)) & 0xffff)<<32) | - (((static_cast(n4)) & 0xffff)<<48); - } - h_p(i) = 0; - h_lock(i) = 0; - } - deep_copy(state_,h_state); - deep_copy(locks_,h_lock); - } - - KOKKOS_INLINE_FUNCTION - Random_XorShift1024 get_state() const { - const int i = DeviceType::hardware_thread_id(); - return Random_XorShift1024(&state_(i,0),p_(i),i); - }; - - KOKKOS_INLINE_FUNCTION - void free_state(const Random_XorShift1024& state) const { - for(int i = 0; i<16; i++) - state_(state.state_idx_,i) = state.state_[i]; - p_(state.state_idx_) = state.p_; - } - }; - -#if defined(KOKKOS_HAVE_CUDA) && defined(__CUDACC__) - - template<> - class Random_XorShift1024 { - private: - int p_; - const int state_idx_; - uint64_t* state_; - friend class Random_XorShift1024_Pool; - public: - - typedef Kokkos::Cuda device_type; - - enum {MAX_URAND = 0xffffffffU}; - enum {MAX_URAND64 = 0xffffffffffffffffULL-1}; - enum {MAX_RAND = static_cast(0xffffffffU/2)}; - enum {MAX_RAND64 = static_cast(0xffffffffffffffffULL/2-1)}; - - KOKKOS_INLINE_FUNCTION - Random_XorShift1024 (uint64_t* state, int p, int state_idx = 0): - p_(p),state_idx_(state_idx),state_(state){ - } - - KOKKOS_INLINE_FUNCTION - uint32_t urand() { - uint64_t state_0 = state_[ p_ ]; - uint64_t state_1 = state_[ p_ = ( p_ + 1 ) & 15 ]; - state_1 ^= state_1 << 31; - state_1 ^= state_1 >> 11; - state_0 ^= state_0 >> 30; - uint64_t tmp = ( state_[ p_ ] = state_0 ^ state_1 ) * 1181783497276652981ULL; - tmp = tmp>>16; - return static_cast(tmp&MAX_URAND); - } - - KOKKOS_INLINE_FUNCTION - uint64_t urand64() { - uint64_t state_0 = state_[ p_ ]; - uint64_t state_1 = state_[ p_ = ( p_ + 1 ) & 15 ]; - state_1 ^= state_1 << 31; - state_1 ^= state_1 >> 11; - state_0 ^= state_0 >> 30; - return (( state_[ p_ ] = state_0 ^ state_1 ) * 1181783497276652981LL) - 1; - } - - KOKKOS_INLINE_FUNCTION - uint32_t urand(const uint32_t& range) { - const uint32_t max_val = (MAX_URAND/range)*range; - uint32_t tmp = urand(); - while(tmp>=max_val) - urand(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - uint32_t urand(const uint32_t& start, const uint32_t& end ) { - return urand(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - uint64_t urand64(const uint64_t& range) { - const uint64_t max_val = (MAX_URAND64/range)*range; - uint64_t tmp = urand64(); - while(tmp>=max_val) - urand64(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - uint64_t urand64(const uint64_t& start, const uint64_t& end ) { - return urand64(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - int rand() { - return static_cast(urand()/2); - } - - KOKKOS_INLINE_FUNCTION - int rand(const int& range) { - const int max_val = (MAX_RAND/range)*range; - int tmp = rand(); - while(tmp>=max_val) - rand(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - int rand(const int& start, const int& end ) { - return rand(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - int64_t rand64() { - return static_cast(urand64()/2); - } - - KOKKOS_INLINE_FUNCTION - int64_t rand64(const int64_t& range) { - const int64_t max_val = (MAX_RAND64/range)*range; - int64_t tmp = rand64(); - while(tmp>=max_val) - rand64(); - return tmp%range; - } - - KOKKOS_INLINE_FUNCTION - int64_t rand64(const int64_t& start, const int64_t& end ) { - return rand64(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - float frand() { - return 1.0f * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - float frand(const float& range) { - return range * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - float frand(const float& start, const float& end ) { - return frand(end-start)+start; - } - - KOKKOS_INLINE_FUNCTION - double drand() { - return 1.0 * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - double drand(const double& range) { - return range * urand64()/MAX_URAND64; - } - - KOKKOS_INLINE_FUNCTION - double drand(const double& start, const double& end ) { - return frand(end-start)+start; - } - - //Marsaglia polar method for drawing a standard normal distributed random number - KOKKOS_INLINE_FUNCTION - double normal() { - double S = 2.0; - double U; - while(S>=1.0) { - U = drand(); - const double V = drand(); - S = U*U+V*V; - } - return U*sqrt(-2.0*log(S)/S); - } - - KOKKOS_INLINE_FUNCTION - double normal(const double& mean, const double& std_dev=1.0) { - return mean + normal()*std_dev; - } - }; - -template<> -inline -Random_XorShift64_Pool::Random_XorShift64_Pool(uint64_t seed) { - num_states_ = 0; - init(seed,4*32768); -} - -template<> -KOKKOS_INLINE_FUNCTION -Random_XorShift64 Random_XorShift64_Pool::get_state() const { -#ifdef __CUDA_ARCH__ - const int i_offset = (threadIdx.x*blockDim.y + threadIdx.y)*blockDim.z+threadIdx.z; - int i = (((blockIdx.x*gridDim.y+blockIdx.y)*gridDim.z + blockIdx.z) * - blockDim.x*blockDim.y*blockDim.z + i_offset)%num_states_; - while(Kokkos::atomic_compare_exchange(&locks_(i),0,1)) { - i+=blockDim.x*blockDim.y*blockDim.z; - if(i>=num_states_) {i = i_offset;} - } - - return Random_XorShift64(state_(i),i); -#else - return Random_XorShift64(state_(0),0); -#endif -} - -template<> -KOKKOS_INLINE_FUNCTION -void Random_XorShift64_Pool::free_state(const Random_XorShift64 &state) const { -#ifdef __CUDA_ARCH__ - state_(state.state_idx_) = state.state_; - locks_(state.state_idx_) = 0; - return; -#endif -} - - -template<> -inline -Random_XorShift1024_Pool::Random_XorShift1024_Pool(uint64_t seed) { - num_states_ = 0; - init(seed,4*32768); -} - -template<> -KOKKOS_INLINE_FUNCTION -Random_XorShift1024 Random_XorShift1024_Pool::get_state() const { -#ifdef __CUDA_ARCH__ - const int i_offset = (threadIdx.x*blockDim.y + threadIdx.y)*blockDim.z+threadIdx.z; - int i = (((blockIdx.x*gridDim.y+blockIdx.y)*gridDim.z + blockIdx.z) * - blockDim.x*blockDim.y*blockDim.z + i_offset)%num_states_; - while(Kokkos::atomic_compare_exchange(&locks_(i),0,1)) { - i+=blockDim.x*blockDim.y*blockDim.z; - if(i>=num_states_) {i = i_offset;} - } - - return Random_XorShift1024(&state_(i,0), p_(i), i); -#else - return Random_XorShift1024(&state_(0,0), p_(0), 0); -#endif -} - -template<> -KOKKOS_INLINE_FUNCTION -void Random_XorShift1024_Pool::free_state(const Random_XorShift1024 &state) const { -#ifdef __CUDA_ARCH__ - for(int i=0; i<16; i++) - state_(state.state_idx_,i) = state.state_[i]; - locks_(state.state_idx_) = 0; - return; -#endif -} - - -#endif - - - -template -struct fill_random_functor_range; -template -struct fill_random_functor_begin_end; - -template -struct fill_random_functor_range{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type range; - - typedef rand Rand; - - fill_random_functor_range(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type range_): - a(a_),rand_pool(rand_pool_),range(range_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_range{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type range; - - typedef rand Rand; - - fill_random_functor_range(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type range_): - a(a_),rand_pool(rand_pool_),range(range_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_range{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type range; - - typedef rand Rand; - - fill_random_functor_range(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type range_): - a(a_),rand_pool(rand_pool_),range(range_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_range{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type range; - - typedef rand Rand; - - fill_random_functor_range(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type range_): - a(a_),rand_pool(rand_pool_),range(range_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_range{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type range; - - typedef rand Rand; - - fill_random_functor_range(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type range_): - a(a_),rand_pool(rand_pool_),range(range_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_range{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type range; - - typedef rand Rand; - - fill_random_functor_range(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type range_): - a(a_),rand_pool(rand_pool_),range(range_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_range{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type range; - - typedef rand Rand; - - fill_random_functor_range(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type range_): - a(a_),rand_pool(rand_pool_),range(range_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_range{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type range; - - typedef rand Rand; - - fill_random_functor_range(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type range_): - a(a_),rand_pool(rand_pool_),range(range_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_begin_end{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type begin,end; - - typedef rand Rand; - - fill_random_functor_begin_end(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type begin_, typename ViewType::const_value_type end_): - a(a_),rand_pool(rand_pool_),begin(begin_),end(end_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_begin_end{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type begin,end; - - typedef rand Rand; - - fill_random_functor_begin_end(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type begin_, typename ViewType::const_value_type end_): - a(a_),rand_pool(rand_pool_),begin(begin_),end(end_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_begin_end{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type begin,end; - - typedef rand Rand; - - fill_random_functor_begin_end(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type begin_, typename ViewType::const_value_type end_): - a(a_),rand_pool(rand_pool_),begin(begin_),end(end_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_begin_end{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type begin,end; - - typedef rand Rand; - - fill_random_functor_begin_end(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type begin_, typename ViewType::const_value_type end_): - a(a_),rand_pool(rand_pool_),begin(begin_),end(end_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_begin_end{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type begin,end; - - typedef rand Rand; - - fill_random_functor_begin_end(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type begin_, typename ViewType::const_value_type end_): - a(a_),rand_pool(rand_pool_),begin(begin_),end(end_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_begin_end{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type begin,end; - - typedef rand Rand; - - fill_random_functor_begin_end(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type begin_, typename ViewType::const_value_type end_): - a(a_),rand_pool(rand_pool_),begin(begin_),end(end_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_begin_end{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type begin,end; - - typedef rand Rand; - - fill_random_functor_begin_end(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type begin_, typename ViewType::const_value_type end_): - a(a_),rand_pool(rand_pool_),begin(begin_),end(end_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -struct fill_random_functor_begin_end{ - typedef typename ViewType::execution_space execution_space; - ViewType a; - RandomPool rand_pool; - typename ViewType::const_value_type begin,end; - - typedef rand Rand; - - fill_random_functor_begin_end(ViewType a_, RandomPool rand_pool_, - typename ViewType::const_value_type begin_, typename ViewType::const_value_type end_): - a(a_),rand_pool(rand_pool_),begin(begin_),end(end_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (unsigned int i) const { - typename RandomPool::generator_type gen = rand_pool.get_state(); - for(unsigned int j=0;j -void fill_random(ViewType a, RandomPool g, typename ViewType::const_value_type range) { - int64_t LDA = a.dimension_0(); - if(LDA>0) - parallel_for((LDA+127)/128,fill_random_functor_range(a,g,range)); -} - -template -void fill_random(ViewType a, RandomPool g, typename ViewType::const_value_type begin,typename ViewType::const_value_type end ) { - int64_t LDA = a.dimension_0(); - if(LDA>0) - parallel_for((LDA+127)/128,fill_random_functor_begin_end(a,g,begin,end)); -} -} - -#endif diff --git a/lib/kokkos/algorithms/src/Kokkos_Sort.hpp b/lib/kokkos/algorithms/src/Kokkos_Sort.hpp deleted file mode 100644 index 8d97472aa9..0000000000 --- a/lib/kokkos/algorithms/src/Kokkos_Sort.hpp +++ /dev/null @@ -1,496 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - - -#ifndef KOKKOS_SORT_HPP_ -#define KOKKOS_SORT_HPP_ - -#include - -#include - -namespace Kokkos { - - namespace SortImpl { - - template - struct CopyOp; - - template - struct CopyOp { - template - KOKKOS_INLINE_FUNCTION - static void copy(DstType& dst, size_t i_dst, - SrcType& src, size_t i_src ) { - dst(i_dst) = src(i_src); - } - }; - - template - struct CopyOp { - template - KOKKOS_INLINE_FUNCTION - static void copy(DstType& dst, size_t i_dst, - SrcType& src, size_t i_src ) { - for(int j = 0;j< (int) dst.dimension_1(); j++) - dst(i_dst,j) = src(i_src,j); - } - }; - - template - struct CopyOp { - template - KOKKOS_INLINE_FUNCTION - static void copy(DstType& dst, size_t i_dst, - SrcType& src, size_t i_src ) { - for(int j = 0; j -class BinSort { - - -public: - template - struct bin_sort_sort_functor { - typedef ExecutionSpace execution_space; - typedef typename ValuesViewType::non_const_type values_view_type; - typedef typename ValuesViewType::const_type const_values_view_type; - Kokkos::View > values; - values_view_type sorted_values; - typename PermuteViewType::const_type sort_order; - bin_sort_sort_functor(const_values_view_type values_, values_view_type sorted_values_, PermuteViewType sort_order_): - values(values_),sorted_values(sorted_values_),sort_order(sort_order_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (const int& i) const { - //printf("Sort: %i %i\n",i,sort_order(i)); - CopyOp::copy(sorted_values,i,values,sort_order(i)); - } - }; - - typedef ExecutionSpace execution_space; - typedef BinSortOp bin_op_type; - - struct bin_count_tag {}; - struct bin_offset_tag {}; - struct bin_binning_tag {}; - struct bin_sort_bins_tag {}; - -public: - typedef SizeType size_type; - typedef size_type value_type; - - typedef Kokkos::View offset_type; - typedef Kokkos::View bin_count_type; - - - typedef Kokkos::View const_key_view_type; - typedef Kokkos::View > const_rnd_key_view_type; - - typedef typename KeyViewType::non_const_value_type non_const_key_scalar; - typedef typename KeyViewType::const_value_type const_key_scalar; - -private: - const_key_view_type keys; - const_rnd_key_view_type keys_rnd; - -public: - BinSortOp bin_op; - - offset_type bin_offsets; - - Kokkos::View > bin_count_atomic; - bin_count_type bin_count_const; - - offset_type sort_order; - - bool sort_within_bins; - -public: - - // Constructor: takes the keys, the binning_operator and optionally whether to sort within bins (default false) - BinSort(const_key_view_type keys_, BinSortOp bin_op_, - bool sort_within_bins_ = false) - :keys(keys_),keys_rnd(keys_), bin_op(bin_op_) { - - bin_count_atomic = Kokkos::View("Kokkos::SortImpl::BinSortFunctor::bin_count",bin_op.max_bins()); - bin_count_const = bin_count_atomic; - bin_offsets = offset_type("Kokkos::SortImpl::BinSortFunctor::bin_offsets",bin_op.max_bins()); - sort_order = offset_type("PermutationVector",keys.dimension_0()); - sort_within_bins = sort_within_bins_; - } - - // Create the permutation vector, the bin_offset array and the bin_count array. Can be called again if keys changed - void create_permute_vector() { - Kokkos::parallel_for (Kokkos::RangePolicy (0,keys.dimension_0()),*this); - Kokkos::parallel_scan(Kokkos::RangePolicy (0,bin_op.max_bins()) ,*this); - - Kokkos::deep_copy(bin_count_atomic,0); - Kokkos::parallel_for (Kokkos::RangePolicy (0,keys.dimension_0()),*this); - - if(sort_within_bins) - Kokkos::parallel_for (Kokkos::RangePolicy(0,bin_op.max_bins()) ,*this); - } - - // Sort a view with respect ot the first dimension using the permutation array - template - void sort(ValuesViewType values) { - ValuesViewType sorted_values = ValuesViewType("Copy", - values.dimension_0(), - values.dimension_1(), - values.dimension_2(), - values.dimension_3(), - values.dimension_4(), - values.dimension_5(), - values.dimension_6(), - values.dimension_7()); - - parallel_for(values.dimension_0(), - bin_sort_sort_functor >(values,sorted_values,sort_order)); - - deep_copy(values,sorted_values); - } - - // Get the permutation vector - KOKKOS_INLINE_FUNCTION - offset_type get_permute_vector() const { return sort_order;} - - // Get the start offsets for each bin - KOKKOS_INLINE_FUNCTION - offset_type get_bin_offsets() const { return bin_offsets;} - - // Get the count for each bin - KOKKOS_INLINE_FUNCTION - bin_count_type get_bin_count() const {return bin_count_const;} - -public: - KOKKOS_INLINE_FUNCTION - void operator() (const bin_count_tag& tag, const int& i) const { - bin_count_atomic(bin_op.bin(keys,i))++; - } - - KOKKOS_INLINE_FUNCTION - void operator() (const bin_offset_tag& tag, const int& i, value_type& offset, const bool& final) const { - if(final) { - bin_offsets(i) = offset; - } - offset+=bin_count_const(i); - } - - KOKKOS_INLINE_FUNCTION - void operator() (const bin_binning_tag& tag, const int& i) const { - const int bin = bin_op.bin(keys,i); - const int count = bin_count_atomic(bin)++; - - sort_order(bin_offsets(bin) + count) = i; - } - - KOKKOS_INLINE_FUNCTION - void operator() (const bin_sort_bins_tag& tag, const int&i ) const { - bool sorted = false; - int upper_bound = bin_offsets(i)+bin_count_const(i); - while(!sorted) { - sorted = true; - int old_idx = sort_order(bin_offsets(i)); - int new_idx; - for(int k=bin_offsets(i)+1; k -struct DefaultBinOp1D { - const int max_bins_; - const double mul_; - typename KeyViewType::const_value_type range_; - typename KeyViewType::const_value_type min_; - - //Construct BinOp with number of bins, minimum value and maxuimum value - DefaultBinOp1D(int max_bins__, typename KeyViewType::const_value_type min, - typename KeyViewType::const_value_type max ) - :max_bins_(max_bins__+1),mul_(1.0*max_bins__/(max-min)),range_(max-min),min_(min) {} - - //Determine bin index from key value - template - KOKKOS_INLINE_FUNCTION - int bin(ViewType& keys, const int& i) const { - return int(mul_*(keys(i)-min_)); - } - - //Return maximum bin index + 1 - KOKKOS_INLINE_FUNCTION - int max_bins() const { - return max_bins_; - } - - //Compare to keys within a bin if true new_val will be put before old_val - template - KOKKOS_INLINE_FUNCTION - bool operator()(ViewType& keys, iType1& i1, iType2& i2) const { - return keys(i1) -struct DefaultBinOp3D { - int max_bins_[3]; - double mul_[3]; - typename KeyViewType::non_const_value_type range_[3]; - typename KeyViewType::non_const_value_type min_[3]; - - DefaultBinOp3D(int max_bins__[], typename KeyViewType::const_value_type min[], - typename KeyViewType::const_value_type max[] ) - { - max_bins_[0] = max_bins__[0]+1; - max_bins_[1] = max_bins__[1]+1; - max_bins_[2] = max_bins__[2]+1; - mul_[0] = 1.0*max_bins__[0]/(max[0]-min[0]); - mul_[1] = 1.0*max_bins__[1]/(max[1]-min[1]); - mul_[2] = 1.0*max_bins__[2]/(max[2]-min[2]); - range_[0] = max[0]-min[0]; - range_[1] = max[1]-min[1]; - range_[2] = max[2]-min[2]; - min_[0] = min[0]; - min_[1] = min[1]; - min_[2] = min[2]; - } - - template - KOKKOS_INLINE_FUNCTION - int bin(ViewType& keys, const int& i) const { - return int( (((int(mul_[0]*(keys(i,0)-min_[0]))*max_bins_[1]) + - int(mul_[1]*(keys(i,1)-min_[1])))*max_bins_[2]) + - int(mul_[2]*(keys(i,2)-min_[2]))); - } - - KOKKOS_INLINE_FUNCTION - int max_bins() const { - return max_bins_[0]*max_bins_[1]*max_bins_[2]; - } - - template - KOKKOS_INLINE_FUNCTION - bool operator()(ViewType& keys, iType1& i1 , iType2& i2) const { - if (keys(i1,0)>keys(i2,0)) return true; - else if (keys(i1,0)==keys(i2,0)) { - if (keys(i1,1)>keys(i2,1)) return true; - else if (keys(i1,1)==keys(i2,2)) { - if (keys(i1,2)>keys(i2,2)) return true; - } - } - return false; - } -}; - -template -struct min_max { - Scalar min; - Scalar max; - bool init; - - KOKKOS_INLINE_FUNCTION - min_max() { - min = 0; - max = 0; - init = 0; - } - - KOKKOS_INLINE_FUNCTION - min_max (const min_max& val) { - min = val.min; - max = val.max; - init = val.init; - } - - KOKKOS_INLINE_FUNCTION - min_max operator = (const min_max& val) { - min = val.min; - max = val.max; - init = val.init; - return *this; - } - - KOKKOS_INLINE_FUNCTION - void operator+= (const Scalar& val) { - if(init) { - min = minval?max:val; - } else { - min = val; - max = val; - init = 1; - } - } - - KOKKOS_INLINE_FUNCTION - void operator+= (const min_max& val) { - if(init && val.init) { - min = minval.max?max:val.max; - } else { - if(val.init) { - min = val.min; - max = val.max; - init = 1; - } - } - } - - KOKKOS_INLINE_FUNCTION - void operator+= (volatile const Scalar& val) volatile { - if(init) { - min = minval?max:val; - } else { - min = val; - max = val; - init = 1; - } - } - - KOKKOS_INLINE_FUNCTION - void operator+= (volatile const min_max& val) volatile { - if(init && val.init) { - min = minval.max?max:val.max; - } else { - if(val.init) { - min = val.min; - max = val.max; - init = 1; - } - } - } -}; - - -template -struct min_max_functor { - typedef typename ViewType::execution_space execution_space; - ViewType view; - typedef min_max value_type; - min_max_functor (const ViewType view_):view(view_) { - } - - KOKKOS_INLINE_FUNCTION - void operator()(const size_t& i, value_type& val) const { - val += view(i); - } -}; - -template -bool try_std_sort(ViewType view) { - bool possible = true; -#if ! defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - size_t stride[8]; - view.stride(stride); -#else - size_t stride[8] = { view.stride_0() - , view.stride_1() - , view.stride_2() - , view.stride_3() - , view.stride_4() - , view.stride_5() - , view.stride_6() - , view.stride_7() - }; -#endif - possible = possible && Impl::is_same::value; - possible = possible && (ViewType::Rank == 1); - possible = possible && (stride[0] == 1); - if(possible) { - std::sort(view.ptr_on_device(),view.ptr_on_device()+view.dimension_0()); - } - return possible; -} - -} - -template -void sort(ViewType view, bool always_use_kokkos_sort = false) { - if(!always_use_kokkos_sort) { - if(SortImpl::try_std_sort(view)) return; - } - - typedef SortImpl::DefaultBinOp1D CompType; - SortImpl::min_max val; - parallel_reduce(view.dimension_0(),SortImpl::min_max_functor(view),val); - BinSort bin_sort(view,CompType(view.dimension_0()/2,val.min,val.max),true); - bin_sort.create_permute_vector(); - bin_sort.sort(view); -} - -/*template -void sort(ViewType view, Comparator comp, bool always_use_kokkos_sort = false) { - -}*/ - -} - -#endif diff --git a/lib/kokkos/algorithms/unit_tests/Makefile b/lib/kokkos/algorithms/unit_tests/Makefile deleted file mode 100644 index 5fc94ac0f8..0000000000 --- a/lib/kokkos/algorithms/unit_tests/Makefile +++ /dev/null @@ -1,92 +0,0 @@ -KOKKOS_PATH = ../.. - -GTEST_PATH = ../../TPL/gtest - -vpath %.cpp ${KOKKOS_PATH}/algorithms/unit_tests - -default: build_all - echo "End Build" - - -include $(KOKKOS_PATH)/Makefile.kokkos - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - CXX = nvcc_wrapper - CXXFLAGS ?= -O3 - LINK = $(CXX) - LDFLAGS ?= -lpthread -else - CXX ?= g++ - CXXFLAGS ?= -O3 - LINK ?= $(CXX) - LDFLAGS ?= -lpthread -endif - -KOKKOS_CXXFLAGS += -I$(GTEST_PATH) -I${KOKKOS_PATH}/algorithms/unit_tests - -TEST_TARGETS = -TARGETS = - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - OBJ_CUDA = TestCuda.o UnitTestMain.o gtest-all.o - TARGETS += KokkosAlgorithms_UnitTest_Cuda - TEST_TARGETS += test-cuda -endif - -ifeq ($(KOKKOS_INTERNAL_USE_PTHREADS), 1) - OBJ_THREADS = TestThreads.o UnitTestMain.o gtest-all.o - TARGETS += KokkosAlgorithms_UnitTest_Threads - TEST_TARGETS += test-threads -endif - -ifeq ($(KOKKOS_INTERNAL_USE_OPENMP), 1) - OBJ_OPENMP = TestOpenMP.o UnitTestMain.o gtest-all.o - TARGETS += KokkosAlgorithms_UnitTest_OpenMP - TEST_TARGETS += test-openmp -endif - -ifeq ($(KOKKOS_INTERNAL_USE_SERIAL), 1) - OBJ_SERIAL = TestSerial.o UnitTestMain.o gtest-all.o - TARGETS += KokkosAlgorithms_UnitTest_Serial - TEST_TARGETS += test-serial -endif - -KokkosAlgorithms_UnitTest_Cuda: $(OBJ_CUDA) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_CUDA) $(KOKKOS_LIBS) $(LIB) -o KokkosAlgorithms_UnitTest_Cuda - -KokkosAlgorithms_UnitTest_Threads: $(OBJ_THREADS) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_THREADS) $(KOKKOS_LIBS) $(LIB) -o KokkosAlgorithms_UnitTest_Threads - -KokkosAlgorithms_UnitTest_OpenMP: $(OBJ_OPENMP) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_OPENMP) $(KOKKOS_LIBS) $(LIB) -o KokkosAlgorithms_UnitTest_OpenMP - -KokkosAlgorithms_UnitTest_Serial: $(OBJ_SERIAL) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_SERIAL) $(KOKKOS_LIBS) $(LIB) -o KokkosAlgorithms_UnitTest_Serial - -test-cuda: KokkosAlgorithms_UnitTest_Cuda - ./KokkosAlgorithms_UnitTest_Cuda - -test-threads: KokkosAlgorithms_UnitTest_Threads - ./KokkosAlgorithms_UnitTest_Threads - -test-openmp: KokkosAlgorithms_UnitTest_OpenMP - ./KokkosAlgorithms_UnitTest_OpenMP - -test-serial: KokkosAlgorithms_UnitTest_Serial - ./KokkosAlgorithms_UnitTest_Serial - -build_all: $(TARGETS) - -test: $(TEST_TARGETS) - -clean: kokkos-clean - rm -f *.o $(TARGETS) - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< - -gtest-all.o:$(GTEST_PATH)/gtest/gtest-all.cc - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $(GTEST_PATH)/gtest/gtest-all.cc - diff --git a/lib/kokkos/algorithms/unit_tests/TestCuda.cpp b/lib/kokkos/algorithms/unit_tests/TestCuda.cpp deleted file mode 100644 index d19c778c46..0000000000 --- a/lib/kokkos/algorithms/unit_tests/TestCuda.cpp +++ /dev/null @@ -1,110 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include - -#include - -#include - -#ifdef KOKKOS_HAVE_CUDA - -#include -#include - -namespace Test { - -class cuda : public ::testing::Test { -protected: - static void SetUpTestCase() - { - std::cout << std::setprecision(5) << std::scientific; - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice(0) ); - } - static void TearDownTestCase() - { - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); - } -}; - -void cuda_test_random_xorshift64( int num_draws ) -{ - Impl::test_random >(num_draws); -} - -void cuda_test_random_xorshift1024( int num_draws ) -{ - Impl::test_random >(num_draws); -} - - -#define CUDA_RANDOM_XORSHIFT64( num_draws ) \ - TEST_F( cuda, Random_XorShift64 ) { \ - cuda_test_random_xorshift64(num_draws); \ - } - -#define CUDA_RANDOM_XORSHIFT1024( num_draws ) \ - TEST_F( cuda, Random_XorShift1024 ) { \ - cuda_test_random_xorshift1024(num_draws); \ - } - -#define CUDA_SORT_UNSIGNED( size ) \ - TEST_F( cuda, SortUnsigned ) { \ - Impl::test_sort< Kokkos::Cuda, unsigned >(size); \ - } - -CUDA_RANDOM_XORSHIFT64( 132141141 ) -CUDA_RANDOM_XORSHIFT1024( 52428813 ) -CUDA_SORT_UNSIGNED(171) - -#undef CUDA_RANDOM_XORSHIFT64 -#undef CUDA_RANDOM_XORSHIFT1024 -#undef CUDA_SORT_UNSIGNED -} - -#endif /* #ifdef KOKKOS_HAVE_CUDA */ - diff --git a/lib/kokkos/algorithms/unit_tests/TestOpenMP.cpp b/lib/kokkos/algorithms/unit_tests/TestOpenMP.cpp deleted file mode 100644 index 4b06dffcb6..0000000000 --- a/lib/kokkos/algorithms/unit_tests/TestOpenMP.cpp +++ /dev/null @@ -1,102 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -//---------------------------------------------------------------------------- -#include -#include -#include - -namespace Test { - -#ifdef KOKKOS_HAVE_OPENMP -class openmp : public ::testing::Test { -protected: - static void SetUpTestCase() - { - std::cout << std::setprecision(5) << std::scientific; - - unsigned threads_count = omp_get_max_threads(); - - if ( Kokkos::hwloc::available() ) { - threads_count = Kokkos::hwloc::get_available_numa_count() * - Kokkos::hwloc::get_available_cores_per_numa(); - } - - Kokkos::OpenMP::initialize( threads_count ); - } - - static void TearDownTestCase() - { - Kokkos::OpenMP::finalize(); - } -}; - -#define OPENMP_RANDOM_XORSHIFT64( num_draws ) \ - TEST_F( openmp, Random_XorShift64 ) { \ - Impl::test_random >(num_draws); \ - } - -#define OPENMP_RANDOM_XORSHIFT1024( num_draws ) \ - TEST_F( openmp, Random_XorShift1024 ) { \ - Impl::test_random >(num_draws); \ - } - -#define OPENMP_SORT_UNSIGNED( size ) \ - TEST_F( openmp, SortUnsigned ) { \ - Impl::test_sort< Kokkos::OpenMP, unsigned >(size); \ - } - -OPENMP_RANDOM_XORSHIFT64( 10240000 ) -OPENMP_RANDOM_XORSHIFT1024( 10130144 ) -OPENMP_SORT_UNSIGNED(171) - -#undef OPENMP_RANDOM_XORSHIFT64 -#undef OPENMP_RANDOM_XORSHIFT1024 -#undef OPENMP_SORT_UNSIGNED -#endif -} // namespace test - diff --git a/lib/kokkos/algorithms/unit_tests/TestRandom.hpp b/lib/kokkos/algorithms/unit_tests/TestRandom.hpp deleted file mode 100644 index eade74ed93..0000000000 --- a/lib/kokkos/algorithms/unit_tests/TestRandom.hpp +++ /dev/null @@ -1,476 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#ifndef KOKKOS_TEST_DUALVIEW_HPP -#define KOKKOS_TEST_DUALVIEW_HPP - -#include -#include -#include -#include -#include -#include -#include -#include - -namespace Test { - -namespace Impl{ - -// This test runs the random number generators and uses some statistic tests to -// check the 'goodness' of the random numbers: -// (i) mean: the mean is expected to be 0.5*RAND_MAX -// (ii) variance: the variance is 1/3*mean*mean -// (iii) covariance: the covariance is 0 -// (iv) 1-tupledistr: the mean, variance and covariance of a 1D Histrogram of random numbers -// (v) 3-tupledistr: the mean, variance and covariance of a 3D Histrogram of random numbers - -#define HIST_DIM3D 24 -#define HIST_DIM1D (HIST_DIM3D*HIST_DIM3D*HIST_DIM3D) - -struct RandomProperties { - uint64_t count; - double mean; - double variance; - double covariance; - double min; - double max; - - KOKKOS_INLINE_FUNCTION - RandomProperties() { - count = 0; - mean = 0.0; - variance = 0.0; - covariance = 0.0; - min = 1e64; - max = -1e64; - } - - KOKKOS_INLINE_FUNCTION - RandomProperties& operator+=(const RandomProperties& add) { - count += add.count; - mean += add.mean; - variance += add.variance; - covariance += add.covariance; - min = add.minmax?add.max:max; - return *this; - } - - KOKKOS_INLINE_FUNCTION - void operator+=(const volatile RandomProperties& add) volatile { - count += add.count; - mean += add.mean; - variance += add.variance; - covariance += add.covariance; - min = add.minmax?add.max:max; - } -}; - -template -struct test_random_functor { - typedef typename GeneratorPool::generator_type rnd_type; - - typedef RandomProperties value_type; - typedef typename GeneratorPool::device_type device_type; - - GeneratorPool rand_pool; - const double mean; - - // NOTE (mfh 03 Nov 2014): Kokkos::rand::max() is supposed to define - // an exclusive upper bound on the range of random numbers that - // draw() can generate. However, for the float specialization, some - // implementations might violate this upper bound, due to rounding - // error. Just in case, we leave an extra space at the end of each - // dimension, in the View types below. - typedef Kokkos::View type_1d; - type_1d density_1d; - typedef Kokkos::View type_3d; - type_3d density_3d; - - test_random_functor (GeneratorPool rand_pool_, type_1d d1d, type_3d d3d) : - rand_pool (rand_pool_), - mean (0.5*Kokkos::rand::max ()), - density_1d (d1d), - density_3d (d3d) - {} - - KOKKOS_INLINE_FUNCTION - void operator() (int i, RandomProperties& prop) const { - using Kokkos::atomic_fetch_add; - - rnd_type rand_gen = rand_pool.get_state(); - for (int k = 0; k < 1024; ++k) { - const Scalar tmp = Kokkos::rand::draw(rand_gen); - prop.count++; - prop.mean += tmp; - prop.variance += (tmp-mean)*(tmp-mean); - const Scalar tmp2 = Kokkos::rand::draw(rand_gen); - prop.count++; - prop.mean += tmp2; - prop.variance += (tmp2-mean)*(tmp2-mean); - prop.covariance += (tmp-mean)*(tmp2-mean); - const Scalar tmp3 = Kokkos::rand::draw(rand_gen); - prop.count++; - prop.mean += tmp3; - prop.variance += (tmp3-mean)*(tmp3-mean); - prop.covariance += (tmp2-mean)*(tmp3-mean); - - // NOTE (mfh 03 Nov 2014): Kokkos::rand::max() is supposed to - // define an exclusive upper bound on the range of random - // numbers that draw() can generate. However, for the float - // specialization, some implementations might violate this upper - // bound, due to rounding error. Just in case, we have left an - // extra space at the end of each dimension of density_1d and - // density_3d. - // - // Please note that those extra entries might not get counted in - // the histograms. However, if Kokkos::rand is broken and only - // returns values of max(), the histograms will still catch this - // indirectly, since none of the other values will be filled in. - - const Scalar theMax = Kokkos::rand::max (); - - const uint64_t ind1_1d = static_cast (1.0 * HIST_DIM1D * tmp / theMax); - const uint64_t ind2_1d = static_cast (1.0 * HIST_DIM1D * tmp2 / theMax); - const uint64_t ind3_1d = static_cast (1.0 * HIST_DIM1D * tmp3 / theMax); - - const uint64_t ind1_3d = static_cast (1.0 * HIST_DIM3D * tmp / theMax); - const uint64_t ind2_3d = static_cast (1.0 * HIST_DIM3D * tmp2 / theMax); - const uint64_t ind3_3d = static_cast (1.0 * HIST_DIM3D * tmp3 / theMax); - - atomic_fetch_add (&density_1d(ind1_1d), 1); - atomic_fetch_add (&density_1d(ind2_1d), 1); - atomic_fetch_add (&density_1d(ind3_1d), 1); - atomic_fetch_add (&density_3d(ind1_3d, ind2_3d, ind3_3d), 1); - } - rand_pool.free_state(rand_gen); - } -}; - -template -struct test_histogram1d_functor { - typedef RandomProperties value_type; - typedef typename DeviceType::execution_space execution_space; - typedef typename DeviceType::memory_space memory_space; - - // NOTE (mfh 03 Nov 2014): Kokkos::rand::max() is supposed to define - // an exclusive upper bound on the range of random numbers that - // draw() can generate. However, for the float specialization, some - // implementations might violate this upper bound, due to rounding - // error. Just in case, we leave an extra space at the end of each - // dimension, in the View type below. - typedef Kokkos::View type_1d; - type_1d density_1d; - double mean; - - test_histogram1d_functor (type_1d d1d, int num_draws) : - density_1d (d1d), - mean (1.0*num_draws/HIST_DIM1D*3) - { - printf ("Mean: %e\n", mean); - } - - KOKKOS_INLINE_FUNCTION void - operator() (const typename memory_space::size_type i, - RandomProperties& prop) const - { - typedef typename memory_space::size_type size_type; - const double count = density_1d(i); - prop.mean += count; - prop.variance += 1.0 * (count - mean) * (count - mean); - //prop.covariance += 1.0*count*count; - prop.min = count < prop.min ? count : prop.min; - prop.max = count > prop.max ? count : prop.max; - if (i < static_cast (HIST_DIM1D-1)) { - prop.covariance += (count - mean) * (density_1d(i+1) - mean); - } - } -}; - -template -struct test_histogram3d_functor { - typedef RandomProperties value_type; - typedef typename DeviceType::execution_space execution_space; - typedef typename DeviceType::memory_space memory_space; - - // NOTE (mfh 03 Nov 2014): Kokkos::rand::max() is supposed to define - // an exclusive upper bound on the range of random numbers that - // draw() can generate. However, for the float specialization, some - // implementations might violate this upper bound, due to rounding - // error. Just in case, we leave an extra space at the end of each - // dimension, in the View type below. - typedef Kokkos::View type_3d; - type_3d density_3d; - double mean; - - test_histogram3d_functor (type_3d d3d, int num_draws) : - density_3d (d3d), - mean (1.0*num_draws/HIST_DIM1D) - {} - - KOKKOS_INLINE_FUNCTION void - operator() (const typename memory_space::size_type i, - RandomProperties& prop) const - { - typedef typename memory_space::size_type size_type; - const double count = density_3d(i/(HIST_DIM3D*HIST_DIM3D), - (i % (HIST_DIM3D*HIST_DIM3D))/HIST_DIM3D, - i % HIST_DIM3D); - prop.mean += count; - prop.variance += (count - mean) * (count - mean); - if (i < static_cast (HIST_DIM1D-1)) { - const double count_next = density_3d((i+1)/(HIST_DIM3D*HIST_DIM3D), - ((i+1)%(HIST_DIM3D*HIST_DIM3D))/HIST_DIM3D, - (i+1)%HIST_DIM3D); - prop.covariance += (count - mean) * (count_next - mean); - } - } -}; - -// -// Templated test that uses the above functors. -// -template -struct test_random_scalar { - typedef typename RandomGenerator::generator_type rnd_type; - - int pass_mean,pass_var,pass_covar; - int pass_hist1d_mean,pass_hist1d_var,pass_hist1d_covar; - int pass_hist3d_mean,pass_hist3d_var,pass_hist3d_covar; - - test_random_scalar (typename test_random_functor::type_1d& density_1d, - typename test_random_functor::type_3d& density_3d, - RandomGenerator& pool, - unsigned int num_draws) - { - using std::cerr; - using std::endl; - using Kokkos::parallel_reduce; - - { - cerr << " -- Testing randomness properties" << endl; - - RandomProperties result; - typedef test_random_functor functor_type; - parallel_reduce (num_draws/1024, functor_type (pool, density_1d, density_3d), result); - - //printf("Result: %lf %lf %lf\n",result.mean/num_draws/3,result.variance/num_draws/3,result.covariance/num_draws/2); - double tolerance = 2.0*sqrt(1.0/num_draws); - double mean_expect = 0.5*Kokkos::rand::max(); - double variance_expect = 1.0/3.0*mean_expect*mean_expect; - double mean_eps = mean_expect/(result.mean/num_draws/3)-1.0; - double variance_eps = variance_expect/(result.variance/num_draws/3)-1.0; - double covariance_eps = result.covariance/num_draws/2/variance_expect; - pass_mean = ((-tolerance < mean_eps) && - ( tolerance > mean_eps)) ? 1:0; - pass_var = ((-tolerance < variance_eps) && - ( tolerance > variance_eps)) ? 1:0; - pass_covar = ((-1.4*tolerance < covariance_eps) && - ( 1.4*tolerance > covariance_eps)) ? 1:0; - cerr << "Pass: " << pass_mean - << " " << pass_var - << " " << mean_eps - << " " << variance_eps - << " " << covariance_eps - << " || " << tolerance << endl; - } - { - cerr << " -- Testing 1-D histogram" << endl; - - RandomProperties result; - typedef test_histogram1d_functor functor_type; - parallel_reduce (HIST_DIM1D, functor_type (density_1d, num_draws), result); - - double tolerance = 6*sqrt(1.0/HIST_DIM1D); - double mean_expect = 1.0*num_draws*3/HIST_DIM1D; - double variance_expect = 1.0*num_draws*3/HIST_DIM1D*(1.0-1.0/HIST_DIM1D); - double covariance_expect = -1.0*num_draws*3/HIST_DIM1D/HIST_DIM1D; - double mean_eps = mean_expect/(result.mean/HIST_DIM1D)-1.0; - double variance_eps = variance_expect/(result.variance/HIST_DIM1D)-1.0; - double covariance_eps = (result.covariance/HIST_DIM1D - covariance_expect)/mean_expect; - pass_hist1d_mean = ((-tolerance < mean_eps) && - ( tolerance > mean_eps)) ? 1:0; - pass_hist1d_var = ((-tolerance < variance_eps) && - ( tolerance > variance_eps)) ? 1:0; - pass_hist1d_covar = ((-tolerance < covariance_eps) && - ( tolerance > covariance_eps)) ? 1:0; - - cerr << "Density 1D: " << mean_eps - << " " << variance_eps - << " " << (result.covariance/HIST_DIM1D/HIST_DIM1D) - << " || " << tolerance - << " " << result.min - << " " << result.max - << " || " << result.variance/HIST_DIM1D - << " " << 1.0*num_draws*3/HIST_DIM1D*(1.0-1.0/HIST_DIM1D) - << " || " << result.covariance/HIST_DIM1D - << " " << -1.0*num_draws*3/HIST_DIM1D/HIST_DIM1D - << endl; - } - { - cerr << " -- Testing 3-D histogram" << endl; - - RandomProperties result; - typedef test_histogram3d_functor functor_type; - parallel_reduce (HIST_DIM1D, functor_type (density_3d, num_draws), result); - - double tolerance = 6*sqrt(1.0/HIST_DIM1D); - double mean_expect = 1.0*num_draws/HIST_DIM1D; - double variance_expect = 1.0*num_draws/HIST_DIM1D*(1.0-1.0/HIST_DIM1D); - double covariance_expect = -1.0*num_draws/HIST_DIM1D/HIST_DIM1D; - double mean_eps = mean_expect/(result.mean/HIST_DIM1D)-1.0; - double variance_eps = variance_expect/(result.variance/HIST_DIM1D)-1.0; - double covariance_eps = (result.covariance/HIST_DIM1D - covariance_expect)/mean_expect; - pass_hist3d_mean = ((-tolerance < mean_eps) && - ( tolerance > mean_eps)) ? 1:0; - pass_hist3d_var = ((-tolerance < variance_eps) && - ( tolerance > variance_eps)) ? 1:0; - pass_hist3d_covar = ((-tolerance < covariance_eps) && - ( tolerance > covariance_eps)) ? 1:0; - - cerr << "Density 3D: " << mean_eps - << " " << variance_eps - << " " << result.covariance/HIST_DIM1D/HIST_DIM1D - << " || " << tolerance - << " " << result.min - << " " << result.max << endl; - } - } -}; - -template -void test_random(unsigned int num_draws) -{ - using std::cerr; - using std::endl; - typename test_random_functor::type_1d density_1d("D1d"); - typename test_random_functor::type_3d density_3d("D3d"); - - cerr << "Test Scalar=int" << endl; - RandomGenerator pool(31891); - test_random_scalar test_int(density_1d,density_3d,pool,num_draws); - ASSERT_EQ( test_int.pass_mean,1); - ASSERT_EQ( test_int.pass_var,1); - ASSERT_EQ( test_int.pass_covar,1); - ASSERT_EQ( test_int.pass_hist1d_mean,1); - ASSERT_EQ( test_int.pass_hist1d_var,1); - ASSERT_EQ( test_int.pass_hist1d_covar,1); - ASSERT_EQ( test_int.pass_hist3d_mean,1); - ASSERT_EQ( test_int.pass_hist3d_var,1); - ASSERT_EQ( test_int.pass_hist3d_covar,1); - deep_copy(density_1d,0); - deep_copy(density_3d,0); - - cerr << "Test Scalar=unsigned int" << endl; - test_random_scalar test_uint(density_1d,density_3d,pool,num_draws); - ASSERT_EQ( test_uint.pass_mean,1); - ASSERT_EQ( test_uint.pass_var,1); - ASSERT_EQ( test_uint.pass_covar,1); - ASSERT_EQ( test_uint.pass_hist1d_mean,1); - ASSERT_EQ( test_uint.pass_hist1d_var,1); - ASSERT_EQ( test_uint.pass_hist1d_covar,1); - ASSERT_EQ( test_uint.pass_hist3d_mean,1); - ASSERT_EQ( test_uint.pass_hist3d_var,1); - ASSERT_EQ( test_uint.pass_hist3d_covar,1); - deep_copy(density_1d,0); - deep_copy(density_3d,0); - - cerr << "Test Scalar=int64_t" << endl; - test_random_scalar test_int64(density_1d,density_3d,pool,num_draws); - ASSERT_EQ( test_int64.pass_mean,1); - ASSERT_EQ( test_int64.pass_var,1); - ASSERT_EQ( test_int64.pass_covar,1); - ASSERT_EQ( test_int64.pass_hist1d_mean,1); - ASSERT_EQ( test_int64.pass_hist1d_var,1); - ASSERT_EQ( test_int64.pass_hist1d_covar,1); - ASSERT_EQ( test_int64.pass_hist3d_mean,1); - ASSERT_EQ( test_int64.pass_hist3d_var,1); - ASSERT_EQ( test_int64.pass_hist3d_covar,1); - deep_copy(density_1d,0); - deep_copy(density_3d,0); - - cerr << "Test Scalar=uint64_t" << endl; - test_random_scalar test_uint64(density_1d,density_3d,pool,num_draws); - ASSERT_EQ( test_uint64.pass_mean,1); - ASSERT_EQ( test_uint64.pass_var,1); - ASSERT_EQ( test_uint64.pass_covar,1); - ASSERT_EQ( test_uint64.pass_hist1d_mean,1); - ASSERT_EQ( test_uint64.pass_hist1d_var,1); - ASSERT_EQ( test_uint64.pass_hist1d_covar,1); - ASSERT_EQ( test_uint64.pass_hist3d_mean,1); - ASSERT_EQ( test_uint64.pass_hist3d_var,1); - ASSERT_EQ( test_uint64.pass_hist3d_covar,1); - deep_copy(density_1d,0); - deep_copy(density_3d,0); - - cerr << "Test Scalar=float" << endl; - test_random_scalar test_float(density_1d,density_3d,pool,num_draws); - ASSERT_EQ( test_float.pass_mean,1); - ASSERT_EQ( test_float.pass_var,1); - ASSERT_EQ( test_float.pass_covar,1); - ASSERT_EQ( test_float.pass_hist1d_mean,1); - ASSERT_EQ( test_float.pass_hist1d_var,1); - ASSERT_EQ( test_float.pass_hist1d_covar,1); - ASSERT_EQ( test_float.pass_hist3d_mean,1); - ASSERT_EQ( test_float.pass_hist3d_var,1); - ASSERT_EQ( test_float.pass_hist3d_covar,1); - deep_copy(density_1d,0); - deep_copy(density_3d,0); - - cerr << "Test Scalar=double" << endl; - test_random_scalar test_double(density_1d,density_3d,pool,num_draws); - ASSERT_EQ( test_double.pass_mean,1); - ASSERT_EQ( test_double.pass_var,1); - ASSERT_EQ( test_double.pass_covar,1); - ASSERT_EQ( test_double.pass_hist1d_mean,1); - ASSERT_EQ( test_double.pass_hist1d_var,1); - ASSERT_EQ( test_double.pass_hist1d_covar,1); - ASSERT_EQ( test_double.pass_hist3d_mean,1); - ASSERT_EQ( test_double.pass_hist3d_var,1); - ASSERT_EQ( test_double.pass_hist3d_covar,1); -} -} - -} // namespace Test - -#endif //KOKKOS_TEST_UNORDERED_MAP_HPP diff --git a/lib/kokkos/algorithms/unit_tests/TestSerial.cpp b/lib/kokkos/algorithms/unit_tests/TestSerial.cpp deleted file mode 100644 index 741cf97ae1..0000000000 --- a/lib/kokkos/algorithms/unit_tests/TestSerial.cpp +++ /dev/null @@ -1,99 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#include -#include -#include - - -//---------------------------------------------------------------------------- - - -namespace Test { - -#ifdef KOKKOS_HAVE_SERIAL -class serial : public ::testing::Test { -protected: - static void SetUpTestCase() - { - std::cout << std::setprecision (5) << std::scientific; - Kokkos::Serial::initialize (); - } - - static void TearDownTestCase () - { - Kokkos::Serial::finalize (); - } -}; - -#define SERIAL_RANDOM_XORSHIFT64( num_draws ) \ - TEST_F( serial, Random_XorShift64 ) { \ - Impl::test_random >(num_draws); \ - } - -#define SERIAL_RANDOM_XORSHIFT1024( num_draws ) \ - TEST_F( serial, Random_XorShift1024 ) { \ - Impl::test_random >(num_draws); \ - } - -#define SERIAL_SORT_UNSIGNED( size ) \ - TEST_F( serial, SortUnsigned ) { \ - Impl::test_sort< Kokkos::Serial, unsigned >(size); \ - } - -SERIAL_RANDOM_XORSHIFT64( 10240000 ) -SERIAL_RANDOM_XORSHIFT1024( 10130144 ) -SERIAL_SORT_UNSIGNED(171) - -#undef SERIAL_RANDOM_XORSHIFT64 -#undef SERIAL_RANDOM_XORSHIFT1024 -#undef SERIAL_SORT_UNSIGNED - -#endif // KOKKOS_HAVE_SERIAL -} // namespace Test - - diff --git a/lib/kokkos/algorithms/unit_tests/TestSort.hpp b/lib/kokkos/algorithms/unit_tests/TestSort.hpp deleted file mode 100644 index ccbcbdd001..0000000000 --- a/lib/kokkos/algorithms/unit_tests/TestSort.hpp +++ /dev/null @@ -1,206 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#ifndef TESTSORT_HPP_ -#define TESTSORT_HPP_ - -#include -#include -#include -#include - -namespace Test { - -namespace Impl{ - -template -struct is_sorted_struct { - typedef unsigned int value_type; - typedef ExecutionSpace execution_space; - - Kokkos::View keys; - - is_sorted_struct(Kokkos::View keys_):keys(keys_) {} - KOKKOS_INLINE_FUNCTION - void operator() (int i, unsigned int& count) const { - if(keys(i)>keys(i+1)) count++; - } -}; - -template -struct sum { - typedef double value_type; - typedef ExecutionSpace execution_space; - - Kokkos::View keys; - - sum(Kokkos::View keys_):keys(keys_) {} - KOKKOS_INLINE_FUNCTION - void operator() (int i, double& count) const { - count+=keys(i); - } -}; - -template -struct bin3d_is_sorted_struct { - typedef unsigned int value_type; - typedef ExecutionSpace execution_space; - - Kokkos::View keys; - - int max_bins; - Scalar min; - Scalar max; - - bin3d_is_sorted_struct(Kokkos::View keys_,int max_bins_,Scalar min_,Scalar max_): - keys(keys_),max_bins(max_bins_),min(min_),max(max_) { - } - KOKKOS_INLINE_FUNCTION - void operator() (int i, unsigned int& count) const { - int ix1 = int ((keys(i,0)-min)/max * max_bins); - int iy1 = int ((keys(i,1)-min)/max * max_bins); - int iz1 = int ((keys(i,2)-min)/max * max_bins); - int ix2 = int ((keys(i+1,0)-min)/max * max_bins); - int iy2 = int ((keys(i+1,1)-min)/max * max_bins); - int iz2 = int ((keys(i+1,2)-min)/max * max_bins); - - if (ix1>ix2) count++; - else if(ix1==ix2) { - if (iy1>iy2) count++; - else if ((iy1==iy2) && (iz1>iz2)) count++; - } - } -}; - -template -struct sum3D { - typedef double value_type; - typedef ExecutionSpace execution_space; - - Kokkos::View keys; - - sum3D(Kokkos::View keys_):keys(keys_) {} - KOKKOS_INLINE_FUNCTION - void operator() (int i, double& count) const { - count+=keys(i,0); - count+=keys(i,1); - count+=keys(i,2); - } -}; - -template -void test_1D_sort(unsigned int n,bool force_kokkos) { - typedef Kokkos::View KeyViewType; - KeyViewType keys("Keys",n); - - Kokkos::Random_XorShift64_Pool g(1931); - Kokkos::fill_random(keys,g,Kokkos::Random_XorShift64_Pool::generator_type::MAX_URAND); - - double sum_before = 0.0; - double sum_after = 0.0; - unsigned int sort_fails = 0; - - Kokkos::parallel_reduce(n,sum(keys),sum_before); - - Kokkos::sort(keys,force_kokkos); - - Kokkos::parallel_reduce(n,sum(keys),sum_after); - Kokkos::parallel_reduce(n-1,is_sorted_struct(keys),sort_fails); - - double ratio = sum_before/sum_after; - double epsilon = 1e-10; - unsigned int equal_sum = (ratio > (1.0-epsilon)) && (ratio < (1.0+epsilon)) ? 1 : 0; - - ASSERT_EQ(sort_fails,0); - ASSERT_EQ(equal_sum,1); -} - -template -void test_3D_sort(unsigned int n) { - typedef Kokkos::View KeyViewType; - - KeyViewType keys("Keys",n*n*n); - - Kokkos::Random_XorShift64_Pool g(1931); - Kokkos::fill_random(keys,g,100.0); - - double sum_before = 0.0; - double sum_after = 0.0; - unsigned int sort_fails = 0; - - Kokkos::parallel_reduce(keys.dimension_0(),sum3D(keys),sum_before); - - int bin_1d = 1; - while( bin_1d*bin_1d*bin_1d*4< (int) keys.dimension_0() ) bin_1d*=2; - int bin_max[3] = {bin_1d,bin_1d,bin_1d}; - typename KeyViewType::value_type min[3] = {0,0,0}; - typename KeyViewType::value_type max[3] = {100,100,100}; - - typedef Kokkos::SortImpl::DefaultBinOp3D< KeyViewType > BinOp; - BinOp bin_op(bin_max,min,max); - Kokkos::BinSort< KeyViewType , BinOp > - Sorter(keys,bin_op,false); - Sorter.create_permute_vector(); - Sorter.template sort< KeyViewType >(keys); - - Kokkos::parallel_reduce(keys.dimension_0(),sum3D(keys),sum_after); - Kokkos::parallel_reduce(keys.dimension_0()-1,bin3d_is_sorted_struct(keys,bin_1d,min[0],max[0]),sort_fails); - - double ratio = sum_before/sum_after; - double epsilon = 1e-10; - unsigned int equal_sum = (ratio > (1.0-epsilon)) && (ratio < (1.0+epsilon)) ? 1 : 0; - - printf("3D Sort Sum: %f %f Fails: %u\n",sum_before,sum_after,sort_fails); - ASSERT_EQ(sort_fails,0); - ASSERT_EQ(equal_sum,1); -} - -template -void test_sort(unsigned int N) -{ - test_1D_sort(N*N*N, true); - test_1D_sort(N*N*N, false); - test_3D_sort(N); -} - -} -} -#endif /* TESTSORT_HPP_ */ diff --git a/lib/kokkos/algorithms/unit_tests/TestThreads.cpp b/lib/kokkos/algorithms/unit_tests/TestThreads.cpp deleted file mode 100644 index a61d6c8bd5..0000000000 --- a/lib/kokkos/algorithms/unit_tests/TestThreads.cpp +++ /dev/null @@ -1,113 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#include -#include -#include - - -//---------------------------------------------------------------------------- - - -namespace Test { - -#ifdef KOKKOS_HAVE_PTHREAD -class threads : public ::testing::Test { -protected: - static void SetUpTestCase() - { - std::cout << std::setprecision(5) << std::scientific; - - unsigned num_threads = 4; - - if (Kokkos::hwloc::available()) { - num_threads = Kokkos::hwloc::get_available_numa_count() - * Kokkos::hwloc::get_available_cores_per_numa() - // * Kokkos::hwloc::get_available_threads_per_core() - ; - - } - - std::cout << "Threads: " << num_threads << std::endl; - - Kokkos::Threads::initialize( num_threads ); - } - - static void TearDownTestCase() - { - Kokkos::Threads::finalize(); - } -}; - -#define THREADS_RANDOM_XORSHIFT64( num_draws ) \ - TEST_F( threads, Random_XorShift64 ) { \ - Impl::test_random >(num_draws); \ - } - -#define THREADS_RANDOM_XORSHIFT1024( num_draws ) \ - TEST_F( threads, Random_XorShift1024 ) { \ - Impl::test_random >(num_draws); \ - } - -#define THREADS_SORT_UNSIGNED( size ) \ - TEST_F( threads, SortUnsigned ) { \ - Impl::test_sort< Kokkos::Threads, double >(size); \ - } - - -THREADS_RANDOM_XORSHIFT64( 10240000 ) -THREADS_RANDOM_XORSHIFT1024( 10130144 ) -THREADS_SORT_UNSIGNED(171) - -#undef THREADS_RANDOM_XORSHIFT64 -#undef THREADS_RANDOM_XORSHIFT1024 -#undef THREADS_SORT_UNSIGNED - -#endif -} // namespace Test - - diff --git a/lib/kokkos/algorithms/unit_tests/UnitTestMain.cpp b/lib/kokkos/algorithms/unit_tests/UnitTestMain.cpp deleted file mode 100644 index f952ab3db5..0000000000 --- a/lib/kokkos/algorithms/unit_tests/UnitTestMain.cpp +++ /dev/null @@ -1,50 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -int main(int argc, char *argv[]) { - ::testing::InitGoogleTest(&argc,argv); - return RUN_ALL_TESTS(); -} - diff --git a/lib/kokkos/config/configure_compton_cpu.sh b/lib/kokkos/config/configure_compton_cpu.sh deleted file mode 100644 index 17287fb848..0000000000 --- a/lib/kokkos/config/configure_compton_cpu.sh +++ /dev/null @@ -1,190 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -# Additional command-line arguments given to this script will be -# passed directly to CMake. -# - -# -# Force CMake to re-evaluate build options. -# -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -#----------------------------------------------------------------------------- -# Incrementally construct cmake configure options: - -CMAKE_CONFIGURE="" - -#----------------------------------------------------------------------------- -# Location of Trilinos source tree: - -CMAKE_PROJECT_DIR="${HOME}/Trilinos" - -# Location for installation: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=/home/projects/kokkos/host/`date +%F`" - -#----------------------------------------------------------------------------- -# General build options. -# Use a variable so options can be propagated to CUDA compiler. - -CMAKE_VERBOSE_MAKEFILE=OFF -CMAKE_BUILD_TYPE=RELEASE -# CMAKE_BUILD_TYPE=DEBUG - -#----------------------------------------------------------------------------- -# Build for CUDA architecture: - -CUDA_ARCH="" -# CUDA_ARCH="20" -# CUDA_ARCH="30" -# CUDA_ARCH="35" - -# Build with Intel compiler - -INTEL=ON - -# Build for MIC architecture: - -# INTEL_XEON_PHI=ON - -# Build with HWLOC at location: - -HWLOC_BASE_DIR="/home/projects/libraries/host/hwloc/1.6.2" - -# Location for MPI to use in examples: - -MPI_BASE_DIR="" - -#----------------------------------------------------------------------------- -# MPI configuation only used for examples: -# -# Must have the MPI_BASE_DIR so that the -# include path can be passed to the Cuda compiler - -if [ -n "${MPI_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D MPI_BASE_DIR:PATH=${MPI_BASE_DIR}" -else - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=OFF" -fi - -#----------------------------------------------------------------------------- -# Pthread configuation: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=ON" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- -# OpenMP configuation: - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=OFF" - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- -# Configure packages for kokkos-only: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- -# Hardware locality cmake configuration: - -if [ -n "${HWLOC_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_HWLOC:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_INCLUDE_DIRS:FILEPATH=${HWLOC_BASE_DIR}/include" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_LIBRARY_DIRS:FILEPATH=${HWLOC_BASE_DIR}/lib" -fi - -#----------------------------------------------------------------------------- -# Cuda cmake configuration: - -if [ -n "${CUDA_ARCH}" ] ; -then - - # Options to CUDA_NVCC_FLAGS must be semi-colon delimited, - # this is different than the standard CMAKE_CXX_FLAGS syntax. - - CUDA_NVCC_FLAGS="-gencode;arch=compute_${CUDA_ARCH},code=sm_${CUDA_ARCH}" - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-Xcompiler;-Wall,-ansi" - - if [ "${CMAKE_BUILD_TYPE}" = "DEBUG" ] ; - then - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-g" - else - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-O3" - fi - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUDA:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUSPARSE:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_VERBOSE_BUILD:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_NVCC_FLAGS:STRING=${CUDA_NVCC_FLAGS}" - -fi - -#----------------------------------------------------------------------------- - -if [ "${INTEL}" = "ON" -o "${INTEL_XEON_PHI}" = "ON" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=icc" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=icpc" -fi - -#----------------------------------------------------------------------------- - -# Cross-compile for Intel Xeon Phi: - -if [ "${INTEL_XEON_PHI}" = "ON" ] ; -then - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_SYSTEM_NAME=Linux" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-mmic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_FLAGS:STRING=-mmic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_Fortran_COMPILER:FILEPATH=ifort" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_DIRS:FILEPATH=${MKLROOT}/lib/mic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_NAMES='mkl_intel_lp64;mkl_sequential;mkl_core;pthread;m'" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CHECKED_STL:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_WARNINGS_AS_ERRORS_FLAGS:STRING=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BUILD_SHARED_LIBS:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D DART_TESTING_TIMEOUT:STRING=600" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_LIBRARY_NAMES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_LAPACK_LIBRARIES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_BinUtils=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_Pthread_LIBRARIES=pthread" - - # Cannot cross-compile fortran compatibility checks on the MIC: - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" - - # Tell cmake the answers to compile-and-execute tests - # to prevent cmake from executing a cross-compiled program. - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_GCC_ABI_DEMANGLE_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_TEUCHOS_BLASFLOAT_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_SLAPY2_WORKS_EXITCODE=0" - -fi - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=${CMAKE_BUILD_TYPE}" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_VERBOSE_MAKEFILE:BOOL=${CMAKE_VERBOSE_MAKEFILE}" - -#----------------------------------------------------------------------------- - -echo "cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR}" - -cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/configure_compton_mic.sh b/lib/kokkos/config/configure_compton_mic.sh deleted file mode 100644 index 7f9aee13f9..0000000000 --- a/lib/kokkos/config/configure_compton_mic.sh +++ /dev/null @@ -1,186 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -# Additional command-line arguments given to this script will be -# passed directly to CMake. -# - -# -# Force CMake to re-evaluate build options. -# -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -#----------------------------------------------------------------------------- -# Incrementally construct cmake configure options: - -CMAKE_CONFIGURE="" - -#----------------------------------------------------------------------------- -# Location of Trilinos source tree: - -CMAKE_PROJECT_DIR="${HOME}/Trilinos" - -# Location for installation: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=/home/projects/kokkos/mic/`date +%F`" - -#----------------------------------------------------------------------------- -# General build options. -# Use a variable so options can be propagated to CUDA compiler. - -CMAKE_VERBOSE_MAKEFILE=OFF -CMAKE_BUILD_TYPE=RELEASE -# CMAKE_BUILD_TYPE=DEBUG - -#----------------------------------------------------------------------------- -# Build for CUDA architecture: - -CUDA_ARCH="" -# CUDA_ARCH="20" -# CUDA_ARCH="30" -# CUDA_ARCH="35" - -# Build for MIC architecture: - -INTEL_XEON_PHI=ON - -# Build with HWLOC at location: - -HWLOC_BASE_DIR="/home/projects/libraries/mic/hwloc/1.6.2" - -# Location for MPI to use in examples: - -MPI_BASE_DIR="" - -#----------------------------------------------------------------------------- -# MPI configuation only used for examples: -# -# Must have the MPI_BASE_DIR so that the -# include path can be passed to the Cuda compiler - -if [ -n "${MPI_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D MPI_BASE_DIR:PATH=${MPI_BASE_DIR}" -else - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=OFF" -fi - -#----------------------------------------------------------------------------- -# Pthread configuation: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=ON" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- -# OpenMP configuation: - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=OFF" - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- -# Configure packages for kokkos-only: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- -# Hardware locality cmake configuration: - -if [ -n "${HWLOC_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_HWLOC:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_INCLUDE_DIRS:FILEPATH=${HWLOC_BASE_DIR}/include" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_LIBRARY_DIRS:FILEPATH=${HWLOC_BASE_DIR}/lib" -fi - -#----------------------------------------------------------------------------- -# Cuda cmake configuration: - -if [ -n "${CUDA_ARCH}" ] ; -then - - # Options to CUDA_NVCC_FLAGS must be semi-colon delimited, - # this is different than the standard CMAKE_CXX_FLAGS syntax. - - CUDA_NVCC_FLAGS="-gencode;arch=compute_${CUDA_ARCH},code=sm_${CUDA_ARCH}" - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-Xcompiler;-Wall,-ansi" - - if [ "${CMAKE_BUILD_TYPE}" = "DEBUG" ] ; - then - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-g" - else - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-O3" - fi - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUDA:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUSPARSE:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_VERBOSE_BUILD:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_NVCC_FLAGS:STRING=${CUDA_NVCC_FLAGS}" - -fi - -#----------------------------------------------------------------------------- - -if [ "${INTEL}" = "ON" -o "${INTEL_XEON_PHI}" = "ON" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=icc" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=icpc" -fi - -#----------------------------------------------------------------------------- - -# Cross-compile for Intel Xeon Phi: - -if [ "${INTEL_XEON_PHI}" = "ON" ] ; -then - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_SYSTEM_NAME=Linux" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-mmic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_FLAGS:STRING=-mmic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_Fortran_COMPILER:FILEPATH=ifort" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_DIRS:FILEPATH=${MKLROOT}/lib/mic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_NAMES='mkl_intel_lp64;mkl_sequential;mkl_core;pthread;m'" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CHECKED_STL:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_WARNINGS_AS_ERRORS_FLAGS:STRING=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BUILD_SHARED_LIBS:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D DART_TESTING_TIMEOUT:STRING=600" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_LIBRARY_NAMES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_LAPACK_LIBRARIES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_BinUtils=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_Pthread_LIBRARIES=pthread" - - # Cannot cross-compile fortran compatibility checks on the MIC: - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" - - # Tell cmake the answers to compile-and-execute tests - # to prevent cmake from executing a cross-compiled program. - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_GCC_ABI_DEMANGLE_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_TEUCHOS_BLASFLOAT_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_SLAPY2_WORKS_EXITCODE=0" - -fi - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=${CMAKE_BUILD_TYPE}" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_VERBOSE_MAKEFILE:BOOL=${CMAKE_VERBOSE_MAKEFILE}" - -#----------------------------------------------------------------------------- - -echo "cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR}" - -cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/configure_kokkos.sh b/lib/kokkos/config/configure_kokkos.sh deleted file mode 100644 index 592e7f5936..0000000000 --- a/lib/kokkos/config/configure_kokkos.sh +++ /dev/null @@ -1,293 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -#----------------------------------------------------------------------------- -# General build options. -# Use a variable so options can be propagated to CUDA compiler. - -CMAKE_BUILD_TYPE=RELEASE -# CMAKE_BUILD_TYPE=DEBUG - -# Source and installation directories: - -TRILINOS_SOURCE_DIR=${HOME}/Trilinos -TRILINOS_INSTALL_DIR=${HOME}/TrilinosInstall/`date +%F` - -#----------------------------------------------------------------------------- - -USE_CUDA_ARCH= -USE_THREAD= -USE_OPENMP= -USE_INTEL= -USE_XEON_PHI= -HWLOC_BASE_DIR= -MPI_BASE_DIR= -BLAS_LIB_DIR= -LAPACK_LIB_DIR= - -if [ 1 ] ; then - # Platform 'kokkos-dev' with Cuda, OpenMP, hwloc, mpi, gnu - USE_CUDA_ARCH="35" - USE_OPENMP=ON - HWLOC_BASE_DIR="/home/projects/hwloc/1.7.1/host/gnu/4.4.7" - MPI_BASE_DIR="/home/projects/mvapich/2.0.0b/gnu/4.4.7" - BLAS_LIB_DIR="/home/projects/blas/host/gnu/lib" - LAPACK_LIB_DIR="/home/projects/lapack/host/gnu/lib" - -elif [ ] ; then - # Platform 'kokkos-dev' with Cuda, Threads, hwloc, mpi, gnu - USE_CUDA_ARCH="35" - USE_THREAD=ON - HWLOC_BASE_DIR="/home/projects/hwloc/1.7.1/host/gnu/4.4.7" - MPI_BASE_DIR="/home/projects/mvapich/2.0.0b/gnu/4.4.7" - BLAS_LIB_DIR="/home/projects/blas/host/gnu/lib" - LAPACK_LIB_DIR="/home/projects/lapack/host/gnu/lib" - -elif [ ] ; then - # Platform 'kokkos-dev' with Xeon Phi and hwloc - USE_OPENMP=ON - USE_INTEL=ON - USE_XEON_PHI=ON - HWLOC_BASE_DIR="/home/projects/hwloc/1.7.1/mic/intel/13.SP1.1.106" - -elif [ ] ; then - # Platform 'kokkos-nvidia' with Cuda, OpenMP, hwloc, mpi, gnu - USE_CUDA_ARCH="20" - USE_OPENMP=ON - HWLOC_BASE_DIR="/home/sems/common/hwloc/current" - MPI_BASE_DIR="/home/sems/common/openmpi/current" - -elif [ ] ; then - # Platform 'kokkos-nvidia' with Cuda, Threads, hwloc, mpi, gnu - USE_CUDA_ARCH="20" - USE_THREAD=ON - HWLOC_BASE_DIR="/home/sems/common/hwloc/current" - MPI_BASE_DIR="/home/sems/common/openmpi/current" - -fi - -#----------------------------------------------------------------------------- -# Incrementally construct cmake configure command line options: - -CMAKE_CONFIGURE="" -CMAKE_CXX_FLAGS="" - -#----------------------------------------------------------------------------- -# Configure for Kokkos subpackages and tests: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- - -if [ 1 ] ; then - - # Configure for Tpetra/Kokkos: - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_DIRS:FILEPATH=${BLAS_LIB_DIR}" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_LIBRARY_DIRS:FILEPATH=${LAPACK_LIB_DIR}" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Tpetra:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Kokkos:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraClassic:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TeuchosKokkosCompat:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TeuchosKokkosComm:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Tpetra_ENABLE_Kokkos_Refactor:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D KokkosClassic_DefaultNode:STRING=Kokkos::Compat::KokkosOpenMPWrapperNode" - - CMAKE_CXX_FLAGS="${CMAKE_CXX_FLAGS}-DKOKKOS_FAST_COMPILE" - - if [ -n "${USE_CUDA_ARCH}" ] ; then - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Cuda:BOOL=ON" - - fi - -fi - -if [ 1 ] ; then - - # Configure for Stokhos: - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Sacado:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Stokhos:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Stokhos_ENABLE_Belos:BOOL=ON" - -fi - -if [ 1 ] ; then - - # Configure for TrilinosCouplings: - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TrilinosCouplings:BOOL=ON" - -fi - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=${CMAKE_BUILD_TYPE}" - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_VERBOSE_MAKEFILE:BOOL=ON" - -if [ "${CMAKE_BUILD_TYPE}" == "DEBUG" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_BOUNDS_CHECK:BOOL=ON" -fi - -#----------------------------------------------------------------------------- -# Location for installation: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=${TRILINOS_INSTALL_DIR}" - -#----------------------------------------------------------------------------- -# MPI configuation only used for examples: -# -# Must have the MPI_BASE_DIR so that the -# include path can be passed to the Cuda compiler - -if [ -n "${MPI_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D MPI_BASE_DIR:PATH=${MPI_BASE_DIR}" -else - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=OFF" -fi - -#----------------------------------------------------------------------------- -# Kokkos use pthread configuation: - -if [ "${USE_THREAD}" = "ON" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=ON" -else - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=OFF" -fi - -#----------------------------------------------------------------------------- -# Kokkos use OpenMP configuation: - -if [ "${USE_OPENMP}" = "ON" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_OpenMP:BOOL=ON" -else - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_OpenMP:BOOL=OFF" -fi - -#----------------------------------------------------------------------------- -# Hardware locality configuration: - -if [ -n "${HWLOC_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_HWLOC:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_INCLUDE_DIRS:FILEPATH=${HWLOC_BASE_DIR}/include" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_LIBRARY_DIRS:FILEPATH=${HWLOC_BASE_DIR}/lib" -fi - -#----------------------------------------------------------------------------- -# Cuda cmake configuration: - -if [ -n "${USE_CUDA_ARCH}" ] ; -then - - # Options to CUDA_NVCC_FLAGS must be semi-colon delimited, - # this is different than the standard CMAKE_CXX_FLAGS syntax. - - CUDA_NVCC_FLAGS="-DKOKKOS_HAVE_CUDA_ARCH=${USE_CUDA_ARCH}0;-gencode;arch=compute_${USE_CUDA_ARCH},code=sm_${USE_CUDA_ARCH}" - - if [ "${USE_OPENMP}" = "ON" ] ; - then - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-Xcompiler;-Wall,-ansi,-fopenmp" - else - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-Xcompiler;-Wall,-ansi" - fi - - if [ "${CMAKE_BUILD_TYPE}" = "DEBUG" ] ; - then - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-g" - else - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-O3" - fi - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUDA:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUSPARSE:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_VERBOSE_BUILD:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_NVCC_FLAGS:STRING=${CUDA_NVCC_FLAGS}" - -fi - -#----------------------------------------------------------------------------- - -if [ "${USE_INTEL}" = "ON" -o "${USE_XEON_PHI}" = "ON" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=icc" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=icpc" -fi - -# Cross-compile for Intel Xeon Phi: - -if [ "${USE_XEON_PHI}" = "ON" ] ; -then - - CMAKE_CXX_FLAGS="${CMAKE_CXX_FLAGS} -mmic" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_SYSTEM_NAME=Linux" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_FLAGS:STRING=-mmic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_Fortran_COMPILER:FILEPATH=ifort" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_DIRS:FILEPATH=${MKLROOT}/lib/mic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_NAMES='mkl_intel_lp64;mkl_sequential;mkl_core;pthread;m'" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CHECKED_STL:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_WARNINGS_AS_ERRORS_FLAGS:STRING=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BUILD_SHARED_LIBS:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D DART_TESTING_TIMEOUT:STRING=600" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_LIBRARY_NAMES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_LAPACK_LIBRARIES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_BinUtils=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_Pthread_LIBRARIES=pthread" - - # Cannot cross-compile fortran compatibility checks on the MIC: - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" - - # Tell cmake the answers to compile-and-execute tests - # to prevent cmake from executing a cross-compiled program. - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_GCC_ABI_DEMANGLE_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_TEUCHOS_BLASFLOAT_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_SLAPY2_WORKS_EXITCODE=0" - -fi - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- - -if [ -n "${CMAKE_CXX_FLAGS}" ] ; then - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING='${CMAKE_CXX_FLAGS}'" - -fi - -#----------------------------------------------------------------------------- -# -# Remove CMake output files to force reconfigure from scratch. -# - -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -# - -echo "cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR}" - -cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/configure_kokkos_bgq.sh b/lib/kokkos/config/configure_kokkos_bgq.sh deleted file mode 100755 index 73236937ea..0000000000 --- a/lib/kokkos/config/configure_kokkos_bgq.sh +++ /dev/null @@ -1,88 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -# Additional command-line arguments given to this script will be -# passed directly to CMake. -# - -# to build: -# build on bgq-b[1-12] -# module load sierra-devel -# run this configure file -# make - -# to run: -# ssh bgq-login -# cd /scratch/username/... -# export OMP_PROC_BIND and XLSMPOPTS environment variables -# run with srun - -# Note: hwloc does not work to get or set cpubindings on bgq. -# Use the openmp backend and the openmp environment variables. -# -# Only the mpi wrappers seem to be setup for cross-compile, -# so it is important that this configure enables MPI and uses mpigcc wrappers. - - - -# -# Force CMake to re-evaluate build options. -# -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -#----------------------------------------------------------------------------- -# Incrementally construct cmake configure options: - -CMAKE_CONFIGURE="" - -#----------------------------------------------------------------------------- -# Location of Trilinos source tree: - -CMAKE_PROJECT_DIR="../Trilinos" - -# Location for installation: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=../TrilinosInstall/`date +%F`" - -#----------------------------------------------------------------------------- -# General build options. -# Use a variable so options can be propagated to CUDA compiler. - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=mpigcc-4.7.2" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=mpig++-4.7.2" - -CMAKE_VERBOSE_MAKEFILE=OFF -CMAKE_BUILD_TYPE=RELEASE -# CMAKE_BUILD_TYPE=DEBUG - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- -# Configure packages for kokkos-only: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=${CMAKE_BUILD_TYPE}" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_VERBOSE_MAKEFILE:BOOL=${CMAKE_VERBOSE_MAKEFILE}" - -#----------------------------------------------------------------------------- - -echo "cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR}" - -cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/configure_kokkos_dev.sh b/lib/kokkos/config/configure_kokkos_dev.sh deleted file mode 100755 index ac61dec602..0000000000 --- a/lib/kokkos/config/configure_kokkos_dev.sh +++ /dev/null @@ -1,216 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -# Additional command-line arguments given to this script will be -# passed directly to CMake. -# - -# -# Force CMake to re-evaluate build options. -# -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -#----------------------------------------------------------------------------- -# Incrementally construct cmake configure options: - -CMAKE_CONFIGURE="" - -#----------------------------------------------------------------------------- -# Location of Trilinos source tree: - -CMAKE_PROJECT_DIR="${HOME}/Trilinos" - -# Location for installation: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=${HOME}/TrilinosInstall/`date +%F`" - -#----------------------------------------------------------------------------- -# General build options. -# Use a variable so options can be propagated to CUDA compiler. - -CMAKE_VERBOSE_MAKEFILE=OFF -CMAKE_BUILD_TYPE=RELEASE -#CMAKE_BUILD_TYPE=DEBUG -#CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_BOUNDS_CHECK:BOOL=ON" - -#----------------------------------------------------------------------------- -# Build for CUDA architecture: - -#CUDA_ARCH="" -#CUDA_ARCH="20" -#CUDA_ARCH="30" -CUDA_ARCH="35" - -# Build with OpenMP - -OPENMP=ON -PTHREADS=ON - -# Build host code with Intel compiler: - -INTEL=OFF - -# Build for MIC architecture: - -INTEL_XEON_PHI=OFF - -# Build with HWLOC at location: - -#HWLOC_BASE_DIR="" -#HWLOC_BASE_DIR="/home/projects/hwloc/1.7.1/host/gnu/4.4.7" -HWLOC_BASE_DIR="/home/projects/hwloc/1.7.1/host/gnu/4.7.3" - -# Location for MPI to use in examples: - -#MPI_BASE_DIR="" -#MPI_BASE_DIR="/home/projects/mvapich/2.0.0b/gnu/4.4.7" -MPI_BASE_DIR="/home/projects/mvapich/2.0.0b/gnu/4.7.3" -#MPI_BASE_DIR="/home/projects/openmpi/1.7.3/llvm/2013-12-02/" - -#----------------------------------------------------------------------------- -# MPI configuation only used for examples: -# -# Must have the MPI_BASE_DIR so that the -# include path can be passed to the Cuda compiler - -if [ -n "${MPI_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D MPI_BASE_DIR:PATH=${MPI_BASE_DIR}" -else - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=OFF" -fi - -#----------------------------------------------------------------------------- -# Pthread configuation: - -if [ "${PTHREADS}" = "ON" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=ON" -else - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=OFF" -fi - -#----------------------------------------------------------------------------- -# OpenMP configuation: - -if [ "${OPENMP}" = "ON" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" -else - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=OFF" -fi - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- -# Configure packages for kokkos-only: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- -# Hardware locality cmake configuration: - -if [ -n "${HWLOC_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_HWLOC:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_INCLUDE_DIRS:FILEPATH=${HWLOC_BASE_DIR}/include" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_LIBRARY_DIRS:FILEPATH=${HWLOC_BASE_DIR}/lib" -fi - -#----------------------------------------------------------------------------- -# Cuda cmake configuration: - -if [ -n "${CUDA_ARCH}" ] ; -then - - # Options to CUDA_NVCC_FLAGS must be semi-colon delimited, - # this is different than the standard CMAKE_CXX_FLAGS syntax. - - CUDA_NVCC_FLAGS="-gencode;arch=compute_${CUDA_ARCH},code=sm_${CUDA_ARCH}" - - if [ "${OPENMP}" = "ON" ] ; - then - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-Xcompiler;-Wall,-ansi,-fopenmp" - else - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-Xcompiler;-Wall,-ansi" - fi - - if [ "${CMAKE_BUILD_TYPE}" = "DEBUG" ] ; - then - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-g" - else - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-O3" - fi - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUDA:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUSPARSE:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_VERBOSE_BUILD:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_NVCC_FLAGS:STRING=${CUDA_NVCC_FLAGS}" - -fi - -#----------------------------------------------------------------------------- - -if [ "${INTEL}" = "ON" -o "${INTEL_XEON_PHI}" = "ON" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=icc" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=icpc" -fi - -#----------------------------------------------------------------------------- - -# Cross-compile for Intel Xeon Phi: - -if [ "${INTEL_XEON_PHI}" = "ON" ] ; -then - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_SYSTEM_NAME=Linux" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-mmic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_FLAGS:STRING=-mmic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_Fortran_COMPILER:FILEPATH=ifort" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_DIRS:FILEPATH=${MKLROOT}/lib/mic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_NAMES='mkl_intel_lp64;mkl_sequential;mkl_core;pthread;m'" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CHECKED_STL:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_WARNINGS_AS_ERRORS_FLAGS:STRING=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BUILD_SHARED_LIBS:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D DART_TESTING_TIMEOUT:STRING=600" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_LIBRARY_NAMES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_LAPACK_LIBRARIES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_BinUtils=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_Pthread_LIBRARIES=pthread" - - # Cannot cross-compile fortran compatibility checks on the MIC: - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" - - # Tell cmake the answers to compile-and-execute tests - # to prevent cmake from executing a cross-compiled program. - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_GCC_ABI_DEMANGLE_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_TEUCHOS_BLASFLOAT_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_SLAPY2_WORKS_EXITCODE=0" - -fi - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=${CMAKE_BUILD_TYPE}" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_VERBOSE_MAKEFILE:BOOL=${CMAKE_VERBOSE_MAKEFILE}" - -#----------------------------------------------------------------------------- - -echo "cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR}" - -cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/configure_kokkos_nvidia.sh b/lib/kokkos/config/configure_kokkos_nvidia.sh deleted file mode 100644 index f78b7dce78..0000000000 --- a/lib/kokkos/config/configure_kokkos_nvidia.sh +++ /dev/null @@ -1,204 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -# Additional command-line arguments given to this script will be -# passed directly to CMake. -# - -# -# Force CMake to re-evaluate build options. -# -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -#----------------------------------------------------------------------------- -# Incrementally construct cmake configure options: - -CMAKE_CONFIGURE="" - -#----------------------------------------------------------------------------- -# Location of Trilinos source tree: - -CMAKE_PROJECT_DIR="${HOME}/Trilinos" - -# Location for installation: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=/home/sems/common/kokkos/`date +%F`" - -#----------------------------------------------------------------------------- -# General build options. -# Use a variable so options can be propagated to CUDA compiler. - -CMAKE_VERBOSE_MAKEFILE=OFF -CMAKE_BUILD_TYPE=RELEASE -# CMAKE_BUILD_TYPE=DEBUG - -#----------------------------------------------------------------------------- -# Build for CUDA architecture: - -# CUDA_ARCH="" -CUDA_ARCH="20" -# CUDA_ARCH="30" -# CUDA_ARCH="35" - -# Build with OpenMP - -OPENMP=ON - -# Build host code with Intel compiler: - -# INTEL=ON - -# Build for MIC architecture: - -# INTEL_XEON_PHI=ON - -# Build with HWLOC at location: - -HWLOC_BASE_DIR="/home/sems/common/hwloc/current" - -# Location for MPI to use in examples: - -MPI_BASE_DIR="/home/sems/common/openmpi/current" - -#----------------------------------------------------------------------------- -# MPI configuation only used for examples: -# -# Must have the MPI_BASE_DIR so that the -# include path can be passed to the Cuda compiler - -if [ -n "${MPI_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D MPI_BASE_DIR:PATH=${MPI_BASE_DIR}" -else - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=OFF" -fi - -#----------------------------------------------------------------------------- -# Pthread configuation: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=ON" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- -# OpenMP configuation: - -if [ "${OPENMP}" = "ON" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" -else - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=OFF" -fi - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- -# Configure packages for kokkos-only: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- -# Hardware locality cmake configuration: - -if [ -n "${HWLOC_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_HWLOC:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_INCLUDE_DIRS:FILEPATH=${HWLOC_BASE_DIR}/include" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_LIBRARY_DIRS:FILEPATH=${HWLOC_BASE_DIR}/lib" -fi - -#----------------------------------------------------------------------------- -# Cuda cmake configuration: - -if [ -n "${CUDA_ARCH}" ] ; -then - - # Options to CUDA_NVCC_FLAGS must be semi-colon delimited, - # this is different than the standard CMAKE_CXX_FLAGS syntax. - - CUDA_NVCC_FLAGS="-gencode;arch=compute_${CUDA_ARCH},code=sm_${CUDA_ARCH}" - - if [ "${OPENMP}" = "ON" ] ; - then - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-Xcompiler;-Wall,-ansi,-fopenmp" - else - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-Xcompiler;-Wall,-ansi" - fi - - if [ "${CMAKE_BUILD_TYPE}" = "DEBUG" ] ; - then - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-g" - else - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-O3" - fi - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUDA:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUSPARSE:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_VERBOSE_BUILD:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_NVCC_FLAGS:STRING=${CUDA_NVCC_FLAGS}" - -fi - -#----------------------------------------------------------------------------- - -if [ "${INTEL}" = "ON" -o "${INTEL_XEON_PHI}" = "ON" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=icc" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=icpc" -fi - -#----------------------------------------------------------------------------- - -# Cross-compile for Intel Xeon Phi: - -if [ "${INTEL_XEON_PHI}" = "ON" ] ; -then - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_SYSTEM_NAME=Linux" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-mmic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_FLAGS:STRING=-mmic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_Fortran_COMPILER:FILEPATH=ifort" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_DIRS:FILEPATH=${MKLROOT}/lib/mic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_NAMES='mkl_intel_lp64;mkl_sequential;mkl_core;pthread;m'" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CHECKED_STL:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_WARNINGS_AS_ERRORS_FLAGS:STRING=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BUILD_SHARED_LIBS:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D DART_TESTING_TIMEOUT:STRING=600" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_LIBRARY_NAMES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_LAPACK_LIBRARIES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_BinUtils=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_Pthread_LIBRARIES=pthread" - - # Cannot cross-compile fortran compatibility checks on the MIC: - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" - - # Tell cmake the answers to compile-and-execute tests - # to prevent cmake from executing a cross-compiled program. - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_GCC_ABI_DEMANGLE_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_TEUCHOS_BLASFLOAT_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_SLAPY2_WORKS_EXITCODE=0" - -fi - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=${CMAKE_BUILD_TYPE}" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_VERBOSE_MAKEFILE:BOOL=${CMAKE_VERBOSE_MAKEFILE}" - -#----------------------------------------------------------------------------- - -echo "cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR}" - -cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/configure_shannon.sh b/lib/kokkos/config/configure_shannon.sh deleted file mode 100644 index 8bd175b031..0000000000 --- a/lib/kokkos/config/configure_shannon.sh +++ /dev/null @@ -1,190 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -# Additional command-line arguments given to this script will be -# passed directly to CMake. -# - -# -# Force CMake to re-evaluate build options. -# -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -#----------------------------------------------------------------------------- -# Incrementally construct cmake configure options: - -CMAKE_CONFIGURE="" - -#----------------------------------------------------------------------------- -# Location of Trilinos source tree: - -CMAKE_PROJECT_DIR="${HOME}/Trilinos" - -# Location for installation: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=/home/projects/kokkos/`date +%F`" - -#----------------------------------------------------------------------------- -# General build options. -# Use a variable so options can be propagated to CUDA compiler. - -CMAKE_VERBOSE_MAKEFILE=OFF -CMAKE_BUILD_TYPE=RELEASE -# CMAKE_BUILD_TYPE=DEBUG - -#----------------------------------------------------------------------------- -# Build for CUDA architecture: - -# CUDA_ARCH="" -# CUDA_ARCH="20" -# CUDA_ARCH="30" -CUDA_ARCH="35" - -# Build host code with Intel compiler: - -INTEL=ON - -# Build for MIC architecture: - -# INTEL_XEON_PHI=ON - -# Build with HWLOC at location: - -HWLOC_BASE_DIR="/home/projects/hwloc/1.6.2" - -# Location for MPI to use in examples: - -MPI_BASE_DIR="" - -#----------------------------------------------------------------------------- -# MPI configuation only used for examples: -# -# Must have the MPI_BASE_DIR so that the -# include path can be passed to the Cuda compiler - -if [ -n "${MPI_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D MPI_BASE_DIR:PATH=${MPI_BASE_DIR}" -else - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_MPI:BOOL=OFF" -fi - -#----------------------------------------------------------------------------- -# Pthread configuation: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=ON" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- -# OpenMP configuation: - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=OFF" - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- -# Configure packages for kokkos-only: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -#----------------------------------------------------------------------------- -# Hardware locality cmake configuration: - -if [ -n "${HWLOC_BASE_DIR}" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_HWLOC:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_INCLUDE_DIRS:FILEPATH=${HWLOC_BASE_DIR}/include" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_LIBRARY_DIRS:FILEPATH=${HWLOC_BASE_DIR}/lib" -fi - -#----------------------------------------------------------------------------- -# Cuda cmake configuration: - -if [ -n "${CUDA_ARCH}" ] ; -then - - # Options to CUDA_NVCC_FLAGS must be semi-colon delimited, - # this is different than the standard CMAKE_CXX_FLAGS syntax. - - CUDA_NVCC_FLAGS="-gencode;arch=compute_${CUDA_ARCH},code=sm_${CUDA_ARCH}" - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-Xcompiler;-Wall,-ansi" - - if [ "${CMAKE_BUILD_TYPE}" = "DEBUG" ] ; - then - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-g" - else - CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-O3" - fi - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUDA:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUSPARSE:BOOL=ON" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_VERBOSE_BUILD:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CUDA_NVCC_FLAGS:STRING=${CUDA_NVCC_FLAGS}" - -fi - -#----------------------------------------------------------------------------- - -if [ "${INTEL}" = "ON" -o "${INTEL_XEON_PHI}" = "ON" ] ; -then - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=icc" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=icpc" -fi - -#----------------------------------------------------------------------------- - -# Cross-compile for Intel Xeon Phi: - -if [ "${INTEL_XEON_PHI}" = "ON" ] ; -then - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_SYSTEM_NAME=Linux" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-mmic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_FLAGS:STRING=-mmic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_Fortran_COMPILER:FILEPATH=ifort" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_DIRS:FILEPATH=${MKLROOT}/lib/mic" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BLAS_LIBRARY_NAMES='mkl_intel_lp64;mkl_sequential;mkl_core;pthread;m'" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CHECKED_STL:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_WARNINGS_AS_ERRORS_FLAGS:STRING=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D BUILD_SHARED_LIBS:BOOL=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D DART_TESTING_TIMEOUT:STRING=600" - - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_LIBRARY_NAMES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_LAPACK_LIBRARIES=''" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_BinUtils=OFF" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_Pthread_LIBRARIES=pthread" - - # Cannot cross-compile fortran compatibility checks on the MIC: - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" - - # Tell cmake the answers to compile-and-execute tests - # to prevent cmake from executing a cross-compiled program. - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_GCC_ABI_DEMANGLE_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HAVE_TEUCHOS_BLASFLOAT_EXITCODE=0" - CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D LAPACK_SLAPY2_WORKS_EXITCODE=0" - -fi - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=${CMAKE_BUILD_TYPE}" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_VERBOSE_MAKEFILE:BOOL=${CMAKE_VERBOSE_MAKEFILE}" - -#----------------------------------------------------------------------------- - -echo "cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR}" - -cmake ${CMAKE_CONFIGURE} ${CMAKE_PROJECT_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/configure_tpetra_kokkos_cuda_nvcc_wrapper.sh b/lib/kokkos/config/configure_tpetra_kokkos_cuda_nvcc_wrapper.sh deleted file mode 100755 index 0baa83aefe..0000000000 --- a/lib/kokkos/config/configure_tpetra_kokkos_cuda_nvcc_wrapper.sh +++ /dev/null @@ -1,140 +0,0 @@ -#!/bin/bash -# -# This script uses CUDA, OpenMP, and MPI. -# -# Before invoking this script, set the OMPI_CXX environment variable -# to point to nvcc_wrapper, wherever it happens to live. (If you use -# an MPI implementation other than OpenMPI, set the corresponding -# environment variable instead.) -# - -rm -f CMakeCache.txt; -rm -rf CMakeFiles -EXTRA_ARGS=$@ -MPI_PATH="/opt/mpi/openmpi/1.8.2/nvcc-gcc/4.8.3-6.5" -CUDA_PATH="/opt/nvidia/cuda/6.5.14" - -# -# As long as there are any .cu files in Trilinos, we'll need to set -# CUDA_NVCC_FLAGS. If Trilinos gets rid of all of its .cu files and -# lets nvcc_wrapper handle them as .cpp files, then we won't need to -# set CUDA_NVCC_FLAGS. As it is, given that we need to set -# CUDA_NVCC_FLAGS, we must make sure that they are the same flags as -# nvcc_wrapper passes to nvcc. -# -CUDA_NVCC_FLAGS="-gencode;arch=compute_35,code=sm_35;-I${MPI_PATH}/include" -CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-Xcompiler;-Wall,-ansi,-fopenmp" -CUDA_NVCC_FLAGS="${CUDA_NVCC_FLAGS};-O3;-DKOKKOS_USE_CUDA_UVM" - -cmake \ - -D CMAKE_INSTALL_PREFIX:PATH="$PWD/../install/" \ - -D CMAKE_BUILD_TYPE:STRING=DEBUG \ - -D CMAKE_CXX_FLAGS:STRING="-g -Wall" \ - -D CMAKE_C_FLAGS:STRING="-g -Wall" \ - -D CMAKE_FORTRAN_FLAGS:STRING="" \ - -D CMAKE_SHARED_LIBRARY_LINK_CXX_FLAGS="" \ - -D Trilinos_ENABLE_Triutils=OFF \ - -D Trilinos_ENABLE_INSTALL_CMAKE_CONFIG_FILES:BOOL=OFF \ - -D Trilinos_ENABLE_DEBUG:BOOL=OFF \ - -D Trilinos_ENABLE_CHECKED_STL:BOOL=OFF \ - -D Trilinos_ENABLE_EXPLICIT_INSTANTIATION:BOOL=OFF \ - -D Trilinos_WARNINGS_AS_ERRORS_FLAGS:STRING="" \ - -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF \ - -D Trilinos_ENABLE_ALL_OPTIONAL_PACKAGES:BOOL=OFF \ - -D BUILD_SHARED_LIBS:BOOL=OFF \ - -D DART_TESTING_TIMEOUT:STRING=600 \ - -D CMAKE_VERBOSE_MAKEFILE:BOOL=OFF \ - \ - \ - -D CMAKE_CXX_COMPILER:FILEPATH="${MPI_PATH}/bin/mpicxx" \ - -D CMAKE_C_COMPILER:FILEPATH="${MPI_PATH}/bin/mpicc" \ - -D MPI_CXX_COMPILER:FILEPATH="${MPI_PATH}/bin/mpicxx" \ - -D MPI_C_COMPILER:FILEPATH="${MPI_PATH}/bin/mpicc" \ - -D CMAKE_Fortran_COMPILER:FILEPATH="${MPI_PATH}/bin/mpif77" \ - -D MPI_EXEC:FILEPATH="${MPI_PATH}/bin/mpirun" \ - -D MPI_EXEC_POST_NUMPROCS_FLAGS:STRING="-bind-to;socket;--map-by;socket;env;CUDA_MANAGED_FORCE_DEVICE_ALLOC=1;CUDA_LAUNCH_BLOCKING=1;OMP_NUM_THREADS=2" \ - \ - \ - -D Trilinos_ENABLE_CXX11:BOOL=OFF \ - -D TPL_ENABLE_MPI:BOOL=ON \ - -D Trilinos_ENABLE_OpenMP:BOOL=ON \ - -D Trilinos_ENABLE_ThreadPool:BOOL=ON \ - \ - \ - -D TPL_ENABLE_CUDA:BOOL=ON \ - -D CUDA_TOOLKIT_ROOT_DIR:FILEPATH="${CUDA_PATH}" \ - -D CUDA_PROPAGATE_HOST_FLAGS:BOOL=OFF \ - -D TPL_ENABLE_Thrust:BOOL=OFF \ - -D Thrust_INCLUDE_DIRS:FILEPATH="${CUDA_PATH}/include" \ - -D TPL_ENABLE_CUSPARSE:BOOL=OFF \ - -D TPL_ENABLE_Cusp:BOOL=OFF \ - -D Cusp_INCLUDE_DIRS="/home/crtrott/Software/cusp" \ - -D CUDA_VERBOSE_BUILD:BOOL=OFF \ - -D CUDA_NVCC_FLAGS:STRING=${CUDA_NVCC_FLAGS} \ - \ - \ - -D TPL_ENABLE_HWLOC=OFF \ - -D HWLOC_INCLUDE_DIRS="/usr/local/software/hwloc/current/include" \ - -D HWLOC_LIBRARY_DIRS="/usr/local/software/hwloc/current/lib" \ - -D TPL_ENABLE_BinUtils=OFF \ - -D TPL_ENABLE_BLAS:STRING=ON \ - -D TPL_ENABLE_LAPACK:STRING=ON \ - -D TPL_ENABLE_MKL:STRING=OFF \ - -D TPL_ENABLE_HWLOC:STRING=OFF \ - -D TPL_ENABLE_GTEST:STRING=ON \ - -D TPL_ENABLE_SuperLU=ON \ - -D TPL_ENABLE_BLAS=ON \ - -D TPL_ENABLE_LAPACK=ON \ - -D TPL_SuperLU_LIBRARIES="/home/crtrott/Software/SuperLU_4.3/lib/libsuperlu_4.3.a" \ - -D TPL_SuperLU_INCLUDE_DIRS="/home/crtrott/Software/SuperLU_4.3/SRC" \ - \ - \ - -D Trilinos_Enable_Kokkos:BOOL=ON \ - -D Trilinos_ENABLE_KokkosCore:BOOL=ON \ - -D Trilinos_ENABLE_TeuchosKokkosCompat:BOOL=ON \ - -D Trilinos_ENABLE_KokkosContainers:BOOL=ON \ - -D Trilinos_ENABLE_TpetraKernels:BOOL=ON \ - -D Trilinos_ENABLE_KokkosAlgorithms:BOOL=ON \ - -D Trilinos_ENABLE_TeuchosKokkosComm:BOOL=ON \ - -D Trilinos_ENABLE_KokkosExample:BOOL=ON \ - -D Kokkos_ENABLE_EXAMPLES:BOOL=ON \ - -D Kokkos_ENABLE_TESTS:BOOL=OFF \ - -D KokkosClassic_DefaultNode:STRING="Kokkos::Compat::KokkosCudaWrapperNode" \ - -D TpetraClassic_ENABLE_OpenMPNode=OFF \ - -D TpetraClassic_ENABLE_TPINode=OFF \ - -D TpetraClassic_ENABLE_MKL=OFF \ - -D Kokkos_ENABLE_Cuda_UVM=ON \ - \ - \ - -D Trilinos_ENABLE_Teuchos:BOOL=ON \ - -D Teuchos_ENABLE_COMPLEX:BOOL=OFF \ - \ - \ - -D Trilinos_ENABLE_Tpetra:BOOL=ON \ - -D Tpetra_ENABLE_KokkosCore=ON \ - -D Tpetra_ENABLE_Kokkos_DistObject=OFF \ - -D Tpetra_ENABLE_Kokkos_Refactor=ON \ - -D Tpetra_ENABLE_TESTS=ON \ - -D Tpetra_ENABLE_EXAMPLES=ON \ - -D Tpetra_ENABLE_MPI_CUDA_RDMA:BOOL=ON \ - \ - \ - -D Trilinos_ENABLE_Belos=OFF \ - -D Trilinos_ENABLE_Amesos=OFF \ - -D Trilinos_ENABLE_Amesos2=OFF \ - -D Trilinos_ENABLE_Ifpack=OFF \ - -D Trilinos_ENABLE_Ifpack2=OFF \ - -D Trilinos_ENABLE_Epetra=OFF \ - -D Trilinos_ENABLE_EpetraExt=OFF \ - -D Trilinos_ENABLE_Zoltan=OFF \ - -D Trilinos_ENABLE_Zoltan2=OFF \ - -D Trilinos_ENABLE_MueLu=OFF \ - -D Belos_ENABLE_TESTS=ON \ - -D Belos_ENABLE_EXAMPLES=ON \ - -D MueLu_ENABLE_TESTS=ON \ - -D MueLu_ENABLE_EXAMPLES=ON \ - -D Ifpack2_ENABLE_TESTS=ON \ - -D Ifpack2_ENABLE_EXAMPLES=ON \ - $EXTRA_ARGS \ -${HOME}/Trilinos - diff --git a/lib/kokkos/config/kokkos_dev/config-core-all.sh b/lib/kokkos/config/kokkos_dev/config-core-all.sh deleted file mode 100755 index fa588c778f..0000000000 --- a/lib/kokkos/config/kokkos_dev/config-core-all.sh +++ /dev/null @@ -1,113 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -#----------------------------------------------------------------------------- -# Building on 'kokkos-dev.sandia.gov' with enabled capabilities: -# -# Cuda, OpenMP, Threads, Qthread, hwloc -# -# module loaded on 'kokkos-dev.sandia.gov' for this build -# -# module load cmake/2.8.11.2 gcc/4.8.3 cuda/6.5.14 nvcc-wrapper/gnu -# -# The 'nvcc-wrapper' module should load a script that matches -# kokkos/config/nvcc_wrapper -# -#----------------------------------------------------------------------------- -# Source and installation directories: - -TRILINOS_SOURCE_DIR=${HOME}/Trilinos -TRILINOS_INSTALL_DIR=${HOME}/TrilinosInstall/`date +%F` - -CMAKE_CONFIGURE="" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=${TRILINOS_INSTALL_DIR}" - -#----------------------------------------------------------------------------- -# Debug/optimized - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=DEBUG" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_BOUNDS_CHECK:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=RELEASE" - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-Wall" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=gcc" - -#----------------------------------------------------------------------------- -# Cuda using GNU, use the nvcc_wrapper to build CUDA source - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=g++" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=nvcc_wrapper" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUDA:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUSPARSE:BOOL=ON" - -#----------------------------------------------------------------------------- -# Configure for Kokkos subpackages and tests: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosAlgorithms:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -# Hardware locality configuration: - -HWLOC_BASE_DIR="/home/projects/hwloc/1.7.1/host/gnu/4.7.3" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_HWLOC:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_INCLUDE_DIRS:FILEPATH=${HWLOC_BASE_DIR}/include" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_LIBRARY_DIRS:FILEPATH=${HWLOC_BASE_DIR}/lib" - -#----------------------------------------------------------------------------- -# Pthread - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=ON" - -#----------------------------------------------------------------------------- -# OpenMP - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_OpenMP:BOOL=ON" - -#----------------------------------------------------------------------------- -# Qthread - -QTHREAD_BASE_DIR="/home/projects/qthreads/2014-07-08/host/gnu/4.7.3" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_QTHREAD:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D QTHREAD_INCLUDE_DIRS:FILEPATH=${QTHREAD_BASE_DIR}/include" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D QTHREAD_LIBRARY_DIRS:FILEPATH=${QTHREAD_BASE_DIR}/lib" - -#----------------------------------------------------------------------------- -# C++11 - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CXX11:BOOL=ON" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_CXX11:BOOL=ON" - -#----------------------------------------------------------------------------- -# -# Remove CMake output files to force reconfigure from scratch. -# - -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -# - -echo cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/kokkos_dev/config-core-cuda-omp-hwloc.sh b/lib/kokkos/config/kokkos_dev/config-core-cuda-omp-hwloc.sh deleted file mode 100755 index c2e17bb944..0000000000 --- a/lib/kokkos/config/kokkos_dev/config-core-cuda-omp-hwloc.sh +++ /dev/null @@ -1,104 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -#----------------------------------------------------------------------------- -# Building on 'kokkos-dev.sandia.gov' with enabled capabilities: -# -# Cuda, OpenMP, hwloc -# -# module loaded on 'kokkos-dev.sandia.gov' for this build -# -# module load cmake/2.8.11.2 gcc/4.8.3 cuda/6.5.14 nvcc-wrapper/gnu -# -# The 'nvcc-wrapper' module should load a script that matches -# kokkos/config/nvcc_wrapper -# -#----------------------------------------------------------------------------- -# Source and installation directories: - -TRILINOS_SOURCE_DIR=${HOME}/Trilinos -TRILINOS_INSTALL_DIR=${HOME}/TrilinosInstall/`date +%F` - -CMAKE_CONFIGURE="" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=${TRILINOS_INSTALL_DIR}" - -#----------------------------------------------------------------------------- -# Debug/optimized - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=DEBUG" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_BOUNDS_CHECK:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=RELEASE" - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-Wall" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=gcc" - -#----------------------------------------------------------------------------- -# Cuda using GNU, use the nvcc_wrapper to build CUDA source - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=g++" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=nvcc_wrapper" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUDA:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUSPARSE:BOOL=ON" - -#----------------------------------------------------------------------------- -# Configure for Kokkos subpackages and tests: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosAlgorithms:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -# Hardware locality configuration: - -HWLOC_BASE_DIR="/home/projects/hwloc/1.7.1/host/gnu/4.7.3" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_HWLOC:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_INCLUDE_DIRS:FILEPATH=${HWLOC_BASE_DIR}/include" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_LIBRARY_DIRS:FILEPATH=${HWLOC_BASE_DIR}/lib" - -#----------------------------------------------------------------------------- -# Pthread explicitly OFF so tribits doesn't automatically turn it on - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- -# OpenMP - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_OpenMP:BOOL=ON" - -#----------------------------------------------------------------------------- -# C++11 - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CXX11:BOOL=ON" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_CXX11:BOOL=ON" - -#----------------------------------------------------------------------------- -# -# Remove CMake output files to force reconfigure from scratch. -# - -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -# - -echo cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/kokkos_dev/config-core-cuda.sh b/lib/kokkos/config/kokkos_dev/config-core-cuda.sh deleted file mode 100755 index 39b72d5ce1..0000000000 --- a/lib/kokkos/config/kokkos_dev/config-core-cuda.sh +++ /dev/null @@ -1,88 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -#----------------------------------------------------------------------------- -# Building on 'kokkos-dev.sandia.gov' with enabled capabilities: -# -# Cuda -# -# module loaded on 'kokkos-dev.sandia.gov' for this build -# -# module load cmake/2.8.11.2 gcc/4.8.3 cuda/6.5.14 nvcc-wrapper/gnu -# -# The 'nvcc-wrapper' module should load a script that matches -# kokkos/config/nvcc_wrapper -# -#----------------------------------------------------------------------------- -# Source and installation directories: - -TRILINOS_SOURCE_DIR=${HOME}/Trilinos -TRILINOS_INSTALL_DIR=${HOME}/TrilinosInstall/`date +%F` - -CMAKE_CONFIGURE="" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=${TRILINOS_INSTALL_DIR}" - -#----------------------------------------------------------------------------- -# Debug/optimized - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=DEBUG" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_BOUNDS_CHECK:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=RELEASE" - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-Wall" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=gcc" - -#----------------------------------------------------------------------------- -# Cuda using GNU, use the nvcc_wrapper to build CUDA source - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=g++" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=nvcc_wrapper" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUDA:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUSPARSE:BOOL=ON" - -# Pthread explicitly OFF, otherwise tribits will automatically turn it on - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- -# Configure for Kokkos subpackages and tests: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosAlgorithms:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -# C++11 - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CXX11:BOOL=ON" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_CXX11:BOOL=ON" - -#----------------------------------------------------------------------------- -# -# Remove CMake output files to force reconfigure from scratch. -# - -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -# - -echo cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/kokkos_dev/config-core-cxx11-omp.sh b/lib/kokkos/config/kokkos_dev/config-core-cxx11-omp.sh deleted file mode 100755 index b83a535416..0000000000 --- a/lib/kokkos/config/kokkos_dev/config-core-cxx11-omp.sh +++ /dev/null @@ -1,84 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -#----------------------------------------------------------------------------- -# Building on 'kokkos-dev.sandia.gov' with enabled capabilities: -# -# C++11, OpenMP -# -# module loaded on 'kokkos-dev.sandia.gov' for this build -# -# module load cmake/2.8.11.2 gcc/4.8.3 -# -#----------------------------------------------------------------------------- -# Source and installation directories: - -TRILINOS_SOURCE_DIR=${HOME}/Trilinos -TRILINOS_INSTALL_DIR=${HOME}/TrilinosInstall/`date +%F` - -CMAKE_CONFIGURE="" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=${TRILINOS_INSTALL_DIR}" - -#----------------------------------------------------------------------------- -# Debug/optimized - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=DEBUG" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_BOUNDS_CHECK:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=RELEASE" - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-Wall" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=gcc" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=g++" - -#----------------------------------------------------------------------------- -# Configure for Kokkos subpackages and tests: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosAlgorithms:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -# Pthread explicitly OFF so tribits doesn't automatically activate - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- -# OpenMP - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_OpenMP:BOOL=ON" - -#----------------------------------------------------------------------------- -# C++11 - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CXX11:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_CXX11:BOOL=ON" - -#----------------------------------------------------------------------------- -# -# Remove CMake output files to force reconfigure from scratch. -# - -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -# - -echo cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/kokkos_dev/config-core-dbg-none.sh b/lib/kokkos/config/kokkos_dev/config-core-dbg-none.sh deleted file mode 100755 index d2e06a4ebd..0000000000 --- a/lib/kokkos/config/kokkos_dev/config-core-dbg-none.sh +++ /dev/null @@ -1,78 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -#----------------------------------------------------------------------------- -# Building on 'kokkos-dev.sandia.gov' with enabled capabilities: -# -# -# -# module loaded on 'kokkos-dev.sandia.gov' for this build -# -# module load cmake/2.8.11.2 gcc/4.8.3 -# -#----------------------------------------------------------------------------- -# Source and installation directories: - -TRILINOS_SOURCE_DIR=${HOME}/Trilinos -TRILINOS_INSTALL_DIR=${HOME}/TrilinosInstall/`date +%F` - -CMAKE_CONFIGURE="" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=${TRILINOS_INSTALL_DIR}" - -#----------------------------------------------------------------------------- -# Debug/optimized - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=DEBUG" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_BOUNDS_CHECK:BOOL=ON" - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=RELEASE" - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-Wall" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=gcc" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=g++" - -#----------------------------------------------------------------------------- -# Configure for Kokkos subpackages and tests: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosAlgorithms:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -# Kokkos Pthread explicitly OFF, TPL Pthread ON for gtest - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- -# C++11 - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CXX11:BOOL=ON" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_CXX11:BOOL=ON" - -#----------------------------------------------------------------------------- -# -# Remove CMake output files to force reconfigure from scratch. -# - -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -# - -echo cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/kokkos_dev/config-core-intel-cuda-omp.sh b/lib/kokkos/config/kokkos_dev/config-core-intel-cuda-omp.sh deleted file mode 100755 index e2ab1f1c00..0000000000 --- a/lib/kokkos/config/kokkos_dev/config-core-intel-cuda-omp.sh +++ /dev/null @@ -1,89 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -#----------------------------------------------------------------------------- -# Building on 'kokkos-dev.sandia.gov' with enabled capabilities: -# -# Intel, OpenMP, Cuda -# -# module loaded on 'kokkos-dev.sandia.gov' for this build -# -# module load cmake/2.8.11.2 cuda/7.0.4 intel/2015.0.090 nvcc-wrapper/intel -# -#----------------------------------------------------------------------------- -# Source and installation directories: - -TRILINOS_SOURCE_DIR=${HOME}/Trilinos -TRILINOS_INSTALL_DIR=${HOME}/TrilinosInstall/`date +%F` - -CMAKE_CONFIGURE="" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=${TRILINOS_INSTALL_DIR}" - -#----------------------------------------------------------------------------- -# Debug/optimized - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=DEBUG" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_BOUNDS_CHECK:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=RELEASE" - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-Wall" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=icc" - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=icpc" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=nvcc_wrapper" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUDA:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_CUSPARSE:BOOL=ON" - -#----------------------------------------------------------------------------- -# Configure for Kokkos subpackages and tests: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosAlgorithms:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -# Pthread explicitly OFF - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- -# OpenMP - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_OpenMP:BOOL=ON" - -#----------------------------------------------------------------------------- -# C++11 - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CXX11:BOOL=ON" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_CXX11:BOOL=ON" - -#----------------------------------------------------------------------------- -# -# Remove CMake output files to force reconfigure from scratch. -# - -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -# - -echo cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/kokkos_dev/config-core-intel-omp.sh b/lib/kokkos/config/kokkos_dev/config-core-intel-omp.sh deleted file mode 100755 index fd56d41161..0000000000 --- a/lib/kokkos/config/kokkos_dev/config-core-intel-omp.sh +++ /dev/null @@ -1,84 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -#----------------------------------------------------------------------------- -# Building on 'kokkos-dev.sandia.gov' with enabled capabilities: -# -# Intel, OpenMP -# -# module loaded on 'kokkos-dev.sandia.gov' for this build -# -# module load cmake/2.8.11.2 intel/13.SP1.1.106 -# -#----------------------------------------------------------------------------- -# Source and installation directories: - -TRILINOS_SOURCE_DIR=${HOME}/Trilinos -TRILINOS_INSTALL_DIR=${HOME}/TrilinosInstall/`date +%F` - -CMAKE_CONFIGURE="" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=${TRILINOS_INSTALL_DIR}" - -#----------------------------------------------------------------------------- -# Debug/optimized - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=DEBUG" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_BOUNDS_CHECK:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=RELEASE" - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-Wall" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=icc" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=icpc" - -#----------------------------------------------------------------------------- -# Configure for Kokkos subpackages and tests: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosAlgorithms:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -# Pthread explicitly OFF - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- -# OpenMP - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_OpenMP:BOOL=ON" - -#----------------------------------------------------------------------------- -# C++11 - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CXX11:BOOL=ON" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_CXX11:BOOL=ON" - -#----------------------------------------------------------------------------- -# -# Remove CMake output files to force reconfigure from scratch. -# - -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -# - -echo cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/kokkos_dev/config-core-omp.sh b/lib/kokkos/config/kokkos_dev/config-core-omp.sh deleted file mode 100755 index f91ecd5254..0000000000 --- a/lib/kokkos/config/kokkos_dev/config-core-omp.sh +++ /dev/null @@ -1,77 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -#----------------------------------------------------------------------------- -# Building on 'kokkos-dev.sandia.gov' with enabled capabilities: -# -# OpenMP -# -# module loaded on 'kokkos-dev.sandia.gov' for this build -# -# module load cmake/2.8.11.2 gcc/4.8.3 -# -#----------------------------------------------------------------------------- -# Source and installation directories: - -TRILINOS_SOURCE_DIR=${HOME}/Trilinos -TRILINOS_INSTALL_DIR=${HOME}/TrilinosInstall/`date +%F` - -CMAKE_CONFIGURE="" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=${TRILINOS_INSTALL_DIR}" - -#----------------------------------------------------------------------------- -# Debug/optimized - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=DEBUG" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_BOUNDS_CHECK:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=RELEASE" - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-Wall" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=gcc" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=g++" - -#----------------------------------------------------------------------------- -# Configure for Kokkos subpackages and tests: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosAlgorithms:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -# OpenMP - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_OpenMP:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_OpenMP:BOOL=ON" - -# Pthread explicitly OFF, otherwise tribits will automatically turn it on - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=OFF" - -#----------------------------------------------------------------------------- -# -# Remove CMake output files to force reconfigure from scratch. -# - -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -# - -echo cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/kokkos_dev/config-core-threads-hwloc.sh b/lib/kokkos/config/kokkos_dev/config-core-threads-hwloc.sh deleted file mode 100755 index 19ab969023..0000000000 --- a/lib/kokkos/config/kokkos_dev/config-core-threads-hwloc.sh +++ /dev/null @@ -1,87 +0,0 @@ -#!/bin/sh -# -# Copy this script, put it outside the Trilinos source directory, and -# build there. -# -#----------------------------------------------------------------------------- -# Building on 'kokkos-dev.sandia.gov' with enabled capabilities: -# -# Threads, hwloc -# -# module loaded on 'kokkos-dev.sandia.gov' for this build -# -# module load cmake/2.8.11.2 gcc/4.8.3 -# -#----------------------------------------------------------------------------- -# Source and installation directories: - -TRILINOS_SOURCE_DIR=${HOME}/Trilinos -TRILINOS_INSTALL_DIR=${HOME}/TrilinosInstall/`date +%F` - -CMAKE_CONFIGURE="" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_INSTALL_PREFIX=${TRILINOS_INSTALL_DIR}" - -#----------------------------------------------------------------------------- -# Debug/optimized - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=DEBUG" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_BOUNDS_CHECK:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_BUILD_TYPE:STRING=RELEASE" - -#----------------------------------------------------------------------------- - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_FLAGS:STRING=-Wall" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_C_COMPILER=gcc" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D CMAKE_CXX_COMPILER=g++" - -#----------------------------------------------------------------------------- -# Configure for Kokkos subpackages and tests: - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_Fortran:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_ALL_PACKAGES:BOOL=OFF" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_EXAMPLES:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TESTS:BOOL=ON" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosCore:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosContainers:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosAlgorithms:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_TpetraKernels:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_KokkosExample:BOOL=ON" - -#----------------------------------------------------------------------------- -# Hardware locality configuration: - -HWLOC_BASE_DIR="/home/projects/hwloc/1.7.1/host/gnu/4.7.3" - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_HWLOC:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_INCLUDE_DIRS:FILEPATH=${HWLOC_BASE_DIR}/include" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D HWLOC_LIBRARY_DIRS:FILEPATH=${HWLOC_BASE_DIR}/lib" - -#----------------------------------------------------------------------------- -# Pthread - -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D TPL_ENABLE_Pthread:BOOL=ON" -CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_Pthread:BOOL=ON" - -#----------------------------------------------------------------------------- -# C++11 - -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Trilinos_ENABLE_CXX11:BOOL=ON" -# CMAKE_CONFIGURE="${CMAKE_CONFIGURE} -D Kokkos_ENABLE_CXX11:BOOL=ON" - -#----------------------------------------------------------------------------- -# -# Remove CMake output files to force reconfigure from scratch. -# - -rm -rf CMake* Trilinos* packages Dart* Testing cmake_install.cmake MakeFile* - -# - -echo cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -cmake ${CMAKE_CONFIGURE} ${TRILINOS_SOURCE_DIR} - -#----------------------------------------------------------------------------- - diff --git a/lib/kokkos/config/nvcc_wrapper b/lib/kokkos/config/nvcc_wrapper deleted file mode 100755 index 63e0ef50a7..0000000000 --- a/lib/kokkos/config/nvcc_wrapper +++ /dev/null @@ -1,185 +0,0 @@ -#!/bin/bash -# -# This shell script (nvcc_wrapper) wraps both the host compiler and -# NVCC, if you are building Trilinos with CUDA enabled. The script -# remedies some differences between the interface of NVCC and that of -# the host compiler, in particular for linking. It also means that -# Trilinos doesn't need separate .cu files; it can just use .cpp -# files. -# -# Hopefully, at some point, NVIDIA may fix NVCC so as to make this -# script obsolete. For now, this script exists and if you want to -# build Trilinos with CUDA enabled, you must use this script as your -# compiler. - -# Default settings: change those according to your machine. For -# example, you may have have two different wrappers with either icpc -# or g++ as their back-end compiler. The defaults can be overwritten -# by using the usual arguments (e.g., -arch=sm_30 -ccbin icpc). - -default_arch="sm_35" -#default_arch="sm_50" - -# -# The default C++ compiler. -# -default_compiler=${NVCC_WRAPPER_DEFAULT_COMPILER:-"g++"} -#default_compiler="icpc" -#default_compiler="/usr/local/gcc/4.8.3/bin/g++" -#default_compiler="/usr/local/gcc/4.9.1/bin/g++" - -# -# Internal variables -# -cpp_files="" -xcompiler_args="" -cuda_arg="" -xlinker_args="" -object_files="" -object_files_xlinker="" -first_host_option=1 -arch_set=0 -ccbin_set=0 -nvcc_error_code=0 -dry_run=0 -replace_pragma_ident=0 - -#echo "Arguments: $# $@" - -while [ $# -gt 0 ] -do - case $1 in - #show the executed command - --show) - dry_run=1 - ;; - #replace '#pragma ident' with '#ident' this is needed to compile OpenMPI due to a configure script bug and a non standardized behaviour of pragma with macros - --replace-pragma-ident) - replace_pragma_ident=1 - ;; - #handle source files to be compiled as cuda files - *.cpp|*.cxx|*.cc|*.C|*.c++|*.cu) - cpp_files="$cpp_files $1" - ;; - #Handle known nvcc args - -O*|-D*|-gencode*|-c|-I*|-L*|-l*|-g|--help|--version|--dryrun|--verbose|--keep-dir|-E|-M|-G|--relocatable-device-code*|-shared|-lineinfo|-expt-extended-lambda|--resource-usage) - cuda_args="$cuda_args $1" - ;; - #Handle c++11 setting - --std=c++11|-std=c++11) - cuda_args="$cuda_args $1" - ;; - #strip of -std=c++98 due to nvcc warnings and Tribits will place both -std=c++11 and -std=c++98 - -std=c++98|--std=c++98) - ;; - #Handle known nvcc args that have an argument - -o|-rdc|-maxrregcount|--default-stream) - cuda_args="$cuda_args $1 $2" - shift - ;; - #strip of pedantic because it produces endless warnings about #LINE added by the preprocessor - -pedantic|-Wpedantic|-ansi) - ;; - #strip -Xcompiler because we add it - -Xcompiler) - ;; - #strip of "-x cu" because we add that - -x) - if [[ $2 != "cu" ]]; then - xcompiler_args="$xcompiler_args,-x,$2" - fi - shift - ;; - #Handle -ccbin (if its not set we can set it to a default value) - -ccbin) - cuda_args="$cuda_args $1 $2" - ccbin_set=1 - shift - ;; - #Handle -arch argument (if its not set use a default - -arch*) - cuda_args="$cuda_args $1" - arch_set=1 - ;; - #Handle -Xcudafe argument - -Xcudafe) - cuda_args="$cuda_args -Xcudafe $2" - shift - ;; - #Handle args that should be sent to the linker - -Wl*) - xlinker_args="$xlinker_args -Xlinker ${1:4:${#1}}" - ;; - #Handle object files: -x cu applies to all input files, so give them to linker, except if only linking - *.a|*.so|*.o|*.obj) - object_files="$object_files $1" - object_files_xlinker="$object_files_xlinker -Xlinker $1" - ;; - #Handle object files: -x cu applies to all input files, so give them to linker, except if only linking - *.so.*|*.dylib) - object_files_xlinker="$object_files_xlinker -Xlinker $1" - object_files="$object_files -Xlinker $1" - ;; - #All other args are sent to the host compiler - *) - if [ $first_host_option -eq 0 ]; then - xcompiler_args="$xcompiler_args,$1" - else - xcompiler_args="-Xcompiler $1" - first_host_option=0 - fi - ;; - esac - - shift -done - -#Add default host compiler if necessary -if [ $ccbin_set -ne 1 ]; then - cuda_args="$cuda_args -ccbin $default_compiler" -fi - -#Add architecture command -if [ $arch_set -ne 1 ]; then - cuda_args="$cuda_args -arch=$default_arch" -fi - -#Compose compilation command -command="nvcc $cuda_args $xlinker_args $xcompiler_args" - -#nvcc does not accept '#pragma ident SOME_MACRO_STRING' but it does accept '#ident SOME_MACRO_STRING' -if [ $replace_pragma_ident -eq 1 ]; then - cpp_files2="" - for file in $cpp_files - do - var=`grep pragma ${file} | grep ident | grep "#"` - if [ "${#var}" -gt 0 ] - then - sed 's/#[\ \t]*pragma[\ \t]*ident/#ident/g' $file > /tmp/nvcc_wrapper_tmp_$file - cpp_files2="$cpp_files2 /tmp/nvcc_wrapper_tmp_$file" - else - cpp_files2="$cpp_files2 $file" - fi - done - cpp_files=$cpp_files2 - echo $cpp_files -fi - -if [ "$cpp_files" ]; then - command="$command $object_files_xlinker -x cu $cpp_files" -else - command="$command $object_files" -fi - -#Print command for dryrun -if [ $dry_run -eq 1 ]; then - echo $command - exit 0 -fi - -#Run compilation command -$command -nvcc_error_code=$? - -#Report error code -exit $nvcc_error_code diff --git a/lib/kokkos/config/snapshot.py b/lib/kokkos/config/snapshot.py deleted file mode 100755 index d816cd0c9c..0000000000 --- a/lib/kokkos/config/snapshot.py +++ /dev/null @@ -1,279 +0,0 @@ -#! /usr/bin/env python - -""" -Snapshot a project into another project and perform the necessary repo actions -to provide a commit message that can be used to trace back to the exact point -in the source repository. -""" - -#todo: -# Support svn -# Allow renaming of the source dir in the destination path -# Check if a new snapshot is necessary? -# - -import sys - -#check the version number so that there is a good error message when argparse is not available. -#This checks for exactly 2.7 which is bad, but it is a python 2 script and argparse was introduced -#in 2.7 which is also the last version of python 2. If this script is updated for python 3 this -#will need to change, but for now it is not safe to allow 3.x to run this. -if sys.version_info[:2] != (2, 7): - print "Error snapshot requires python 2.7 detected version is %d.%d." % (sys.version_info[0], sys.version_info[1]) - sys.exit(1) - -import subprocess, argparse, re, doctest, os, datetime, traceback - -def parse_cmdline(description): - parser = argparse.ArgumentParser(usage="snapshot.py [options] source destination", description=description) - - parser.add_argument("-n", "--no-comit", action="store_false", dest="create_commit", default=True, - help="Do not perform a commit or create a commit message.") - parser.add_argument("-v", "--verbose", action="store_true", dest="verbose_mode", default=False, - help="Enable verbose mode.") - parser.add_argument("-d", "--debug", action="store_true", dest="debug_mode", default=False, - help="Enable debugging output.") - parser.add_argument("--no-validate-repo", action="store_true", dest="no_validate_repo", default=False, - help="Reduce the validation that the source and destination repos are clean to a warning.") - parser.add_argument("--source-repo", choices=["git","none"], default="", - help="Type of repository of the source, use none to skip all repository operations.") - parser.add_argument("--dest-repo", choices=["git","none"], default="", - help="Type of repository of the destination, use none to skip all repository operations.") - - parser.add_argument("source", help="Source project to snapshot from.") - parser.add_argument("destination", help="Destination to snapshot too.") - - options = parser.parse_args() - options = validate_options(options) - return options -#end parseCmdline - -def validate_options(options): - apparent_source_repo_type="none" - apparent_dest_repo_type="none" - - #prevent user from accidentally giving us a path that rsync will treat differently than expected. - options.source = options.source.rstrip(os.sep) - options.destination = options.destination.rstrip(os.sep) - - options.source = os.path.abspath(options.source) - options.destination = os.path.abspath(options.destination) - - if os.path.exists(options.source): - apparent_source_repo_type, source_root = deterimine_repo_type(options.source) - else: - raise RuntimeError("Could not find source directory of %s." % options.source) - options.source_root = source_root - - if not os.path.exists(options.destination): - print "Could not find destination directory of %s so it will be created." % options.destination - os.makedirs(options.destination) - - apparent_dest_repo_type, dest_root = deterimine_repo_type(options.destination) - options.dest_root = dest_root - - #error on svn repo types for now - if apparent_source_repo_type == "svn" or apparent_dest_repo_type == "svn": - raise RuntimeError("SVN repositories are not supported at this time.") - - if options.source_repo == "": - #source repo type is not specified to just using the apparent type. - options.source_repo = apparent_source_repo_type - else: - if options.source_repo != "none" and options.source_repo != apparent_source_repo_type: - raise RuntimeError("Specified source repository type of %s conflicts with determined type of %s" % \ - (options.source_repo, apparent_source_repo_type)) - - if options.dest_repo == "": - #destination repo type is not specified to just using the apparent type. - options.dest_repo = apparent_dest_repo_type - else: - if options.dest_repo != "none" and options.dest_repo != apparent_dest_repo_type: - raise RuntimeError("Specified destination repository type of %s conflicts with determined type of %s" % \ - (options.dest_repo, apparent_dest_repo_type)) - - return options -#end validate_options - -def run_cmd(cmd, options, working_dir="."): - cmd_str = " ".join(cmd) - if options.verbose_mode: - print "Running command '%s' in dir %s." % (cmd_str, working_dir) - - proc = subprocess.Popen(cmd, stdout=subprocess.PIPE, stderr=subprocess.PIPE, cwd=working_dir) - proc_stdout, proc_stderr = proc.communicate() - ret_val = proc.wait() - - if options.debug_mode: - print "==== %s stdout start ====" % cmd_str - print proc_stdout - print "==== %s stdout end ====" % cmd_str - print "==== %s stderr ====" % cmd_str - print proc_stderr - print "==== %s stderr ====" % cmd_str - - if ret_val != 0: - raise RuntimeError("Command '%s' failed with error code %d. Error message:%s%s%sstdout:%s" % \ - (cmd_str, ret_val, os.linesep, proc_stderr, os.linesep, proc_stdout)) - - return proc_stdout, proc_stderr -#end run_cmd - -def deterimine_repo_type(location): - apparent_repo_type = "none" - - while location != "": - if os.path.exists(os.path.join(location, ".git")): - apparent_repo_type = "git" - break - elif os.path.exists(os.path.join(location, ".svn")): - apparent_repo_type = "svn" - break - else: - location = location[:location.rfind(os.sep)] - - return apparent_repo_type, location - -#end deterimine_repo_type - -def rsync(source, dest, options): - rsync_cmd = ["rsync", "-ar", "--delete"] - if options.debug_mode: - rsync_cmd.append("-v") - - if options.source_repo == "git": - rsync_cmd.append("--exclude=.git") - - rsync_cmd.append(options.source) - rsync_cmd.append(options.destination) - run_cmd(rsync_cmd, options) -#end rsync - -def create_commit_message(commit_id, commit_log, project_name, project_location): - eol = os.linesep - message = "Snapshot of %s from commit %s" % (project_name, commit_id) - message += eol * 2 - message += "From repository at %s" % project_location - message += eol * 2 - message += "At commit:" + eol - message += commit_log - return message -#end create_commit_message - -def find_git_commit_information(options): - r""" - >>> class fake_options: - ... source="." - ... verbose_mode=False - ... debug_mode=False - >>> myoptions = fake_options() - >>> find_git_commit_information(myoptions)[2:] - ('sems', 'software.sandia.gov:/git/sems') - """ - git_log_cmd = ["git", "log", "-1"] - - output, error = run_cmd(git_log_cmd, options, options.source) - - commit_match = re.match("commit ([0-9a-fA-F]+)", output) - commit_id = commit_match.group(1) - commit_log = output - - git_remote_cmd = ["git", "remote", "-v"] - output, error = run_cmd(git_remote_cmd, options, options.source) - - remote_match = re.search("origin\s([^ ]*/([^ ]+))", output, re.MULTILINE) - if not remote_match: - raise RuntimeError("Could not find origin of repo at %s. Consider using none for source repo type." % (options.source)) - - source_location = remote_match.group(1) - source_name = remote_match.group(2).strip() - - if source_name[-1] == "/": - source_name = source_name[:-1] - - return commit_id, commit_log, source_name, source_location - -#end find_git_commit_information - -def do_git_commit(message, options): - if options.verbose_mode: - print "Commiting to destination repository." - - git_add_cmd = ["git", "add", "-A"] - run_cmd(git_add_cmd, options, options.destination) - - git_commit_cmd = ["git", "commit", "-m%s" % message] - run_cmd(git_commit_cmd, options, options.destination) - - git_log_cmd = ["git", "log", "--format=%h", "-1"] - commit_sha1, error = run_cmd(git_log_cmd, options, options.destination) - - print "Commit %s was made to %s." % (commit_sha1.strip(), options.dest_root) -#end do_git_commit - -def verify_git_repo_clean(location, options): - git_status_cmd = ["git", "status", "--porcelain"] - output, error = run_cmd(git_status_cmd, options, location) - - if output != "": - if options.no_validate_repo == False: - raise RuntimeError("%s is not clean.%sPlease commit or stash all changes before running snapshot." - % (location, os.linesep)) - else: - print "WARNING: %s is not clean. Proceeding anyway." % location - print "WARNING: This could lead to differences in the source and destination." - print "WARNING: It could also lead to extra files being included in the snapshot commit." - -#end verify_git_repo_clean - -def main(options): - if options.verbose_mode: - print "Snapshotting %s to %s." % (options.source, options.destination) - - if options.source_repo == "git": - verify_git_repo_clean(options.source, options) - commit_id, commit_log, repo_name, repo_location = find_git_commit_information(options) - elif options.source_repo == "none": - commit_id = "N/A" - commit_log = "Unknown commit from %s snapshotted at: %s" % (options.source, datetime.datetime.now()) - repo_name = options.source - repo_location = options.source - - commit_message = create_commit_message(commit_id, commit_log, repo_name, repo_location) + os.linesep*2 - - if options.dest_repo == "git": - verify_git_repo_clean(options.destination, options) - - rsync(options.source, options.destination, options) - - if options.dest_repo == "git": - do_git_commit(commit_message, options) - elif options.dest_repo == "none": - file_name = "snapshot_message.txt" - message_file = open(file_name, "w") - message_file.write(commit_message) - message_file.close() - cwd = os.getcwd() - print "No commit done by request. Please use file at:" - print "%s%sif you wish to commit this to a repo later." % (cwd+"/"+file_name, os.linesep) - - - - -#end main - -if (__name__ == "__main__"): - if ("--test" in sys.argv): - doctest.testmod() - sys.exit(0) - - try: - options = parse_cmdline(__doc__) - main(options) - except RuntimeError, e: - print "Error occured:", e - if "--debug" in sys.argv: - traceback.print_exc() - sys.exit(1) - else: - sys.exit(0) diff --git a/lib/kokkos/config/test_all_sandia b/lib/kokkos/config/test_all_sandia deleted file mode 100755 index 7d52039bea..0000000000 --- a/lib/kokkos/config/test_all_sandia +++ /dev/null @@ -1,305 +0,0 @@ -#!/bin/bash -e - -# -# Global config -# - -set -o pipefail - -COMPILER_ROOT="/home/projects/x86-64" - -GCC_BUILD_LIST="OpenMP,Pthread,Serial,OpenMP_Serial,Pthread_Serial" -INTEL_BUILD_LIST="OpenMP,Pthread,Serial,OpenMP_Serial,Pthread_Serial" -CLANG_BUILD_LIST="Pthread,Serial,Pthread_Serial" -CUDA_BUILD_LIST="Cuda_OpenMP,Cuda_Pthread,Cuda_Serial" - -GCC_WARNING_FLAGS="-Wall,-Wshadow,-pedantic,-Werror,-Wsign-compare,-Wtype-limits,-Wignored-qualifiers,-Wempty-body,-Wclobbered,-Wuninitialized" -CLANG_WARNING_FLAGS="-Wall,-Wshadow,-pedantic,-Werror,-Wsign-compare,-Wtype-limits,-Wuninitialized" -INTEL_WARNING_FLAGS="-Wall,-Wshadow,-pedantic,-Werror,-Wsign-compare,-Wtype-limits,-Wuninitialized" -CUDA_WARNING_FLAGS="" - -# Format: (compiler module-list build-list exe-name warning-flag) -COMPILERS=("gcc/4.7.2 gcc/4.7.2/base,hwloc/1.10.0/host/gnu/4.7.2 $GCC_BUILD_LIST g++ $GCC_WARNING_FLAGS" - "gcc/4.8.4 gcc/4.9.2/base,hwloc/1.10.0/host/gnu/4.9.2 $GCC_BUILD_LIST g++ $GCC_WARNING_FLAGS" - "gcc/4.9.2 gcc/4.9.2/base,hwloc/1.10.0/host/gnu/4.9.2 $GCC_BUILD_LIST g++ $GCC_WARNING_FLAGS" - "gcc/5.1.0 gcc/5.1.0/base,hwloc/1.10.0/host/gnu/5.1.0 $GCC_BUILD_LIST g++ $GCC_WARNING_FLAGS" - "intel/14.0.4 intel/14.0.4/base,hwloc/1.10.0/host/gnu/4.7.2 $INTEL_BUILD_LIST icpc $INTEL_WARNING_FLAGS" - "intel/15.0.2 intel/15.0.2/base,hwloc/1.10.0/host/gnu/4.7.2 $INTEL_BUILD_LIST icpc $INTEL_WARNING_FLAGS" - "clang/3.5.2 clang/3.5.2/base $CLANG_BUILD_LIST clang++ $CLANG_WARNING_FLAGS" - "clang/3.6.1 clang/3.6.1/base $CLANG_BUILD_LIST clang++ $CLANG_WARNING_FLAGS" - "cuda/6.5.14 cuda/6.5.14,nvcc-wrapper/gnu,gcc/4.7.2/base $CUDA_BUILD_LIST nvcc_wrapper $CUDA_WARNING_FLAGS" - "cuda/7.0.28 cuda/7.0.18,nvcc-wrapper/gnu,gcc/4.7.2/base $CUDA_BUILD_LIST nvcc_wrapper $CUDA_WARNING_FLAGS" - ) - -export OMP_NUM_THREADS=4 - -export SEMS_MODULE_ROOT=/projects/modulefiles -module use /home/projects/modulefiles -module use /projects/modulefiles/rhel6-x86_64/sems/compiler - -SCRIPT_KOKKOS_ROOT=$( cd "$( dirname "$0" )" && cd .. && pwd ) - -# -# Handle arguments -# - -DEBUG=False -ARGS="" -CUSTOM_BUILD_LIST="" -DRYRUN=False - -while [[ $# > 0 ]] -do -key="$1" -case $key in ---kokkos-path*) -KOKKOS_PATH="${key#*=}" -;; ---build-list*) -CUSTOM_BUILD_LIST="${key#*=}" -;; ---debug*) -DEBUG=True -;; ---dry-run*) -DRYRUN=True -;; ---help) -echo "test_all_sandia :" -echo "--kokkos-path=/Path/To/Kokkos: Path to the Kokkos root directory" -echo " Defaults to root repo containing this script" -echo "--debug: Run tests in debug. Defaults to False" -echo "--dry-run: Just print what would be executed" -echo "--build-list=BUILD,BUILD,BUILD..." -echo " Provide a comma-separated list of builds instead of running all builds" -echo " Valid items:" -echo " OpenMP, Pthread, Serial, OpenMP_Serial, Pthread_Serial" -echo " Cuda_OpenMP, Cuda_Pthread, Cuda_Serial" -echo "" -echo "ARGS: list of expressions matching compilers to test" -echo "" -echo "Examples:" -echo " Run all tests" -echo " % test_all_sandia" -echo "" -echo " Run all gcc tests" -echo " % test_all_sandia gcc" -echo "" -echo " Run all gcc/4.7.2 and all intel tests" -echo " % test_all_sandia gcc/4.7.2 intel" -echo "" -echo " Run all tests in debug" -echo " % test_all_sandia --debug" -echo "" -echo " Run gcc/4.7.2 and only do OpenMP and OpenMP_Serial builds" -echo " % test_all_sandia gcc/4.7.2 --build-list=OpenMP,OpenMP_Serial" -echo -exit 0 -;; -*) -# args, just append -ARGS="$ARGS $1" -;; -esac -shift -done - - -# set kokkos path -if [ -z "$KOKKOS_PATH" ]; then - KOKKOS_PATH=$SCRIPT_KOKKOS_ROOT -else - # Ensure KOKKOS_PATH is abs path - KOKKOS_PATH=$( cd $KOKKOS_PATH && pwd ) -fi - -# set build type -if [ "$DEBUG" = "True" ]; then - BUILD_TYPE=debug -else - BUILD_TYPE=release -fi - -# If no args provided, do all compilers -if [ -z "$ARGS" ]; then - ARGS='?' -fi - -# Process args to figure out which compilers to test -COMPILERS_TO_TEST="" -for ARG in $ARGS; do - for COMPILER_DATA in "${COMPILERS[@]}"; do - arr=($COMPILER_DATA) - COMPILER=${arr[0]} - if [[ "$COMPILER" = $ARG* ]]; then - if [[ "$COMPILERS_TO_TEST" != *${COMPILER}* ]]; then - COMPILERS_TO_TEST="$COMPILERS_TO_TEST $COMPILER" - else - echo "Tried to add $COMPILER twice" - fi - fi - done -done - -# -# Functions -# - -# Do not call directly -get_compiler_data() { - compiler=$1 - item=$2 - - for compiler_data in "${COMPILERS[@]}" ; do - arr=($compiler_data) - if [ "$compiler" = "${arr[0]}" ]; then - echo "${arr[$item]}" | tr , ' ' - return 0 - fi - done - - # Not found - echo "Unreconized compiler $compiler" >&2 - exit 1 -} - -# -# For all getters, usage: -# - -get_compiler_modules() { - get_compiler_data $1 1 -} - -get_compiler_build_list() { - get_compiler_data $1 2 -} - -get_compiler_exe_name() { - get_compiler_data $1 3 -} - -get_compiler_warning_flags() { - get_compiler_data $1 4 -} - -run_cmd() { - echo "RUNNING: $*" - if [ "$DRYRUN" != "True" ]; then - eval "$*" - fi -} - -report_and_log_test_result() { - if [ "$1" = "0" ]; then - echo "PASSED $2" - TEST_RESULTS="${TEST_RESULTS}\nPASSED $2" - else - echo "FAILED $2" >&2 - TEST_RESULTS="${TEST_RESULTS}\nFAILED $2 ($3)" - NUM_FAILED+=1 - fi -} - -# single_build_and_test -single_build_and_test() { - # Use sane var names - local compiler=$1; local build=$2; local build_type=$3; - - cd $ROOT_DIR/$compiler - - local compiler_warning_flags=$(get_compiler_warning_flags $compiler) - local compiler_exe=$(get_compiler_exe_name $compiler) - - if [[ "$build_type" = hwloc* ]]; then - local extra_args="--with-hwloc=$HWLOC_ROOT" - fi - - if [[ "$build_type" = *debug* ]]; then - local extra_args="$extra_args --debug" - local cxxflags="-g $compiler_warning_flags" - else - local cxxflags="-O3 $compiler_warning_flags" - fi - - local desc=$(echo "${compiler}-${build}-${build_type}" | sed 's:/:-:g') - echo " Doing build: $desc" - - mkdir "${build}-$build_type" - cd "${build}-$build_type" - - # cxxflags="-DKOKKOS_USING_EXPERIMENTAL_VIEW $cxxflags" - - run_cmd ${KOKKOS_PATH}/generate_makefile.bash --with-devices=$build --compiler=$(which $compiler_exe) --cxxflags=\"$cxxflags\" \"$extra_args\" 2>&1 | tee ${desc}.configure.log || { report_and_log_test_result 1 ${desc} configure && return 0; } - run_cmd make build-test 2>&1 | tee ${desc}.build.log || { report_and_log_test_result 1 ${desc} build && return 0; } - run_cmd make test 2>&1 | tee ${desc}.test.log || { report_and_log_test_result 1 ${desc} test && return 0; } - report_and_log_test_result 0 $desc - return 0 -} - -setup_env() { - local compiler=$1 - local compiler_modules=$(get_compiler_modules $compiler) - - module purge - - for mod in $compiler_modules; do - module load $mod - # It is ridiculously hard to check for the success of a loaded - # module. Module does not return error codes and piping to grep - # causes module to run in a subshell. - module list 2>&1 | grep "$mod" - done -} - -# build_and_test_all -build_and_test_all() { - # Get compiler data - local compiler=$1 - if [ -z "$CUSTOM_BUILD_LIST" ]; then - local compiler_build_list=$(get_compiler_build_list $compiler) - else - local compiler_build_list=$(echo "$CUSTOM_BUILD_LIST" | tr , ' ') - fi - - # set up env - cd $ROOT_DIR - mkdir -p $compiler - setup_env $compiler - - # do builds - for build in $compiler_build_list - do - single_build_and_test $compiler $build $BUILD_TYPE - - # If not cuda, do a hwloc test too - if [[ "$compiler" != cuda* ]]; then - single_build_and_test $compiler $build "hwloc-$BUILD_TYPE" - fi - done - - return 0 -} - -# -# Main -# - -/bin/rm -rf TestAll -mkdir TestAll -cd TestAll - -TEST_RESULTS="" -declare -i NUM_FAILED=0 -ROOT_DIR=$(pwd) -for COMPILER in $COMPILERS_TO_TEST; do - echo "Testing compiler $COMPILER" - build_and_test_all $COMPILER -done - -echo "#######################################################" -echo "RESULT SUMMARY" -echo "#######################################################" -echo -e $TEST_RESULTS - -exit $NUM_FAILED diff --git a/lib/kokkos/config/testing_scripts/README b/lib/kokkos/config/testing_scripts/README deleted file mode 100644 index 455afffd84..0000000000 --- a/lib/kokkos/config/testing_scripts/README +++ /dev/null @@ -1,5 +0,0 @@ -jenkins_test_driver is designed to be run through Jenkins as a -multiconfiguration job. It relies on a number of environment variables that will -only be set when run in that context. It is possible to override these if you -know the Jenkins job setup. It is not recommended that a non-expert try to run -this script directly. diff --git a/lib/kokkos/config/testing_scripts/jenkins_test_driver b/lib/kokkos/config/testing_scripts/jenkins_test_driver deleted file mode 100755 index 9cba7fa518..0000000000 --- a/lib/kokkos/config/testing_scripts/jenkins_test_driver +++ /dev/null @@ -1,83 +0,0 @@ -#!/bin/bash -x - -echo "Building for BUILD_TYPE = ${BUILD_TYPE}" -echo "Building with HOST_COMPILER = ${HOST_COMPILER}" -echo "Building in ${WORKSPACE}" - -module use /home/projects/modulefiles - -BUILD_TYPE=`echo $BUILD_TYPE | tr "~" " "` -build_options="" -for item in ${BUILD_TYPE}; do - build_options="$build_options --with-$item" -done - -kokkos_path=${WORKSPACE}/kokkos -gtest_path=${WORKSPACE}/kokkos/tpls/gtest - -echo ${WORKSPACE} -pwd - -#extract information from the provided parameters. -host_compiler_brand=`echo $HOST_COMPILER | grep -o "^[a-zA-Z]*"` -cuda_compiler=`echo $BUILD_TYPE | grep -o "cuda_[^ ]*"` - -host_compiler_module=`echo $HOST_COMPILER | tr "_" "/"` -cuda_compiler_module=`echo $cuda_compiler | tr "_" "/"` -build_path=`echo $BUILD_TYPE | tr " " "_"` - -module load $host_compiler_module -module load $cuda_compiler_module - -case $host_compiler_brand in - gcc) - module load nvcc-wrapper/gnu - compiler=g++ - ;; - intel) - module load nvcc-wrapper/intel - compiler=icpc - ;; - *) - echo "Unrecognized compiler brand." - exit 1 - ;; -esac - -#if cuda is on we need to set the host compiler for the -#nvcc wrapper and make the wrapper the compiler. -if [ $cuda_compiler != "" ]; then - export NVCC_WRAPPER_DEFAULT_COMPILER=$compiler - compiler=$kokkos_path/config/nvcc_wrapper -fi - -if [ $host_compiler_brand == "intel" -a $cuda_compiler != "" ]; then - echo "Intel compilers are not supported with cuda at this time." - exit 0 -fi - -rm -rf test-$build_path -mkdir test-$build_path -cd test-$build_path - -/bin/bash $kokkos_path/generate_makefile.bash $build_options --kokkos-path="$kokkos_path" --with-gtest="$gtest_path" --compiler=$compiler 2>&1 |tee configure.out - -if [ ${PIPESTATUS[0]} != 0 ]; then - echo "Configure failed." - exit 1 -fi - -make build-test 2>&1 | tee build.log - -if [ ${PIPESTATUS[0]} != 0 ]; then - echo "Build failed." - exit 1 -fi - -make test 2>&1 | tee test.log - -grep "FAIL" test.log -if [ $? == 0 ]; then - echo "Tests failed." - exit 1 -fi diff --git a/lib/kokkos/containers/performance_tests/Makefile b/lib/kokkos/containers/performance_tests/Makefile deleted file mode 100644 index 7ced945282..0000000000 --- a/lib/kokkos/containers/performance_tests/Makefile +++ /dev/null @@ -1,81 +0,0 @@ -KOKKOS_PATH = ../.. - -GTEST_PATH = ../../TPL/gtest - -vpath %.cpp ${KOKKOS_PATH}/containers/performance_tests - -default: build_all - echo "End Build" - - -include $(KOKKOS_PATH)/Makefile.kokkos - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - CXX = nvcc_wrapper - CXXFLAGS ?= -O3 - LINK = $(CXX) - LDFLAGS ?= -lpthread -else - CXX ?= g++ - CXXFLAGS ?= -O3 - LINK ?= $(CXX) - LDFLAGS ?= -lpthread -endif - -KOKKOS_CXXFLAGS += -I$(GTEST_PATH) -I${KOKKOS_PATH}/containers/performance_tests - -TEST_TARGETS = -TARGETS = - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - OBJ_CUDA = TestCuda.o TestMain.o gtest-all.o - TARGETS += KokkosContainers_PerformanceTest_Cuda - TEST_TARGETS += test-cuda -endif - -ifeq ($(KOKKOS_INTERNAL_USE_PTHREADS), 1) - OBJ_THREADS = TestThreads.o TestMain.o gtest-all.o - TARGETS += KokkosContainers_PerformanceTest_Threads - TEST_TARGETS += test-threads -endif - -ifeq ($(KOKKOS_INTERNAL_USE_OPENMP), 1) - OBJ_OPENMP = TestOpenMP.o TestMain.o gtest-all.o - TARGETS += KokkosContainers_PerformanceTest_OpenMP - TEST_TARGETS += test-openmp -endif - -KokkosContainers_PerformanceTest_Cuda: $(OBJ_CUDA) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_CUDA) $(KOKKOS_LIBS) $(LIB) -o KokkosContainers_PerformanceTest_Cuda - -KokkosContainers_PerformanceTest_Threads: $(OBJ_THREADS) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_THREADS) $(KOKKOS_LIBS) $(LIB) -o KokkosContainers_PerformanceTest_Threads - -KokkosContainers_PerformanceTest_OpenMP: $(OBJ_OPENMP) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_OPENMP) $(KOKKOS_LIBS) $(LIB) -o KokkosContainers_PerformanceTest_OpenMP - -test-cuda: KokkosContainers_PerformanceTest_Cuda - ./KokkosContainers_PerformanceTest_Cuda - -test-threads: KokkosContainers_PerformanceTest_Threads - ./KokkosContainers_PerformanceTest_Threads - -test-openmp: KokkosContainers_PerformanceTest_OpenMP - ./KokkosContainers_PerformanceTest_OpenMP - - -build_all: $(TARGETS) - -test: $(TEST_TARGETS) - -clean: kokkos-clean - rm -f *.o $(TARGETS) - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< - -gtest-all.o:$(GTEST_PATH)/gtest/gtest-all.cc - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $(GTEST_PATH)/gtest/gtest-all.cc - diff --git a/lib/kokkos/containers/performance_tests/TestCuda.cpp b/lib/kokkos/containers/performance_tests/TestCuda.cpp deleted file mode 100644 index aee262de93..0000000000 --- a/lib/kokkos/containers/performance_tests/TestCuda.cpp +++ /dev/null @@ -1,100 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include -#include - -#include - -#include - -#if defined( KOKKOS_HAVE_CUDA ) - -#include - -#include - -#include - -namespace Performance { - -class cuda : public ::testing::Test { -protected: - static void SetUpTestCase() - { - std::cout << std::setprecision(5) << std::scientific; - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice(0) ); - } - static void TearDownTestCase() - { - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); - } -}; - -TEST_F( cuda, global_2_local) -{ - std::cout << "Cuda" << std::endl; - std::cout << "size, create, generate, fill, find" << std::endl; - for (unsigned i=Performance::begin_id_size; i<=Performance::end_id_size; i *= Performance::id_step) - test_global_to_local_ids(i); -} - -TEST_F( cuda, unordered_map_performance_near) -{ - Perf::run_performance_tests("cuda-near"); -} - -TEST_F( cuda, unordered_map_performance_far) -{ - Perf::run_performance_tests("cuda-far"); -} - -} - -#endif /* #if defined( KOKKOS_HAVE_CUDA ) */ diff --git a/lib/kokkos/containers/performance_tests/TestGlobal2LocalIds.hpp b/lib/kokkos/containers/performance_tests/TestGlobal2LocalIds.hpp deleted file mode 100644 index fb70b8fe2e..0000000000 --- a/lib/kokkos/containers/performance_tests/TestGlobal2LocalIds.hpp +++ /dev/null @@ -1,231 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#ifndef KOKKOS_TEST_GLOBAL_TO_LOCAL_IDS_HPP -#define KOKKOS_TEST_GLOBAL_TO_LOCAL_IDS_HPP - -#include -#include -#include -#include - -#include - -// This test will simulate global ids - -namespace Performance { - -static const unsigned begin_id_size = 256u; -static const unsigned end_id_size = 1u << 22; -static const unsigned id_step = 2u; - -union helper -{ - uint32_t word; - uint8_t byte[4]; -}; - - -template -struct generate_ids -{ - typedef Device execution_space; - typedef typename execution_space::size_type size_type; - typedef Kokkos::View local_id_view; - - local_id_view local_2_global; - - generate_ids( local_id_view & ids) - : local_2_global(ids) - { - Kokkos::parallel_for(local_2_global.dimension_0(), *this); - } - - - KOKKOS_INLINE_FUNCTION - void operator()(size_type i) const - { - - helper x = {static_cast(i)}; - - // shuffle the bytes of i to create a unique, semi-random global_id - x.word = ~x.word; - - uint8_t tmp = x.byte[3]; - x.byte[3] = x.byte[1]; - x.byte[1] = tmp; - - tmp = x.byte[2]; - x.byte[2] = x.byte[0]; - x.byte[0] = tmp; - - local_2_global[i] = x.word; - } - -}; - -template -struct fill_map -{ - typedef Device execution_space; - typedef typename execution_space::size_type size_type; - typedef Kokkos::View local_id_view; - typedef Kokkos::UnorderedMap global_id_view; - - global_id_view global_2_local; - local_id_view local_2_global; - - fill_map( global_id_view gIds, local_id_view lIds) - : global_2_local(gIds) , local_2_global(lIds) - { - Kokkos::parallel_for(local_2_global.dimension_0(), *this); - } - - KOKKOS_INLINE_FUNCTION - void operator()(size_type i) const - { - global_2_local.insert( local_2_global[i], i); - } - -}; - -template -struct find_test -{ - typedef Device execution_space; - typedef typename execution_space::size_type size_type; - typedef Kokkos::View local_id_view; - typedef Kokkos::UnorderedMap global_id_view; - - global_id_view global_2_local; - local_id_view local_2_global; - - typedef size_t value_type; - - find_test( global_id_view gIds, local_id_view lIds, value_type & num_errors) - : global_2_local(gIds) , local_2_global(lIds) - { - Kokkos::parallel_reduce(local_2_global.dimension_0(), *this, num_errors); - } - - KOKKOS_INLINE_FUNCTION - void init(value_type & v) const - { v = 0; } - - KOKKOS_INLINE_FUNCTION - void join(volatile value_type & dst, volatile value_type const & src) const - { dst += src; } - - KOKKOS_INLINE_FUNCTION - void operator()(size_type i, value_type & num_errors) const - { - uint32_t index = global_2_local.find( local_2_global[i] ); - - if ( global_2_local.value_at(index) != i) ++num_errors; - } - -}; - -template -void test_global_to_local_ids(unsigned num_ids) -{ - - typedef Device execution_space; - typedef typename execution_space::size_type size_type; - - typedef Kokkos::View local_id_view; - typedef Kokkos::UnorderedMap global_id_view; - - //size - std::cout << num_ids << ", "; - - double elasped_time = 0; - Kokkos::Impl::Timer timer; - - local_id_view local_2_global("local_ids", num_ids); - global_id_view global_2_local((3u*num_ids)/2u); - - //create - elasped_time = timer.seconds(); - std::cout << elasped_time << ", "; - timer.reset(); - - // generate unique ids - { - generate_ids gen(local_2_global); - } - Device::fence(); - // generate - elasped_time = timer.seconds(); - std::cout << elasped_time << ", "; - timer.reset(); - - { - fill_map fill(global_2_local, local_2_global); - } - Device::fence(); - - // fill - elasped_time = timer.seconds(); - std::cout << elasped_time << ", "; - timer.reset(); - - - size_t num_errors = 0; - for (int i=0; i<100; ++i) - { - find_test find(global_2_local, local_2_global,num_errors); - } - Device::fence(); - - // find - elasped_time = timer.seconds(); - std::cout << elasped_time << std::endl; - - ASSERT_EQ( num_errors, 0u); -} - - -} // namespace Performance - - -#endif //KOKKOS_TEST_GLOBAL_TO_LOCAL_IDS_HPP - diff --git a/lib/kokkos/containers/performance_tests/TestMain.cpp b/lib/kokkos/containers/performance_tests/TestMain.cpp deleted file mode 100644 index f952ab3db5..0000000000 --- a/lib/kokkos/containers/performance_tests/TestMain.cpp +++ /dev/null @@ -1,50 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -int main(int argc, char *argv[]) { - ::testing::InitGoogleTest(&argc,argv); - return RUN_ALL_TESTS(); -} - diff --git a/lib/kokkos/containers/performance_tests/TestOpenMP.cpp b/lib/kokkos/containers/performance_tests/TestOpenMP.cpp deleted file mode 100644 index 82a9311df7..0000000000 --- a/lib/kokkos/containers/performance_tests/TestOpenMP.cpp +++ /dev/null @@ -1,131 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#include - -#include -#include - -#include -#include -#include -#include - - -namespace Performance { - -class openmp : public ::testing::Test { -protected: - static void SetUpTestCase() - { - std::cout << std::setprecision(5) << std::scientific; - - unsigned num_threads = 4; - - if (Kokkos::hwloc::available()) { - num_threads = Kokkos::hwloc::get_available_numa_count() - * Kokkos::hwloc::get_available_cores_per_numa() - * Kokkos::hwloc::get_available_threads_per_core() - ; - - } - - std::cout << "OpenMP: " << num_threads << std::endl; - - Kokkos::OpenMP::initialize( num_threads ); - - std::cout << "available threads: " << omp_get_max_threads() << std::endl; - } - - static void TearDownTestCase() - { - Kokkos::OpenMP::finalize(); - - omp_set_num_threads(1); - - ASSERT_EQ( 1 , omp_get_max_threads() ); - } -}; - -TEST_F( openmp, global_2_local) -{ - std::cout << "OpenMP" << std::endl; - std::cout << "size, create, generate, fill, find" << std::endl; - for (unsigned i=Performance::begin_id_size; i<=Performance::end_id_size; i *= Performance::id_step) - test_global_to_local_ids(i); -} - -TEST_F( openmp, unordered_map_performance_near) -{ - unsigned num_openmp = 4; - if (Kokkos::hwloc::available()) { - num_openmp = Kokkos::hwloc::get_available_numa_count() * - Kokkos::hwloc::get_available_cores_per_numa() * - Kokkos::hwloc::get_available_threads_per_core(); - - } - std::ostringstream base_file_name; - base_file_name << "openmp-" << num_openmp << "-near"; - Perf::run_performance_tests(base_file_name.str()); -} - -TEST_F( openmp, unordered_map_performance_far) -{ - unsigned num_openmp = 4; - if (Kokkos::hwloc::available()) { - num_openmp = Kokkos::hwloc::get_available_numa_count() * - Kokkos::hwloc::get_available_cores_per_numa() * - Kokkos::hwloc::get_available_threads_per_core(); - - } - std::ostringstream base_file_name; - base_file_name << "openmp-" << num_openmp << "-far"; - Perf::run_performance_tests(base_file_name.str()); -} - -} // namespace test - diff --git a/lib/kokkos/containers/performance_tests/TestThreads.cpp b/lib/kokkos/containers/performance_tests/TestThreads.cpp deleted file mode 100644 index 04d9dc0c18..0000000000 --- a/lib/kokkos/containers/performance_tests/TestThreads.cpp +++ /dev/null @@ -1,126 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#include - -#include - -#include -#include - -#include -#include -#include -#include - -namespace Performance { - -class threads : public ::testing::Test { -protected: - static void SetUpTestCase() - { - std::cout << std::setprecision(5) << std::scientific; - - unsigned num_threads = 4; - - if (Kokkos::hwloc::available()) { - num_threads = Kokkos::hwloc::get_available_numa_count() * - Kokkos::hwloc::get_available_cores_per_numa() * - Kokkos::hwloc::get_available_threads_per_core(); - - } - - std::cout << "Threads: " << num_threads << std::endl; - - Kokkos::Threads::initialize( num_threads ); - } - - static void TearDownTestCase() - { - Kokkos::Threads::finalize(); - } -}; - -TEST_F( threads, global_2_local) -{ - std::cout << "Threads" << std::endl; - std::cout << "size, create, generate, fill, find" << std::endl; - for (unsigned i=Performance::begin_id_size; i<=Performance::end_id_size; i *= Performance::id_step) - test_global_to_local_ids(i); -} - -TEST_F( threads, unordered_map_performance_near) -{ - unsigned num_threads = 4; - if (Kokkos::hwloc::available()) { - num_threads = Kokkos::hwloc::get_available_numa_count() * - Kokkos::hwloc::get_available_cores_per_numa() * - Kokkos::hwloc::get_available_threads_per_core(); - - } - std::ostringstream base_file_name; - base_file_name << "threads-" << num_threads << "-near"; - Perf::run_performance_tests(base_file_name.str()); -} - -TEST_F( threads, unordered_map_performance_far) -{ - unsigned num_threads = 4; - if (Kokkos::hwloc::available()) { - num_threads = Kokkos::hwloc::get_available_numa_count() * - Kokkos::hwloc::get_available_cores_per_numa() * - Kokkos::hwloc::get_available_threads_per_core(); - - } - std::ostringstream base_file_name; - base_file_name << "threads-" << num_threads << "-far"; - Perf::run_performance_tests(base_file_name.str()); -} - -} // namespace Performance - - diff --git a/lib/kokkos/containers/performance_tests/TestUnorderedMapPerformance.hpp b/lib/kokkos/containers/performance_tests/TestUnorderedMapPerformance.hpp deleted file mode 100644 index 975800229c..0000000000 --- a/lib/kokkos/containers/performance_tests/TestUnorderedMapPerformance.hpp +++ /dev/null @@ -1,262 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#ifndef KOKKOS_TEST_UNORDERED_MAP_PERFORMANCE_HPP -#define KOKKOS_TEST_UNORDERED_MAP_PERFORMANCE_HPP - -#include - -#include -#include -#include -#include -#include - - -namespace Perf { - -template -struct UnorderedMapTest -{ - typedef Device execution_space; - typedef Kokkos::UnorderedMap map_type; - typedef typename map_type::histogram_type histogram_type; - - struct value_type { - uint32_t failed_count; - uint32_t max_list; - }; - - uint32_t capacity; - uint32_t inserts; - uint32_t collisions; - double seconds; - map_type map; - histogram_type histogram; - - UnorderedMapTest( uint32_t arg_capacity, uint32_t arg_inserts, uint32_t arg_collisions) - : capacity(arg_capacity) - , inserts(arg_inserts) - , collisions(arg_collisions) - , seconds(0) - , map(capacity) - , histogram(map.get_histogram()) - { - Kokkos::Impl::Timer wall_clock ; - wall_clock.reset(); - - value_type v = {}; - int loop_count = 0; - do { - ++loop_count; - - v = value_type(); - Kokkos::parallel_reduce(inserts, *this, v); - - if (v.failed_count > 0u) { - const uint32_t new_capacity = map.capacity() + ((map.capacity()*3ull)/20u) + v.failed_count/collisions ; - map.rehash( new_capacity ); - } - } while (v.failed_count > 0u); - - seconds = wall_clock.seconds(); - - switch (loop_count) - { - case 1u: std::cout << " \033[0;32m" << loop_count << "\033[0m "; break; - case 2u: std::cout << " \033[1;31m" << loop_count << "\033[0m "; break; - default: std::cout << " \033[0;31m" << loop_count << "\033[0m "; break; - } - std::cout << std::setprecision(2) << std::fixed << std::setw(5) << (1e9*(seconds/(inserts))) << "; " << std::flush; - - histogram.calculate(); - Device::fence(); - } - - void print(std::ostream & metrics_out, std::ostream & length_out, std::ostream & distance_out, std::ostream & block_distance_out) - { - metrics_out << map.capacity() << " , "; - metrics_out << inserts/collisions << " , "; - metrics_out << (100.0 * inserts/collisions) / map.capacity() << " , "; - metrics_out << inserts << " , "; - metrics_out << (map.failed_insert() ? "true" : "false") << " , "; - metrics_out << collisions << " , "; - metrics_out << 1e9*(seconds/inserts) << " , "; - metrics_out << seconds << std::endl; - - length_out << map.capacity() << " , "; - length_out << ((100.0 *inserts/collisions) / map.capacity()) << " , "; - length_out << collisions << " , "; - histogram.print_length(length_out); - - distance_out << map.capacity() << " , "; - distance_out << ((100.0 *inserts/collisions) / map.capacity()) << " , "; - distance_out << collisions << " , "; - histogram.print_distance(distance_out); - - block_distance_out << map.capacity() << " , "; - block_distance_out << ((100.0 *inserts/collisions) / map.capacity()) << " , "; - block_distance_out << collisions << " , "; - histogram.print_block_distance(block_distance_out); - } - - - KOKKOS_INLINE_FUNCTION - void init( value_type & v ) const - { - v.failed_count = 0; - v.max_list = 0; - } - - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & dst, const volatile value_type & src ) const - { - dst.failed_count += src.failed_count; - dst.max_list = src.max_list < dst.max_list ? dst.max_list : src.max_list; - } - - KOKKOS_INLINE_FUNCTION - void operator()(uint32_t i, value_type & v) const - { - const uint32_t key = Near ? i/collisions : i%(inserts/collisions); - typename map_type::insert_result result = map.insert(key,i); - v.failed_count += !result.failed() ? 0 : 1; - v.max_list = result.list_position() < v.max_list ? v.max_list : result.list_position(); - } - -}; - -//#define KOKKOS_COLLECT_UNORDERED_MAP_METRICS - -template -void run_performance_tests(std::string const & base_file_name) -{ -#if defined(KOKKOS_COLLECT_UNORDERED_MAP_METRICS) - std::string metrics_file_name = base_file_name + std::string("-metrics.csv"); - std::string length_file_name = base_file_name + std::string("-length.csv"); - std::string distance_file_name = base_file_name + std::string("-distance.csv"); - std::string block_distance_file_name = base_file_name + std::string("-block_distance.csv"); - - std::ofstream metrics_out( metrics_file_name.c_str(), std::ofstream::out ); - std::ofstream length_out( length_file_name.c_str(), std::ofstream::out ); - std::ofstream distance_out( distance_file_name.c_str(), std::ofstream::out ); - std::ofstream block_distance_out( block_distance_file_name.c_str(), std::ofstream::out ); - - - /* - const double test_ratios[] = { - 0.50 - , 0.75 - , 0.80 - , 0.85 - , 0.90 - , 0.95 - , 1.00 - , 1.25 - , 2.00 - }; - */ - - const double test_ratios[] = { 1.00 }; - - const int num_ratios = sizeof(test_ratios) / sizeof(double); - - /* - const uint32_t collisions[] { - 1 - , 4 - , 16 - , 64 - }; - */ - - const uint32_t collisions[] = { 16 }; - - const int num_collisions = sizeof(collisions) / sizeof(uint32_t); - - // set up file headers - metrics_out << "Capacity , Unique , Percent Full , Attempted Inserts , Failed Inserts , Collision Ratio , Nanoseconds/Inserts, Seconds" << std::endl; - length_out << "Capacity , Percent Full , "; - distance_out << "Capacity , Percent Full , "; - block_distance_out << "Capacity , Percent Full , "; - - for (int i=0; i<100; ++i) { - length_out << i << " , "; - distance_out << i << " , "; - block_distance_out << i << " , "; - } - - length_out << "\b\b\b " << std::endl; - distance_out << "\b\b\b " << std::endl; - block_distance_out << "\b\b\b " << std::endl; - - Kokkos::Impl::Timer wall_clock ; - for (int i=0; i < num_collisions ; ++i) { - wall_clock.reset(); - std::cout << "Collisions: " << collisions[i] << std::endl; - for (int j = 0; j < num_ratios; ++j) { - std::cout << std::setprecision(1) << std::fixed << std::setw(5) << (100.0*test_ratios[j]) << "% " << std::flush; - for (uint32_t capacity = 1<<14; capacity < 1<<25; capacity = capacity << 1) { - uint32_t inserts = static_cast(test_ratios[j]*(capacity)); - std::cout << capacity << std::flush; - UnorderedMapTest test(capacity, inserts*collisions[i], collisions[i]); - Device::fence(); - test.print(metrics_out, length_out, distance_out, block_distance_out); - } - std::cout << "\b\b " << std::endl; - - } - std::cout << " " << wall_clock.seconds() << " secs" << std::endl; - } - metrics_out.close(); - length_out.close(); - distance_out.close(); - block_distance_out.close(); -#else - (void)base_file_name; - std::cout << "skipping test" << std::endl; -#endif -} - - -} // namespace Perf - -#endif //KOKKOS_TEST_UNORDERED_MAP_PERFORMANCE_HPP diff --git a/lib/kokkos/containers/src/Kokkos_Bitset.hpp b/lib/kokkos/containers/src/Kokkos_Bitset.hpp deleted file mode 100644 index b51b1c2b26..0000000000 --- a/lib/kokkos/containers/src/Kokkos_Bitset.hpp +++ /dev/null @@ -1,437 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_BITSET_HPP -#define KOKKOS_BITSET_HPP - -#include -#include - -#include - -#include - -namespace Kokkos { - -template -class Bitset; - -template -class ConstBitset; - -template -void deep_copy( Bitset & dst, Bitset const& src); - -template -void deep_copy( Bitset & dst, ConstBitset const& src); - -template -void deep_copy( ConstBitset & dst, ConstBitset const& src); - - -/// A thread safe view to a bitset -template -class Bitset -{ -public: - typedef Device execution_space; - typedef unsigned size_type; - - enum { BIT_SCAN_REVERSE = 1u }; - enum { MOVE_HINT_BACKWARD = 2u }; - - enum { - BIT_SCAN_FORWARD_MOVE_HINT_FORWARD = 0u - , BIT_SCAN_REVERSE_MOVE_HINT_FORWARD = BIT_SCAN_REVERSE - , BIT_SCAN_FORWARD_MOVE_HINT_BACKWARD = MOVE_HINT_BACKWARD - , BIT_SCAN_REVERSE_MOVE_HINT_BACKWARD = BIT_SCAN_REVERSE | MOVE_HINT_BACKWARD - }; - -private: - enum { block_size = static_cast(sizeof(unsigned)*CHAR_BIT) }; - enum { block_mask = block_size-1u }; - enum { block_shift = static_cast(Impl::power_of_two::value) }; - -public: - - - /// constructor - /// arg_size := number of bit in set - Bitset(unsigned arg_size = 0u) - : m_size(arg_size) - , m_last_block_mask(0u) - , m_blocks("Bitset", ((m_size + block_mask) >> block_shift) ) - { - for (int i=0, end = static_cast(m_size & block_mask); i < end; ++i) { - m_last_block_mask |= 1u << i; - } - } - - /// assignment - Bitset & operator = (Bitset const & rhs) - { - this->m_size = rhs.m_size; - this->m_last_block_mask = rhs.m_last_block_mask; - this->m_blocks = rhs.m_blocks; - - return *this; - } - - /// copy constructor - Bitset( Bitset const & rhs) - : m_size( rhs.m_size ) - , m_last_block_mask( rhs.m_last_block_mask ) - , m_blocks( rhs.m_blocks ) - {} - - /// number of bits in the set - /// can be call from the host or the device - KOKKOS_FORCEINLINE_FUNCTION - unsigned size() const - { return m_size; } - - /// number of bits which are set to 1 - /// can only be called from the host - unsigned count() const - { - Impl::BitsetCount< Bitset > f(*this); - return f.apply(); - } - - /// set all bits to 1 - /// can only be called from the host - void set() - { - Kokkos::deep_copy(m_blocks, ~0u ); - - if (m_last_block_mask) { - //clear the unused bits in the last block - typedef Kokkos::Impl::DeepCopy< typename execution_space::memory_space, Kokkos::HostSpace > raw_deep_copy; - raw_deep_copy( m_blocks.ptr_on_device() + (m_blocks.dimension_0() -1u), &m_last_block_mask, sizeof(unsigned)); - } - } - - /// set all bits to 0 - /// can only be called from the host - void reset() - { - Kokkos::deep_copy(m_blocks, 0u ); - } - - /// set all bits to 0 - /// can only be called from the host - void clear() - { - Kokkos::deep_copy(m_blocks, 0u ); - } - - /// set i'th bit to 1 - /// can only be called from the device - KOKKOS_FORCEINLINE_FUNCTION - bool set( unsigned i ) const - { - if ( i < m_size ) { - unsigned * block_ptr = &m_blocks[ i >> block_shift ]; - const unsigned mask = 1u << static_cast( i & block_mask ); - - return !( atomic_fetch_or( block_ptr, mask ) & mask ); - } - return false; - } - - /// set i'th bit to 0 - /// can only be called from the device - KOKKOS_FORCEINLINE_FUNCTION - bool reset( unsigned i ) const - { - if ( i < m_size ) { - unsigned * block_ptr = &m_blocks[ i >> block_shift ]; - const unsigned mask = 1u << static_cast( i & block_mask ); - - return atomic_fetch_and( block_ptr, ~mask ) & mask; - } - return false; - } - - /// return true if the i'th bit set to 1 - /// can only be called from the device - KOKKOS_FORCEINLINE_FUNCTION - bool test( unsigned i ) const - { - if ( i < m_size ) { - const unsigned block = volatile_load(&m_blocks[ i >> block_shift ]); - const unsigned mask = 1u << static_cast( i & block_mask ); - return block & mask; - } - return false; - } - - /// used with find_any_set_near or find_any_unset_near functions - /// returns the max number of times those functions should be call - /// when searching for an available bit - KOKKOS_FORCEINLINE_FUNCTION - unsigned max_hint() const - { - return m_blocks.dimension_0(); - } - - /// find a bit set to 1 near the hint - /// returns a pair< bool, unsigned> where if result.first is true then result.second is the bit found - /// and if result.first is false the result.second is a new hint - KOKKOS_INLINE_FUNCTION - Kokkos::pair find_any_set_near( unsigned hint , unsigned scan_direction = BIT_SCAN_FORWARD_MOVE_HINT_FORWARD ) const - { - const unsigned block_idx = (hint >> block_shift) < m_blocks.dimension_0() ? (hint >> block_shift) : 0; - const unsigned offset = hint & block_mask; - unsigned block = volatile_load(&m_blocks[ block_idx ]); - block = !m_last_block_mask || (block_idx < (m_blocks.dimension_0()-1)) ? block : block & m_last_block_mask ; - - return find_any_helper(block_idx, offset, block, scan_direction); - } - - /// find a bit set to 0 near the hint - /// returns a pair< bool, unsigned> where if result.first is true then result.second is the bit found - /// and if result.first is false the result.second is a new hint - KOKKOS_INLINE_FUNCTION - Kokkos::pair find_any_unset_near( unsigned hint , unsigned scan_direction = BIT_SCAN_FORWARD_MOVE_HINT_FORWARD ) const - { - const unsigned block_idx = hint >> block_shift; - const unsigned offset = hint & block_mask; - unsigned block = volatile_load(&m_blocks[ block_idx ]); - block = !m_last_block_mask || (block_idx < (m_blocks.dimension_0()-1) ) ? ~block : ~block & m_last_block_mask ; - - return find_any_helper(block_idx, offset, block, scan_direction); - } - -private: - - KOKKOS_FORCEINLINE_FUNCTION - Kokkos::pair find_any_helper(unsigned block_idx, unsigned offset, unsigned block, unsigned scan_direction) const - { - Kokkos::pair result( block > 0u, 0); - - if (!result.first) { - result.second = update_hint( block_idx, offset, scan_direction ); - } - else { - result.second = scan_block( (block_idx << block_shift) - , offset - , block - , scan_direction - ); - } - return result; - } - - - KOKKOS_FORCEINLINE_FUNCTION - unsigned scan_block(unsigned block_start, int offset, unsigned block, unsigned scan_direction ) const - { - offset = !(scan_direction & BIT_SCAN_REVERSE) ? offset : (offset + block_mask) & block_mask; - block = Impl::rotate_right(block, offset); - return ((( !(scan_direction & BIT_SCAN_REVERSE) ? - Impl::bit_scan_forward(block) : - Impl::bit_scan_reverse(block) - ) + offset - ) & block_mask - ) + block_start; - } - - KOKKOS_FORCEINLINE_FUNCTION - unsigned update_hint( long long block_idx, unsigned offset, unsigned scan_direction ) const - { - block_idx += scan_direction & MOVE_HINT_BACKWARD ? -1 : 1; - block_idx = block_idx >= 0 ? block_idx : m_blocks.dimension_0() - 1; - block_idx = block_idx < static_cast(m_blocks.dimension_0()) ? block_idx : 0; - - return static_cast(block_idx)*block_size + offset; - } - -private: - - unsigned m_size; - unsigned m_last_block_mask; - View< unsigned *, execution_space, MemoryTraits > m_blocks; - -private: - template - friend class Bitset; - - template - friend class ConstBitset; - - template - friend struct Impl::BitsetCount; - - template - friend void deep_copy( Bitset & dst, Bitset const& src); - - template - friend void deep_copy( Bitset & dst, ConstBitset const& src); -}; - -/// a thread-safe view to a const bitset -/// i.e. can only test bits -template -class ConstBitset -{ -public: - typedef Device execution_space; - typedef unsigned size_type; - -private: - enum { block_size = static_cast(sizeof(unsigned)*CHAR_BIT) }; - enum { block_mask = block_size -1u }; - enum { block_shift = static_cast(Impl::power_of_two::value) }; - -public: - ConstBitset() - : m_size (0) - {} - - ConstBitset(Bitset const& rhs) - : m_size(rhs.m_size) - , m_blocks(rhs.m_blocks) - {} - - ConstBitset(ConstBitset const& rhs) - : m_size( rhs.m_size ) - , m_blocks( rhs.m_blocks ) - {} - - ConstBitset & operator = (Bitset const & rhs) - { - this->m_size = rhs.m_size; - this->m_blocks = rhs.m_blocks; - - return *this; - } - - ConstBitset & operator = (ConstBitset const & rhs) - { - this->m_size = rhs.m_size; - this->m_blocks = rhs.m_blocks; - - return *this; - } - - - KOKKOS_FORCEINLINE_FUNCTION - unsigned size() const - { - return m_size; - } - - unsigned count() const - { - Impl::BitsetCount< ConstBitset > f(*this); - return f.apply(); - } - - KOKKOS_FORCEINLINE_FUNCTION - bool test( unsigned i ) const - { - if ( i < m_size ) { - const unsigned block = m_blocks[ i >> block_shift ]; - const unsigned mask = 1u << static_cast( i & block_mask ); - return block & mask; - } - return false; - } - -private: - - unsigned m_size; - View< const unsigned *, execution_space, MemoryTraits > m_blocks; - -private: - template - friend class ConstBitset; - - template - friend struct Impl::BitsetCount; - - template - friend void deep_copy( Bitset & dst, ConstBitset const& src); - - template - friend void deep_copy( ConstBitset & dst, ConstBitset const& src); -}; - - -template -void deep_copy( Bitset & dst, Bitset const& src) -{ - if (dst.size() != src.size()) { - throw std::runtime_error("Error: Cannot deep_copy bitsets of different sizes!"); - } - - typedef Kokkos::Impl::DeepCopy< typename DstDevice::memory_space, typename SrcDevice::memory_space > raw_deep_copy; - raw_deep_copy(dst.m_blocks.ptr_on_device(), src.m_blocks.ptr_on_device(), sizeof(unsigned)*src.m_blocks.dimension_0()); -} - -template -void deep_copy( Bitset & dst, ConstBitset const& src) -{ - if (dst.size() != src.size()) { - throw std::runtime_error("Error: Cannot deep_copy bitsets of different sizes!"); - } - - typedef Kokkos::Impl::DeepCopy< typename DstDevice::memory_space, typename SrcDevice::memory_space > raw_deep_copy; - raw_deep_copy(dst.m_blocks.ptr_on_device(), src.m_blocks.ptr_on_device(), sizeof(unsigned)*src.m_blocks.dimension_0()); -} - -template -void deep_copy( ConstBitset & dst, ConstBitset const& src) -{ - if (dst.size() != src.size()) { - throw std::runtime_error("Error: Cannot deep_copy bitsets of different sizes!"); - } - - typedef Kokkos::Impl::DeepCopy< typename DstDevice::memory_space, typename SrcDevice::memory_space > raw_deep_copy; - raw_deep_copy(dst.m_blocks.ptr_on_device(), src.m_blocks.ptr_on_device(), sizeof(unsigned)*src.m_blocks.dimension_0()); -} - -} // namespace Kokkos - -#endif //KOKKOS_BITSET_HPP diff --git a/lib/kokkos/containers/src/Kokkos_DualView.hpp b/lib/kokkos/containers/src/Kokkos_DualView.hpp deleted file mode 100644 index 5e70731bdc..0000000000 --- a/lib/kokkos/containers/src/Kokkos_DualView.hpp +++ /dev/null @@ -1,880 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -/// \file Kokkos_DualView.hpp -/// \brief Declaration and definition of Kokkos::DualView. -/// -/// This header file declares and defines Kokkos::DualView and its -/// related nonmember functions. - -#ifndef KOKKOS_DUALVIEW_HPP -#define KOKKOS_DUALVIEW_HPP - -#include -#include - -namespace Kokkos { - -/* \class DualView - * \brief Container to manage mirroring a Kokkos::View that lives - * in device memory with a Kokkos::View that lives in host memory. - * - * This class provides capabilities to manage data which exists in two - * memory spaces at the same time. It keeps views of the same layout - * on two memory spaces as well as modified flags for both - * allocations. Users are responsible for setting the modified flags - * manually if they change the data in either memory space, by calling - * the sync() method templated on the device where they modified the - * data. Users may synchronize data by calling the modify() function, - * templated on the device towards which they want to synchronize - * (i.e., the target of the one-way copy operation). - * - * The DualView class also provides convenience methods such as - * realloc, resize and capacity which call the appropriate methods of - * the underlying Kokkos::View objects. - * - * The four template arguments are the same as those of Kokkos::View. - * (Please refer to that class' documentation for a detailed - * description.) - * - * \tparam DataType The type of the entries stored in the container. - * - * \tparam Layout The array's layout in memory. - * - * \tparam Device The Kokkos Device type. If its memory space is - * not the same as the host's memory space, then DualView will - * contain two separate Views: one in device memory, and one in - * host memory. Otherwise, DualView will only store one View. - * - * \tparam MemoryTraits (optional) The user's intended memory access - * behavior. Please see the documentation of Kokkos::View for - * examples. The default suffices for most users. - */ -template< class DataType , - class Arg1Type = void , - class Arg2Type = void , - class Arg3Type = void> -class DualView : public ViewTraits< DataType , Arg1Type , Arg2Type, Arg3Type > -{ -public: - //! \name Typedefs for device types and various Kokkos::View specializations. - //@{ - typedef ViewTraits< DataType , Arg1Type , Arg2Type, Arg3Type > traits ; - - //! The Kokkos Host Device type; - typedef typename traits::host_mirror_space host_mirror_space ; - - //! The type of a Kokkos::View on the device. - typedef View< typename traits::data_type , - typename traits::array_layout , - typename traits::device_type , - typename traits::memory_traits > t_dev ; - - /// \typedef t_host - /// \brief The type of a Kokkos::View host mirror of \c t_dev. - typedef typename t_dev::HostMirror t_host ; - - //! The type of a const View on the device. - //! The type of a Kokkos::View on the device. - typedef View< typename traits::const_data_type , - typename traits::array_layout , - typename traits::device_type , - typename traits::memory_traits > t_dev_const ; - - /// \typedef t_host_const - /// \brief The type of a const View host mirror of \c t_dev_const. - typedef typename t_dev_const::HostMirror t_host_const; - - //! The type of a const, random-access View on the device. - typedef View< typename traits::const_data_type , - typename traits::array_layout , - typename traits::device_type , - MemoryRandomAccess > t_dev_const_randomread ; - - /// \typedef t_host_const_randomread - /// \brief The type of a const, random-access View host mirror of - /// \c t_dev_const_randomread. - typedef typename t_dev_const_randomread::HostMirror t_host_const_randomread; - - //! The type of an unmanaged View on the device. - typedef View< typename traits::data_type , - typename traits::array_layout , - typename traits::device_type , - MemoryUnmanaged> t_dev_um; - - //! The type of an unmanaged View host mirror of \c t_dev_um. - typedef View< typename t_host::data_type , - typename t_host::array_layout , - typename t_host::device_type , - MemoryUnmanaged> t_host_um; - - //! The type of a const unmanaged View on the device. - typedef View< typename traits::const_data_type , - typename traits::array_layout , - typename traits::device_type , - MemoryUnmanaged> t_dev_const_um; - - //! The type of a const unmanaged View host mirror of \c t_dev_const_um. - typedef View t_host_const_um; - - //@} - //! \name The two View instances. - //@{ - - t_dev d_view; - t_host h_view; - - //@} - //! \name Counters to keep track of changes ("modified" flags) - //@{ - - View modified_device; - View modified_host; - - //@} - //! \name Constructors - //@{ - - /// \brief Empty constructor. - /// - /// Both device and host View objects are constructed using their - /// default constructors. The "modified" flags are both initialized - /// to "unmodified." - DualView () : - modified_device (View ("DualView::modified_device")), - modified_host (View ("DualView::modified_host")) - {} - - /// \brief Constructor that allocates View objects on both host and device. - /// - /// This constructor works like the analogous constructor of View. - /// The first argument is a string label, which is entirely for your - /// benefit. (Different DualView objects may have the same label if - /// you like.) The arguments that follow are the dimensions of the - /// View objects. For example, if the View has three dimensions, - /// the first three integer arguments will be nonzero, and you may - /// omit the integer arguments that follow. - DualView (const std::string& label, - const size_t n0 = 0, - const size_t n1 = 0, - const size_t n2 = 0, - const size_t n3 = 0, - const size_t n4 = 0, - const size_t n5 = 0, - const size_t n6 = 0, - const size_t n7 = 0) - : d_view (label, n0, n1, n2, n3, n4, n5, n6, n7) - , h_view (create_mirror_view (d_view)) // without UVM, host View mirrors - , modified_device (View ("DualView::modified_device")) - , modified_host (View ("DualView::modified_host")) - {} - - //! Copy constructor (shallow copy) - template - DualView (const DualView& src) : - d_view (src.d_view), - h_view (src.h_view), - modified_device (src.modified_device), - modified_host (src.modified_host) - {} - - /// \brief Create DualView from existing device and host View objects. - /// - /// This constructor assumes that the device and host View objects - /// are synchronized. You, the caller, are responsible for making - /// sure this is the case before calling this constructor. After - /// this constructor returns, you may use DualView's sync() and - /// modify() methods to ensure synchronization of the View objects. - /// - /// \param d_view_ Device View - /// \param h_view_ Host View (must have type t_host = t_dev::HostMirror) - DualView (const t_dev& d_view_, const t_host& h_view_) : - d_view (d_view_), - h_view (h_view_), - modified_device (View ("DualView::modified_device")), - modified_host (View ("DualView::modified_host")) - { - Impl::assert_shapes_are_equal (d_view.shape (), h_view.shape ()); - } - - //@} - //! \name Methods for synchronizing, marking as modified, and getting Views. - //@{ - - /// \brief Return a View on a specific device \c Device. - /// - /// Please don't be afraid of the if_c expression in the return - /// value's type. That just tells the method what the return type - /// should be: t_dev if the \c Device template parameter matches - /// this DualView's device type, else t_host. - /// - /// For example, suppose you create a DualView on Cuda, like this: - /// \code - /// typedef Kokkos::DualView dual_view_type; - /// dual_view_type DV ("my dual view", 100); - /// \endcode - /// If you want to get the CUDA device View, do this: - /// \code - /// typename dual_view_type::t_dev cudaView = DV.view (); - /// \endcode - /// and if you want to get the host mirror of that View, do this: - /// \code - /// typedef typename Kokkos::HostSpace::execution_space host_device_type; - /// typename dual_view_type::t_host hostView = DV.view (); - /// \endcode - template< class Device > - KOKKOS_INLINE_FUNCTION - const typename Impl::if_c< - Impl::is_same::value, - t_dev, - t_host>::type& view () const - { - return Impl::if_c< - Impl::is_same< - typename t_dev::memory_space, - typename Device::memory_space>::value, - t_dev, - t_host >::select (d_view , h_view); - } - - /// \brief Update data on device or host only if data in the other - /// space has been marked as modified. - /// - /// If \c Device is the same as this DualView's device type, then - /// copy data from host to device. Otherwise, copy data from device - /// to host. In either case, only copy if the source of the copy - /// has been modified. - /// - /// This is a one-way synchronization only. If the target of the - /// copy has been modified, this operation will discard those - /// modifications. It will also reset both device and host modified - /// flags. - /// - /// \note This method doesn't know on its own whether you modified - /// the data in either View. You must manually mark modified data - /// as modified, by calling the modify() method with the - /// appropriate template parameter. - template - void sync( const typename Impl::enable_if< - ( Impl::is_same< typename traits::data_type , typename traits::non_const_data_type>::value) || - ( Impl::is_same< Device , int>::value) - , int >::type& = 0) - { - const unsigned int dev = - Impl::if_c< - Impl::is_same< - typename t_dev::memory_space, - typename Device::memory_space>::value , - unsigned int, - unsigned int>::select (1, 0); - - if (dev) { // if Device is the same as DualView's device type - if ((modified_host () > 0) && (modified_host () >= modified_device ())) { - deep_copy (d_view, h_view); - modified_host() = modified_device() = 0; - } - } else { // hopefully Device is the same as DualView's host type - if ((modified_device () > 0) && (modified_device () >= modified_host ())) { - deep_copy (h_view, d_view); - modified_host() = modified_device() = 0; - } - } - if(Impl::is_same::value) { - t_dev::execution_space::fence(); - t_host::execution_space::fence(); - } - } - - template - void sync ( const typename Impl::enable_if< - ( ! Impl::is_same< typename traits::data_type , typename traits::non_const_data_type>::value ) || - ( Impl::is_same< Device , int>::value) - , int >::type& = 0 ) - { - const unsigned int dev = - Impl::if_c< - Impl::is_same< - typename t_dev::memory_space, - typename Device::memory_space>::value, - unsigned int, - unsigned int>::select (1, 0); - if (dev) { // if Device is the same as DualView's device type - if ((modified_host () > 0) && (modified_host () >= modified_device ())) { - Impl::throw_runtime_exception("Calling sync on a DualView with a const datatype."); - } - } else { // hopefully Device is the same as DualView's host type - if ((modified_device () > 0) && (modified_device () >= modified_host ())) { - Impl::throw_runtime_exception("Calling sync on a DualView with a const datatype."); - } - } - } - - template - bool need_sync() - { - const unsigned int dev = - Impl::if_c< - Impl::is_same< - typename t_dev::memory_space, - typename Device::memory_space>::value , - unsigned int, - unsigned int>::select (1, 0); - - if (dev) { // if Device is the same as DualView's device type - if ((modified_host () > 0) && (modified_host () >= modified_device ())) { - return true; - } - } else { // hopefully Device is the same as DualView's host type - if ((modified_device () > 0) && (modified_device () >= modified_host ())) { - return true; - } - } - return false; - } - /// \brief Mark data as modified on the given device \c Device. - /// - /// If \c Device is the same as this DualView's device type, then - /// mark the device's data as modified. Otherwise, mark the host's - /// data as modified. - template - void modify () { - const unsigned int dev = - Impl::if_c< - Impl::is_same< - typename t_dev::memory_space, - typename Device::memory_space>::value, - unsigned int, - unsigned int>::select (1, 0); - - if (dev) { // if Device is the same as DualView's device type - // Increment the device's modified count. - modified_device () = (modified_device () > modified_host () ? - modified_device () : modified_host ()) + 1; - } else { // hopefully Device is the same as DualView's host type - // Increment the host's modified count. - modified_host () = (modified_device () > modified_host () ? - modified_device () : modified_host ()) + 1; - } - } - - //@} - //! \name Methods for reallocating or resizing the View objects. - //@{ - - /// \brief Reallocate both View objects. - /// - /// This discards any existing contents of the objects, and resets - /// their modified flags. It does not copy the old contents - /// of either View into the new View objects. - void realloc( const size_t n0 = 0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 ) { - ::Kokkos::realloc(d_view,n0,n1,n2,n3,n4,n5,n6,n7); - h_view = create_mirror_view( d_view ); - - /* Reset dirty flags */ - modified_device() = modified_host() = 0; - } - - /// \brief Resize both views, copying old contents into new if necessary. - /// - /// This method only copies the old contents into the new View - /// objects for the device which was last marked as modified. - void resize( const size_t n0 = 0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 ) { - if(modified_device() >= modified_host()) { - /* Resize on Device */ - ::Kokkos::resize(d_view,n0,n1,n2,n3,n4,n5,n6,n7); - h_view = create_mirror_view( d_view ); - - /* Mark Device copy as modified */ - modified_device() = modified_device()+1; - - } else { - /* Realloc on Device */ - - ::Kokkos::realloc(d_view,n0,n1,n2,n3,n4,n5,n6,n7); - t_host temp_view = create_mirror_view( d_view ); - - /* Remap on Host */ - Kokkos::deep_copy( temp_view , h_view ); - - h_view = temp_view; - - /* Mark Host copy as modified */ - modified_host() = modified_host()+1; - } - } - - //@} - //! \name Methods for getting capacity, stride, or dimension(s). - //@{ - - //! The allocation size (same as Kokkos::View::capacity). - size_t capacity() const { -#if defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - return d_view.span(); -#else - return d_view.capacity(); -#endif - } - - //! Get stride(s) for each dimension. - template< typename iType> - void stride(iType* stride_) const { - d_view.stride(stride_); - } - - /* \brief return size of dimension 0 */ - size_t dimension_0() const {return d_view.dimension_0();} - /* \brief return size of dimension 1 */ - size_t dimension_1() const {return d_view.dimension_1();} - /* \brief return size of dimension 2 */ - size_t dimension_2() const {return d_view.dimension_2();} - /* \brief return size of dimension 3 */ - size_t dimension_3() const {return d_view.dimension_3();} - /* \brief return size of dimension 4 */ - size_t dimension_4() const {return d_view.dimension_4();} - /* \brief return size of dimension 5 */ - size_t dimension_5() const {return d_view.dimension_5();} - /* \brief return size of dimension 6 */ - size_t dimension_6() const {return d_view.dimension_6();} - /* \brief return size of dimension 7 */ - size_t dimension_7() const {return d_view.dimension_7();} - - //@} -}; - -} // namespace Kokkos -// -// Partial specializations of Kokkos::subview() for DualView objects. -// - -namespace Kokkos { -namespace Impl { - -template< class SrcDataType , class SrcArg1Type , class SrcArg2Type , class SrcArg3Type - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - , class SubArg4_type , class SubArg5_type , class SubArg6_type , class SubArg7_type - > -struct ViewSubview< DualView< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type > - , SubArg0_type , SubArg1_type , SubArg2_type , SubArg3_type - , SubArg4_type , SubArg5_type , SubArg6_type , SubArg7_type > -{ -private: - - typedef DualView< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type > SrcViewType ; - - enum { V0 = Impl::is_same< SubArg0_type , void >::value ? 1 : 0 }; - enum { V1 = Impl::is_same< SubArg1_type , void >::value ? 1 : 0 }; - enum { V2 = Impl::is_same< SubArg2_type , void >::value ? 1 : 0 }; - enum { V3 = Impl::is_same< SubArg3_type , void >::value ? 1 : 0 }; - enum { V4 = Impl::is_same< SubArg4_type , void >::value ? 1 : 0 }; - enum { V5 = Impl::is_same< SubArg5_type , void >::value ? 1 : 0 }; - enum { V6 = Impl::is_same< SubArg6_type , void >::value ? 1 : 0 }; - enum { V7 = Impl::is_same< SubArg7_type , void >::value ? 1 : 0 }; - - // The source view rank must be equal to the input argument rank - // Once a void argument is encountered all subsequent arguments must be void. - enum { InputRank = - Impl::StaticAssert<( SrcViewType::rank == - ( V0 ? 0 : ( - V1 ? 1 : ( - V2 ? 2 : ( - V3 ? 3 : ( - V4 ? 4 : ( - V5 ? 5 : ( - V6 ? 6 : ( - V7 ? 7 : 8 ))))))) )) - && - ( SrcViewType::rank == - ( 8 - ( V0 + V1 + V2 + V3 + V4 + V5 + V6 + V7 ) ) ) - >::value ? SrcViewType::rank : 0 }; - - enum { R0 = Impl::ViewOffsetRange< SubArg0_type >::is_range ? 1 : 0 }; - enum { R1 = Impl::ViewOffsetRange< SubArg1_type >::is_range ? 1 : 0 }; - enum { R2 = Impl::ViewOffsetRange< SubArg2_type >::is_range ? 1 : 0 }; - enum { R3 = Impl::ViewOffsetRange< SubArg3_type >::is_range ? 1 : 0 }; - enum { R4 = Impl::ViewOffsetRange< SubArg4_type >::is_range ? 1 : 0 }; - enum { R5 = Impl::ViewOffsetRange< SubArg5_type >::is_range ? 1 : 0 }; - enum { R6 = Impl::ViewOffsetRange< SubArg6_type >::is_range ? 1 : 0 }; - enum { R7 = Impl::ViewOffsetRange< SubArg7_type >::is_range ? 1 : 0 }; - - enum { OutputRank = unsigned(R0) + unsigned(R1) + unsigned(R2) + unsigned(R3) - + unsigned(R4) + unsigned(R5) + unsigned(R6) + unsigned(R7) }; - - // Reverse - enum { R0_rev = 0 == InputRank ? 0u : ( - 1 == InputRank ? unsigned(R0) : ( - 2 == InputRank ? unsigned(R1) : ( - 3 == InputRank ? unsigned(R2) : ( - 4 == InputRank ? unsigned(R3) : ( - 5 == InputRank ? unsigned(R4) : ( - 6 == InputRank ? unsigned(R5) : ( - 7 == InputRank ? unsigned(R6) : unsigned(R7) ))))))) }; - - typedef typename SrcViewType::array_layout SrcViewLayout ; - - // Choose array layout, attempting to preserve original layout if at all possible. - typedef typename Impl::if_c< - ( // Same Layout IF - // OutputRank 0 - ( OutputRank == 0 ) - || - // OutputRank 1 or 2, InputLayout Left, Interval 0 - // because single stride one or second index has a stride. - ( OutputRank <= 2 && R0 && Impl::is_same::value ) - || - // OutputRank 1 or 2, InputLayout Right, Interval [InputRank-1] - // because single stride one or second index has a stride. - ( OutputRank <= 2 && R0_rev && Impl::is_same::value ) - ), SrcViewLayout , Kokkos::LayoutStride >::type OutputViewLayout ; - - // Choose data type as a purely dynamic rank array to accomodate a runtime range. - typedef typename Impl::if_c< OutputRank == 0 , typename SrcViewType::value_type , - typename Impl::if_c< OutputRank == 1 , typename SrcViewType::value_type *, - typename Impl::if_c< OutputRank == 2 , typename SrcViewType::value_type **, - typename Impl::if_c< OutputRank == 3 , typename SrcViewType::value_type ***, - typename Impl::if_c< OutputRank == 4 , typename SrcViewType::value_type ****, - typename Impl::if_c< OutputRank == 5 , typename SrcViewType::value_type *****, - typename Impl::if_c< OutputRank == 6 , typename SrcViewType::value_type ******, - typename Impl::if_c< OutputRank == 7 , typename SrcViewType::value_type *******, - typename SrcViewType::value_type ******** - >::type >::type >::type >::type >::type >::type >::type >::type OutputData ; - - // Choose space. - // If the source view's template arg1 or arg2 is a space then use it, - // otherwise use the source view's execution space. - - typedef typename Impl::if_c< Impl::is_space< SrcArg1Type >::value , SrcArg1Type , - typename Impl::if_c< Impl::is_space< SrcArg2Type >::value , SrcArg2Type , typename SrcViewType::execution_space - >::type >::type OutputSpace ; - -public: - - // If keeping the layout then match non-data type arguments - // else keep execution space and memory traits. - typedef typename - Impl::if_c< Impl::is_same< SrcViewLayout , OutputViewLayout >::value - , Kokkos::DualView< OutputData , SrcArg1Type , SrcArg2Type , SrcArg3Type > - , Kokkos::DualView< OutputData , OutputViewLayout , OutputSpace - , typename SrcViewType::memory_traits > - >::type type ; -}; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -namespace Kokkos { - -template< class D , class A1 , class A2 , class A3 , - class ArgType0 > -typename Impl::ViewSubview< DualView - , ArgType0 , void , void , void - , void , void , void , void - >::type -subview( const DualView & src , - const ArgType0 & arg0 ) -{ - typedef typename - Impl::ViewSubview< DualView - , ArgType0 , void , void , void - , void , void , void , void - >::type - DstViewType ; - DstViewType sub_view; - sub_view.d_view = subview(src.d_view,arg0); - sub_view.h_view = subview(src.h_view,arg0); - sub_view.modified_device = src.modified_device; - sub_view.modified_host = src.modified_host; - return sub_view; -} - - -template< class D , class A1 , class A2 , class A3 , - class ArgType0 , class ArgType1 > -typename Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , void , void - , void , void , void , void - >::type -subview( const DualView & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 ) -{ - typedef typename - Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , void , void - , void , void , void , void - >::type - DstViewType ; - DstViewType sub_view; - sub_view.d_view = subview(src.d_view,arg0,arg1); - sub_view.h_view = subview(src.h_view,arg0,arg1); - sub_view.modified_device = src.modified_device; - sub_view.modified_host = src.modified_host; - return sub_view; -} - -template< class D , class A1 , class A2 , class A3 , - class ArgType0 , class ArgType1 , class ArgType2 > -typename Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , void - , void , void , void , void - >::type -subview( const DualView & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 ) -{ - typedef typename - Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , void - , void , void , void , void - >::type - DstViewType ; - DstViewType sub_view; - sub_view.d_view = subview(src.d_view,arg0,arg1,arg2); - sub_view.h_view = subview(src.h_view,arg0,arg1,arg2); - sub_view.modified_device = src.modified_device; - sub_view.modified_host = src.modified_host; - return sub_view; -} - -template< class D , class A1 , class A2 , class A3 , - class ArgType0 , class ArgType1 , class ArgType2 , class ArgType3 > -typename Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , void , void , void , void - >::type -subview( const DualView & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 , - const ArgType3 & arg3 ) -{ - typedef typename - Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , void , void , void , void - >::type - DstViewType ; - DstViewType sub_view; - sub_view.d_view = subview(src.d_view,arg0,arg1,arg2,arg3); - sub_view.h_view = subview(src.h_view,arg0,arg1,arg2,arg3); - sub_view.modified_device = src.modified_device; - sub_view.modified_host = src.modified_host; - return sub_view; -} - -template< class D , class A1 , class A2 , class A3 , - class ArgType0 , class ArgType1 , class ArgType2 , class ArgType3 , - class ArgType4 > -typename Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , void , void , void - >::type -subview( const DualView & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 , - const ArgType3 & arg3 , - const ArgType4 & arg4 ) -{ - typedef typename - Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , void , void ,void - >::type - DstViewType ; - DstViewType sub_view; - sub_view.d_view = subview(src.d_view,arg0,arg1,arg2,arg3,arg4); - sub_view.h_view = subview(src.h_view,arg0,arg1,arg2,arg3,arg4); - sub_view.modified_device = src.modified_device; - sub_view.modified_host = src.modified_host; - return sub_view; -} - -template< class D , class A1 , class A2 , class A3 , - class ArgType0 , class ArgType1 , class ArgType2 , class ArgType3 , - class ArgType4 , class ArgType5 > -typename Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , void , void - >::type -subview( const DualView & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 , - const ArgType3 & arg3 , - const ArgType4 & arg4 , - const ArgType5 & arg5 ) -{ - typedef typename - Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , void , void - >::type - DstViewType ; - DstViewType sub_view; - sub_view.d_view = subview(src.d_view,arg0,arg1,arg2,arg3,arg4,arg5); - sub_view.h_view = subview(src.h_view,arg0,arg1,arg2,arg3,arg4,arg5); - sub_view.modified_device = src.modified_device; - sub_view.modified_host = src.modified_host; - return sub_view; -} - -template< class D , class A1 , class A2 , class A3 , - class ArgType0 , class ArgType1 , class ArgType2 , class ArgType3 , - class ArgType4 , class ArgType5 , class ArgType6 > -typename Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , ArgType6 , void - >::type -subview( const DualView & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 , - const ArgType3 & arg3 , - const ArgType4 & arg4 , - const ArgType5 & arg5 , - const ArgType6 & arg6 ) -{ - typedef typename - Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , ArgType6 , void - >::type - DstViewType ; - DstViewType sub_view; - sub_view.d_view = subview(src.d_view,arg0,arg1,arg2,arg3,arg4,arg5,arg6); - sub_view.h_view = subview(src.h_view,arg0,arg1,arg2,arg3,arg4,arg5,arg6); - sub_view.modified_device = src.modified_device; - sub_view.modified_host = src.modified_host; - return sub_view; -} - -template< class D , class A1 , class A2 , class A3 , - class ArgType0 , class ArgType1 , class ArgType2 , class ArgType3 , - class ArgType4 , class ArgType5 , class ArgType6 , class ArgType7 > -typename Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , ArgType6 , ArgType7 - >::type -subview( const DualView & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 , - const ArgType3 & arg3 , - const ArgType4 & arg4 , - const ArgType5 & arg5 , - const ArgType6 & arg6 , - const ArgType7 & arg7 ) -{ - typedef typename - Impl::ViewSubview< DualView - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , ArgType6 , ArgType7 - >::type - DstViewType ; - DstViewType sub_view; - sub_view.d_view = subview(src.d_view,arg0,arg1,arg2,arg3,arg4,arg5,arg6,arg7); - sub_view.h_view = subview(src.h_view,arg0,arg1,arg2,arg3,arg4,arg5,arg6,arg7); - sub_view.modified_device = src.modified_device; - sub_view.modified_host = src.modified_host; - return sub_view; -} - -// -// Partial specialization of Kokkos::deep_copy() for DualView objects. -// - -template< class DT , class DL , class DD , class DM , - class ST , class SL , class SD , class SM > -void -deep_copy (DualView dst, // trust me, this must not be a reference - const DualView& src ) -{ - if (src.modified_device () >= src.modified_host ()) { - deep_copy (dst.d_view, src.d_view); - dst.template modify::device_type> (); - } else { - deep_copy (dst.h_view, src.h_view); - dst.template modify::host_mirror_space> (); - } -} - -template< class ExecutionSpace , - class DT , class DL , class DD , class DM , - class ST , class SL , class SD , class SM > -void -deep_copy (const ExecutionSpace& exec , - DualView dst, // trust me, this must not be a reference - const DualView& src ) -{ - if (src.modified_device () >= src.modified_host ()) { - deep_copy (exec, dst.d_view, src.d_view); - dst.template modify::device_type> (); - } else { - deep_copy (exec, dst.h_view, src.h_view); - dst.template modify::host_mirror_space> (); - } -} - -} // namespace Kokkos - -#endif diff --git a/lib/kokkos/containers/src/Kokkos_Functional.hpp b/lib/kokkos/containers/src/Kokkos_Functional.hpp deleted file mode 100644 index 5c7350ef1c..0000000000 --- a/lib/kokkos/containers/src/Kokkos_Functional.hpp +++ /dev/null @@ -1,173 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#ifndef KOKKOS_FUNCTIONAL_HPP -#define KOKKOS_FUNCTIONAL_HPP - -#include -#include - -namespace Kokkos { - -// These should work for most types - -template -struct pod_hash -{ - typedef T argument_type; - typedef T first_argument_type; - typedef uint32_t second_argument_type; - typedef uint32_t result_type; - - KOKKOS_FORCEINLINE_FUNCTION - uint32_t operator()(T const & t) const - { return Impl::MurmurHash3_x86_32( &t, sizeof(T), 0); } - - KOKKOS_FORCEINLINE_FUNCTION - uint32_t operator()(T const & t, uint32_t seed) const - { return Impl::MurmurHash3_x86_32( &t, sizeof(T), seed); } -}; - -template -struct pod_equal_to -{ - typedef T first_argument_type; - typedef T second_argument_type; - typedef bool result_type; - - KOKKOS_FORCEINLINE_FUNCTION - bool operator()(T const & a, T const & b) const - { return Impl::bitwise_equal(&a,&b); } -}; - -template -struct pod_not_equal_to -{ - typedef T first_argument_type; - typedef T second_argument_type; - typedef bool result_type; - - KOKKOS_FORCEINLINE_FUNCTION - bool operator()(T const & a, T const & b) const - { return !Impl::bitwise_equal(&a,&b); } -}; - -template -struct equal_to -{ - typedef T first_argument_type; - typedef T second_argument_type; - typedef bool result_type; - - KOKKOS_FORCEINLINE_FUNCTION - bool operator()(T const & a, T const & b) const - { return a == b; } -}; - -template -struct not_equal_to -{ - typedef T first_argument_type; - typedef T second_argument_type; - typedef bool result_type; - - KOKKOS_FORCEINLINE_FUNCTION - bool operator()(T const & a, T const & b) const - { return a != b; } -}; - - -template -struct greater -{ - typedef T first_argument_type; - typedef T second_argument_type; - typedef bool result_type; - - KOKKOS_FORCEINLINE_FUNCTION - bool operator()(T const & a, T const & b) const - { return a > b; } -}; - - -template -struct less -{ - typedef T first_argument_type; - typedef T second_argument_type; - typedef bool result_type; - - KOKKOS_FORCEINLINE_FUNCTION - bool operator()(T const & a, T const & b) const - { return a < b; } -}; - -template -struct greater_equal -{ - typedef T first_argument_type; - typedef T second_argument_type; - typedef bool result_type; - - KOKKOS_FORCEINLINE_FUNCTION - bool operator()(T const & a, T const & b) const - { return a >= b; } -}; - - -template -struct less_equal -{ - typedef T first_argument_type; - typedef T second_argument_type; - typedef bool result_type; - - KOKKOS_FORCEINLINE_FUNCTION - bool operator()(T const & a, T const & b) const - { return a <= b; } -}; - -} // namespace Kokkos - - -#endif //KOKKOS_FUNCTIONAL_HPP - - diff --git a/lib/kokkos/containers/src/Kokkos_SegmentedView.hpp b/lib/kokkos/containers/src/Kokkos_SegmentedView.hpp deleted file mode 100644 index 3f328ba956..0000000000 --- a/lib/kokkos/containers/src/Kokkos_SegmentedView.hpp +++ /dev/null @@ -1,531 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_SEGMENTED_VIEW_HPP_ -#define KOKKOS_SEGMENTED_VIEW_HPP_ - -#include -#include -#include - -#if ! defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - -namespace Kokkos { -namespace Experimental { - -namespace Impl { - -template -struct delete_segmented_view; - -template -inline -void DeviceSetAllocatableMemorySize(size_t) {} - -#if defined( KOKKOS_HAVE_CUDA ) - -template<> -inline -void DeviceSetAllocatableMemorySize(size_t size) { -#ifdef __CUDACC__ - size_t size_limit; - cudaDeviceGetLimit(&size_limit,cudaLimitMallocHeapSize); - if(size_limit -inline -void DeviceSetAllocatableMemorySize(size_t size) { -#ifdef __CUDACC__ - size_t size_limit; - cudaDeviceGetLimit(&size_limit,cudaLimitMallocHeapSize); - if(size_limit -class SegmentedView : public Kokkos::ViewTraits< DataType , Arg1Type , Arg2Type, Arg3Type > -{ -public: - //! \name Typedefs for device types and various Kokkos::View specializations. - //@{ - typedef Kokkos::ViewTraits< DataType , Arg1Type , Arg2Type, Arg3Type > traits ; - - //! The type of a Kokkos::View on the device. - typedef Kokkos::View< typename traits::data_type , - typename traits::array_layout , - typename traits::memory_space , - Kokkos::MemoryUnmanaged > t_dev ; - - -private: - Kokkos::View segments_; - - Kokkos::View realloc_lock; - Kokkos::View nsegments_; - - size_t segment_length_; - size_t segment_length_m1_; - int max_segments_; - - int segment_length_log2; - - // Dimensions, cardinality, capacity, and offset computation for - // multidimensional array view of contiguous memory. - // Inherits from Impl::Shape - typedef Kokkos::Impl::ViewOffset< typename traits::shape_type - , typename traits::array_layout - > offset_map_type ; - - offset_map_type m_offset_map ; - - typedef Kokkos::View< typename traits::array_intrinsic_type , - typename traits::array_layout , - typename traits::memory_space , - typename traits::memory_traits > array_type ; - - typedef Kokkos::View< typename traits::const_data_type , - typename traits::array_layout , - typename traits::memory_space , - typename traits::memory_traits > const_type ; - - typedef Kokkos::View< typename traits::non_const_data_type , - typename traits::array_layout , - typename traits::memory_space , - typename traits::memory_traits > non_const_type ; - - typedef Kokkos::View< typename traits::non_const_data_type , - typename traits::array_layout , - HostSpace , - void > HostMirror ; - - template< bool Accessible > - KOKKOS_INLINE_FUNCTION - typename Kokkos::Impl::enable_if< Accessible , typename traits::size_type >::type - dimension_0_intern() const { return nsegments_() * segment_length_ ; } - - template< bool Accessible > - KOKKOS_INLINE_FUNCTION - typename Kokkos::Impl::enable_if< ! Accessible , typename traits::size_type >::type - dimension_0_intern() const - { - // In Host space - int n = 0 ; -#if ! defined( __CUDA_ARCH__ ) - Kokkos::Impl::DeepCopy< HostSpace , typename traits::memory_space >( & n , nsegments_.ptr_on_device() , sizeof(int) ); -#endif - - return n * segment_length_ ; - } - -public: - - enum { Rank = traits::rank }; - - KOKKOS_INLINE_FUNCTION offset_map_type shape() const { return m_offset_map ; } - - /* \brief return (current) size of dimension 0 */ - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_0() const { - enum { Accessible = Kokkos::Impl::VerifyExecutionCanAccessMemorySpace< - Kokkos::Impl::ActiveExecutionMemorySpace, typename traits::memory_space >::value }; - int n = SegmentedView::dimension_0_intern< Accessible >(); - return n ; - } - - /* \brief return size of dimension 1 */ - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_1() const { return m_offset_map.N1 ; } - /* \brief return size of dimension 2 */ - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_2() const { return m_offset_map.N2 ; } - /* \brief return size of dimension 3 */ - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_3() const { return m_offset_map.N3 ; } - /* \brief return size of dimension 4 */ - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_4() const { return m_offset_map.N4 ; } - /* \brief return size of dimension 5 */ - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_5() const { return m_offset_map.N5 ; } - /* \brief return size of dimension 6 */ - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_6() const { return m_offset_map.N6 ; } - /* \brief return size of dimension 7 */ - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_7() const { return m_offset_map.N7 ; } - - /* \brief return size of dimension 2 */ - KOKKOS_INLINE_FUNCTION typename traits::size_type size() const { - return dimension_0() * - m_offset_map.N1 * m_offset_map.N2 * m_offset_map.N3 * m_offset_map.N4 * - m_offset_map.N5 * m_offset_map.N6 * m_offset_map.N7 ; - } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - typename traits::size_type dimension( const iType & i ) const { - if(i==0) - return dimension_0(); - else - return Kokkos::Impl::dimension( m_offset_map , i ); - } - - KOKKOS_INLINE_FUNCTION - typename traits::size_type capacity() { - return segments_.dimension_0() * - m_offset_map.N1 * m_offset_map.N2 * m_offset_map.N3 * m_offset_map.N4 * - m_offset_map.N5 * m_offset_map.N6 * m_offset_map.N7; - } - - KOKKOS_INLINE_FUNCTION - typename traits::size_type get_num_segments() { - enum { Accessible = Kokkos::Impl::VerifyExecutionCanAccessMemorySpace< - Kokkos::Impl::ActiveExecutionMemorySpace, typename traits::memory_space >::value }; - int n = SegmentedView::dimension_0_intern< Accessible >(); - return n/segment_length_ ; - } - - KOKKOS_INLINE_FUNCTION - typename traits::size_type get_max_segments() { - return max_segments_; - } - - /// \brief Constructor that allocates View objects with an initial length of 0. - /// - /// This constructor works mostly like the analogous constructor of View. - /// The first argument is a string label, which is entirely for your - /// benefit. (Different SegmentedView objects may have the same label if - /// you like.) The second argument 'view_length' is the size of the segments. - /// This number must be a power of two. The third argument n0 is the maximum - /// value for the first dimension of the segmented view. The maximal allocatable - /// number of Segments is thus: (n0+view_length-1)/view_length. - /// The arguments that follow are the other dimensions of the (1-7) of the - /// View objects. For example, for a View with 3 runtime dimensions, - /// the first 4 integer arguments will be nonzero: - /// SegmentedView("Name",32768,10000000,8,4). This allocates a SegmentedView - /// with a maximum of 306 segments of dimension (32768,8,4). The logical size of - /// the segmented view is (n,8,4) with n between 0 and 10000000. - /// You may omit the integer arguments that follow. - template< class LabelType > - SegmentedView(const LabelType & label , - const size_t view_length , - const size_t n0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 - ): segment_length_(view_length),segment_length_m1_(view_length-1) - { - segment_length_log2 = -1; - size_t l = segment_length_; - while(l>0) { - l>>=1; - segment_length_log2++; - } - l = 1<(segment_length_*max_segments_*sizeof(typename traits::value_type)); - - segments_ = Kokkos::View(label , max_segments_); - realloc_lock = Kokkos::View("Lock"); - nsegments_ = Kokkos::View("nviews"); - m_offset_map.assign( n0, n1, n2, n3, n4, n5, n6, n7, n0*n1*n2*n3*n4*n5*n6*n7 ); - - } - - KOKKOS_INLINE_FUNCTION - SegmentedView(const SegmentedView& src): - segments_(src.segments_), - realloc_lock (src.realloc_lock), - nsegments_ (src.nsegments_), - segment_length_(src.segment_length_), - segment_length_m1_(src.segment_length_m1_), - max_segments_ (src.max_segments_), - segment_length_log2(src.segment_length_log2), - m_offset_map (src.m_offset_map) - {} - - KOKKOS_INLINE_FUNCTION - SegmentedView& operator= (const SegmentedView& src) { - segments_ = src.segments_; - realloc_lock = src.realloc_lock; - nsegments_ = src.nsegments_; - segment_length_= src.segment_length_; - segment_length_m1_= src.segment_length_m1_; - max_segments_ = src.max_segments_; - segment_length_log2= src.segment_length_log2; - m_offset_map = src.m_offset_map; - return *this; - } - - ~SegmentedView() { - if ( !segments_.tracker().ref_counting()) { return; } - size_t ref_count = segments_.tracker().ref_count(); - if(ref_count == 1u) { - Kokkos::fence(); - typename Kokkos::View::HostMirror h_nviews("h_nviews"); - Kokkos::deep_copy(h_nviews,nsegments_); - Kokkos::parallel_for(h_nviews(),Impl::delete_segmented_view(*this)); - } - } - - KOKKOS_INLINE_FUNCTION - t_dev get_segment(const int& i) const { - return segments_[i]; - } - - template< class MemberType> - KOKKOS_INLINE_FUNCTION - void grow (MemberType& team_member, const size_t& growSize) const { - if (growSize>max_segments_*segment_length_) { - printf ("Exceeding maxSize: %lu %lu\n", growSize, max_segments_*segment_length_); - return; - } - - if(team_member.team_rank()==0) { - bool too_small = growSize > segment_length_ * nsegments_(); - if (too_small) { - while(Kokkos::atomic_compare_exchange(&realloc_lock(),0,1) ) - ; // get the lock - too_small = growSize > segment_length_ * nsegments_(); // Recheck once we have the lock - if(too_small) { - while(too_small) { - const size_t alloc_size = segment_length_*m_offset_map.N1*m_offset_map.N2*m_offset_map.N3* - m_offset_map.N4*m_offset_map.N5*m_offset_map.N6*m_offset_map.N7; - typename traits::non_const_value_type* const ptr = new typename traits::non_const_value_type[alloc_size]; - - segments_(nsegments_()) = - t_dev(ptr,segment_length_,m_offset_map.N1,m_offset_map.N2,m_offset_map.N3,m_offset_map.N4,m_offset_map.N5,m_offset_map.N6,m_offset_map.N7); - nsegments_()++; - too_small = growSize > segment_length_ * nsegments_(); - } - } - realloc_lock() = 0; //release the lock - } - } - team_member.team_barrier(); - } - - KOKKOS_INLINE_FUNCTION - void grow_non_thread_safe (const size_t& growSize) const { - if (growSize>max_segments_*segment_length_) { - printf ("Exceeding maxSize: %lu %lu\n", growSize, max_segments_*segment_length_); - return; - } - bool too_small = growSize > segment_length_ * nsegments_(); - if(too_small) { - while(too_small) { - const size_t alloc_size = segment_length_*m_offset_map.N1*m_offset_map.N2*m_offset_map.N3* - m_offset_map.N4*m_offset_map.N5*m_offset_map.N6*m_offset_map.N7; - typename traits::non_const_value_type* const ptr = - new typename traits::non_const_value_type[alloc_size]; - - segments_(nsegments_()) = - t_dev (ptr, segment_length_, m_offset_map.N1, m_offset_map.N2, - m_offset_map.N3, m_offset_map.N4, m_offset_map.N5, - m_offset_map.N6, m_offset_map.N7); - nsegments_()++; - too_small = growSize > segment_length_ * nsegments_(); - } - } - } - - template< typename iType0 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( std::is_integral::value && traits::rank == 1 ) - , typename traits::value_type & - >::type - operator() ( const iType0 & i0 ) const - { - return segments_[i0>>segment_length_log2](i0&(segment_length_m1_)); - } - - template< typename iType0 , typename iType1 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( std::is_integral::value && - std::is_integral::value && - traits::rank == 2 ) - , typename traits::value_type & - >::type - operator() ( const iType0 & i0 , const iType1 & i1 ) const - { - return segments_[i0>>segment_length_log2](i0&(segment_length_m1_),i1); - } - - template< typename iType0 , typename iType1 , typename iType2 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - traits::rank == 3 ) - , typename traits::value_type & - >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 ) const - { - return segments_[i0>>segment_length_log2](i0&(segment_length_m1_),i1,i2); - } - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - traits::rank == 4 ) - , typename traits::value_type & - >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 ) const - { - return segments_[i0>>segment_length_log2](i0&(segment_length_m1_),i1,i2,i3); - } - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - traits::rank == 5 ) - , typename traits::value_type & - >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 ) const - { - return segments_[i0>>segment_length_log2](i0&(segment_length_m1_),i1,i2,i3,i4); - } - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 , typename iType5 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - traits::rank == 6 ) - , typename traits::value_type & - >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 , const iType5 & i5 ) const - { - return segments_[i0>>segment_length_log2](i0&(segment_length_m1_),i1,i2,i3,i4,i5); - } - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 , typename iType5 , typename iType6 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - traits::rank == 7 ) - , typename traits::value_type & - >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 , const iType5 & i5 , const iType6 & i6 ) const - { - return segments_[i0>>segment_length_log2](i0&(segment_length_m1_),i1,i2,i3,i4,i5,i6); - } - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 , typename iType5 , typename iType6 , typename iType7 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - traits::rank == 8 ) - , typename traits::value_type & - >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 , const iType5 & i5 , const iType6 & i6 , const iType7 & i7 ) const - { - return segments_[i0>>segment_length_log2](i0&(segment_length_m1_),i1,i2,i3,i4,i5,i6,i7); - } -}; - -namespace Impl { -template -struct delete_segmented_view { - typedef SegmentedView view_type; - typedef typename view_type::execution_space execution_space; - - view_type view_; - delete_segmented_view(view_type view):view_(view) { - } - - KOKKOS_INLINE_FUNCTION - void operator() (int i) const { - delete [] view_.get_segment(i).ptr_on_device(); - } -}; - -} -} -} - -#endif - -#endif diff --git a/lib/kokkos/containers/src/Kokkos_StaticCrsGraph.hpp b/lib/kokkos/containers/src/Kokkos_StaticCrsGraph.hpp deleted file mode 100644 index 1ce38638a2..0000000000 --- a/lib/kokkos/containers/src/Kokkos_StaticCrsGraph.hpp +++ /dev/null @@ -1,226 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_STATICCRSGRAPH_HPP -#define KOKKOS_STATICCRSGRAPH_HPP - -#include -#include - -#include - -namespace Kokkos { - -/// \class StaticCrsGraph -/// \brief Compressed row storage array. -/// -/// \tparam DataType The type of stored entries. If a StaticCrsGraph is -/// used as the graph of a sparse matrix, then this is usually an -/// integer type, the type of the column indices in the sparse -/// matrix. -/// -/// \tparam Arg1Type The second template parameter, corresponding -/// either to the Device type (if there are no more template -/// parameters) or to the Layout type (if there is at least one more -/// template parameter). -/// -/// \tparam Arg2Type The third template parameter, which if provided -/// corresponds to the Device type. -/// -/// \tparam SizeType The type of row offsets. Usually the default -/// parameter suffices. However, setting a nondefault value is -/// necessary in some cases, for example, if you want to have a -/// sparse matrices with dimensions (and therefore column indices) -/// that fit in \c int, but want to store more than INT_MAX -/// entries in the sparse matrix. -/// -/// A row has a range of entries: -///
    -///
  • row_map[i0] <= entry < row_map[i0+1]
    • -///
  • 0 <= i1 < row_map[i0+1] - row_map[i0]
    • -///
  • entries( entry , i2 , i3 , ... );
    • -///
  • entries( row_map[i0] + i1 , i2 , i3 , ... );
    • -///
-template< class DataType, - class Arg1Type, - class Arg2Type = void, - typename SizeType = typename ViewTraits::size_type> -class StaticCrsGraph { -private: - typedef ViewTraits traits; - -public: - typedef DataType data_type; - typedef typename traits::array_layout array_layout; - typedef typename traits::execution_space execution_space; - typedef typename traits::device_type device_type; - typedef SizeType size_type; - - typedef StaticCrsGraph< DataType , Arg1Type , Arg2Type , SizeType > staticcrsgraph_type; - typedef StaticCrsGraph< DataType , array_layout , typename traits::host_mirror_space , SizeType > HostMirror; - typedef View< const size_type* , array_layout, device_type > row_map_type; - typedef View< DataType* , array_layout, device_type > entries_type; - - entries_type entries; - row_map_type row_map; - - //! Construct an empty view. - StaticCrsGraph () : entries(), row_map() {} - - //! Copy constructor (shallow copy). - StaticCrsGraph (const StaticCrsGraph& rhs) : entries (rhs.entries), row_map (rhs.row_map) - {} - - template - StaticCrsGraph (const EntriesType& entries_,const RowMapType& row_map_) : entries (entries_), row_map (row_map_) - {} - - /** \brief Assign to a view of the rhs array. - * If the old view is the last view - * then allocated memory is deallocated. - */ - StaticCrsGraph& operator= (const StaticCrsGraph& rhs) { - entries = rhs.entries; - row_map = rhs.row_map; - return *this; - } - - /** \brief Destroy this view of the array. - * If the last view then allocated memory is deallocated. - */ - ~StaticCrsGraph() {} - - KOKKOS_INLINE_FUNCTION - size_type numRows() const { - return (row_map.dimension_0 () != 0) ? - row_map.dimension_0 () - static_cast (1) : - static_cast (0); - } -}; - -//---------------------------------------------------------------------------- - -template< class StaticCrsGraphType , class InputSizeType > -typename StaticCrsGraphType::staticcrsgraph_type -create_staticcrsgraph( const std::string & label , - const std::vector< InputSizeType > & input ); - -template< class StaticCrsGraphType , class InputSizeType > -typename StaticCrsGraphType::staticcrsgraph_type -create_staticcrsgraph( const std::string & label , - const std::vector< std::vector< InputSizeType > > & input ); - -//---------------------------------------------------------------------------- - -template< class DataType , - class Arg1Type , - class Arg2Type , - typename SizeType > -typename StaticCrsGraph< DataType , Arg1Type , Arg2Type , SizeType >::HostMirror -create_mirror_view( const StaticCrsGraph & input ); - -template< class DataType , - class Arg1Type , - class Arg2Type , - typename SizeType > -typename StaticCrsGraph< DataType , Arg1Type , Arg2Type , SizeType >::HostMirror -create_mirror( const StaticCrsGraph & input ); - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class GraphType > -struct StaticCrsGraphMaximumEntry { - - typedef typename GraphType::execution_space execution_space ; - typedef typename GraphType::data_type value_type ; - - const typename GraphType::entries_type entries ; - - StaticCrsGraphMaximumEntry( const GraphType & graph ) : entries( graph.entries ) {} - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned i , value_type & update ) const - { if ( update < entries(i) ) update = entries(i); } - - KOKKOS_INLINE_FUNCTION - void init( value_type & update ) const - { update = 0 ; } - - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & update , - volatile const value_type & input ) const - { if ( update < input ) update = input ; } -}; - -} - -template< class DataType, class Arg1Type, class Arg2Type, typename SizeType > -DataType maximum_entry( const StaticCrsGraph< DataType , Arg1Type , Arg2Type , SizeType > & graph ) -{ - typedef StaticCrsGraph GraphType ; - typedef Impl::StaticCrsGraphMaximumEntry< GraphType > FunctorType ; - - DataType result = 0 ; - Kokkos::parallel_reduce( graph.entries.dimension_0(), - FunctorType(graph), result ); - return result ; -} - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_CRSARRAY_HPP */ - diff --git a/lib/kokkos/containers/src/Kokkos_UnorderedMap.hpp b/lib/kokkos/containers/src/Kokkos_UnorderedMap.hpp deleted file mode 100644 index 7a916c6ef7..0000000000 --- a/lib/kokkos/containers/src/Kokkos_UnorderedMap.hpp +++ /dev/null @@ -1,848 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -/// \file Kokkos_UnorderedMap.hpp -/// \brief Declaration and definition of Kokkos::UnorderedMap. -/// -/// This header file declares and defines Kokkos::UnorderedMap and its -/// related nonmember functions. - -#ifndef KOKKOS_UNORDERED_MAP_HPP -#define KOKKOS_UNORDERED_MAP_HPP - -#include -#include - -#include - -#include -#include - - -#include - -#include -#include - - -namespace Kokkos { - -enum { UnorderedMapInvalidIndex = ~0u }; - -/// \brief First element of the return value of UnorderedMap::insert(). -/// -/// Inserting an element into an UnorderedMap is not guaranteed to -/// succeed. There are three possible conditions: -///
    -///
  1. INSERT_FAILED: The insert failed. This usually -/// means that the UnorderedMap ran out of space.
    2. -///
  2. INSERT_SUCCESS: The insert succeeded, and the key -/// did not exist in the table before.
    3. -///
  3. INSERT_EXISTING: The insert succeeded, and the key -/// did exist in the table before. The new value was -/// ignored and the old value was left in place.
    4. -///
- -class UnorderedMapInsertResult -{ -private: - enum Status{ - SUCCESS = 1u << 31 - , EXISTING = 1u << 30 - , FREED_EXISTING = 1u << 29 - , LIST_LENGTH_MASK = ~(SUCCESS | EXISTING | FREED_EXISTING) - }; - -public: - /// Did the map successful insert the key/value pair - KOKKOS_FORCEINLINE_FUNCTION - bool success() const { return (m_status & SUCCESS); } - - /// Was the key already present in the map - KOKKOS_FORCEINLINE_FUNCTION - bool existing() const { return (m_status & EXISTING); } - - /// Did the map fail to insert the key due to insufficent capacity - KOKKOS_FORCEINLINE_FUNCTION - bool failed() const { return m_index == UnorderedMapInvalidIndex; } - - /// Did the map lose a race condition to insert a dupulicate key/value pair - /// where an index was claimed that needed to be released - KOKKOS_FORCEINLINE_FUNCTION - bool freed_existing() const { return (m_status & FREED_EXISTING); } - - /// How many iterations through the insert loop did it take before the - /// map returned - KOKKOS_FORCEINLINE_FUNCTION - uint32_t list_position() const { return (m_status & LIST_LENGTH_MASK); } - - /// Index where the key can be found as long as the insert did not fail - KOKKOS_FORCEINLINE_FUNCTION - uint32_t index() const { return m_index; } - - KOKKOS_FORCEINLINE_FUNCTION - UnorderedMapInsertResult() - : m_index(UnorderedMapInvalidIndex) - , m_status(0) - {} - - KOKKOS_FORCEINLINE_FUNCTION - void increment_list_position() - { - m_status += (list_position() < LIST_LENGTH_MASK) ? 1u : 0u; - } - - KOKKOS_FORCEINLINE_FUNCTION - void set_existing(uint32_t i, bool arg_freed_existing) - { - m_index = i; - m_status = EXISTING | (arg_freed_existing ? FREED_EXISTING : 0u) | list_position(); - } - - KOKKOS_FORCEINLINE_FUNCTION - void set_success(uint32_t i) - { - m_index = i; - m_status = SUCCESS | list_position(); - } - -private: - uint32_t m_index; - uint32_t m_status; -}; - -/// \class UnorderedMap -/// \brief Thread-safe, performance-portable lookup table. -/// -/// This class provides a lookup table. In terms of functionality, -/// this class compares to std::unordered_map (new in C++11). -/// "Unordered" means that keys are not stored in any particular -/// order, unlike (for example) std::map. "Thread-safe" means that -/// lookups, insertion, and deletion are safe to call by multiple -/// threads in parallel. "Performance-portable" means that parallel -/// performance of these operations is reasonable, on multiple -/// hardware platforms. Platforms on which performance has been -/// tested include conventional Intel x86 multicore processors, Intel -/// Xeon Phi ("MIC"), and NVIDIA GPUs. -/// -/// Parallel performance portability entails design decisions that -/// might differ from one's expectation for a sequential interface. -/// This particularly affects insertion of single elements. In an -/// interface intended for sequential use, insertion might reallocate -/// memory if the original allocation did not suffice to hold the new -/// element. In this class, insertion does not reallocate -/// memory. This means that it might fail. insert() returns an enum -/// which indicates whether the insert failed. There are three -/// possible conditions: -///
    -///
  1. INSERT_FAILED: The insert failed. This usually -/// means that the UnorderedMap ran out of space.
    2. -///
  2. INSERT_SUCCESS: The insert succeeded, and the key -/// did not exist in the table before.
    3. -///
  3. INSERT_EXISTING: The insert succeeded, and the key -/// did exist in the table before. The new value was -/// ignored and the old value was left in place.
    4. -///
-/// -/// \tparam Key Type of keys of the lookup table. If \c const, users -/// are not allowed to add or remove keys, though they are allowed -/// to change values. In that case, the implementation may make -/// optimizations specific to the Device. For example, if -/// Device is \c Cuda, it may use texture fetches to access -/// keys. -/// -/// \tparam Value Type of values stored in the lookup table. You may use -/// \c void here, in which case the table will be a set of keys. If -/// \c const, users are not allowed to change entries. -/// In that case, the implementation may make -/// optimizations specific to the \c Device, such as using texture -/// fetches to access values. -/// -/// \tparam Device The Kokkos Device type. -/// -/// \tparam Hasher Definition of the hash function for instances of -/// Key. The default will calculate a bitwise hash. -/// -/// \tparam EqualTo Definition of the equality function for instances of -/// Key. The default will do a bitwise equality comparison. -/// -template < typename Key - , typename Value - , typename Device = Kokkos::DefaultExecutionSpace - , typename Hasher = pod_hash::type> - , typename EqualTo = pod_equal_to::type> - > -class UnorderedMap -{ -private: - typedef typename ViewTraits::host_mirror_space host_mirror_space ; -public: - //! \name Public types and constants - //@{ - - //key_types - typedef Key declared_key_type; - typedef typename Impl::remove_const::type key_type; - typedef typename Impl::add_const::type const_key_type; - - //value_types - typedef Value declared_value_type; - typedef typename Impl::remove_const::type value_type; - typedef typename Impl::add_const::type const_value_type; - - typedef Device execution_space; - typedef Hasher hasher_type; - typedef EqualTo equal_to_type; - typedef uint32_t size_type; - - //map_types - typedef UnorderedMap declared_map_type; - typedef UnorderedMap insertable_map_type; - typedef UnorderedMap modifiable_map_type; - typedef UnorderedMap const_map_type; - - static const bool is_set = Impl::is_same::value; - static const bool has_const_key = Impl::is_same::value; - static const bool has_const_value = is_set || Impl::is_same::value; - - static const bool is_insertable_map = !has_const_key && (is_set || !has_const_value); - static const bool is_modifiable_map = has_const_key && !has_const_value; - static const bool is_const_map = has_const_key && has_const_value; - - - typedef UnorderedMapInsertResult insert_result; - - typedef UnorderedMap HostMirror; - - typedef Impl::UnorderedMapHistogram histogram_type; - - //@} - -private: - enum { invalid_index = ~static_cast(0) }; - - typedef typename Impl::if_c< is_set, int, declared_value_type>::type impl_value_type; - - typedef typename Impl::if_c< is_insertable_map - , View< key_type *, execution_space> - , View< const key_type *, execution_space, MemoryTraits > - >::type key_type_view; - - typedef typename Impl::if_c< is_insertable_map || is_modifiable_map - , View< impl_value_type *, execution_space> - , View< const impl_value_type *, execution_space, MemoryTraits > - >::type value_type_view; - - typedef typename Impl::if_c< is_insertable_map - , View< size_type *, execution_space> - , View< const size_type *, execution_space, MemoryTraits > - >::type size_type_view; - - typedef typename Impl::if_c< is_insertable_map - , Bitset< execution_space > - , ConstBitset< execution_space> - >::type bitset_type; - - enum { modified_idx = 0, erasable_idx = 1, failed_insert_idx = 2 }; - enum { num_scalars = 3 }; - typedef View< int[num_scalars], LayoutLeft, execution_space> scalars_view; - -public: - //! \name Public member functions - //@{ - - UnorderedMap() - : m_bounded_insert() - , m_hasher() - , m_equal_to() - , m_size() - , m_available_indexes() - , m_hash_lists() - , m_next_index() - , m_keys() - , m_values() - , m_scalars() - {} - - /// \brief Constructor - /// - /// \param capacity_hint [in] Initial guess of how many unique keys will be inserted into the map - /// \param hash [in] Hasher function for \c Key instances. The - /// default value usually suffices. - UnorderedMap( size_type capacity_hint, hasher_type hasher = hasher_type(), equal_to_type equal_to = equal_to_type() ) - : m_bounded_insert(true) - , m_hasher(hasher) - , m_equal_to(equal_to) - , m_size() - , m_available_indexes(calculate_capacity(capacity_hint)) - , m_hash_lists(ViewAllocateWithoutInitializing("UnorderedMap hash list"), Impl::find_hash_size(capacity())) - , m_next_index(ViewAllocateWithoutInitializing("UnorderedMap next index"), capacity()+1) // +1 so that the *_at functions can always return a valid reference - , m_keys("UnorderedMap keys",capacity()+1) - , m_values("UnorderedMap values",(is_set? 1 : capacity()+1)) - , m_scalars("UnorderedMap scalars") - { - if (!is_insertable_map) { - throw std::runtime_error("Cannot construct a non-insertable (i.e. const key_type) unordered_map"); - } - - Kokkos::deep_copy(m_hash_lists, invalid_index); - Kokkos::deep_copy(m_next_index, invalid_index); - } - - void reset_failed_insert_flag() - { - reset_flag(failed_insert_idx); - } - - histogram_type get_histogram() - { - return histogram_type(*this); - } - - //! Clear all entries in the table. - void clear() - { - m_bounded_insert = true; - - if (capacity() == 0) return; - - m_available_indexes.clear(); - - Kokkos::deep_copy(m_hash_lists, invalid_index); - Kokkos::deep_copy(m_next_index, invalid_index); - { - const key_type tmp = key_type(); - Kokkos::deep_copy(m_keys,tmp); - } - if (is_set){ - const impl_value_type tmp = impl_value_type(); - Kokkos::deep_copy(m_values,tmp); - } - { - Kokkos::deep_copy(m_scalars, 0); - } - } - - /// \brief Change the capacity of the the map - /// - /// If there are no failed inserts the current size of the map will - /// be used as a lower bound for the input capacity. - /// If the map is not empty and does not have failed inserts - /// and the capacity changes then the current data is copied - /// into the resized / rehashed map. - /// - /// This is not a device function; it may not be - /// called in a parallel kernel. - bool rehash(size_type requested_capacity = 0) - { - const bool bounded_insert = (capacity() == 0) || (size() == 0u); - return rehash(requested_capacity, bounded_insert ); - } - - bool rehash(size_type requested_capacity, bool bounded_insert) - { - if(!is_insertable_map) return false; - - const size_type curr_size = size(); - requested_capacity = (requested_capacity < curr_size) ? curr_size : requested_capacity; - - insertable_map_type tmp(requested_capacity, m_hasher, m_equal_to); - - if (curr_size) { - tmp.m_bounded_insert = false; - Impl::UnorderedMapRehash f(tmp,*this); - f.apply(); - } - tmp.m_bounded_insert = bounded_insert; - - *this = tmp; - - return true; - } - - /// \brief The number of entries in the table. - /// - /// This method has undefined behavior when erasable() is true. - /// - /// Note that this is not a device function; it cannot be called in - /// a parallel kernel. The value is not stored as a variable; it - /// must be computed. - size_type size() const - { - if( capacity() == 0u ) return 0u; - if (modified()) { - m_size = m_available_indexes.count(); - reset_flag(modified_idx); - } - return m_size; - } - - /// \brief The current number of failed insert() calls. - /// - /// This is not a device function; it may not be - /// called in a parallel kernel. The value is not stored as a - /// variable; it must be computed. - bool failed_insert() const - { - return get_flag(failed_insert_idx); - } - - bool erasable() const - { - return is_insertable_map ? get_flag(erasable_idx) : false; - } - - bool begin_erase() - { - bool result = !erasable(); - if (is_insertable_map && result) { - execution_space::fence(); - set_flag(erasable_idx); - execution_space::fence(); - } - return result; - } - - bool end_erase() - { - bool result = erasable(); - if (is_insertable_map && result) { - execution_space::fence(); - Impl::UnorderedMapErase f(*this); - f.apply(); - execution_space::fence(); - reset_flag(erasable_idx); - } - return result; - } - - /// \brief The maximum number of entries that the table can hold. - /// - /// This is a device function; it may be called in a parallel - /// kernel. - KOKKOS_FORCEINLINE_FUNCTION - size_type capacity() const - { return m_available_indexes.size(); } - - /// \brief The number of hash table "buckets." - /// - /// This is different than the number of entries that the table can - /// hold. Each key hashes to an index in [0, hash_capacity() - 1]. - /// That index can hold zero or more entries. This class decides - /// what hash_capacity() should be, given the user's upper bound on - /// the number of entries the table must be able to hold. - /// - /// This is a device function; it may be called in a parallel - /// kernel. - KOKKOS_INLINE_FUNCTION - size_type hash_capacity() const - { return m_hash_lists.dimension_0(); } - - //--------------------------------------------------------------------------- - //--------------------------------------------------------------------------- - - - /// This is a device function; it may be called in a parallel - /// kernel. As discussed in the class documentation, it need not - /// succeed. The return value tells you if it did. - /// - /// \param k [in] The key to attempt to insert. - /// \param v [in] The corresponding value to attempt to insert. If - /// using this class as a set (with Value = void), then you need not - /// provide this value. - KOKKOS_INLINE_FUNCTION - insert_result insert(key_type const& k, impl_value_type const&v = impl_value_type()) const - { - insert_result result; - - if ( !is_insertable_map || capacity() == 0u || m_scalars((int)erasable_idx) ) { - return result; - } - - if ( !m_scalars((int)modified_idx) ) { - m_scalars((int)modified_idx) = true; - } - - int volatile & failed_insert_ref = m_scalars((int)failed_insert_idx) ; - - const size_type hash_value = m_hasher(k); - const size_type hash_list = hash_value % m_hash_lists.dimension_0(); - - size_type * curr_ptr = & m_hash_lists[ hash_list ]; - size_type new_index = invalid_index ; - - // Force integer multiply to long - size_type index_hint = static_cast( (static_cast(hash_list) * capacity()) / m_hash_lists.dimension_0()); - - size_type find_attempts = 0; - - enum { bounded_find_attempts = 32u }; - const size_type max_attempts = (m_bounded_insert && (bounded_find_attempts < m_available_indexes.max_hint()) ) ? - bounded_find_attempts : - m_available_indexes.max_hint(); - - bool not_done = true ; - -#if defined( __MIC__ ) - #pragma noprefetch -#endif - while ( not_done ) { - - // Continue searching the unordered list for this key, - // list will only be appended during insert phase. - // Need volatile_load as other threads may be appending. - size_type curr = volatile_load(curr_ptr); - - KOKKOS_NONTEMPORAL_PREFETCH_LOAD(&m_keys[curr != invalid_index ? curr : 0]); -#if defined( __MIC__ ) - #pragma noprefetch -#endif - while ( curr != invalid_index && ! m_equal_to( volatile_load(&m_keys[curr]), k) ) { - result.increment_list_position(); - index_hint = curr; - curr_ptr = &m_next_index[curr]; - curr = volatile_load(curr_ptr); - KOKKOS_NONTEMPORAL_PREFETCH_LOAD(&m_keys[curr != invalid_index ? curr : 0]); - } - - //------------------------------------------------------------ - // If key already present then return that index. - if ( curr != invalid_index ) { - - const bool free_existing = new_index != invalid_index; - if ( free_existing ) { - // Previously claimed an unused entry that was not inserted. - // Release this unused entry immediately. - if (!m_available_indexes.reset(new_index) ) { - printf("Unable to free existing\n"); - } - - } - - result.set_existing(curr, free_existing); - not_done = false ; - } - //------------------------------------------------------------ - // Key is not currently in the map. - // If the thread has claimed an entry try to insert now. - else { - - //------------------------------------------------------------ - // If have not already claimed an unused entry then do so now. - if (new_index == invalid_index) { - - bool found = false; - // use the hash_list as the flag for the search direction - Kokkos::tie(found, index_hint) = m_available_indexes.find_any_unset_near( index_hint, hash_list ); - - // found and index and this thread set it - if ( !found && ++find_attempts >= max_attempts ) { - failed_insert_ref = true; - not_done = false ; - } - else if (m_available_indexes.set(index_hint) ) { - new_index = index_hint; - // Set key and value - KOKKOS_NONTEMPORAL_PREFETCH_STORE(&m_keys[new_index]); - m_keys[new_index] = k ; - - if (!is_set) { - KOKKOS_NONTEMPORAL_PREFETCH_STORE(&m_values[new_index]); - m_values[new_index] = v ; - } - - // Do not proceed until key and value are updated in global memory - memory_fence(); - } - } - else if (failed_insert_ref) { - not_done = false; - } - - // Attempt to append claimed entry into the list. - // Another thread may also be trying to append the same list so protect with atomic. - if ( new_index != invalid_index && - curr == atomic_compare_exchange(curr_ptr, static_cast(invalid_index), new_index) ) { - // Succeeded in appending - result.set_success(new_index); - not_done = false ; - } - } - } // while ( not_done ) - - return result ; - } - - KOKKOS_INLINE_FUNCTION - bool erase(key_type const& k) const - { - bool result = false; - - if(is_insertable_map && 0u < capacity() && m_scalars((int)erasable_idx)) { - - if ( ! m_scalars((int)modified_idx) ) { - m_scalars((int)modified_idx) = true; - } - - size_type index = find(k); - if (valid_at(index)) { - m_available_indexes.reset(index); - result = true; - } - } - - return result; - } - - /// \brief Find the given key \c k, if it exists in the table. - /// - /// \return If the key exists in the table, the index of the - /// value corresponding to that key; otherwise, an invalid index. - /// - /// This is a device function; it may be called in a parallel - /// kernel. - KOKKOS_INLINE_FUNCTION - size_type find( const key_type & k) const - { - size_type curr = 0u < capacity() ? m_hash_lists( m_hasher(k) % m_hash_lists.dimension_0() ) : invalid_index ; - - KOKKOS_NONTEMPORAL_PREFETCH_LOAD(&m_keys[curr != invalid_index ? curr : 0]); - while (curr != invalid_index && !m_equal_to( m_keys[curr], k) ) { - KOKKOS_NONTEMPORAL_PREFETCH_LOAD(&m_keys[curr != invalid_index ? curr : 0]); - curr = m_next_index[curr]; - } - - return curr; - } - - /// \brief Does the key exist in the map - /// - /// This is a device function; it may be called in a parallel - /// kernel. - KOKKOS_INLINE_FUNCTION - bool exists( const key_type & k) const - { - return valid_at(find(k)); - } - - - /// \brief Get the value with \c i as its direct index. - /// - /// \param i [in] Index directly into the array of entries. - /// - /// This is a device function; it may be called in a parallel - /// kernel. - /// - /// 'const value_type' via Cuda texture fetch must return by value. - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::if_c< (is_set || has_const_value), impl_value_type, impl_value_type &>::type - value_at(size_type i) const - { - return m_values[ is_set ? 0 : (i < capacity() ? i : capacity()) ]; - } - - /// \brief Get the key with \c i as its direct index. - /// - /// \param i [in] Index directly into the array of entries. - /// - /// This is a device function; it may be called in a parallel - /// kernel. - KOKKOS_FORCEINLINE_FUNCTION - key_type key_at(size_type i) const - { - return m_keys[ i < capacity() ? i : capacity() ]; - } - - KOKKOS_FORCEINLINE_FUNCTION - bool valid_at(size_type i) const - { - return m_available_indexes.test(i); - } - - template - UnorderedMap( UnorderedMap const& src, - typename Impl::enable_if< Impl::UnorderedMapCanAssign::value,int>::type = 0 - ) - : m_bounded_insert(src.m_bounded_insert) - , m_hasher(src.m_hasher) - , m_equal_to(src.m_equal_to) - , m_size(src.m_size) - , m_available_indexes(src.m_available_indexes) - , m_hash_lists(src.m_hash_lists) - , m_next_index(src.m_next_index) - , m_keys(src.m_keys) - , m_values(src.m_values) - , m_scalars(src.m_scalars) - {} - - - template - typename Impl::enable_if< Impl::UnorderedMapCanAssign::value - ,declared_map_type & >::type - operator=( UnorderedMap const& src) - { - m_bounded_insert = src.m_bounded_insert; - m_hasher = src.m_hasher; - m_equal_to = src.m_equal_to; - m_size = src.m_size; - m_available_indexes = src.m_available_indexes; - m_hash_lists = src.m_hash_lists; - m_next_index = src.m_next_index; - m_keys = src.m_keys; - m_values = src.m_values; - m_scalars = src.m_scalars; - return *this; - } - - template - typename Impl::enable_if< Impl::is_same< typename Impl::remove_const::type, key_type>::value && - Impl::is_same< typename Impl::remove_const::type, value_type>::value - >::type - create_copy_view( UnorderedMap const& src) - { - if (m_hash_lists.ptr_on_device() != src.m_hash_lists.ptr_on_device()) { - - insertable_map_type tmp; - - tmp.m_bounded_insert = src.m_bounded_insert; - tmp.m_hasher = src.m_hasher; - tmp.m_equal_to = src.m_equal_to; - tmp.m_size = src.size(); - tmp.m_available_indexes = bitset_type( src.capacity() ); - tmp.m_hash_lists = size_type_view( ViewAllocateWithoutInitializing("UnorderedMap hash list"), src.m_hash_lists.dimension_0() ); - tmp.m_next_index = size_type_view( ViewAllocateWithoutInitializing("UnorderedMap next index"), src.m_next_index.dimension_0() ); - tmp.m_keys = key_type_view( ViewAllocateWithoutInitializing("UnorderedMap keys"), src.m_keys.dimension_0() ); - tmp.m_values = value_type_view( ViewAllocateWithoutInitializing("UnorderedMap values"), src.m_values.dimension_0() ); - tmp.m_scalars = scalars_view("UnorderedMap scalars"); - - Kokkos::deep_copy(tmp.m_available_indexes, src.m_available_indexes); - - typedef Kokkos::Impl::DeepCopy< typename execution_space::memory_space, typename SDevice::memory_space > raw_deep_copy; - - raw_deep_copy(tmp.m_hash_lists.ptr_on_device(), src.m_hash_lists.ptr_on_device(), sizeof(size_type)*src.m_hash_lists.dimension_0()); - raw_deep_copy(tmp.m_next_index.ptr_on_device(), src.m_next_index.ptr_on_device(), sizeof(size_type)*src.m_next_index.dimension_0()); - raw_deep_copy(tmp.m_keys.ptr_on_device(), src.m_keys.ptr_on_device(), sizeof(key_type)*src.m_keys.dimension_0()); - if (!is_set) { - raw_deep_copy(tmp.m_values.ptr_on_device(), src.m_values.ptr_on_device(), sizeof(impl_value_type)*src.m_values.dimension_0()); - } - raw_deep_copy(tmp.m_scalars.ptr_on_device(), src.m_scalars.ptr_on_device(), sizeof(int)*num_scalars ); - - *this = tmp; - } - } - - //@} -private: // private member functions - - bool modified() const - { - return get_flag(modified_idx); - } - - void set_flag(int flag) const - { - typedef Kokkos::Impl::DeepCopy< typename execution_space::memory_space, Kokkos::HostSpace > raw_deep_copy; - const int true_ = true; - raw_deep_copy(m_scalars.ptr_on_device() + flag, &true_, sizeof(int)); - } - - void reset_flag(int flag) const - { - typedef Kokkos::Impl::DeepCopy< typename execution_space::memory_space, Kokkos::HostSpace > raw_deep_copy; - const int false_ = false; - raw_deep_copy(m_scalars.ptr_on_device() + flag, &false_, sizeof(int)); - } - - bool get_flag(int flag) const - { - typedef Kokkos::Impl::DeepCopy< Kokkos::HostSpace, typename execution_space::memory_space > raw_deep_copy; - int result = false; - raw_deep_copy(&result, m_scalars.ptr_on_device() + flag, sizeof(int)); - return result; - } - - static uint32_t calculate_capacity(uint32_t capacity_hint) - { - // increase by 16% and round to nears multiple of 128 - return capacity_hint ? ((static_cast(7ull*capacity_hint/6u) + 127u)/128u)*128u : 128u; - } - -private: // private members - bool m_bounded_insert; - hasher_type m_hasher; - equal_to_type m_equal_to; - mutable size_type m_size; - bitset_type m_available_indexes; - size_type_view m_hash_lists; - size_type_view m_next_index; - key_type_view m_keys; - value_type_view m_values; - scalars_view m_scalars; - - template - friend class UnorderedMap; - - template - friend struct Impl::UnorderedMapErase; - - template - friend struct Impl::UnorderedMapHistogram; - - template - friend struct Impl::UnorderedMapPrint; -}; - -// Specialization of deep_copy for two UnorderedMap objects. -template < typename DKey, typename DT, typename DDevice - , typename SKey, typename ST, typename SDevice - , typename Hasher, typename EqualTo > -inline void deep_copy( UnorderedMap & dst - , const UnorderedMap & src ) -{ - dst.create_copy_view(src); -} - - -} // namespace Kokkos - -#endif //KOKKOS_UNORDERED_MAP_HPP diff --git a/lib/kokkos/containers/src/Kokkos_Vector.hpp b/lib/kokkos/containers/src/Kokkos_Vector.hpp deleted file mode 100644 index db54b0c350..0000000000 --- a/lib/kokkos/containers/src/Kokkos_Vector.hpp +++ /dev/null @@ -1,287 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_VECTOR_HPP -#define KOKKOS_VECTOR_HPP - -#include -#include - -/* Drop in replacement for std::vector based on Kokkos::DualView - * Most functions only work on the host (it will not compile if called from device kernel) - * - */ - namespace Kokkos { - -template -class vector : public DualView { -public: - typedef typename Space::memory_space memory_space; - typedef typename Space::execution_space execution_space; - typedef typename Kokkos::Device device_type; - - typedef Scalar value_type; - typedef Scalar* pointer; - typedef const Scalar* const_pointer; - typedef Scalar* reference; - typedef const Scalar* const_reference; - typedef Scalar* iterator; - typedef const Scalar* const_iterator; - -private: - size_t _size; - typedef size_t size_type; - float _extra_storage; - typedef DualView DV; - - -public: -#ifdef KOKKOS_CUDA_USE_UVM - KOKKOS_INLINE_FUNCTION Scalar& operator() (int i) const {return DV::h_view(i);}; - KOKKOS_INLINE_FUNCTION Scalar& operator[] (int i) const {return DV::h_view(i);}; -#else - inline Scalar& operator() (int i) const {return DV::h_view(i);}; - inline Scalar& operator[] (int i) const {return DV::h_view(i);}; -#endif - - /* Member functions which behave like std::vector functions */ - - vector():DV() { - _size = 0; - _extra_storage = 1.1; - DV::modified_host() = 1; - }; - - - vector(int n, Scalar val=Scalar()):DualView("Vector",size_t(n*(1.1))) { - _size = n; - _extra_storage = 1.1; - DV::modified_host() = 1; - - assign(n,val); - } - - - void resize(size_t n) { - if(n>=capacity()) - DV::resize(size_t (n*_extra_storage)); - _size = n; - } - - void resize(size_t n, const Scalar& val) { - assign(n,val); - } - - void assign (size_t n, const Scalar& val) { - - /* Resize if necessary (behavour of std:vector) */ - - if(n>capacity()) - DV::resize(size_t (n*_extra_storage)); - _size = n; - - /* Assign value either on host or on device */ - - if( DV::modified_host() >= DV::modified_device() ) { - set_functor_host f(DV::h_view,val); - parallel_for(n,f); - DV::t_host::execution_space::fence(); - DV::modified_host()++; - } else { - set_functor f(DV::d_view,val); - parallel_for(n,f); - DV::t_dev::execution_space::fence(); - DV::modified_device()++; - } - } - - void reserve(size_t n) { - DV::resize(size_t (n*_extra_storage)); - } - - void push_back(Scalar val) { - DV::modified_host()++; - if(_size == capacity()) { - size_t new_size = _size*_extra_storage; - if(new_size == _size) new_size++; - DV::resize(new_size); - } - - DV::h_view(_size) = val; - _size++; - - }; - - void pop_back() { - _size--; - }; - - void clear() { - _size = 0; - } - - size_type size() const {return _size;}; - size_type max_size() const {return 2000000000;} - size_type capacity() const {return DV::capacity();}; - bool empty() const {return _size==0;}; - - iterator begin() const {return &DV::h_view(0);}; - - iterator end() const {return &DV::h_view(_size);}; - - - /* std::algorithms wich work originally with iterators, here they are implemented as member functions */ - - size_t - lower_bound (const size_t& start, - const size_t& theEnd, - const Scalar& comp_val) const - { - int lower = start; // FIXME (mfh 24 Apr 2014) narrowing conversion - int upper = _size > theEnd? theEnd : _size-1; // FIXME (mfh 24 Apr 2014) narrowing conversion - if (upper <= lower) { - return theEnd; - } - - Scalar lower_val = DV::h_view(lower); - Scalar upper_val = DV::h_view(upper); - size_t idx = (upper+lower)/2; - Scalar val = DV::h_view(idx); - if(val>upper_val) return upper; - if(vallower) { - if(comp_val>val) { - lower = ++idx; - } else { - upper = idx; - } - idx = (upper+lower)/2; - val = DV::h_view(idx); - } - return idx; - } - - bool is_sorted() { - for(int i=0;i<_size-1;i++) { - if(DV::h_view(i)>DV::h_view(i+1)) return false; - } - return true; - } - - iterator find(Scalar val) const { - if(_size == 0) return end(); - - int upper,lower,current; - current = _size/2; - upper = _size-1; - lower = 0; - - if((valDV::h_view(_size-1)) ) return end(); - - while(upper>lower) - { - if(val>DV::h_view(current)) lower = current+1; - else upper = current; - current = (upper+lower)/2; - } - - if(val==DV::h_view(current)) return &DV::h_view(current); - else return end(); - } - - /* Additional functions for data management */ - - void device_to_host(){ - deep_copy(DV::h_view,DV::d_view); - } - void host_to_device() const { - deep_copy(DV::d_view,DV::h_view); - } - - void on_host() { - DV::modified_host() = DV::modified_device() + 1; - } - void on_device() { - DV::modified_device() = DV::modified_host() + 1; - } - - void set_overallocation(float extra) { - _extra_storage = 1.0 + extra; - } - - -public: - struct set_functor { - typedef typename DV::t_dev::execution_space execution_space; - typename DV::t_dev _data; - Scalar _val; - - set_functor(typename DV::t_dev data, Scalar val) : - _data(data),_val(val) {} - - KOKKOS_INLINE_FUNCTION - void operator() (const int &i) const { - _data(i) = _val; - } - }; - - struct set_functor_host { - typedef typename DV::t_host::execution_space execution_space; - typename DV::t_host _data; - Scalar _val; - - set_functor_host(typename DV::t_host data, Scalar val) : - _data(data),_val(val) {} - - KOKKOS_INLINE_FUNCTION - void operator() (const int &i) const { - _data(i) = _val; - } - }; - -}; - - -} -#endif diff --git a/lib/kokkos/containers/src/impl/Kokkos_Bitset_impl.hpp b/lib/kokkos/containers/src/impl/Kokkos_Bitset_impl.hpp deleted file mode 100644 index 7de290e711..0000000000 --- a/lib/kokkos/containers/src/impl/Kokkos_Bitset_impl.hpp +++ /dev/null @@ -1,173 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_BITSET_IMPL_HPP -#define KOKKOS_BITSET_IMPL_HPP - -#include -#include - -#include -#include -#include -#include - -namespace Kokkos { namespace Impl { - -KOKKOS_FORCEINLINE_FUNCTION -unsigned rotate_right(unsigned i, int r) -{ - enum { size = static_cast(sizeof(unsigned)*CHAR_BIT) }; - return r ? ((i >> r) | (i << (size-r))) : i ; -} - -KOKKOS_FORCEINLINE_FUNCTION -int bit_scan_forward(unsigned i) -{ -#if defined( __CUDA_ARCH__ ) - return __ffs(i) - 1; -#elif defined( __GNUC__ ) || defined( __GNUG__ ) - return __builtin_ffs(i) - 1; -#elif defined( __INTEL_COMPILER ) - return _bit_scan_forward(i); -#else - - unsigned t = 1u; - int r = 0; - while (i && (i & t == 0)) - { - t = t << 1; - ++r; - } - return r; -#endif -} - - -KOKKOS_FORCEINLINE_FUNCTION -int bit_scan_reverse(unsigned i) -{ - enum { shift = static_cast(sizeof(unsigned)*CHAR_BIT - 1) }; -#if defined( __CUDA_ARCH__ ) - return shift - __clz(i); -#elif defined( __GNUC__ ) || defined( __GNUG__ ) - return shift - __builtin_clz(i); -#elif defined( __INTEL_COMPILER ) - return _bit_scan_reverse(i); -#else - unsigned t = 1u << shift; - int r = 0; - while (i && (i & t == 0)) - { - t = t >> 1; - ++r; - } - return r; -#endif -} - - -// count the bits set -KOKKOS_FORCEINLINE_FUNCTION -int popcount(unsigned i) -{ -#if defined( __CUDA_ARCH__ ) - return __popc(i); -#elif defined( __GNUC__ ) || defined( __GNUG__ ) - return __builtin_popcount(i); -#elif defined ( __INTEL_COMPILER ) - return _popcnt32(i); -#else - // http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetNaive - i = i - ((i >> 1) & ~0u/3u); // temp - i = (i & ~0u/15u*3u) + ((i >> 2) & ~0u/15u*3u); // temp - i = (i + (i >> 4)) & ~0u/255u*15u; // temp - return (int)((i * (~0u/255u)) >> (sizeof(unsigned) - 1) * CHAR_BIT); // count -#endif -} - - -template -struct BitsetCount -{ - typedef Bitset bitset_type; - typedef typename bitset_type::execution_space::execution_space execution_space; - typedef typename bitset_type::size_type size_type; - typedef size_type value_type; - - bitset_type m_bitset; - - BitsetCount( bitset_type const& bitset) - : m_bitset(bitset) - {} - - size_type apply() const - { - size_type count = 0u; - parallel_reduce(m_bitset.m_blocks.dimension_0(), *this, count); - return count; - } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & count) - { - count = 0u; - } - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & count, const volatile size_type & incr ) - { - count += incr; - } - - KOKKOS_INLINE_FUNCTION - void operator()( size_type i, value_type & count) const - { - count += popcount(m_bitset.m_blocks[i]); - } -}; - -}} //Kokkos::Impl - -#endif // KOKKOS_BITSET_IMPL_HPP - diff --git a/lib/kokkos/containers/src/impl/Kokkos_Functional_impl.hpp b/lib/kokkos/containers/src/impl/Kokkos_Functional_impl.hpp deleted file mode 100644 index c87bb8a3a3..0000000000 --- a/lib/kokkos/containers/src/impl/Kokkos_Functional_impl.hpp +++ /dev/null @@ -1,195 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#ifndef KOKKOS_FUNCTIONAL_IMPL_HPP -#define KOKKOS_FUNCTIONAL_IMPL_HPP - -#include -#include - -namespace Kokkos { namespace Impl { - -// MurmurHash3 was written by Austin Appleby, and is placed in the public -// domain. The author hereby disclaims copyright to this source code. -KOKKOS_FORCEINLINE_FUNCTION -uint32_t getblock32 ( const uint8_t * p, int i ) -{ -// used to avoid aliasing error which could cause errors with -// forced inlining - return ((uint32_t)p[i*4+0]) - | ((uint32_t)p[i*4+1] << 8) - | ((uint32_t)p[i*4+2] << 16) - | ((uint32_t)p[i*4+3] << 24); -} - -KOKKOS_FORCEINLINE_FUNCTION -uint32_t rotl32 ( uint32_t x, int8_t r ) -{ return (x << r) | (x >> (32 - r)); } - -KOKKOS_FORCEINLINE_FUNCTION -uint32_t fmix32 ( uint32_t h ) -{ - h ^= h >> 16; - h *= 0x85ebca6b; - h ^= h >> 13; - h *= 0xc2b2ae35; - h ^= h >> 16; - - return h; -} - -KOKKOS_INLINE_FUNCTION -uint32_t MurmurHash3_x86_32 ( const void * key, int len, uint32_t seed ) -{ - const uint8_t * data = (const uint8_t*)key; - const int nblocks = len / 4; - - uint32_t h1 = seed; - - const uint32_t c1 = 0xcc9e2d51; - const uint32_t c2 = 0x1b873593; - - //---------- - // body - - for(int i=0; i -KOKKOS_FORCEINLINE_FUNCTION -bool bitwise_equal(T const * const a_ptr, T const * const b_ptr) -{ - typedef uint64_t KOKKOS_MAY_ALIAS T64; - typedef uint32_t KOKKOS_MAY_ALIAS T32; - typedef uint16_t KOKKOS_MAY_ALIAS T16; - typedef uint8_t KOKKOS_MAY_ALIAS T8; - - enum { - NUM_8 = sizeof(T), - NUM_16 = NUM_8 / 2, - NUM_32 = NUM_8 / 4, - NUM_64 = NUM_8 / 8 - }; - - union { - T const * const ptr; - T64 const * const ptr64; - T32 const * const ptr32; - T16 const * const ptr16; - T8 const * const ptr8; - } a = {a_ptr}, b = {b_ptr}; - - bool result = true; - - for (int i=0; i < NUM_64; ++i) { - result = result && a.ptr64[i] == b.ptr64[i]; - } - - if ( NUM_64*2 < NUM_32 ) { - result = result && a.ptr32[NUM_64*2] == b.ptr32[NUM_64*2]; - } - - if ( NUM_32*2 < NUM_16 ) { - result = result && a.ptr16[NUM_32*2] == b.ptr16[NUM_32*2]; - } - - if ( NUM_16*2 < NUM_8 ) { - result = result && a.ptr8[NUM_16*2] == b.ptr8[NUM_16*2]; - } - - return result; -} - - - -#undef KOKKOS_MAY_ALIAS - -}} // namespace Kokkos::Impl - -#endif //KOKKOS_FUNCTIONAL_IMPL_HPP diff --git a/lib/kokkos/containers/src/impl/Kokkos_StaticCrsGraph_factory.hpp b/lib/kokkos/containers/src/impl/Kokkos_StaticCrsGraph_factory.hpp deleted file mode 100644 index c52fc24359..0000000000 --- a/lib/kokkos/containers/src/impl/Kokkos_StaticCrsGraph_factory.hpp +++ /dev/null @@ -1,208 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_IMPL_STATICCRSGRAPH_FACTORY_HPP -#define KOKKOS_IMPL_STATICCRSGRAPH_FACTORY_HPP - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -template< class DataType , class Arg1Type , class Arg2Type , typename SizeType > -inline -typename StaticCrsGraph< DataType , Arg1Type , Arg2Type , SizeType >::HostMirror -create_mirror_view( const StaticCrsGraph & view , - typename Impl::enable_if< ViewTraits::is_hostspace >::type * = 0 ) -{ - return view ; -} - -template< class DataType , class Arg1Type , class Arg2Type , typename SizeType > -inline -typename StaticCrsGraph< DataType , Arg1Type , Arg2Type , SizeType >::HostMirror -create_mirror( const StaticCrsGraph & view ) -{ - // Force copy: - //typedef Impl::ViewAssignment< Impl::ViewDefault > alloc ; // unused - typedef StaticCrsGraph< DataType , Arg1Type , Arg2Type , SizeType > staticcrsgraph_type ; - - typename staticcrsgraph_type::HostMirror tmp ; - typename staticcrsgraph_type::row_map_type::HostMirror tmp_row_map = create_mirror( view.row_map); - - // Allocation to match: - tmp.row_map = tmp_row_map ; // Assignment of 'const' from 'non-const' - tmp.entries = create_mirror( view.entries ); - - - // Deep copy: - deep_copy( tmp_row_map , view.row_map ); - deep_copy( tmp.entries , view.entries ); - - return tmp ; -} - -template< class DataType , class Arg1Type , class Arg2Type , typename SizeType > -inline -typename StaticCrsGraph< DataType , Arg1Type , Arg2Type , SizeType >::HostMirror -create_mirror_view( const StaticCrsGraph & view , - typename Impl::enable_if< ! ViewTraits::is_hostspace >::type * = 0 ) -{ - return create_mirror( view ); -} -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -template< class StaticCrsGraphType , class InputSizeType > -inline -typename StaticCrsGraphType::staticcrsgraph_type -create_staticcrsgraph( const std::string & label , - const std::vector< InputSizeType > & input ) -{ - typedef StaticCrsGraphType output_type ; - //typedef std::vector< InputSizeType > input_type ; // unused - - typedef typename output_type::entries_type entries_type ; - - typedef View< typename output_type::size_type [] , - typename output_type::array_layout , - typename output_type::execution_space > work_type ; - - output_type output ; - - // Create the row map: - - const size_t length = input.size(); - - { - work_type row_work( "tmp" , length + 1 ); - - typename work_type::HostMirror row_work_host = - create_mirror_view( row_work ); - - size_t sum = 0 ; - row_work_host[0] = 0 ; - for ( size_t i = 0 ; i < length ; ++i ) { - row_work_host[i+1] = sum += input[i]; - } - - deep_copy( row_work , row_work_host ); - - output.entries = entries_type( label , sum ); - output.row_map = row_work ; - } - - return output ; -} - -//---------------------------------------------------------------------------- - -template< class StaticCrsGraphType , class InputSizeType > -inline -typename StaticCrsGraphType::staticcrsgraph_type -create_staticcrsgraph( const std::string & label , - const std::vector< std::vector< InputSizeType > > & input ) -{ - typedef StaticCrsGraphType output_type ; - typedef typename output_type::entries_type entries_type ; - - static_assert( entries_type::rank == 1 - , "Graph entries view must be rank one" ); - - typedef View< typename output_type::size_type [] , - typename output_type::array_layout , - typename output_type::execution_space > work_type ; - - output_type output ; - - // Create the row map: - - const size_t length = input.size(); - - { - work_type row_work( "tmp" , length + 1 ); - - typename work_type::HostMirror row_work_host = - create_mirror_view( row_work ); - - size_t sum = 0 ; - row_work_host[0] = 0 ; - for ( size_t i = 0 ; i < length ; ++i ) { - row_work_host[i+1] = sum += input[i].size(); - } - - deep_copy( row_work , row_work_host ); - - output.entries = entries_type( label , sum ); - output.row_map = row_work ; - } - - // Fill in the entries: - { - typename entries_type::HostMirror host_entries = - create_mirror_view( output.entries ); - - size_t sum = 0 ; - for ( size_t i = 0 ; i < length ; ++i ) { - for ( size_t j = 0 ; j < input[i].size() ; ++j , ++sum ) { - host_entries( sum ) = input[i][j] ; - } - } - - deep_copy( output.entries , host_entries ); - } - - return output ; -} - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_IMPL_CRSARRAY_FACTORY_HPP */ - diff --git a/lib/kokkos/containers/src/impl/Kokkos_UnorderedMap_impl.cpp b/lib/kokkos/containers/src/impl/Kokkos_UnorderedMap_impl.cpp deleted file mode 100644 index 843fd3a808..0000000000 --- a/lib/kokkos/containers/src/impl/Kokkos_UnorderedMap_impl.cpp +++ /dev/null @@ -1,101 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -namespace Kokkos { namespace Impl { - -uint32_t find_hash_size(uint32_t size) -{ - if (size == 0u) return 0u; - - // these primes try to preserve randomness of hash - static const uint32_t primes [] = { - 3, 7, 13, 23, 53, 97, 193, 389, 769, 1543 - , 2237, 2423, 2617, 2797, 2999, 3167, 3359, 3539 - , 3727, 3911, 4441 , 4787 , 5119 , 5471 , 5801 , 6143 , 6521 , 6827 - , 7177 , 7517 , 7853 , 8887 , 9587 , 10243 , 10937 , 11617 , 12289 - , 12967 , 13649 , 14341 , 15013 , 15727 - , 17749 , 19121 , 20479 , 21859 , 23209 , 24593 , 25939 , 27329 - , 28669 , 30047 , 31469 , 35507 , 38231 , 40961 , 43711 , 46439 - , 49157 , 51893 , 54617 , 57347 , 60077 , 62801 , 70583 , 75619 - , 80669 , 85703 , 90749 , 95783 , 100823 , 105871 , 110909 , 115963 - , 120997 , 126031 , 141157 , 151237 , 161323 , 171401 , 181499 , 191579 - , 201653 , 211741 , 221813 , 231893 , 241979 , 252079 - , 282311 , 302483 , 322649 , 342803 , 362969 , 383143 , 403301 , 423457 - , 443629 , 463787 , 483953 , 504121 , 564617 , 604949 , 645313 , 685609 - , 725939 , 766273 , 806609 , 846931 , 887261 , 927587 , 967919 , 1008239 - , 1123477 , 1198397 , 1273289 , 1348177 , 1423067 , 1497983 , 1572869 - , 1647761 , 1722667 , 1797581 , 1872461 , 1947359 , 2022253 - , 2246953 , 2396759 , 2546543 , 2696363 , 2846161 , 2995973 , 3145739 - , 3295541 , 3445357 , 3595117 , 3744941 , 3894707 , 4044503 - , 4493921 , 4793501 , 5093089 , 5392679 , 5692279 , 5991883 , 6291469 - , 6591059 , 6890641 , 7190243 , 7489829 , 7789447 , 8089033 - , 8987807 , 9586981 , 10186177 , 10785371 , 11384539 , 11983729 - , 12582917 , 13182109 , 13781291 , 14380469 , 14979667 , 15578861 - , 16178053 , 17895707 , 19014187 , 20132683 , 21251141 , 22369661 - , 23488103 , 24606583 , 25725083 , 26843549 , 27962027 , 29080529 - , 30198989 , 31317469 , 32435981 , 35791397 , 38028379 , 40265327 - , 42502283 , 44739259 , 46976221 , 49213237 , 51450131 , 53687099 - , 55924061 , 58161041 , 60397993 , 62634959 , 64871921 - , 71582857 , 76056727 , 80530643 , 85004567 , 89478503 , 93952427 - , 98426347 , 102900263 , 107374217 , 111848111 , 116322053 , 120795971 - , 125269877 , 129743807 , 143165587 , 152113427 , 161061283 , 170009141 - , 178956983 , 187904819 , 196852693 , 205800547 , 214748383 , 223696237 - , 232644089 , 241591943 , 250539763 , 259487603 , 268435399 - }; - - const uint32_t num_primes = sizeof(primes)/sizeof(uint32_t); - - uint32_t hsize = primes[num_primes-1] ; - for (uint32_t i = 0; i < num_primes; ++i) { - if (size <= primes[i]) { - hsize = primes[i]; - break; - } - } - return hsize; -} - -}} // namespace Kokkos::Impl - diff --git a/lib/kokkos/containers/src/impl/Kokkos_UnorderedMap_impl.hpp b/lib/kokkos/containers/src/impl/Kokkos_UnorderedMap_impl.hpp deleted file mode 100644 index b788c966e9..0000000000 --- a/lib/kokkos/containers/src/impl/Kokkos_UnorderedMap_impl.hpp +++ /dev/null @@ -1,297 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_UNORDERED_MAP_IMPL_HPP -#define KOKKOS_UNORDERED_MAP_IMPL_HPP - -#include -#include - -#include -#include -#include -#include - -namespace Kokkos { namespace Impl { - -uint32_t find_hash_size( uint32_t size ); - -template -struct UnorderedMapRehash -{ - typedef Map map_type; - typedef typename map_type::const_map_type const_map_type; - typedef typename map_type::execution_space execution_space; - typedef typename map_type::size_type size_type; - - map_type m_dst; - const_map_type m_src; - - UnorderedMapRehash( map_type const& dst, const_map_type const& src) - : m_dst(dst), m_src(src) - {} - - void apply() const - { - parallel_for(m_src.capacity(), *this); - } - - KOKKOS_INLINE_FUNCTION - void operator()(size_type i) const - { - if ( m_src.valid_at(i) ) - m_dst.insert(m_src.key_at(i), m_src.value_at(i)); - } - -}; - -template -struct UnorderedMapErase -{ - typedef UMap map_type; - typedef typename map_type::execution_space execution_space; - typedef typename map_type::size_type size_type; - typedef typename map_type::key_type key_type; - typedef typename map_type::impl_value_type value_type; - - map_type m_map; - - UnorderedMapErase( map_type const& map) - : m_map(map) - {} - - void apply() const - { - parallel_for(m_map.m_hash_lists.dimension_0(), *this); - } - - KOKKOS_INLINE_FUNCTION - void operator()( size_type i ) const - { - const size_type invalid_index = map_type::invalid_index; - - size_type curr = m_map.m_hash_lists(i); - size_type next = invalid_index; - - // remove erased head of the linked-list - while (curr != invalid_index && !m_map.valid_at(curr)) { - next = m_map.m_next_index[curr]; - m_map.m_next_index[curr] = invalid_index; - m_map.m_keys[curr] = key_type(); - if (m_map.is_set) m_map.m_values[curr] = value_type(); - curr = next; - m_map.m_hash_lists(i) = next; - } - - // if the list is non-empty and the head is valid - if (curr != invalid_index && m_map.valid_at(curr) ) { - size_type prev = curr; - curr = m_map.m_next_index[prev]; - - while (curr != invalid_index) { - next = m_map.m_next_index[curr]; - if (m_map.valid_at(curr)) { - prev = curr; - } - else { - // remove curr from list - m_map.m_next_index[prev] = next; - m_map.m_next_index[curr] = invalid_index; - m_map.m_keys[curr] = key_type(); - if (map_type::is_set) m_map.m_values[curr] = value_type(); - } - curr = next; - } - } - } -}; - -template -struct UnorderedMapHistogram -{ - typedef UMap map_type; - typedef typename map_type::execution_space execution_space; - typedef typename map_type::size_type size_type; - - typedef View histogram_view; - typedef typename histogram_view::HostMirror host_histogram_view; - - map_type m_map; - histogram_view m_length; - histogram_view m_distance; - histogram_view m_block_distance; - - UnorderedMapHistogram( map_type const& map) - : m_map(map) - , m_length("UnorderedMap Histogram") - , m_distance("UnorderedMap Histogram") - , m_block_distance("UnorderedMap Histogram") - {} - - void calculate() - { - parallel_for(m_map.m_hash_lists.dimension_0(), *this); - } - - void clear() - { - Kokkos::deep_copy(m_length, 0); - Kokkos::deep_copy(m_distance, 0); - Kokkos::deep_copy(m_block_distance, 0); - } - - void print_length(std::ostream &out) - { - host_histogram_view host_copy = create_mirror_view(m_length); - Kokkos::deep_copy(host_copy, m_length); - - for (int i=0, size = host_copy.dimension_0(); i -struct UnorderedMapPrint -{ - typedef UMap map_type; - typedef typename map_type::execution_space execution_space; - typedef typename map_type::size_type size_type; - - map_type m_map; - - UnorderedMapPrint( map_type const& map) - : m_map(map) - {} - - void apply() - { - parallel_for(m_map.m_hash_lists.dimension_0(), *this); - } - - KOKKOS_INLINE_FUNCTION - void operator()( size_type i ) const - { - const size_type invalid_index = map_type::invalid_index; - - uint32_t list = m_map.m_hash_lists(i); - for (size_type curr = list, ii=0; curr != invalid_index; curr = m_map.m_next_index[curr], ++ii) { - printf("%d[%d]: %d->%d\n", list, ii, m_map.key_at(curr), m_map.value_at(curr)); - } - } -}; - -template -struct UnorderedMapCanAssign : public false_ {}; - -template -struct UnorderedMapCanAssign : public true_ {}; - -template -struct UnorderedMapCanAssign : public true_ {}; - -template -struct UnorderedMapCanAssign : public true_ {}; - -template -struct UnorderedMapCanAssign : public true_ {}; - - -}} //Kokkos::Impl - -#endif // KOKKOS_UNORDERED_MAP_IMPL_HPP diff --git a/lib/kokkos/containers/unit_tests/Makefile b/lib/kokkos/containers/unit_tests/Makefile deleted file mode 100644 index 176bfa906e..0000000000 --- a/lib/kokkos/containers/unit_tests/Makefile +++ /dev/null @@ -1,92 +0,0 @@ -KOKKOS_PATH = ../.. - -GTEST_PATH = ../../TPL/gtest - -vpath %.cpp ${KOKKOS_PATH}/containers/unit_tests - -default: build_all - echo "End Build" - - -include $(KOKKOS_PATH)/Makefile.kokkos - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - CXX = nvcc_wrapper - CXXFLAGS ?= -O3 - LINK = $(CXX) - LDFLAGS ?= -lpthread -else - CXX ?= g++ - CXXFLAGS ?= -O3 - LINK ?= $(CXX) - LDFLAGS ?= -lpthread -endif - -KOKKOS_CXXFLAGS += -I$(GTEST_PATH) -I${KOKKOS_PATH}/containers/unit_tests - -TEST_TARGETS = -TARGETS = - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - OBJ_CUDA = TestCuda.o UnitTestMain.o gtest-all.o - TARGETS += KokkosContainers_UnitTest_Cuda - TEST_TARGETS += test-cuda -endif - -ifeq ($(KOKKOS_INTERNAL_USE_PTHREADS), 1) - OBJ_THREADS = TestThreads.o UnitTestMain.o gtest-all.o - TARGETS += KokkosContainers_UnitTest_Threads - TEST_TARGETS += test-threads -endif - -ifeq ($(KOKKOS_INTERNAL_USE_OPENMP), 1) - OBJ_OPENMP = TestOpenMP.o UnitTestMain.o gtest-all.o - TARGETS += KokkosContainers_UnitTest_OpenMP - TEST_TARGETS += test-openmp -endif - -ifeq ($(KOKKOS_INTERNAL_USE_SERIAL), 1) - OBJ_SERIAL = TestSerial.o UnitTestMain.o gtest-all.o - TARGETS += KokkosContainers_UnitTest_Serial - TEST_TARGETS += test-serial -endif - -KokkosContainers_UnitTest_Cuda: $(OBJ_CUDA) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_CUDA) $(KOKKOS_LIBS) $(LIB) -o KokkosContainers_UnitTest_Cuda - -KokkosContainers_UnitTest_Threads: $(OBJ_THREADS) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_THREADS) $(KOKKOS_LIBS) $(LIB) -o KokkosContainers_UnitTest_Threads - -KokkosContainers_UnitTest_OpenMP: $(OBJ_OPENMP) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_OPENMP) $(KOKKOS_LIBS) $(LIB) -o KokkosContainers_UnitTest_OpenMP - -KokkosContainers_UnitTest_Serial: $(OBJ_SERIAL) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_SERIAL) $(KOKKOS_LIBS) $(LIB) -o KokkosContainers_UnitTest_Serial - -test-cuda: KokkosContainers_UnitTest_Cuda - ./KokkosContainers_UnitTest_Cuda - -test-threads: KokkosContainers_UnitTest_Threads - ./KokkosContainers_UnitTest_Threads - -test-openmp: KokkosContainers_UnitTest_OpenMP - ./KokkosContainers_UnitTest_OpenMP - -test-serial: KokkosContainers_UnitTest_Serial - ./KokkosContainers_UnitTest_Serial - -build_all: $(TARGETS) - -test: $(TEST_TARGETS) - -clean: kokkos-clean - rm -f *.o $(TARGETS) - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< - -gtest-all.o:$(GTEST_PATH)/gtest/gtest-all.cc - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $(GTEST_PATH)/gtest/gtest-all.cc - diff --git a/lib/kokkos/containers/unit_tests/TestBitset.hpp b/lib/kokkos/containers/unit_tests/TestBitset.hpp deleted file mode 100644 index 76fb30edcb..0000000000 --- a/lib/kokkos/containers/unit_tests/TestBitset.hpp +++ /dev/null @@ -1,285 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#ifndef KOKKOS_TEST_BITSET_HPP -#define KOKKOS_TEST_BITSET_HPP - -#include -#include - - -namespace Test { - -namespace Impl { - -template -struct TestBitset -{ - typedef Bitset bitset_type; - typedef typename bitset_type::execution_space execution_space; - typedef uint32_t value_type; - - bitset_type m_bitset; - - TestBitset( bitset_type const& bitset) - : m_bitset(bitset) - {} - - unsigned testit(unsigned collisions) - { - execution_space::fence(); - - unsigned count = 0; - Kokkos::parallel_reduce( m_bitset.size()*collisions, *this, count); - return count; - } - - - KOKKOS_INLINE_FUNCTION - void init( value_type & v ) const { v = 0; } - - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & dst, const volatile value_type & src ) const - { dst += src; } - - KOKKOS_INLINE_FUNCTION - void operator()(uint32_t i, value_type & v) const - { - i = i % m_bitset.size(); - if (Set) { - if (m_bitset.set(i)) { - if (m_bitset.test(i)) ++v; - } - } - else { - if (m_bitset.reset(i)) { - if (!m_bitset.test(i)) ++v; - } - } - } - -}; - -template -struct TestBitsetTest -{ - typedef Bitset bitset_type; - typedef typename bitset_type::execution_space execution_space; - typedef uint32_t value_type; - - bitset_type m_bitset; - - TestBitsetTest( bitset_type const& bitset) - : m_bitset(bitset) - {} - - unsigned testit() - { - execution_space::fence(); - - unsigned count = 0; - Kokkos::parallel_reduce( m_bitset.size(), *this, count); - return count; - } - - - KOKKOS_INLINE_FUNCTION - void init( value_type & v ) const { v = 0; } - - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & dst, const volatile value_type & src ) const - { dst += src; } - - KOKKOS_INLINE_FUNCTION - void operator()(uint32_t i, value_type & v) const - { - if (m_bitset.test( i )) ++v; - } -}; - -template -struct TestBitsetAny -{ - typedef Bitset bitset_type; - typedef typename bitset_type::execution_space execution_space; - typedef uint32_t value_type; - - bitset_type m_bitset; - - TestBitsetAny( bitset_type const& bitset) - : m_bitset(bitset) - {} - - unsigned testit() - { - execution_space::fence(); - - unsigned count = 0; - Kokkos::parallel_reduce( m_bitset.size(), *this, count); - return count; - } - - - KOKKOS_INLINE_FUNCTION - void init( value_type & v ) const { v = 0; } - - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & dst, const volatile value_type & src ) const - { dst += src; } - - KOKKOS_INLINE_FUNCTION - void operator()(uint32_t i, value_type & v) const - { - bool result = false; - unsigned attempts = 0; - uint32_t hint = (i >> 4) << 4; - while (attempts < m_bitset.max_hint()) { - if (Set) { - Kokkos::tie(result, hint) = m_bitset.find_any_unset_near(hint, i); - if (result && m_bitset.set(hint)) { - ++v; - break; - } - else if (!result) { - ++attempts; - } - } - else { - Kokkos::tie(result, hint) = m_bitset.find_any_set_near(hint, i); - if (result && m_bitset.reset(hint)) { - ++v; - break; - } - else if (!result) { - ++attempts; - } - } - } - } - -}; -} // namespace Impl - - - -template -void test_bitset() -{ - typedef Kokkos::Bitset< Device > bitset_type; - typedef Kokkos::ConstBitset< Device > const_bitset_type; - - //unsigned test_sizes[] = { 0u, 1000u, 1u<<14, 1u<<16, 10000001 }; - unsigned test_sizes[] = { 1000u, 1u<<14, 1u<<16, 10000001 }; - - for (int i=0, end = sizeof(test_sizes)/sizeof(unsigned); i f(bitset); - uint32_t count = f.testit(); - EXPECT_EQ(0u, count); - EXPECT_EQ(count, bitset.count()); - } - - //std::cout << " Check set() " << std::endl; - bitset.set(); - // everything should be set - { - Impl::TestBitsetTest< const_bitset_type > f(bitset); - uint32_t count = f.testit(); - EXPECT_EQ(bitset.size(), count); - EXPECT_EQ(count, bitset.count()); - } - - //std::cout << " Check reset() " << std::endl; - bitset.reset(); - EXPECT_EQ(0u, bitset.count()); - - //std::cout << " Check set(i) " << std::endl; - // test setting bits - { - Impl::TestBitset< bitset_type, true > f(bitset); - uint32_t count = f.testit(10u); - EXPECT_EQ( bitset.size(), bitset.count()); - EXPECT_EQ( bitset.size(), count ); - } - - //std::cout << " Check reset(i) " << std::endl; - // test resetting bits - { - Impl::TestBitset< bitset_type, false > f(bitset); - uint32_t count = f.testit(10u); - EXPECT_EQ( bitset.size(), count); - EXPECT_EQ( 0u, bitset.count() ); - } - - - //std::cout << " Check find_any_set(i) " << std::endl; - // test setting any bits - { - Impl::TestBitsetAny< bitset_type, true > f(bitset); - uint32_t count = f.testit(); - EXPECT_EQ( bitset.size(), bitset.count()); - EXPECT_EQ( bitset.size(), count ); - } - - //std::cout << " Check find_any_unset(i) " << std::endl; - // test resetting any bits - { - Impl::TestBitsetAny< bitset_type, false > f(bitset); - uint32_t count = f.testit(); - EXPECT_EQ( bitset.size(), count); - EXPECT_EQ( 0u, bitset.count() ); - } - - } - -} - -} // namespace Test - -#endif //KOKKOS_TEST_BITSET_HPP - diff --git a/lib/kokkos/containers/unit_tests/TestComplex.hpp b/lib/kokkos/containers/unit_tests/TestComplex.hpp deleted file mode 100644 index 5065d72579..0000000000 --- a/lib/kokkos/containers/unit_tests/TestComplex.hpp +++ /dev/null @@ -1,264 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - - -#ifndef KOKKOS_TEST_COMPLEX_HPP -#define KOKKOS_TEST_COMPLEX_HPP - -//#include -#include -#include - -namespace Test { - -namespace Impl { - template - void testComplexConstructors () { - typedef Kokkos::complex complex_type; - - complex_type z1; - complex_type z2 (0.0, 0.0); - complex_type z3 (1.0, 0.0); - complex_type z4 (0.0, 1.0); - complex_type z5 (-1.0, -2.0); - - ASSERT_TRUE( z1 == z2 ); - ASSERT_TRUE( z1 != z3 ); - ASSERT_TRUE( z1 != z4 ); - ASSERT_TRUE( z1 != z5 ); - - ASSERT_TRUE( z2 != z3 ); - ASSERT_TRUE( z2 != z4 ); - ASSERT_TRUE( z2 != z5 ); - - ASSERT_TRUE( z3 != z4 ); - ASSERT_TRUE( z3 != z5 ); - - complex_type z6 (-1.0, -2.0); - ASSERT_TRUE( z5 == z6 ); - - // Make sure that complex has value semantics, in particular, that - // equality tests use values and not pointers, so that - // reassignment actually changes the value. - z1 = complex_type (-3.0, -4.0); - ASSERT_TRUE( z1.real () == -3.0 ); - ASSERT_TRUE( z1.imag () == -4.0 ); - ASSERT_TRUE( z1 != z2 ); - - complex_type z7 (1.0); - ASSERT_TRUE( z3 == z7 ); - ASSERT_TRUE( z7 == 1.0 ); - ASSERT_TRUE( z7 != -1.0 ); - - z7 = complex_type (5.0); - ASSERT_TRUE( z7.real () == 5.0 ); - ASSERT_TRUE( z7.imag () == 0.0 ); - } - - template - void testPlus () { - typedef Kokkos::complex complex_type; - - complex_type z1 (1.0, -1.0); - complex_type z2 (-1.0, 1.0); - complex_type z3 = z1 + z2; - ASSERT_TRUE( z3 == complex_type (0.0, 0.0) ); - } - - template - void testMinus () { - typedef Kokkos::complex complex_type; - - // Test binary minus. - complex_type z1 (1.0, -1.0); - complex_type z2 (-1.0, 1.0); - complex_type z3 = z1 - z2; - ASSERT_TRUE( z3 == complex_type (2.0, -2.0) ); - - // Test unary minus. - complex_type z4 (3.0, -4.0); - ASSERT_TRUE( -z1 == complex_type (-3.0, 4.0) ); - } - - template - void testTimes () { - typedef Kokkos::complex complex_type; - - complex_type z1 (1.0, -1.0); - complex_type z2 (-1.0, 1.0); - complex_type z3 = z1 - z2; - ASSERT_TRUE( z3 == complex_type (2.0, -2.0) ); - - // Test unary minus. - complex_type z4 (3.0, -4.0); - ASSERT_TRUE( z4 == complex_type (3.0, -4.0) ); - ASSERT_TRUE( -z4 == complex_type (-3.0, 4.0) ); - ASSERT_TRUE( z4 == -complex_type (-3.0, 4.0) ); - } - - template - void testDivide () { - typedef Kokkos::complex complex_type; - - // Test division of a complex number by a real number. - complex_type z1 (1.0, -1.0); - complex_type z2 (1.0 / 2.0, -1.0 / 2.0); - ASSERT_TRUE( z1 / 2.0 == z2 ); - - // (-1+2i)/(1-i) == ((-1+2i)(1+i)) / ((1-i)(1+i)) - // (-1+2i)(1+i) == -3 + i - complex_type z3 (-1.0, 2.0); - complex_type z4 (1.0, -1.0); - complex_type z5 (-3.0, 1.0); - ASSERT_TRUE(z3 * Kokkos::conj (z4) == z5 ); - - // Test division of a complex number by a complex number. - // This assumes that RealType is a floating-point type. - complex_type z6 (Kokkos::real (z5) / 2.0, - Kokkos::imag (z5) / 2.0); - - complex_type z7 = z3 / z4; - ASSERT_TRUE( z7 == z6 ); - } - - template - void testOutsideKernel () { - testComplexConstructors (); - testPlus (); - testTimes (); - testDivide (); - } - - - template - void testCreateView () { - typedef Kokkos::complex complex_type; - Kokkos::View x ("x", 10); - ASSERT_TRUE( x.dimension_0 () == 10 ); - - // Test that View assignment works. - Kokkos::View x_nonconst = x; - Kokkos::View x_const = x; - } - - template - class Fill { - public: - typedef typename Device::execution_space execution_space; - - typedef Kokkos::View*, Device> view_type; - typedef typename view_type::size_type size_type; - - KOKKOS_INLINE_FUNCTION - void operator () (const size_type i) const { - x_(i) = val_; - } - - Fill (const view_type& x, const Kokkos::complex& val) : - x_ (x), val_ (val) - {} - - private: - view_type x_; - const Kokkos::complex val_; - }; - - template - class Sum { - public: - typedef typename Device::execution_space execution_space; - - typedef Kokkos::View*, Device> view_type; - typedef typename view_type::size_type size_type; - typedef Kokkos::complex value_type; - - KOKKOS_INLINE_FUNCTION - void operator () (const size_type i, Kokkos::complex& sum) const { - sum += x_(i); - } - - Sum (const view_type& x) : x_ (x) {} - - private: - view_type x_; - }; - - template - void testInsideKernel () { - typedef Kokkos::complex complex_type; - typedef Kokkos::View view_type; - typedef typename view_type::size_type size_type; - - const size_type N = 1000; - view_type x ("x", N); - ASSERT_TRUE( x.dimension_0 () == N ); - - // Kokkos::parallel_reduce (N, [=] (const size_type i, complex_type& result) { - // result += x[i]; - // }); - - Kokkos::parallel_for (N, Fill (x, complex_type (1.0, -1.0))); - - complex_type sum; - Kokkos::parallel_reduce (N, Sum (x), sum); - - ASSERT_TRUE( sum.real () == 1000.0 && sum.imag () == -1000.0 ); - } -} // namespace Impl - - -template -void testComplex () -{ - Impl::testOutsideKernel (); - Impl::testOutsideKernel (); - - Impl::testCreateView (); - Impl::testCreateView (); - - Impl::testInsideKernel (); - Impl::testInsideKernel (); -} - - -} // namespace Test - -#endif // KOKKOS_TEST_COMPLEX_HPP diff --git a/lib/kokkos/containers/unit_tests/TestCuda.cpp b/lib/kokkos/containers/unit_tests/TestCuda.cpp deleted file mode 100644 index 2f79205c49..0000000000 --- a/lib/kokkos/containers/unit_tests/TestCuda.cpp +++ /dev/null @@ -1,206 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include - -#include - -#include - -#include -#include -#include - -#include -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - - -#ifdef KOKKOS_HAVE_CUDA - -namespace Test { - -class cuda : public ::testing::Test { -protected: - static void SetUpTestCase() - { - std::cout << std::setprecision(5) << std::scientific; - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice(0) ); - } - static void TearDownTestCase() - { - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); - } -}; - -TEST_F( cuda , staticcrsgraph ) -{ - TestStaticCrsGraph::run_test_graph< Kokkos::Cuda >(); - TestStaticCrsGraph::run_test_graph2< Kokkos::Cuda >(); -} - - -void cuda_test_insert_close( uint32_t num_nodes - , uint32_t num_inserts - , uint32_t num_duplicates - ) -{ - test_insert< Kokkos::Cuda >( num_nodes, num_inserts, num_duplicates, true); -} - -void cuda_test_insert_far( uint32_t num_nodes - , uint32_t num_inserts - , uint32_t num_duplicates - ) -{ - test_insert< Kokkos::Cuda >( num_nodes, num_inserts, num_duplicates, false); -} - -void cuda_test_failed_insert( uint32_t num_nodes ) -{ - test_failed_insert< Kokkos::Cuda >( num_nodes ); -} - -void cuda_test_deep_copy( uint32_t num_nodes ) -{ - test_deep_copy< Kokkos::Cuda >( num_nodes ); -} - -void cuda_test_vector_combinations(unsigned int size) -{ - test_vector_combinations(size); -} - -void cuda_test_dualview_combinations(unsigned int size) -{ - test_dualview_combinations(size); -} - -void cuda_test_segmented_view(unsigned int size) -{ - test_segmented_view(size); -} - -void cuda_test_bitset() -{ - test_bitset(); -} - - - -/*TEST_F( cuda, bitset ) -{ - cuda_test_bitset(); -}*/ - -#define CUDA_INSERT_TEST( name, num_nodes, num_inserts, num_duplicates, repeat ) \ - TEST_F( cuda, UnorderedMap_insert_##name##_##num_nodes##_##num_inserts##_##num_duplicates##_##repeat##x) { \ - for (int i=0; i -#include -#include -#include -#include - -namespace Test { - -namespace Impl { - - template - struct test_dualview_combinations - { - typedef test_dualview_combinations self_type; - - typedef Scalar scalar_type; - typedef Device execution_space; - - Scalar reference; - Scalar result; - - template - Scalar run_me(unsigned int n,unsigned int m){ - if(n<10) n = 10; - if(m<3) m = 3; - ViewType a("A",n,m); - - Kokkos::deep_copy( a.d_view , 1 ); - - a.template modify(); - a.template sync(); - - a.h_view(5,1) = 3; - a.h_view(6,1) = 4; - a.h_view(7,2) = 5; - a.template modify(); - ViewType b = Kokkos::subview(a,std::pair(6,9),std::pair(0,1)); - a.template sync(); - b.template modify(); - - Kokkos::deep_copy( b.d_view , 2 ); - - a.template sync(); - Scalar count = 0; - for(unsigned int i = 0; i >(size,3); - } - - }; - -} // namespace Impl - - - - -template -void test_dualview_combinations(unsigned int size) -{ - Impl::test_dualview_combinations test(size); - ASSERT_EQ( test.result,0); - -} - - -} // namespace Test - -#endif //KOKKOS_TEST_UNORDERED_MAP_HPP diff --git a/lib/kokkos/containers/unit_tests/TestOpenMP.cpp b/lib/kokkos/containers/unit_tests/TestOpenMP.cpp deleted file mode 100644 index 0ff9b4f66b..0000000000 --- a/lib/kokkos/containers/unit_tests/TestOpenMP.cpp +++ /dev/null @@ -1,162 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#include -#include -#include - -//---------------------------------------------------------------------------- -#include -#include -#include -#include -#include -#include -#include - -#include - -namespace Test { - -#ifdef KOKKOS_HAVE_OPENMP -class openmp : public ::testing::Test { -protected: - static void SetUpTestCase() - { - std::cout << std::setprecision(5) << std::scientific; - - unsigned threads_count = 4 ; - - if ( Kokkos::hwloc::available() ) { - threads_count = Kokkos::hwloc::get_available_numa_count() * - Kokkos::hwloc::get_available_cores_per_numa(); - } - - Kokkos::OpenMP::initialize( threads_count ); - } - - static void TearDownTestCase() - { - Kokkos::OpenMP::finalize(); - } -}; - -TEST_F( openmp, complex ) -{ - testComplex (); -} - -TEST_F( openmp, bitset ) -{ - test_bitset(); -} - -TEST_F( openmp , staticcrsgraph ) -{ - TestStaticCrsGraph::run_test_graph< Kokkos::OpenMP >(); - TestStaticCrsGraph::run_test_graph2< Kokkos::OpenMP >(); -} - -#define OPENMP_INSERT_TEST( name, num_nodes, num_inserts, num_duplicates, repeat, near ) \ - TEST_F( openmp, UnorderedMap_insert_##name##_##num_nodes##_##num_inserts##_##num_duplicates##_##repeat##x) { \ - for (int i=0; i(num_nodes,num_inserts,num_duplicates, near); \ - } - -#define OPENMP_FAILED_INSERT_TEST( num_nodes, repeat ) \ - TEST_F( openmp, UnorderedMap_failed_insert_##num_nodes##_##repeat##x) { \ - for (int i=0; i(num_nodes); \ - } - -#define OPENMP_ASSIGNEMENT_TEST( num_nodes, repeat ) \ - TEST_F( openmp, UnorderedMap_assignment_operators_##num_nodes##_##repeat##x) { \ - for (int i=0; i(num_nodes); \ - } - -#define OPENMP_DEEP_COPY( num_nodes, repeat ) \ - TEST_F( openmp, UnorderedMap_deep_copy##num_nodes##_##repeat##x) { \ - for (int i=0; i(num_nodes); \ - } - -#define OPENMP_VECTOR_COMBINE_TEST( size ) \ - TEST_F( openmp, vector_combination##size##x) { \ - test_vector_combinations(size); \ - } - -#define OPENMP_DUALVIEW_COMBINE_TEST( size ) \ - TEST_F( openmp, dualview_combination##size##x) { \ - test_dualview_combinations(size); \ - } - -#define OPENMP_SEGMENTEDVIEW_TEST( size ) \ - TEST_F( openmp, segmentedview_##size##x) { \ - test_segmented_view(size); \ - } - -OPENMP_INSERT_TEST(close, 100000, 90000, 100, 500, true) -OPENMP_INSERT_TEST(far, 100000, 90000, 100, 500, false) -OPENMP_FAILED_INSERT_TEST( 10000, 1000 ) -OPENMP_DEEP_COPY( 10000, 1 ) - -OPENMP_VECTOR_COMBINE_TEST( 10 ) -OPENMP_VECTOR_COMBINE_TEST( 3057 ) -OPENMP_DUALVIEW_COMBINE_TEST( 10 ) -OPENMP_SEGMENTEDVIEW_TEST( 10000 ) - -#undef OPENMP_INSERT_TEST -#undef OPENMP_FAILED_INSERT_TEST -#undef OPENMP_ASSIGNEMENT_TEST -#undef OPENMP_DEEP_COPY -#undef OPENMP_VECTOR_COMBINE_TEST -#undef OPENMP_DUALVIEW_COMBINE_TEST -#undef OPENMP_SEGMENTEDVIEW_TEST -#endif -} // namespace test - diff --git a/lib/kokkos/containers/unit_tests/TestSegmentedView.hpp b/lib/kokkos/containers/unit_tests/TestSegmentedView.hpp deleted file mode 100644 index 3da4bc781b..0000000000 --- a/lib/kokkos/containers/unit_tests/TestSegmentedView.hpp +++ /dev/null @@ -1,708 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_TEST_SEGMENTEDVIEW_HPP -#define KOKKOS_TEST_SEGMENTEDVIEW_HPP - -#include -#include -#include -#include -#include - -#if ! defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - -#include -#include - -namespace Test { - -namespace Impl { - - template - struct GrowTest; - - template - struct GrowTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - GrowTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - a.grow(team_member , team_idx+team_member.team_size()); - value += team_idx + team_member.team_rank(); - - if((a.dimension_0()>team_idx+team_member.team_rank()) && - (a.dimension(0)>team_idx+team_member.team_rank())) - a(team_idx+team_member.team_rank()) = team_idx+team_member.team_rank(); - - } - }; - - template - struct GrowTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - GrowTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - a.grow(team_member , team_idx+ team_member.team_size()); - - for( typename ExecutionSpace::size_type k=0;k<7;k++) - value += team_idx + team_member.team_rank() + 13*k; - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct GrowTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - GrowTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - a.grow(team_member , team_idx+ team_member.team_size()); - - for( typename ExecutionSpace::size_type k=0;k<7;k++) - for( typename ExecutionSpace::size_type l=0;l<3;l++) - value += team_idx + team_member.team_rank() + 13*k + 3*l; - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct GrowTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - GrowTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - a.grow(team_member , team_idx+ team_member.team_size()); - - for( typename ExecutionSpace::size_type k=0;k<7;k++) - for( typename ExecutionSpace::size_type l=0;l<3;l++) - for( typename ExecutionSpace::size_type m=0;m<2;m++) - value += team_idx + team_member.team_rank() + 13*k + 3*l + 7*m; - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct GrowTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - GrowTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - a.grow(team_member , team_idx+ team_member.team_size()); - - for( typename ExecutionSpace::size_type k=0;k<7;k++) - for( typename ExecutionSpace::size_type l=0;l<3;l++) - for( typename ExecutionSpace::size_type m=0;m<2;m++) - for( typename ExecutionSpace::size_type n=0;n<3;n++) - value += - team_idx + team_member.team_rank() + 13*k + 3*l + 7*m + 5*n; - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct GrowTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - GrowTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - a.grow(team_member , team_idx+ team_member.team_size()); - - for( typename ExecutionSpace::size_type k=0;k<7;k++) - for( typename ExecutionSpace::size_type l=0;l<3;l++) - for( typename ExecutionSpace::size_type m=0;m<2;m++) - for( typename ExecutionSpace::size_type n=0;n<3;n++) - for( typename ExecutionSpace::size_type o=0;o<2;o++) - value += - team_idx + team_member.team_rank() + 13*k + 3*l + 7*m + 5*n + 2*o ; - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct GrowTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - GrowTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - a.grow(team_member , team_idx+ team_member.team_size()); - - for( typename ExecutionSpace::size_type k=0;k<7;k++) - for( typename ExecutionSpace::size_type l=0;l<3;l++) - for( typename ExecutionSpace::size_type m=0;m<2;m++) - for( typename ExecutionSpace::size_type n=0;n<3;n++) - for( typename ExecutionSpace::size_type o=0;o<2;o++) - for( typename ExecutionSpace::size_type p=0;p<4;p++) - value += - team_idx + team_member.team_rank() + 13*k + 3*l + 7*m + 5*n + 2*o + 15*p ; - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct GrowTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - GrowTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - a.grow(team_member , team_idx + team_member.team_size()); - - for( typename ExecutionSpace::size_type k=0;k<7;k++) - for( typename ExecutionSpace::size_type l=0;l<3;l++) - for( typename ExecutionSpace::size_type m=0;m<2;m++) - for( typename ExecutionSpace::size_type n=0;n<3;n++) - for( typename ExecutionSpace::size_type o=0;o<2;o++) - for( typename ExecutionSpace::size_type p=0;p<4;p++) - for( typename ExecutionSpace::size_type q=0;q<3;q++) - value += - team_idx + team_member.team_rank() + 13*k + 3*l + 7*m + 5*n + 2*o + 15*p + 17*q; - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct VerifyTest; - - template - struct VerifyTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - VerifyTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - value += a(team_idx+ team_member.team_rank()); - } - } - }; - - template - struct VerifyTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - VerifyTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct VerifyTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - VerifyTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct VerifyTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - VerifyTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct VerifyTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - VerifyTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct VerifyTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - VerifyTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct VerifyTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - VerifyTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct VerifyTest { - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - typedef typename Policy::member_type team_type; - typedef double value_type; - - ViewType a; - - VerifyTest(ViewType in):a(in) {} - - KOKKOS_INLINE_FUNCTION - void operator() (team_type team_member, double& value) const { - unsigned int team_idx = team_member.league_rank() * team_member.team_size(); - - if((a.dimension_0()>team_idx+ team_member.team_rank()) && - (a.dimension(0)>team_idx+ team_member.team_rank())) { - for( typename ExecutionSpace::size_type k=0;k - struct test_segmented_view - { - typedef test_segmented_view self_type; - - typedef Scalar scalar_type; - typedef ExecutionSpace execution_space; - typedef Kokkos::TeamPolicy Policy; - - double result; - double reference; - - template - void run_me(ViewType a, int max_length){ - const int team_size = Policy::team_size_max( GrowTest(a) ); - const int nteams = max_length/team_size; - - reference = 0; - result = 0; - - Kokkos::parallel_reduce(Policy(nteams,team_size),GrowTest(a),reference); - Kokkos::fence(); - Kokkos::parallel_reduce(Policy(nteams,team_size),VerifyTest(a),result); - Kokkos::fence(); - } - - - test_segmented_view(unsigned int size,int rank) - { - reference = 0; - result = 0; - - const int dim_1 = 7; - const int dim_2 = 3; - const int dim_3 = 2; - const int dim_4 = 3; - const int dim_5 = 2; - const int dim_6 = 4; - //const int dim_7 = 3; - - if(rank==1) { - typedef Kokkos::Experimental::SegmentedView rank1_view; - run_me< rank1_view >(rank1_view("Rank1",128,size), size); - } - if(rank==2) { - typedef Kokkos::Experimental::SegmentedView rank2_view; - run_me< rank2_view >(rank2_view("Rank2",128,size,dim_1), size); - } - if(rank==3) { - typedef Kokkos::Experimental::SegmentedView rank3_view; - run_me< rank3_view >(rank3_view("Rank3",128,size), size); - } - if(rank==4) { - typedef Kokkos::Experimental::SegmentedView rank4_view; - run_me< rank4_view >(rank4_view("Rank4",128,size,dim_1,dim_2,dim_3), size); - } - if(rank==5) { - typedef Kokkos::Experimental::SegmentedView rank5_view; - run_me< rank5_view >(rank5_view("Rank5",128,size), size); - } - if(rank==6) { - typedef Kokkos::Experimental::SegmentedView rank6_view; - run_me< rank6_view >(rank6_view("Rank6",128,size,dim_1,dim_2,dim_3,dim_4), size); - } - if(rank==7) { - typedef Kokkos::Experimental::SegmentedView rank7_view; - run_me< rank7_view >(rank7_view("Rank7",128,size,dim_1,dim_2,dim_3,dim_4,dim_5,dim_6), size); - } - if(rank==8) { - typedef Kokkos::Experimental::SegmentedView rank8_view; - run_me< rank8_view >(rank8_view("Rank8",128,size,dim_1,dim_2,dim_3,dim_4), size); - } - } - - }; - -} // namespace Impl - - - - -template -void test_segmented_view(unsigned int size) -{ - { - typedef Kokkos::Experimental::SegmentedView view_type; - view_type a("A",128,size,7,3,2,3); - double reference; - - Impl::GrowTest f(a); - - const int team_size = Kokkos::TeamPolicy::team_size_max( f ); - const int nteams = (size+team_size-1)/team_size; - - Kokkos::parallel_reduce(Kokkos::TeamPolicy(nteams,team_size),f,reference); - - size_t real_size = ((size+127)/128)*128; - - ASSERT_EQ(real_size,a.dimension_0()); - ASSERT_EQ(7,a.dimension_1()); - ASSERT_EQ(3,a.dimension_2()); - ASSERT_EQ(2,a.dimension_3()); - ASSERT_EQ(3,a.dimension_4()); - ASSERT_EQ(2,a.dimension_5()); - ASSERT_EQ(4,a.dimension_6()); - ASSERT_EQ(3,a.dimension_7()); - ASSERT_EQ(real_size,a.dimension(0)); - ASSERT_EQ(7,a.dimension(1)); - ASSERT_EQ(3,a.dimension(2)); - ASSERT_EQ(2,a.dimension(3)); - ASSERT_EQ(3,a.dimension(4)); - ASSERT_EQ(2,a.dimension(5)); - ASSERT_EQ(4,a.dimension(6)); - ASSERT_EQ(3,a.dimension(7)); - ASSERT_EQ(8,a.Rank); - } - { - Impl::test_segmented_view test(size,1); - ASSERT_EQ(test.reference,test.result); - } - { - Impl::test_segmented_view test(size,2); - ASSERT_EQ(test.reference,test.result); - } - { - Impl::test_segmented_view test(size,3); - ASSERT_EQ(test.reference,test.result); - } - { - Impl::test_segmented_view test(size,4); - ASSERT_EQ(test.reference,test.result); - } - { - Impl::test_segmented_view test(size,5); - ASSERT_EQ(test.reference,test.result); - } - { - Impl::test_segmented_view test(size,6); - ASSERT_EQ(test.reference,test.result); - } - { - Impl::test_segmented_view test(size,7); - ASSERT_EQ(test.reference,test.result); - } - { - Impl::test_segmented_view test(size,8); - ASSERT_EQ(test.reference,test.result); - } - -} - - -} // namespace Test - -#else - -template -void test_segmented_view(unsigned int ) {} - -#endif - -#endif /* #ifndef KOKKOS_TEST_SEGMENTEDVIEW_HPP */ - diff --git a/lib/kokkos/containers/unit_tests/TestSerial.cpp b/lib/kokkos/containers/unit_tests/TestSerial.cpp deleted file mode 100644 index 6f00b113f9..0000000000 --- a/lib/kokkos/containers/unit_tests/TestSerial.cpp +++ /dev/null @@ -1,158 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#if ! defined(KOKKOS_HAVE_SERIAL) -# error "It doesn't make sense to build this file unless the Kokkos::Serial device is enabled. If you see this message, it probably means that there is an error in Kokkos' CMake build infrastructure." -#else - -#include -#include -#include - -#include -#include -#include -#include -#include -#include -#include - -#include - -namespace Test { - -class serial : public ::testing::Test { -protected: - static void SetUpTestCase () { - std::cout << std::setprecision(5) << std::scientific; - Kokkos::Serial::initialize (); - } - - static void TearDownTestCase () { - Kokkos::Serial::finalize (); - } -}; - - -TEST_F( serial , staticcrsgraph ) -{ - TestStaticCrsGraph::run_test_graph< Kokkos::Serial >(); - TestStaticCrsGraph::run_test_graph2< Kokkos::Serial >(); -} - -TEST_F( serial, complex ) -{ - testComplex (); -} - -TEST_F( serial, bitset ) -{ - test_bitset (); -} - -#define SERIAL_INSERT_TEST( name, num_nodes, num_inserts, num_duplicates, repeat, near ) \ - TEST_F( serial, UnorderedMap_insert_##name##_##num_nodes##_##num_inserts##_##num_duplicates##_##repeat##x) { \ - for (int i=0; i (num_nodes, num_inserts, num_duplicates, near); \ - } - -#define SERIAL_FAILED_INSERT_TEST( num_nodes, repeat ) \ - TEST_F( serial, UnorderedMap_failed_insert_##num_nodes##_##repeat##x) { \ - for (int i=0; i (num_nodes); \ - } - -#define SERIAL_ASSIGNEMENT_TEST( num_nodes, repeat ) \ - TEST_F( serial, UnorderedMap_assignment_operators_##num_nodes##_##repeat##x) { \ - for (int i=0; i (num_nodes); \ - } - -#define SERIAL_DEEP_COPY( num_nodes, repeat ) \ - TEST_F( serial, UnorderedMap_deep_copy##num_nodes##_##repeat##x) { \ - for (int i=0; i (num_nodes); \ - } - -#define SERIAL_VECTOR_COMBINE_TEST( size ) \ - TEST_F( serial, vector_combination##size##x) { \ - test_vector_combinations(size); \ - } - -#define SERIAL_DUALVIEW_COMBINE_TEST( size ) \ - TEST_F( serial, dualview_combination##size##x) { \ - test_dualview_combinations(size); \ - } - -#define SERIAL_SEGMENTEDVIEW_TEST( size ) \ - TEST_F( serial, segmentedview_##size##x) { \ - test_segmented_view(size); \ - } - -SERIAL_INSERT_TEST(close, 100000, 90000, 100, 500, true) -SERIAL_INSERT_TEST(far, 100000, 90000, 100, 500, false) -SERIAL_FAILED_INSERT_TEST( 10000, 1000 ) -SERIAL_DEEP_COPY( 10000, 1 ) - -SERIAL_VECTOR_COMBINE_TEST( 10 ) -SERIAL_VECTOR_COMBINE_TEST( 3057 ) -SERIAL_DUALVIEW_COMBINE_TEST( 10 ) -SERIAL_SEGMENTEDVIEW_TEST( 10000 ) - -#undef SERIAL_INSERT_TEST -#undef SERIAL_FAILED_INSERT_TEST -#undef SERIAL_ASSIGNEMENT_TEST -#undef SERIAL_DEEP_COPY -#undef SERIAL_VECTOR_COMBINE_TEST -#undef SERIAL_DUALVIEW_COMBINE_TEST -#undef SERIAL_SEGMENTEDVIEW_TEST - -} // namespace test - -#endif // KOKKOS_HAVE_SERIAL - - diff --git a/lib/kokkos/containers/unit_tests/TestStaticCrsGraph.hpp b/lib/kokkos/containers/unit_tests/TestStaticCrsGraph.hpp deleted file mode 100644 index 52b45b7865..0000000000 --- a/lib/kokkos/containers/unit_tests/TestStaticCrsGraph.hpp +++ /dev/null @@ -1,149 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#include - -/*--------------------------------------------------------------------------*/ - -namespace TestStaticCrsGraph { - -template< class Space > -void run_test_graph() -{ - typedef Kokkos::StaticCrsGraph< unsigned , Space > dView ; - typedef typename dView::HostMirror hView ; - - const unsigned LENGTH = 1000 ; - dView dx ; - hView hx ; - - std::vector< std::vector< int > > graph( LENGTH ); - - for ( size_t i = 0 ; i < LENGTH ; ++i ) { - graph[i].reserve(8); - for ( size_t j = 0 ; j < 8 ; ++j ) { - graph[i].push_back( i + j * 3 ); - } - } - - dx = Kokkos::create_staticcrsgraph( "dx" , graph ); - hx = Kokkos::create_mirror( dx ); - - ASSERT_EQ( hx.row_map.dimension_0() - 1 , LENGTH ); - - for ( size_t i = 0 ; i < LENGTH ; ++i ) { - const size_t begin = hx.row_map[i]; - const size_t n = hx.row_map[i+1] - begin ; - ASSERT_EQ( n , graph[i].size() ); - for ( size_t j = 0 ; j < n ; ++j ) { - ASSERT_EQ( (int) hx.entries( j + begin ) , graph[i][j] ); - } - } -} - -template< class Space > -void run_test_graph2() -{ - typedef Kokkos::StaticCrsGraph< unsigned[3] , Space > dView ; - typedef typename dView::HostMirror hView ; - - const unsigned LENGTH = 10 ; - - std::vector< size_t > sizes( LENGTH ); - - size_t total_length = 0 ; - - for ( size_t i = 0 ; i < LENGTH ; ++i ) { - total_length += ( sizes[i] = 6 + i % 4 ); - } - - dView dx = Kokkos::create_staticcrsgraph( "test" , sizes ); - hView hx = Kokkos::create_mirror( dx ); - hView mx = Kokkos::create_mirror( dx ); - - ASSERT_EQ( (size_t) dx.row_map.dimension_0() , (size_t) LENGTH + 1 ); - ASSERT_EQ( (size_t) hx.row_map.dimension_0() , (size_t) LENGTH + 1 ); - ASSERT_EQ( (size_t) mx.row_map.dimension_0() , (size_t) LENGTH + 1 ); - - ASSERT_EQ( (size_t) dx.entries.dimension_0() , (size_t) total_length ); - ASSERT_EQ( (size_t) hx.entries.dimension_0() , (size_t) total_length ); - ASSERT_EQ( (size_t) mx.entries.dimension_0() , (size_t) total_length ); - - ASSERT_EQ( (size_t) dx.entries.dimension_1() , (size_t) 3 ); - ASSERT_EQ( (size_t) hx.entries.dimension_1() , (size_t) 3 ); - ASSERT_EQ( (size_t) mx.entries.dimension_1() , (size_t) 3 ); - - for ( size_t i = 0 ; i < LENGTH ; ++i ) { - const size_t entry_begin = hx.row_map[i]; - const size_t entry_end = hx.row_map[i+1]; - for ( size_t j = entry_begin ; j < entry_end ; ++j ) { - hx.entries(j,0) = j + 1 ; - hx.entries(j,1) = j + 2 ; - hx.entries(j,2) = j + 3 ; - } - } - - Kokkos::deep_copy( dx.entries , hx.entries ); - Kokkos::deep_copy( mx.entries , dx.entries ); - - ASSERT_EQ( mx.row_map.dimension_0() , (size_t) LENGTH + 1 ); - - for ( size_t i = 0 ; i < LENGTH ; ++i ) { - const size_t entry_begin = mx.row_map[i]; - const size_t entry_end = mx.row_map[i+1]; - ASSERT_EQ( ( entry_end - entry_begin ) , sizes[i] ); - for ( size_t j = entry_begin ; j < entry_end ; ++j ) { - ASSERT_EQ( (size_t) mx.entries( j , 0 ) , ( j + 1 ) ); - ASSERT_EQ( (size_t) mx.entries( j , 1 ) , ( j + 2 ) ); - ASSERT_EQ( (size_t) mx.entries( j , 2 ) , ( j + 3 ) ); - } - } -} - -} /* namespace TestStaticCrsGraph */ - - diff --git a/lib/kokkos/containers/unit_tests/TestThreads.cpp b/lib/kokkos/containers/unit_tests/TestThreads.cpp deleted file mode 100644 index 9320a114fb..0000000000 --- a/lib/kokkos/containers/unit_tests/TestThreads.cpp +++ /dev/null @@ -1,168 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#if defined( KOKKOS_HAVE_PTHREAD ) - -#include -#include - -#include -#include - - -//---------------------------------------------------------------------------- -#include -#include -#include - -#include -#include -#include - -namespace Test { - -class threads : public ::testing::Test { -protected: - static void SetUpTestCase() - { - std::cout << std::setprecision(5) << std::scientific; - - unsigned num_threads = 4; - - if (Kokkos::hwloc::available()) { - num_threads = Kokkos::hwloc::get_available_numa_count() - * Kokkos::hwloc::get_available_cores_per_numa() - // * Kokkos::hwloc::get_available_threads_per_core() - ; - - } - - std::cout << "Threads: " << num_threads << std::endl; - - Kokkos::Threads::initialize( num_threads ); - } - - static void TearDownTestCase() - { - Kokkos::Threads::finalize(); - } -}; - -TEST_F( threads , staticcrsgraph ) -{ - TestStaticCrsGraph::run_test_graph< Kokkos::Threads >(); - TestStaticCrsGraph::run_test_graph2< Kokkos::Threads >(); -} - -/*TEST_F( threads, bitset ) -{ - test_bitset(); -}*/ - -#define THREADS_INSERT_TEST( name, num_nodes, num_inserts, num_duplicates, repeat, near ) \ - TEST_F( threads, UnorderedMap_insert_##name##_##num_nodes##_##num_inserts##_##num_duplicates##_##repeat##x) { \ - for (int i=0; i(num_nodes,num_inserts,num_duplicates, near); \ - } - -#define THREADS_FAILED_INSERT_TEST( num_nodes, repeat ) \ - TEST_F( threads, UnorderedMap_failed_insert_##num_nodes##_##repeat##x) { \ - for (int i=0; i(num_nodes); \ - } - -#define THREADS_ASSIGNEMENT_TEST( num_nodes, repeat ) \ - TEST_F( threads, UnorderedMap_assignment_operators_##num_nodes##_##repeat##x) { \ - for (int i=0; i(num_nodes); \ - } - -#define THREADS_DEEP_COPY( num_nodes, repeat ) \ - TEST_F( threads, UnorderedMap_deep_copy##num_nodes##_##repeat##x) { \ - for (int i=0; i(num_nodes); \ - } - -#define THREADS_VECTOR_COMBINE_TEST( size ) \ - TEST_F( threads, vector_combination##size##x) { \ - test_vector_combinations(size); \ - } - -#define THREADS_DUALVIEW_COMBINE_TEST( size ) \ - TEST_F( threads, dualview_combination##size##x) { \ - test_dualview_combinations(size); \ - } - -#define THREADS_SEGMENTEDVIEW_TEST( size ) \ - TEST_F( threads, segmentedview_##size##x) { \ - test_segmented_view(size); \ - } - - -THREADS_INSERT_TEST(far, 100000, 90000, 100, 500, false) -THREADS_FAILED_INSERT_TEST( 10000, 1000 ) -THREADS_DEEP_COPY( 10000, 1 ) - -THREADS_VECTOR_COMBINE_TEST( 10 ) -THREADS_VECTOR_COMBINE_TEST( 3057 ) -THREADS_DUALVIEW_COMBINE_TEST( 10 ) -THREADS_SEGMENTEDVIEW_TEST( 10000 ) - - -#undef THREADS_INSERT_TEST -#undef THREADS_FAILED_INSERT_TEST -#undef THREADS_ASSIGNEMENT_TEST -#undef THREADS_DEEP_COPY -#undef THREADS_VECTOR_COMBINE_TEST -#undef THREADS_DUALVIEW_COMBINE_TEST -#undef THREADS_SEGMENTEDVIEW_TEST - -} // namespace Test - - -#endif /* #if defined( KOKKOS_HAVE_PTHREAD ) */ - diff --git a/lib/kokkos/containers/unit_tests/TestUnorderedMap.hpp b/lib/kokkos/containers/unit_tests/TestUnorderedMap.hpp deleted file mode 100644 index ff0328548d..0000000000 --- a/lib/kokkos/containers/unit_tests/TestUnorderedMap.hpp +++ /dev/null @@ -1,313 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#ifndef KOKKOS_TEST_UNORDERED_MAP_HPP -#define KOKKOS_TEST_UNORDERED_MAP_HPP - -#include -#include - - -namespace Test { - -namespace Impl { - -template -struct TestInsert -{ - typedef MapType map_type; - typedef typename map_type::execution_space execution_space; - typedef uint32_t value_type; - - map_type map; - uint32_t inserts; - uint32_t collisions; - - TestInsert( map_type arg_map, uint32_t arg_inserts, uint32_t arg_collisions) - : map(arg_map) - , inserts(arg_inserts) - , collisions(arg_collisions) - {} - - void testit( bool rehash_on_fail = true ) - { - execution_space::fence(); - - uint32_t failed_count = 0; - do { - failed_count = 0; - Kokkos::parallel_reduce(inserts, *this, failed_count); - - if (rehash_on_fail && failed_count > 0u) { - const uint32_t new_capacity = map.capacity() + ((map.capacity()*3ull)/20u) + failed_count/collisions ; - map.rehash( new_capacity ); - } - } while (rehash_on_fail && failed_count > 0u); - - execution_space::fence(); - } - - - KOKKOS_INLINE_FUNCTION - void init( value_type & failed_count ) const { failed_count = 0; } - - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & failed_count, const volatile value_type & count ) const - { failed_count += count; } - - KOKKOS_INLINE_FUNCTION - void operator()(uint32_t i, value_type & failed_count) const - { - const uint32_t key = Near ? i/collisions : i%(inserts/collisions); - if (map.insert(key,i).failed()) ++failed_count; - } - -}; - - template - struct TestErase - { - typedef TestErase self_type; - - typedef MapType map_type; - typedef typename MapType::execution_space execution_space; - - map_type m_map; - uint32_t m_num_erase; - uint32_t m_num_duplicates; - - TestErase(map_type map, uint32_t num_erases, uint32_t num_duplicates) - : m_map(map) - , m_num_erase(num_erases) - , m_num_duplicates(num_duplicates) - {} - - void testit() - { - execution_space::fence(); - Kokkos::parallel_for(m_num_erase, *this); - execution_space::fence(); - } - - KOKKOS_INLINE_FUNCTION - void operator()(typename execution_space::size_type i) const - { - if (Near) { - m_map.erase(i/m_num_duplicates); - } - else { - m_map.erase(i%(m_num_erase/m_num_duplicates)); - } - - } - }; - - template - struct TestFind - { - typedef MapType map_type; - typedef typename MapType::execution_space::execution_space execution_space; - typedef uint32_t value_type; - - map_type m_map; - uint32_t m_num_insert; - uint32_t m_num_duplicates; - uint32_t m_max_key; - - TestFind(map_type map, uint32_t num_inserts, uint32_t num_duplicates) - : m_map(map) - , m_num_insert(num_inserts) - , m_num_duplicates(num_duplicates) - , m_max_key( ((num_inserts + num_duplicates) - 1)/num_duplicates ) - {} - - void testit(value_type &errors) - { - execution_space::execution_space::fence(); - Kokkos::parallel_reduce(m_map.capacity(), *this, errors); - execution_space::execution_space::fence(); - } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & dst) - { - dst = 0; - } - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & dst, const volatile value_type & src) - { dst += src; } - - KOKKOS_INLINE_FUNCTION - void operator()(typename execution_space::size_type i, value_type & errors) const - { - const bool expect_to_find_i = (i < m_max_key); - - const bool exists = m_map.exists(i); - - if (expect_to_find_i && !exists) ++errors; - if (!expect_to_find_i && exists) ++errors; - } - }; - -} // namespace Impl - - - -template -void test_insert( uint32_t num_nodes , uint32_t num_inserts , uint32_t num_duplicates , bool near ) -{ - typedef Kokkos::UnorderedMap map_type; - typedef Kokkos::UnorderedMap const_map_type; - - const uint32_t expected_inserts = (num_inserts + num_duplicates -1u) / num_duplicates; - - map_type map; - map.rehash(num_nodes,false); - - if (near) { - Impl::TestInsert test_insert(map, num_inserts, num_duplicates); - test_insert.testit(); - } else - { - Impl::TestInsert test_insert(map, num_inserts, num_duplicates); - test_insert.testit(); - } - - const bool print_list = false; - if (print_list) { - Kokkos::Impl::UnorderedMapPrint f(map); - f.apply(); - } - - const uint32_t map_size = map.size(); - - ASSERT_FALSE( map.failed_insert()); - { - EXPECT_EQ(expected_inserts, map_size); - - { - uint32_t find_errors = 0; - Impl::TestFind test_find(map, num_inserts, num_duplicates); - test_find.testit(find_errors); - EXPECT_EQ( 0u, find_errors); - } - - map.begin_erase(); - Impl::TestErase test_erase(map, num_inserts, num_duplicates); - test_erase.testit(); - map.end_erase(); - EXPECT_EQ(0u, map.size()); - } -} - -template -void test_failed_insert( uint32_t num_nodes) -{ - typedef Kokkos::UnorderedMap map_type; - - map_type map(num_nodes); - Impl::TestInsert test_insert(map, 2u*num_nodes, 1u); - test_insert.testit(false /*don't rehash on fail*/); - Device::execution_space::fence(); - - EXPECT_TRUE( map.failed_insert() ); -} - - - -template -void test_deep_copy( uint32_t num_nodes ) -{ - typedef Kokkos::UnorderedMap map_type; - typedef Kokkos::UnorderedMap const_map_type; - - typedef typename map_type::HostMirror host_map_type ; - // typedef Kokkos::UnorderedMap host_map_type; - - map_type map; - map.rehash(num_nodes,false); - - { - Impl::TestInsert test_insert(map, num_nodes, 1); - test_insert.testit(); - ASSERT_EQ( map.size(), num_nodes); - ASSERT_FALSE( map.failed_insert() ); - { - uint32_t find_errors = 0; - Impl::TestFind test_find(map, num_nodes, 1); - test_find.testit(find_errors); - EXPECT_EQ( find_errors, 0u); - } - - } - - host_map_type hmap; - Kokkos::deep_copy(hmap, map); - - ASSERT_EQ( map.size(), hmap.size()); - ASSERT_EQ( map.capacity(), hmap.capacity()); - { - uint32_t find_errors = 0; - Impl::TestFind test_find(hmap, num_nodes, 1); - test_find.testit(find_errors); - EXPECT_EQ( find_errors, 0u); - } - - map_type mmap; - Kokkos::deep_copy(mmap, hmap); - - const_map_type cmap = mmap; - - EXPECT_EQ( cmap.size(), num_nodes); - - { - uint32_t find_errors = 0; - Impl::TestFind test_find(cmap, num_nodes, 1); - test_find.testit(find_errors); - EXPECT_EQ( find_errors, 0u); - } - -} - -} // namespace Test - -#endif //KOKKOS_TEST_UNORDERED_MAP_HPP diff --git a/lib/kokkos/containers/unit_tests/TestVector.hpp b/lib/kokkos/containers/unit_tests/TestVector.hpp deleted file mode 100644 index f9f4564898..0000000000 --- a/lib/kokkos/containers/unit_tests/TestVector.hpp +++ /dev/null @@ -1,131 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#ifndef KOKKOS_TEST_VECTOR_HPP -#define KOKKOS_TEST_VECTOR_HPP - -#include -#include -#include -#include -#include - -namespace Test { - -namespace Impl { - - template - struct test_vector_combinations - { - typedef test_vector_combinations self_type; - - typedef Scalar scalar_type; - typedef Device execution_space; - - Scalar reference; - Scalar result; - - template - Scalar run_me(unsigned int n){ - Vector a(n,1); - - - a.push_back(2); - a.resize(n+4); - a[n+1] = 3; - a[n+2] = 4; - a[n+3] = 5; - - - Scalar temp1 = a[2]; - Scalar temp2 = a[n]; - Scalar temp3 = a[n+1]; - - a.assign(n+2,-1); - - a[2] = temp1; - a[n] = temp2; - a[n+1] = temp3; - - Scalar test1 = 0; - for(unsigned int i=0; i >(size); - result = run_me >(size); - } - - }; - -} // namespace Impl - - - - -template -void test_vector_combinations(unsigned int size) -{ - Impl::test_vector_combinations test(size); - ASSERT_EQ( test.reference, test.result); -} - - -} // namespace Test - -#endif //KOKKOS_TEST_UNORDERED_MAP_HPP diff --git a/lib/kokkos/containers/unit_tests/UnitTestMain.cpp b/lib/kokkos/containers/unit_tests/UnitTestMain.cpp deleted file mode 100644 index f952ab3db5..0000000000 --- a/lib/kokkos/containers/unit_tests/UnitTestMain.cpp +++ /dev/null @@ -1,50 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -int main(int argc, char *argv[]) { - ::testing::InitGoogleTest(&argc,argv); - return RUN_ALL_TESTS(); -} - diff --git a/lib/kokkos/core/perf_test/Makefile b/lib/kokkos/core/perf_test/Makefile deleted file mode 100644 index 2bf189a22f..0000000000 --- a/lib/kokkos/core/perf_test/Makefile +++ /dev/null @@ -1,66 +0,0 @@ -KOKKOS_PATH = ../.. - -GTEST_PATH = ../../TPL/gtest - -vpath %.cpp ${KOKKOS_PATH}/core/perf_test - -default: build_all - echo "End Build" - - -include $(KOKKOS_PATH)/Makefile.kokkos - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - CXX = nvcc_wrapper - CXXFLAGS ?= -O3 - LINK = $(CXX) - LDFLAGS ?= -lpthread -else - CXX ?= g++ - CXXFLAGS ?= -O3 - LINK ?= $(CXX) - LDFLAGS ?= -lpthread -endif - -KOKKOS_CXXFLAGS += -I$(GTEST_PATH) -I${KOKKOS_PATH}/core/perf_test - -TEST_TARGETS = -TARGETS = - -OBJ_PERF = PerfTestHost.o PerfTestCuda.o PerfTestMain.o gtest-all.o -TARGETS += KokkosCore_PerformanceTest -TEST_TARGETS += test-performance - -OBJ_ATOMICS = test_atomic.o -TARGETS += KokkosCore_PerformanceTest_Atomics -TEST_TARGETS += test-atomic - - -KokkosCore_PerformanceTest: $(OBJ_PERF) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_PERF) $(KOKKOS_LIBS) $(LIB) -o KokkosCore_PerformanceTest - -KokkosCore_PerformanceTest_Atomics: $(OBJ_ATOMICS) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_ATOMICS) $(KOKKOS_LIBS) $(LIB) -o KokkosCore_PerformanceTest_Atomics - -test-performance: KokkosCore_PerformanceTest - ./KokkosCore_PerformanceTest - -test-atomic: KokkosCore_PerformanceTest_Atomics - ./KokkosCore_PerformanceTest_Atomics - - -build_all: $(TARGETS) - -test: $(TEST_TARGETS) - -clean: kokkos-clean - rm -f *.o $(TARGETS) - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< - -gtest-all.o:$(GTEST_PATH)/gtest/gtest-all.cc - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $(GTEST_PATH)/gtest/gtest-all.cc - diff --git a/lib/kokkos/core/perf_test/PerfTestBlasKernels.hpp b/lib/kokkos/core/perf_test/PerfTestBlasKernels.hpp deleted file mode 100644 index aa4046cbf0..0000000000 --- a/lib/kokkos/core/perf_test/PerfTestBlasKernels.hpp +++ /dev/null @@ -1,309 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_BLAS_KERNELS_HPP -#define KOKKOS_BLAS_KERNELS_HPP - -namespace Kokkos { - -template< class ConstVectorType , - class Device = typename ConstVectorType::execution_space > -struct Dot ; - -template< class ConstVectorType , - class Device = typename ConstVectorType::execution_space > -struct DotSingle ; - -template< class ConstScalarType , - class VectorType , - class Device = typename VectorType::execution_space > -struct Scale ; - -template< class ConstScalarType , - class ConstVectorType , - class VectorType , - class Device = typename VectorType::execution_space > -struct AXPBY ; - -/** \brief Y = alpha * X + beta * Y */ -template< class ConstScalarType , - class ConstVectorType , - class VectorType > -void axpby( const ConstScalarType & alpha , - const ConstVectorType & X , - const ConstScalarType & beta , - const VectorType & Y ) -{ - typedef AXPBY< ConstScalarType , ConstVectorType , VectorType > functor ; - - parallel_for( Y.dimension_0() , functor( alpha , X , beta , Y ) ); -} - -/** \brief Y *= alpha */ -template< class ConstScalarType , - class VectorType > -void scale( const ConstScalarType & alpha , const VectorType & Y ) -{ - typedef Scale< ConstScalarType , VectorType > functor ; - - parallel_for( Y.dimension_0() , functor( alpha , Y ) ); -} - -template< class ConstVectorType , - class Finalize > -void dot( const ConstVectorType & X , - const ConstVectorType & Y , - const Finalize & finalize ) -{ - typedef Dot< ConstVectorType > functor ; - - parallel_reduce( X.dimension_0() , functor( X , Y ) , finalize ); -} - -template< class ConstVectorType , - class Finalize > -void dot( const ConstVectorType & X , - const Finalize & finalize ) -{ - typedef DotSingle< ConstVectorType > functor ; - - parallel_reduce( X.dimension_0() , functor( X ) , finalize ); -} - -} /* namespace Kokkos */ - - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -template< class Type , class Device > -struct Dot -{ - typedef typename Device::execution_space execution_space ; - - typedef typename - Impl::StaticAssertSame< Impl::unsigned_< 1 > , - Impl::unsigned_< Type::Rank > >::type ok_rank ; - - -/* typedef typename - Impl::StaticAssertSame< execution_space , - typename Type::execution_space >::type ok_device ;*/ - - typedef double value_type ; - -#if 1 - typename Type::const_type X ; - typename Type::const_type Y ; -#else - Type X ; - Type Y ; -#endif - - Dot( const Type & arg_x , const Type & arg_y ) - : X(arg_x) , Y(arg_y) { } - - KOKKOS_INLINE_FUNCTION - void operator()( int i , value_type & update ) const - { update += X[i] * Y[i]; } - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & source ) - { update += source; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } -}; - -template< class Type , class Device > -struct DotSingle -{ - typedef typename Device::execution_space execution_space ; - - typedef typename - Impl::StaticAssertSame< Impl::unsigned_< 1 > , - Impl::unsigned_< Type::Rank > >::type ok_rank ; - -/* typedef typename - Impl::StaticAssertSame< execution_space , - typename Type::execution_space >::type ok_device ;*/ - - typedef double value_type ; - -#if 1 - typename Type::const_type X ; -#else - Type X ; -#endif - - DotSingle( const Type & arg_x ) : X(arg_x) {} - - KOKKOS_INLINE_FUNCTION - void operator()( int i , value_type & update ) const - { - const typename Type::value_type & x = X[i]; update += x * x ; - } - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & source ) - { update += source; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } -}; - - -template< class ScalarType , class VectorType , class Device> -struct Scale -{ - typedef typename Device::execution_space execution_space ; - -/* typedef typename - Impl::StaticAssertSame< execution_space , - typename ScalarType::execution_space >::type - ok_scalar_device ; - - typedef typename - Impl::StaticAssertSame< execution_space , - typename VectorType::execution_space >::type - ok_vector_device ;*/ - - typedef typename - Impl::StaticAssertSame< Impl::unsigned_< 0 > , - Impl::unsigned_< ScalarType::Rank > >::type - ok_scalar_rank ; - - typedef typename - Impl::StaticAssertSame< Impl::unsigned_< 1 > , - Impl::unsigned_< VectorType::Rank > >::type - ok_vector_rank ; - -#if 1 - typename ScalarType::const_type alpha ; -#else - ScalarType alpha ; -#endif - - VectorType Y ; - - Scale( const ScalarType & arg_alpha , const VectorType & arg_Y ) - : alpha( arg_alpha ), Y( arg_Y ) {} - - KOKKOS_INLINE_FUNCTION - void operator()( int i ) const - { - Y[i] *= alpha() ; - } -}; - - -template< class ScalarType , - class ConstVectorType , - class VectorType, - class Device> -struct AXPBY -{ - typedef typename Device::execution_space execution_space ; - -/* typedef typename - Impl::StaticAssertSame< execution_space , - typename ScalarType::execution_space >::type - ok_scalar_device ; - - typedef typename - Impl::StaticAssertSame< execution_space , - typename ConstVectorType::execution_space >::type - ok_const_vector_device ; - - typedef typename - Impl::StaticAssertSame< execution_space , - typename VectorType::execution_space >::type - ok_vector_device ;*/ - - typedef typename - Impl::StaticAssertSame< Impl::unsigned_< 0 > , - Impl::unsigned_< ScalarType::Rank > >::type - ok_scalar_rank ; - - typedef typename - Impl::StaticAssertSame< Impl::unsigned_< 1 > , - Impl::unsigned_< ConstVectorType::Rank > >::type - ok_const_vector_rank ; - - typedef typename - Impl::StaticAssertSame< Impl::unsigned_< 1 > , - Impl::unsigned_< VectorType::Rank > >::type - ok_vector_rank ; - -#if 1 - typename ScalarType::const_type alpha , beta ; - typename ConstVectorType::const_type X ; -#else - ScalarType alpha , beta ; - ConstVectorType X ; -#endif - - VectorType Y ; - - AXPBY( const ScalarType & arg_alpha , - const ConstVectorType & arg_X , - const ScalarType & arg_beta , - const VectorType & arg_Y ) - : alpha( arg_alpha ), beta( arg_beta ), X( arg_X ), Y( arg_Y ) {} - - KOKKOS_INLINE_FUNCTION - void operator()( int i ) const - { - Y[i] = alpha() * X[i] + beta() * Y[i] ; - } -}; - -} /* namespace Kokkos */ - -#endif /* #ifndef KOKKOS_BLAS_KERNELS_HPP */ diff --git a/lib/kokkos/core/perf_test/PerfTestCuda.cpp b/lib/kokkos/core/perf_test/PerfTestCuda.cpp deleted file mode 100644 index 1263a7672a..0000000000 --- a/lib/kokkos/core/perf_test/PerfTestCuda.cpp +++ /dev/null @@ -1,189 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include - -#include - -#if defined( KOKKOS_HAVE_CUDA ) - -#include - -#include -#include -#include -#include - - -namespace Test { - -class cuda : public ::testing::Test { - protected: - static void SetUpTestCase() { - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice(0) ); - } - static void TearDownTestCase() { - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); - } -}; - -TEST_F( cuda, hexgrad ) -{ - EXPECT_NO_THROW( run_test_hexgrad< Kokkos::Cuda >( 10 , 20, "Kokkos::Cuda" ) ); -} - -TEST_F( cuda, gramschmidt ) -{ - EXPECT_NO_THROW( run_test_gramschmidt< Kokkos::Cuda >( 10 , 20, "Kokkos::Cuda" ) ); -} - -namespace { - -template -struct TextureFetch -{ - typedef Kokkos::View< T *, Kokkos::CudaSpace> array_type; - typedef Kokkos::View< const T *, Kokkos::CudaSpace, Kokkos::MemoryRandomAccess> const_array_type; - typedef Kokkos::View< int *, Kokkos::CudaSpace> index_array_type; - typedef Kokkos::View< const int *, Kokkos::CudaSpace> const_index_array_type; - - struct FillArray - { - array_type m_array; - FillArray( const array_type & array ) - : m_array(array) - {} - - void apply() const - { - Kokkos::parallel_for( Kokkos::RangePolicy(0,m_array.dimension_0()), *this); - } - - KOKKOS_INLINE_FUNCTION - void operator()(int i) const { m_array(i) = i; } - }; - - struct RandomIndexes - { - index_array_type m_indexes; - typename index_array_type::HostMirror m_host_indexes; - RandomIndexes( const index_array_type & indexes) - : m_indexes(indexes) - , m_host_indexes(Kokkos::create_mirror(m_indexes)) - {} - - void apply() const - { - Kokkos::parallel_for( Kokkos::RangePolicy(0,m_host_indexes.dimension_0()), *this); - //random shuffle - Kokkos::HostSpace::execution_space::fence(); - std::random_shuffle(m_host_indexes.ptr_on_device(), m_host_indexes.ptr_on_device() + m_host_indexes.dimension_0()); - Kokkos::deep_copy(m_indexes,m_host_indexes); - } - - KOKKOS_INLINE_FUNCTION - void operator()(int i) const { m_host_indexes(i) = i; } - }; - - struct RandomReduce - { - const_array_type m_array; - const_index_array_type m_indexes; - RandomReduce( const const_array_type & array, const const_index_array_type & indexes) - : m_array(array) - , m_indexes(indexes) - {} - - void apply(T & reduce) const - { - Kokkos::parallel_reduce( Kokkos::RangePolicy(0,m_array.dimension_0()), *this, reduce); - } - - KOKKOS_INLINE_FUNCTION - void operator()(int i, T & reduce) const - { reduce += m_array(m_indexes(i)); } - }; - - static void run(int size, double & reduce_time, T &reduce) - { - array_type array("array",size); - index_array_type indexes("indexes",size); - - { FillArray f(array); f.apply(); } - { RandomIndexes f(indexes); f.apply(); } - - Kokkos::Cuda::fence(); - - Kokkos::Impl::Timer timer; - for (int j=0; j<10; ++j) { - RandomReduce f(array,indexes); - f.apply(reduce); - } - Kokkos::Cuda::fence(); - reduce_time = timer.seconds(); - } -}; - -} // unnamed namespace - -TEST_F( cuda, texture_double ) -{ - printf("Random reduce of double through texture fetch\n"); - for (int i=1; i<=27; ++i) { - int size = 1<::run(size,time,reduce); - printf(" time = %1.3e size = 2^%d\n", time, i); - } -} - -} // namespace Test - -#endif /* #if defined( KOKKOS_HAVE_CUDA ) */ - diff --git a/lib/kokkos/core/perf_test/PerfTestDriver.hpp b/lib/kokkos/core/perf_test/PerfTestDriver.hpp deleted file mode 100644 index e3dd3b4123..0000000000 --- a/lib/kokkos/core/perf_test/PerfTestDriver.hpp +++ /dev/null @@ -1,152 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -// mfh 06 Jun 2013: This macro doesn't work like one might thing it -// should. It doesn't take the template parameter DeviceType and -// print its actual type name; it just literally prints out -// "DeviceType". I've worked around this below without using the -// macro, so I'm commenting out the macro to avoid compiler complaints -// about an unused macro. - -// #define KOKKOS_MACRO_IMPL_TO_STRING( X ) #X -// #define KOKKOS_MACRO_TO_STRING( X ) KOKKOS_MACRO_IMPL_TO_STRING( X ) - -//------------------------------------------------------------------------ - -namespace Test { - -enum { NUMBER_OF_TRIALS = 5 }; - - - -template< class DeviceType > -void run_test_hexgrad( int exp_beg , int exp_end, const char deviceTypeName[] ) -{ - std::string label_hexgrad ; - label_hexgrad.append( "\"HexGrad< double , " ); - // mfh 06 Jun 2013: This only appends "DeviceType" (literally) to - // the string, not the actual name of the device type. Thus, I've - // modified the function to take the name of the device type. - // - //label_hexgrad.append( KOKKOS_MACRO_TO_STRING( DeviceType ) ); - label_hexgrad.append( deviceTypeName ); - label_hexgrad.append( " >\"" ); - - for (int i = exp_beg ; i < exp_end ; ++i) { - double min_seconds = 0.0 ; - double max_seconds = 0.0 ; - double avg_seconds = 0.0 ; - - const int parallel_work_length = 1<::test(parallel_work_length) ; - - if ( 0 == j ) { - min_seconds = seconds ; - max_seconds = seconds ; - } - else { - if ( seconds < min_seconds ) min_seconds = seconds ; - if ( seconds > max_seconds ) max_seconds = seconds ; - } - avg_seconds += seconds ; - } - avg_seconds /= NUMBER_OF_TRIALS ; - - std::cout << label_hexgrad - << " , " << parallel_work_length - << " , " << min_seconds - << " , " << ( min_seconds / parallel_work_length ) - << std::endl ; - } -} - -template< class DeviceType > -void run_test_gramschmidt( int exp_beg , int exp_end, const char deviceTypeName[] ) -{ - std::string label_gramschmidt ; - label_gramschmidt.append( "\"GramSchmidt< double , " ); - // mfh 06 Jun 2013: This only appends "DeviceType" (literally) to - // the string, not the actual name of the device type. Thus, I've - // modified the function to take the name of the device type. - // - //label_gramschmidt.append( KOKKOS_MACRO_TO_STRING( DeviceType ) ); - label_gramschmidt.append( deviceTypeName ); - label_gramschmidt.append( " >\"" ); - - for (int i = exp_beg ; i < exp_end ; ++i) { - double min_seconds = 0.0 ; - double max_seconds = 0.0 ; - double avg_seconds = 0.0 ; - - const int parallel_work_length = 1<::test(parallel_work_length, 32 ) ; - - if ( 0 == j ) { - min_seconds = seconds ; - max_seconds = seconds ; - } - else { - if ( seconds < min_seconds ) min_seconds = seconds ; - if ( seconds > max_seconds ) max_seconds = seconds ; - } - avg_seconds += seconds ; - } - avg_seconds /= NUMBER_OF_TRIALS ; - - std::cout << label_gramschmidt - << " , " << parallel_work_length - << " , " << min_seconds - << " , " << ( min_seconds / parallel_work_length ) - << std::endl ; - } -} - -} - diff --git a/lib/kokkos/core/perf_test/PerfTestGramSchmidt.hpp b/lib/kokkos/core/perf_test/PerfTestGramSchmidt.hpp deleted file mode 100644 index 03805dcdf5..0000000000 --- a/lib/kokkos/core/perf_test/PerfTestGramSchmidt.hpp +++ /dev/null @@ -1,226 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Test { - -// Reduction : result = dot( Q(:,j) , Q(:,j) ); -// PostProcess : R(j,j) = result ; inv = 1 / result ; -template< class VectorView , class ValueView > -struct InvNorm2 : public Kokkos::DotSingle< VectorView > { - - typedef typename Kokkos::DotSingle< VectorView >::value_type value_type ; - - ValueView Rjj ; - ValueView inv ; - - InvNorm2( const VectorView & argX , - const ValueView & argR , - const ValueView & argInv ) - : Kokkos::DotSingle< VectorView >( argX ) - , Rjj( argR ) - , inv( argInv ) - {} - - KOKKOS_INLINE_FUNCTION - void final( value_type & result ) const - { - result = sqrt( result ); - Rjj() = result ; - inv() = ( 0 < result ) ? 1.0 / result : 0 ; - } -}; - -template< class VectorView , class ValueView > -inline -void invnorm2( const VectorView & x , - const ValueView & r , - const ValueView & r_inv ) -{ - Kokkos::parallel_reduce( x.dimension_0() , InvNorm2< VectorView , ValueView >( x , r , r_inv ) ); -} - -// PostProcess : tmp = - ( R(j,k) = result ); -template< class VectorView , class ValueView > -struct DotM : public Kokkos::Dot< VectorView > { - - typedef typename Kokkos::Dot< VectorView >::value_type value_type ; - - ValueView Rjk ; - ValueView tmp ; - - DotM( const VectorView & argX , - const VectorView & argY , - const ValueView & argR , - const ValueView & argTmp ) - : Kokkos::Dot< VectorView >( argX , argY ) - , Rjk( argR ) - , tmp( argTmp ) - {} - - KOKKOS_INLINE_FUNCTION - void final( value_type & result ) const - { - Rjk() = result ; - tmp() = - result ; - } -}; - -template< class VectorView , class ValueView > -inline -void dot_neg( const VectorView & x , - const VectorView & y , - const ValueView & r , - const ValueView & r_neg ) -{ - Kokkos::parallel_reduce( x.dimension_0() , DotM< VectorView , ValueView >( x , y , r , r_neg ) ); -} - - -template< typename Scalar , class DeviceType > -struct ModifiedGramSchmidt -{ - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type ; - - typedef Kokkos::View< Scalar** , - Kokkos::LayoutLeft , - execution_space > multivector_type ; - - typedef Kokkos::View< Scalar* , - Kokkos::LayoutLeft , - execution_space > vector_type ; - - typedef Kokkos::View< Scalar , - Kokkos::LayoutLeft , - execution_space > value_view ; - - - multivector_type Q ; - multivector_type R ; - - static double factorization( const multivector_type Q_ , - const multivector_type R_ ) - { - const size_type count = Q_.dimension_1(); - value_view tmp("tmp"); - value_view one("one"); - - Kokkos::deep_copy( one , (Scalar) 1 ); - - Kokkos::Impl::Timer timer ; - - for ( size_type j = 0 ; j < count ; ++j ) { - // Reduction : tmp = dot( Q(:,j) , Q(:,j) ); - // PostProcess : tmp = sqrt( tmp ); R(j,j) = tmp ; tmp = 1 / tmp ; - const vector_type Qj = Kokkos::subview( Q_ , Kokkos::ALL() , j ); - const value_view Rjj = Kokkos::subview( R_ , j , j ); - - invnorm2( Qj , Rjj , tmp ); - - // Q(:,j) *= ( 1 / R(j,j) ); => Q(:,j) *= tmp ; - Kokkos::scale( tmp , Qj ); - - for ( size_t k = j + 1 ; k < count ; ++k ) { - const vector_type Qk = Kokkos::subview( Q_ , Kokkos::ALL() , k ); - const value_view Rjk = Kokkos::subview( R_ , j , k ); - - // Reduction : R(j,k) = dot( Q(:,j) , Q(:,k) ); - // PostProcess : tmp = - R(j,k); - dot_neg( Qj , Qk , Rjk , tmp ); - - // Q(:,k) -= R(j,k) * Q(:,j); => Q(:,k) += tmp * Q(:,j) - Kokkos::axpby( tmp , Qj , one , Qk ); - } - } - - execution_space::fence(); - - return timer.seconds(); - } - - //-------------------------------------------------------------------------- - - static double test( const size_t length , - const size_t count , - const size_t iter = 1 ) - { - multivector_type Q_( "Q" , length , count ); - multivector_type R_( "R" , count , count ); - - typename multivector_type::HostMirror A = - Kokkos::create_mirror( Q_ ); - - // Create and fill A on the host - - for ( size_type j = 0 ; j < count ; ++j ) { - for ( size_type i = 0 ; i < length ; ++i ) { - A(i,j) = ( i + 1 ) * ( j + 1 ); - } - } - - double dt_min = 0 ; - - for ( size_t i = 0 ; i < iter ; ++i ) { - - Kokkos::deep_copy( Q_ , A ); - - // A = Q * R - - const double dt = factorization( Q_ , R_ ); - - if ( 0 == i ) dt_min = dt ; - else dt_min = dt < dt_min ? dt : dt_min ; - } - - return dt_min ; - } -}; - -} - diff --git a/lib/kokkos/core/perf_test/PerfTestHexGrad.hpp b/lib/kokkos/core/perf_test/PerfTestHexGrad.hpp deleted file mode 100644 index d13d9a49e8..0000000000 --- a/lib/kokkos/core/perf_test/PerfTestHexGrad.hpp +++ /dev/null @@ -1,268 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -namespace Test { - -template< class DeviceType , - typename CoordScalarType = double , - typename GradScalarType = float > -struct HexGrad -{ - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type ; - - typedef HexGrad self_type; - - // 3D array : ( ParallelWork , Space , Node ) - - enum { NSpace = 3 , NNode = 8 }; - - typedef Kokkos::View< CoordScalarType*[NSpace][NNode] , execution_space > - elem_coord_type ; - - typedef Kokkos::View< GradScalarType*[NSpace][NNode] , execution_space > - elem_grad_type ; - - elem_coord_type coords ; - elem_grad_type grad_op ; - - enum { FLOPS = 318 }; // = 3 * ( 18 + 8 * 11 ) }; - enum { READS = 18 }; - enum { WRITES = 18 }; - - HexGrad( const elem_coord_type & arg_coords , - const elem_grad_type & arg_grad_op ) - : coords( arg_coords ) - , grad_op( arg_grad_op ) - {} - - KOKKOS_INLINE_FUNCTION static - void grad( const CoordScalarType x[] , - const CoordScalarType z[] , - GradScalarType grad_y[] ) - { - const GradScalarType R42=(x[3] - x[1]); - const GradScalarType R52=(x[4] - x[1]); - const GradScalarType R54=(x[4] - x[3]); - - const GradScalarType R63=(x[5] - x[2]); - const GradScalarType R83=(x[7] - x[2]); - const GradScalarType R86=(x[7] - x[5]); - - const GradScalarType R31=(x[2] - x[0]); - const GradScalarType R61=(x[5] - x[0]); - const GradScalarType R74=(x[6] - x[3]); - - const GradScalarType R72=(x[6] - x[1]); - const GradScalarType R75=(x[6] - x[4]); - const GradScalarType R81=(x[7] - x[0]); - - const GradScalarType t1=(R63 + R54); - const GradScalarType t2=(R61 + R74); - const GradScalarType t3=(R72 + R81); - - const GradScalarType t4 =(R86 + R42); - const GradScalarType t5 =(R83 + R52); - const GradScalarType t6 =(R75 + R31); - - // Calculate Y gradient from X and Z data - - grad_y[0] = (z[1] * t1) - (z[2] * R42) - (z[3] * t5) + (z[4] * t4) + (z[5] * R52) - (z[7] * R54); - grad_y[1] = (z[2] * t2) + (z[3] * R31) - (z[0] * t1) - (z[5] * t6) + (z[6] * R63) - (z[4] * R61); - grad_y[2] = (z[3] * t3) + (z[0] * R42) - (z[1] * t2) - (z[6] * t4) + (z[7] * R74) - (z[5] * R72); - grad_y[3] = (z[0] * t5) - (z[1] * R31) - (z[2] * t3) + (z[7] * t6) + (z[4] * R81) - (z[6] * R83); - grad_y[4] = (z[5] * t3) + (z[6] * R86) - (z[7] * t2) - (z[0] * t4) - (z[3] * R81) + (z[1] * R61); - grad_y[5] = (z[6] * t5) - (z[4] * t3) - (z[7] * R75) + (z[1] * t6) - (z[0] * R52) + (z[2] * R72); - grad_y[6] = (z[7] * t1) - (z[5] * t5) - (z[4] * R86) + (z[2] * t4) - (z[1] * R63) + (z[3] * R83); - grad_y[7] = (z[4] * t2) - (z[6] * t1) + (z[5] * R75) - (z[3] * t6) - (z[2] * R74) + (z[0] * R54); - } - - KOKKOS_INLINE_FUNCTION - void operator()( size_type ielem ) const - { - GradScalarType g[NNode] ; - - const CoordScalarType x[NNode] = { - coords(ielem,0,0), - coords(ielem,0,1), - coords(ielem,0,2), - coords(ielem,0,3), - coords(ielem,0,4), - coords(ielem,0,5), - coords(ielem,0,6), - coords(ielem,0,7) - }; - - const CoordScalarType y[NNode] = { - coords(ielem,1,0), - coords(ielem,1,1), - coords(ielem,1,2), - coords(ielem,1,3), - coords(ielem,1,4), - coords(ielem,1,5), - coords(ielem,1,6), - coords(ielem,1,7) - }; - - const CoordScalarType z[NNode] = { - coords(ielem,2,0), - coords(ielem,2,1), - coords(ielem,2,2), - coords(ielem,2,3), - coords(ielem,2,4), - coords(ielem,2,5), - coords(ielem,2,6), - coords(ielem,2,7) - }; - - grad( z , y , g ); - - grad_op(ielem,0,0) = g[0]; - grad_op(ielem,0,1) = g[1]; - grad_op(ielem,0,2) = g[2]; - grad_op(ielem,0,3) = g[3]; - grad_op(ielem,0,4) = g[4]; - grad_op(ielem,0,5) = g[5]; - grad_op(ielem,0,6) = g[6]; - grad_op(ielem,0,7) = g[7]; - - grad( x , z , g ); - - grad_op(ielem,1,0) = g[0]; - grad_op(ielem,1,1) = g[1]; - grad_op(ielem,1,2) = g[2]; - grad_op(ielem,1,3) = g[3]; - grad_op(ielem,1,4) = g[4]; - grad_op(ielem,1,5) = g[5]; - grad_op(ielem,1,6) = g[6]; - grad_op(ielem,1,7) = g[7]; - - grad( y , x , g ); - - grad_op(ielem,2,0) = g[0]; - grad_op(ielem,2,1) = g[1]; - grad_op(ielem,2,2) = g[2]; - grad_op(ielem,2,3) = g[3]; - grad_op(ielem,2,4) = g[4]; - grad_op(ielem,2,5) = g[5]; - grad_op(ielem,2,6) = g[6]; - grad_op(ielem,2,7) = g[7]; - } - - //-------------------------------------------------------------------------- - - struct Init { - typedef typename self_type::execution_space execution_space ; - - elem_coord_type coords ; - - Init( const elem_coord_type & arg_coords ) - : coords( arg_coords ) {} - - KOKKOS_INLINE_FUNCTION - void operator()( size_type ielem ) const - { - coords(ielem,0,0) = 0.; - coords(ielem,1,0) = 0.; - coords(ielem,2,0) = 0.; - - coords(ielem,0,1) = 1.; - coords(ielem,1,1) = 0.; - coords(ielem,2,1) = 0.; - - coords(ielem,0,2) = 1.; - coords(ielem,1,2) = 1.; - coords(ielem,2,2) = 0.; - - coords(ielem,0,3) = 0.; - coords(ielem,1,3) = 1.; - coords(ielem,2,3) = 0.; - - - coords(ielem,0,4) = 0.; - coords(ielem,1,4) = 0.; - coords(ielem,2,4) = 1.; - - coords(ielem,0,5) = 1.; - coords(ielem,1,5) = 0.; - coords(ielem,2,5) = 1.; - - coords(ielem,0,6) = 1.; - coords(ielem,1,6) = 1.; - coords(ielem,2,6) = 1.; - - coords(ielem,0,7) = 0.; - coords(ielem,1,7) = 1.; - coords(ielem,2,7) = 1.; - } - }; - - //-------------------------------------------------------------------------- - - static double test( const int count , const int iter = 1 ) - { - elem_coord_type coord( "coord" , count ); - elem_grad_type grad ( "grad" , count ); - - // Execute the parallel kernels on the arrays: - - double dt_min = 0 ; - - Kokkos::parallel_for( count , Init( coord ) ); - execution_space::fence(); - - for ( int i = 0 ; i < iter ; ++i ) { - Kokkos::Impl::Timer timer ; - Kokkos::parallel_for( count , HexGrad( coord , grad ) ); - execution_space::fence(); - const double dt = timer.seconds(); - if ( 0 == i ) dt_min = dt ; - else dt_min = dt < dt_min ? dt : dt_min ; - } - - return dt_min ; - } -}; - -} - diff --git a/lib/kokkos/core/perf_test/PerfTestHost.cpp b/lib/kokkos/core/perf_test/PerfTestHost.cpp deleted file mode 100644 index 6a0f2efada..0000000000 --- a/lib/kokkos/core/perf_test/PerfTestHost.cpp +++ /dev/null @@ -1,104 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#if defined( KOKKOS_HAVE_OPENMP ) - -typedef Kokkos::OpenMP TestHostDevice ; -const char TestHostDeviceName[] = "Kokkos::OpenMP" ; - -#elif defined( KOKKOS_HAVE_PTHREAD ) - -typedef Kokkos::Threads TestHostDevice ; -const char TestHostDeviceName[] = "Kokkos::Threads" ; - -#elif defined( KOKKOS_HAVE_SERIAL ) - -typedef Kokkos::Serial TestHostDevice ; -const char TestHostDeviceName[] = "Kokkos::Serial" ; - -#else -# error "You must enable at least one of the following execution spaces in order to build this test: Kokkos::Threads, Kokkos::OpenMP, or Kokkos::Serial." -#endif - -#include - -#include -#include -#include -#include - -//------------------------------------------------------------------------ - -namespace Test { - -class host : public ::testing::Test { -protected: - static void SetUpTestCase() - { - const unsigned team_count = Kokkos::hwloc::get_available_numa_count(); - const unsigned threads_per_team = 4 ; - - TestHostDevice::initialize( team_count * threads_per_team ); - } - - static void TearDownTestCase() - { - TestHostDevice::finalize(); - } -}; - -TEST_F( host, hexgrad ) { - EXPECT_NO_THROW(run_test_hexgrad< TestHostDevice>( 10, 20, TestHostDeviceName )); -} - -TEST_F( host, gramschmidt ) { - EXPECT_NO_THROW(run_test_gramschmidt< TestHostDevice>( 10, 20, TestHostDeviceName )); -} - -} // namespace Test - - diff --git a/lib/kokkos/core/perf_test/PerfTestMain.cpp b/lib/kokkos/core/perf_test/PerfTestMain.cpp deleted file mode 100644 index ac91630829..0000000000 --- a/lib/kokkos/core/perf_test/PerfTestMain.cpp +++ /dev/null @@ -1,49 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -int main(int argc, char *argv[]) { - ::testing::InitGoogleTest(&argc,argv); - return RUN_ALL_TESTS(); -} diff --git a/lib/kokkos/core/perf_test/test_atomic.cpp b/lib/kokkos/core/perf_test/test_atomic.cpp deleted file mode 100644 index f1e5c1b620..0000000000 --- a/lib/kokkos/core/perf_test/test_atomic.cpp +++ /dev/null @@ -1,504 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include - -#include -#include - -typedef Kokkos::DefaultExecutionSpace exec_space; - -#define RESET 0 -#define BRIGHT 1 -#define DIM 2 -#define UNDERLINE 3 -#define BLINK 4 -#define REVERSE 7 -#define HIDDEN 8 - -#define BLACK 0 -#define RED 1 -#define GREEN 2 -#define YELLOW 3 -#define BLUE 4 -#define MAGENTA 5 -#define CYAN 6 -#define GREY 7 -#define WHITE 8 - -void textcolor(int attr, int fg, int bg) -{ char command[13]; - - /* Command is the control command to the terminal */ - sprintf(command, "%c[%d;%d;%dm", 0x1B, attr, fg + 30, bg + 40); - printf("%s", command); -} -void textcolor_standard() {textcolor(RESET, BLACK, WHITE);} - - -template -struct ZeroFunctor{ - typedef DEVICE_TYPE execution_space; - typedef typename Kokkos::View type; - typedef typename Kokkos::View::HostMirror h_type; - type data; - KOKKOS_INLINE_FUNCTION - void operator()(int i) const { - data() = 0; - } -}; - -//--------------------------------------------------- -//--------------atomic_fetch_add--------------------- -//--------------------------------------------------- - -template -struct AddFunctor{ - typedef DEVICE_TYPE execution_space; - typedef Kokkos::View type; - type data; - - KOKKOS_INLINE_FUNCTION - void operator()(int i) const { - Kokkos::atomic_fetch_add(&data(),(T)1); - } -}; - -template -T AddLoop(int loop) { - struct ZeroFunctor f_zero; - typename ZeroFunctor::type data("Data"); - typename ZeroFunctor::h_type h_data("HData"); - f_zero.data = data; - Kokkos::parallel_for(1,f_zero); - exec_space::fence(); - - struct AddFunctor f_add; - f_add.data = data; - Kokkos::parallel_for(loop,f_add); - exec_space::fence(); - - Kokkos::deep_copy(h_data,data); - T val = h_data(); - return val; -} - -template -struct AddNonAtomicFunctor{ - typedef DEVICE_TYPE execution_space; - typedef Kokkos::View type; - type data; - - KOKKOS_INLINE_FUNCTION - void operator()(int i) const { - data()+=(T)1; - } -}; - -template -T AddLoopNonAtomic(int loop) { - struct ZeroFunctor f_zero; - typename ZeroFunctor::type data("Data"); - typename ZeroFunctor::h_type h_data("HData"); - - f_zero.data = data; - Kokkos::parallel_for(1,f_zero); - exec_space::fence(); - - struct AddNonAtomicFunctor f_add; - f_add.data = data; - Kokkos::parallel_for(loop,f_add); - exec_space::fence(); - - Kokkos::deep_copy(h_data,data); - T val = h_data(); - - return val; -} - -template -T AddLoopSerial(int loop) { - T* data = new T[1]; - data[0] = 0; - - for(int i=0;i -struct CASFunctor{ - typedef DEVICE_TYPE execution_space; - typedef Kokkos::View type; - type data; - - KOKKOS_INLINE_FUNCTION - void operator()(int i) const { - T old = data(); - T newval, assumed; - do { - assumed = old; - newval = assumed + (T)1; - old = Kokkos::atomic_compare_exchange(&data(), assumed, newval); - } - while( old != assumed ); - } -}; - -template -T CASLoop(int loop) { - struct ZeroFunctor f_zero; - typename ZeroFunctor::type data("Data"); - typename ZeroFunctor::h_type h_data("HData"); - f_zero.data = data; - Kokkos::parallel_for(1,f_zero); - exec_space::fence(); - - struct CASFunctor f_cas; - f_cas.data = data; - Kokkos::parallel_for(loop,f_cas); - exec_space::fence(); - - Kokkos::deep_copy(h_data,data); - T val = h_data(); - - return val; -} - -template -struct CASNonAtomicFunctor{ - typedef DEVICE_TYPE execution_space; - typedef Kokkos::View type; - type data; - - KOKKOS_INLINE_FUNCTION - void operator()(int i) const { - volatile T assumed; - volatile T newval; - bool fail=1; - do { - assumed = data(); - newval = assumed + (T)1; - if(data()==assumed) { - data() = newval; - fail = 0; - } - } - while(fail); - } -}; - -template -T CASLoopNonAtomic(int loop) { - struct ZeroFunctor f_zero; - typename ZeroFunctor::type data("Data"); - typename ZeroFunctor::h_type h_data("HData"); - f_zero.data = data; - Kokkos::parallel_for(1,f_zero); - exec_space::fence(); - - struct CASNonAtomicFunctor f_cas; - f_cas.data = data; - Kokkos::parallel_for(loop,f_cas); - exec_space::fence(); - - Kokkos::deep_copy(h_data,data); - T val = h_data(); - - return val; -} - -template -T CASLoopSerial(int loop) { - T* data = new T[1]; - data[0] = 0; - - for(int i=0;i -struct ExchFunctor{ - typedef DEVICE_TYPE execution_space; - typedef Kokkos::View type; - type data, data2; - - KOKKOS_INLINE_FUNCTION - void operator()(int i) const { - T old = Kokkos::atomic_exchange(&data(),(T)i); - Kokkos::atomic_fetch_add(&data2(),old); - } -}; - -template -T ExchLoop(int loop) { - struct ZeroFunctor f_zero; - typename ZeroFunctor::type data("Data"); - typename ZeroFunctor::h_type h_data("HData"); - f_zero.data = data; - Kokkos::parallel_for(1,f_zero); - exec_space::fence(); - - typename ZeroFunctor::type data2("Data"); - typename ZeroFunctor::h_type h_data2("HData"); - f_zero.data = data2; - Kokkos::parallel_for(1,f_zero); - exec_space::fence(); - - struct ExchFunctor f_exch; - f_exch.data = data; - f_exch.data2 = data2; - Kokkos::parallel_for(loop,f_exch); - exec_space::fence(); - - Kokkos::deep_copy(h_data,data); - Kokkos::deep_copy(h_data2,data2); - T val = h_data() + h_data2(); - - return val; -} - -template -struct ExchNonAtomicFunctor{ - typedef DEVICE_TYPE execution_space; - typedef Kokkos::View type; - type data, data2; - - KOKKOS_INLINE_FUNCTION - void operator()(int i) const { - T old = data(); - data()=(T) i; - data2()+=old; - } -}; - - -template -T ExchLoopNonAtomic(int loop) { - struct ZeroFunctor f_zero; - typename ZeroFunctor::type data("Data"); - typename ZeroFunctor::h_type h_data("HData"); - f_zero.data = data; - Kokkos::parallel_for(1,f_zero); - exec_space::fence(); - - typename ZeroFunctor::type data2("Data"); - typename ZeroFunctor::h_type h_data2("HData"); - f_zero.data = data2; - Kokkos::parallel_for(1,f_zero); - exec_space::fence(); - - struct ExchNonAtomicFunctor f_exch; - f_exch.data = data; - f_exch.data2 = data2; - Kokkos::parallel_for(loop,f_exch); - exec_space::fence(); - - Kokkos::deep_copy(h_data,data); - Kokkos::deep_copy(h_data2,data2); - T val = h_data() + h_data2(); - - return val; -} - -template -T ExchLoopSerial(int loop) { - T* data = new T[1]; - T* data2 = new T[1]; - data[0] = 0; - data2[0] = 0; - for(int i=0;i -T LoopVariant(int loop, int test) { - switch (test) { - case 1: return AddLoop(loop); - case 2: return CASLoop(loop); - case 3: return ExchLoop(loop); - } - return 0; -} - -template -T LoopVariantSerial(int loop, int test) { - switch (test) { - case 1: return AddLoopSerial(loop); - case 2: return CASLoopSerial(loop); - case 3: return ExchLoopSerial(loop); - } - return 0; -} - -template -T LoopVariantNonAtomic(int loop, int test) { - switch (test) { - case 1: return AddLoopNonAtomic(loop); - case 2: return CASLoopNonAtomic(loop); - case 3: return ExchLoopNonAtomic(loop); - } - return 0; -} - -template -void Loop(int loop, int test, const char* type_name) { - LoopVariant(loop,test); - - Kokkos::Impl::Timer timer; - T res = LoopVariant(loop,test); - double time1 = timer.seconds(); - - timer.reset(); - T resNonAtomic = LoopVariantNonAtomic(loop,test); - double time2 = timer.seconds(); - - timer.reset(); - T resSerial = LoopVariantSerial(loop,test); - double time3 = timer.seconds(); - - time1*=1e6/loop; - time2*=1e6/loop; - time3*=1e6/loop; - //textcolor_standard(); - bool passed = true; - if(resSerial!=res) passed = false; - //if(!passed) textcolor(RESET,BLACK,YELLOW); - printf("%s Test %i %s --- Loop: %i Value (S,A,NA): %e %e %e Time: %7.4e %7.4e %7.4e Size of Type %i)",type_name,test,passed?"PASSED":"FAILED",loop,1.0*resSerial,1.0*res,1.0*resNonAtomic,time1,time2,time3,(int)sizeof(T)); - //if(!passed) textcolor_standard(); - printf("\n"); -} - - -template -void Test(int loop, int test, const char* type_name) { - if(test==-1) { - Loop(loop,1,type_name); - Loop(loop,2,type_name); - Loop(loop,3,type_name); - - } - else - Loop(loop,test,type_name); -} - -int main(int argc, char* argv[]) -{ - int type = -1; - int loop = 1000000; - int test = -1; - - for(int i=0;i(loop,test,"int "); - } - if(type==2) { - Test(loop,test,"long int "); - } - if(type==3) { - Test(loop,test,"long long int "); - } - if(type==4) { - Test(loop,test,"unsigned int "); - } - if(type==5) { - Test(loop,test,"unsigned long int "); - } - if(type==6) { - Test(loop,test,"unsigned long long int "); - } - if(type==10) { - //Test(loop,test,"float "); - } - if(type==11) { - Test(loop,test,"double "); - } - if(!all_tests) type=100; - else type++; - } - - Kokkos::finalize(); - -} - diff --git a/lib/kokkos/core/src/Cuda/KokkosExp_Cuda_View.hpp b/lib/kokkos/core/src/Cuda/KokkosExp_Cuda_View.hpp deleted file mode 100644 index 37c5e53e58..0000000000 --- a/lib/kokkos/core/src/Cuda/KokkosExp_Cuda_View.hpp +++ /dev/null @@ -1,283 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXPERIMENTAL_CUDA_VIEW_HPP -#define KOKKOS_EXPERIMENTAL_CUDA_VIEW_HPP - -/* only compile this file if CUDA is enabled for Kokkos */ -#if defined( KOKKOS_HAVE_CUDA ) - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -//---------------------------------------------------------------------------- -// Cuda Texture fetches can be performed for 4, 8 and 16 byte objects (int,int2,int4) -// Via reinterpret_case this can be used to support all scalar types of those sizes. -// Any other scalar type falls back to either normal reads out of global memory, -// or using the __ldg intrinsic on Kepler GPUs or newer (Compute Capability >= 3.0) - -template< typename ValueType , typename AliasType > -struct CudaTextureFetch { - - ::cudaTextureObject_t m_obj ; - const ValueType * m_ptr ; - int m_offset ; - - // Deference operator pulls through texture object and returns by value - template< typename iType > - KOKKOS_INLINE_FUNCTION - ValueType operator[]( const iType & i ) const - { -#if defined( __CUDA_ARCH__ ) && ( 300 <= __CUDA_ARCH__ ) - AliasType v = tex1Dfetch( m_obj , i + m_offset ); - return *(reinterpret_cast (&v)); -#else - return m_ptr[ i ]; -#endif - } - - // Pointer to referenced memory - KOKKOS_INLINE_FUNCTION - operator const ValueType * () const { return m_ptr ; } - - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch() : m_obj() , m_ptr() , m_offset() {} - - KOKKOS_INLINE_FUNCTION - ~CudaTextureFetch() {} - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch( const CudaTextureFetch & rhs ) - : m_obj( rhs.m_obj ) - , m_ptr( rhs.m_ptr ) - , m_offset( rhs.m_offset ) - {} - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch( CudaTextureFetch && rhs ) - : m_obj( rhs.m_obj ) - , m_ptr( rhs.m_ptr ) - , m_offset( rhs.m_offset ) - {} - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch & operator = ( const CudaTextureFetch & rhs ) - { - m_obj = rhs.m_obj ; - m_ptr = rhs.m_ptr ; - m_offset = rhs.m_offset ; - return *this ; - } - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch & operator = ( CudaTextureFetch && rhs ) - { - m_obj = rhs.m_obj ; - m_ptr = rhs.m_ptr ; - m_offset = rhs.m_offset ; - return *this ; - } - - // Texture object spans the entire allocation. - // This handle may view a subset of the allocation, so an offset is required. - template< class CudaMemorySpace > - inline explicit - CudaTextureFetch( const ValueType * const arg_ptr - , Kokkos::Experimental::Impl::SharedAllocationRecord< CudaMemorySpace , void > & record - ) - // 'attach_texture_object' returns 0 when __CUDA_ARCH__ < 300 - : m_obj( record.template attach_texture_object< AliasType >() ) - , m_ptr( arg_ptr ) - , m_offset( record.attach_texture_object_offset( reinterpret_cast( arg_ptr ) ) ) - {} -}; - -#if defined( KOKKOS_CUDA_USE_LDG_INTRINSIC ) - -template< typename ValueType , typename AliasType > -struct CudaLDGFetch { - - const ValueType * m_ptr ; - - template< typename iType > - KOKKOS_INLINE_FUNCTION - ValueType operator[]( const iType & i ) const - { - AliasType v = __ldg(reinterpret_cast(&m_ptr[i])); - return *(reinterpret_cast (&v)); - } - - KOKKOS_INLINE_FUNCTION - operator const ValueType * () const { return m_ptr ; } - - KOKKOS_INLINE_FUNCTION - CudaLDGFetch() : m_ptr() {} - - KOKKOS_INLINE_FUNCTION - ~CudaLDGFetch() {} - - KOKKOS_INLINE_FUNCTION - CudaLDGFetch( const CudaLDGFetch & rhs ) - : m_ptr( rhs.m_ptr ) - {} - - KOKKOS_INLINE_FUNCTION - CudaLDGFetch( CudaLDGFetch && rhs ) - : m_ptr( rhs.m_ptr ) - {} - - KOKKOS_INLINE_FUNCTION - CudaLDGFetch & operator = ( const CudaLDGFetch & rhs ) - { - m_ptr = rhs.m_ptr ; - return *this ; - } - - KOKKOS_INLINE_FUNCTION - CudaLDGFetch & operator = ( CudaLDGFetch && rhs ) - { - m_ptr = rhs.m_ptr ; - return *this ; - } - - template< class CudaMemorySpace > - inline explicit - CudaTextureFetch( const ValueType * const arg_ptr - , Kokkos::Experimental::Impl::SharedAllocationRecord< CudaMemorySpace , void > const & - ) - : m_ptr( arg_data_ptr ) - {} -}; - -#endif - -} // namespace Impl -} // namespace Experimental -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -/** \brief Replace Default ViewDataHandle with Cuda texture fetch specialization - * if 'const' value type, CudaSpace and random access. - */ -template< class Traits > -class ViewDataHandle< Traits , - typename std::enable_if<( - // Is Cuda memory space - ( std::is_same< typename Traits::memory_space,Kokkos::CudaSpace>::value || - std::is_same< typename Traits::memory_space,Kokkos::CudaUVMSpace>::value ) - && - // Is a trivial const value of 4, 8, or 16 bytes - std::is_trivial::value - && - std::is_same::value - && - ( sizeof(typename Traits::const_value_type) == 4 || - sizeof(typename Traits::const_value_type) == 8 || - sizeof(typename Traits::const_value_type) == 16 ) - && - // Random access trait - ( Traits::memory_traits::RandomAccess != 0 ) - )>::type > -{ -public: - - using track_type = Kokkos::Experimental::Impl::SharedAllocationTracker ; - - using value_type = typename Traits::const_value_type ; - using return_type = typename Traits::const_value_type ; // NOT a reference - - using alias_type = typename std::conditional< ( sizeof(value_type) == 4 ) , int , - typename std::conditional< ( sizeof(value_type) == 8 ) , ::int2 , - typename std::conditional< ( sizeof(value_type) == 16 ) , ::int4 , void - >::type - >::type - >::type ; - -#if defined( KOKKOS_CUDA_USE_LDG_INTRINSIC ) - using handle_type = Kokkos::Experimental::Impl::CudaLDGFetch< value_type , alias_type > ; -#else - using handle_type = Kokkos::Experimental::Impl::CudaTextureFetch< value_type , alias_type > ; -#endif - - KOKKOS_INLINE_FUNCTION - static handle_type const & assign( handle_type const & arg_handle , track_type const & /* arg_tracker */ ) - { - return arg_handle ; - } - - KOKKOS_INLINE_FUNCTION - static handle_type assign( value_type * arg_data_ptr, track_type const & arg_tracker ) - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - // Assignment of texture = non-texture requires creation of a texture object - // which can only occur on the host. In addition, 'get_record' is only valid - // if called in a host execution space - return handle_type( arg_data_ptr , arg_tracker.template get_record< typename Traits::memory_space >() ); -#else - Kokkos::Impl::cuda_abort("Cannot create Cuda texture object from within a Cuda kernel"); - return handle_type(); -#endif - } -}; - -} -} -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #if defined( KOKKOS_HAVE_CUDA ) */ -#endif /* #ifndef KOKKOS_CUDA_VIEW_HPP */ - diff --git a/lib/kokkos/core/src/Cuda/Kokkos_CudaExec.hpp b/lib/kokkos/core/src/Cuda/Kokkos_CudaExec.hpp deleted file mode 100644 index c1b2d51c47..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_CudaExec.hpp +++ /dev/null @@ -1,277 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CUDAEXEC_HPP -#define KOKKOS_CUDAEXEC_HPP - -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#ifdef KOKKOS_HAVE_CUDA - -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -struct CudaTraits { - enum { WarpSize = 32 /* 0x0020 */ }; - enum { WarpIndexMask = 0x001f /* Mask for warpindex */ }; - enum { WarpIndexShift = 5 /* WarpSize == 1 << WarpShift */ }; - - enum { SharedMemoryBanks = 32 /* Compute device 2.0 */ }; - enum { SharedMemoryCapacity = 0x0C000 /* 48k shared / 16k L1 Cache */ }; - enum { SharedMemoryUsage = 0x04000 /* 16k shared / 48k L1 Cache */ }; - - enum { UpperBoundGridCount = 65535 /* Hard upper bound */ }; - enum { ConstantMemoryCapacity = 0x010000 /* 64k bytes */ }; - enum { ConstantMemoryUsage = 0x008000 /* 32k bytes */ }; - enum { ConstantMemoryCache = 0x002000 /* 8k bytes */ }; - - typedef unsigned long - ConstantGlobalBufferType[ ConstantMemoryUsage / sizeof(unsigned long) ]; - - enum { ConstantMemoryUseThreshold = 0x000200 /* 512 bytes */ }; - - KOKKOS_INLINE_FUNCTION static - CudaSpace::size_type warp_count( CudaSpace::size_type i ) - { return ( i + WarpIndexMask ) >> WarpIndexShift ; } - - KOKKOS_INLINE_FUNCTION static - CudaSpace::size_type warp_align( CudaSpace::size_type i ) - { - enum { Mask = ~CudaSpace::size_type( WarpIndexMask ) }; - return ( i + WarpIndexMask ) & Mask ; - } -}; - -//---------------------------------------------------------------------------- - -CudaSpace::size_type cuda_internal_maximum_warp_count(); -CudaSpace::size_type cuda_internal_maximum_grid_count(); -CudaSpace::size_type cuda_internal_maximum_shared_words(); - -CudaSpace::size_type * cuda_internal_scratch_flags( const CudaSpace::size_type size ); -CudaSpace::size_type * cuda_internal_scratch_space( const CudaSpace::size_type size ); -CudaSpace::size_type * cuda_internal_scratch_unified( const CudaSpace::size_type size ); - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#if defined( __CUDACC__ ) - -/** \brief Access to constant memory on the device */ -#ifdef KOKKOS_CUDA_USE_RELOCATABLE_DEVICE_CODE -extern -#endif -__device__ __constant__ -Kokkos::Impl::CudaTraits::ConstantGlobalBufferType -kokkos_impl_cuda_constant_memory_buffer ; - -__device__ __constant__ -int* kokkos_impl_cuda_atomic_lock_array ; -#define CUDA_SPACE_ATOMIC_MASK 0x1FFFF -#define CUDA_SPACE_ATOMIC_XOR_MASK 0x15A39 - -namespace Kokkos { -namespace Impl { -__device__ inline -bool lock_address_cuda_space(void* ptr) { - size_t offset = size_t(ptr); - offset = offset >> 2; - offset = offset & CUDA_SPACE_ATOMIC_MASK; - //offset = offset xor CUDA_SPACE_ATOMIC_XOR_MASK; - return (0 == atomicCAS(&kokkos_impl_cuda_atomic_lock_array[offset],0,1)); -} - -__device__ inline -void unlock_address_cuda_space(void* ptr) { - size_t offset = size_t(ptr); - offset = offset >> 2; - offset = offset & CUDA_SPACE_ATOMIC_MASK; - //offset = offset xor CUDA_SPACE_ATOMIC_XOR_MASK; - atomicExch( &kokkos_impl_cuda_atomic_lock_array[ offset ], 0); -} - -} -} - -template< typename T > -inline -__device__ -T * kokkos_impl_cuda_shared_memory() -{ extern __shared__ Kokkos::CudaSpace::size_type sh[]; return (T*) sh ; } - -namespace Kokkos { -namespace Impl { - -//---------------------------------------------------------------------------- -// See section B.17 of Cuda C Programming Guide Version 3.2 -// for discussion of -// __launch_bounds__(maxThreadsPerBlock,minBlocksPerMultiprocessor) -// function qualifier which could be used to improve performance. -//---------------------------------------------------------------------------- -// Maximize L1 cache and minimize shared memory: -// cudaFuncSetCacheConfig(MyKernel, cudaFuncCachePreferL1 ); -// For 2.0 capability: 48 KB L1 and 16 KB shared -//---------------------------------------------------------------------------- - -template< class DriverType > -__global__ -static void cuda_parallel_launch_constant_memory() -{ - const DriverType & driver = - *((const DriverType *) kokkos_impl_cuda_constant_memory_buffer ); - - driver(); -} - -template< class DriverType > -__global__ -static void cuda_parallel_launch_local_memory( const DriverType driver ) -{ - driver(); -} - -template < class DriverType , - bool Large = ( CudaTraits::ConstantMemoryUseThreshold < sizeof(DriverType) ) > -struct CudaParallelLaunch ; - -template < class DriverType > -struct CudaParallelLaunch< DriverType , true > { - - inline - CudaParallelLaunch( const DriverType & driver - , const dim3 & grid - , const dim3 & block - , const int shmem - , const cudaStream_t stream = 0 ) - { - if ( grid.x && ( block.x * block.y * block.z ) ) { - - if ( sizeof( Kokkos::Impl::CudaTraits::ConstantGlobalBufferType ) < - sizeof( DriverType ) ) { - Kokkos::Impl::throw_runtime_exception( std::string("CudaParallelLaunch FAILED: Functor is too large") ); - } - - if ( CudaTraits::SharedMemoryCapacity < shmem ) { - Kokkos::Impl::throw_runtime_exception( std::string("CudaParallelLaunch FAILED: shared memory request is too large") ); - } - else if ( shmem ) { - cudaFuncSetCacheConfig( cuda_parallel_launch_constant_memory< DriverType > , cudaFuncCachePreferShared ); - } else { - cudaFuncSetCacheConfig( cuda_parallel_launch_constant_memory< DriverType > , cudaFuncCachePreferL1 ); - } - - // Copy functor to constant memory on the device - cudaMemcpyToSymbol( kokkos_impl_cuda_constant_memory_buffer , & driver , sizeof(DriverType) ); - - int* lock_array_ptr = lock_array_cuda_space_ptr(); - cudaMemcpyToSymbol( kokkos_impl_cuda_atomic_lock_array , & lock_array_ptr , sizeof(int*) ); - - // Invoke the driver function on the device - cuda_parallel_launch_constant_memory< DriverType ><<< grid , block , shmem , stream >>>(); - -#if defined( KOKKOS_ENABLE_DEBUG_BOUNDS_CHECK ) - Kokkos::Cuda::fence(); - CUDA_SAFE_CALL( cudaGetLastError() ); -#endif - } - } -}; - -template < class DriverType > -struct CudaParallelLaunch< DriverType , false > { - - inline - CudaParallelLaunch( const DriverType & driver - , const dim3 & grid - , const dim3 & block - , const int shmem - , const cudaStream_t stream = 0 ) - { - if ( grid.x && ( block.x * block.y * block.z ) ) { - - if ( CudaTraits::SharedMemoryCapacity < shmem ) { - Kokkos::Impl::throw_runtime_exception( std::string("CudaParallelLaunch FAILED: shared memory request is too large") ); - } - else if ( shmem ) { - cudaFuncSetCacheConfig( cuda_parallel_launch_local_memory< DriverType > , cudaFuncCachePreferShared ); - } else { - cudaFuncSetCacheConfig( cuda_parallel_launch_local_memory< DriverType > , cudaFuncCachePreferL1 ); - } - - int* lock_array_ptr = lock_array_cuda_space_ptr(); - cudaMemcpyToSymbol( kokkos_impl_cuda_atomic_lock_array , & lock_array_ptr , sizeof(int*) ); - - cuda_parallel_launch_local_memory< DriverType ><<< grid , block , shmem , stream >>>( driver ); - -#if defined( KOKKOS_ENABLE_DEBUG_BOUNDS_CHECK ) - Kokkos::Cuda::fence(); - CUDA_SAFE_CALL( cudaGetLastError() ); -#endif - } - } -}; - -//---------------------------------------------------------------------------- - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* defined( __CUDACC__ ) */ -#endif /* defined( KOKKOS_HAVE_CUDA ) */ -#endif /* #ifndef KOKKOS_CUDAEXEC_HPP */ diff --git a/lib/kokkos/core/src/Cuda/Kokkos_CudaSpace.cpp b/lib/kokkos/core/src/Cuda/Kokkos_CudaSpace.cpp deleted file mode 100644 index 13316cb63e..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_CudaSpace.cpp +++ /dev/null @@ -1,686 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#ifdef KOKKOS_HAVE_CUDA - -#include -#include - -#include -#include -#include - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -namespace { - cudaStream_t get_deep_copy_stream() { - static cudaStream_t s = 0; - if( s == 0) { - cudaStreamCreate ( &s ); - } - return s; - } -} - -DeepCopy::DeepCopy( void * dst , const void * src , size_t n ) -{ CUDA_SAFE_CALL( cudaMemcpy( dst , src , n , cudaMemcpyDefault ) ); } - -DeepCopy::DeepCopy( void * dst , const void * src , size_t n ) -{ CUDA_SAFE_CALL( cudaMemcpy( dst , src , n , cudaMemcpyDefault ) ); } - -DeepCopy::DeepCopy( void * dst , const void * src , size_t n ) -{ CUDA_SAFE_CALL( cudaMemcpy( dst , src , n , cudaMemcpyDefault ) ); } - -DeepCopy::DeepCopy( const Cuda & instance , void * dst , const void * src , size_t n ) -{ CUDA_SAFE_CALL( cudaMemcpyAsync( dst , src , n , cudaMemcpyDefault , instance.cuda_stream() ) ); } - -DeepCopy::DeepCopy( const Cuda & instance , void * dst , const void * src , size_t n ) -{ CUDA_SAFE_CALL( cudaMemcpyAsync( dst , src , n , cudaMemcpyDefault , instance.cuda_stream() ) ); } - -DeepCopy::DeepCopy( const Cuda & instance , void * dst , const void * src , size_t n ) -{ CUDA_SAFE_CALL( cudaMemcpyAsync( dst , src , n , cudaMemcpyDefault , instance.cuda_stream() ) ); } - -void DeepCopyAsyncCuda( void * dst , const void * src , size_t n) { - cudaStream_t s = get_deep_copy_stream(); - CUDA_SAFE_CALL( cudaMemcpyAsync( dst , src , n , cudaMemcpyDefault , s ) ); - cudaStreamSynchronize(s); -} - -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - - -namespace Kokkos { - -namespace { - -void texture_object_attach_impl( Impl::AllocationTracker const & tracker - , unsigned type_size - , ::cudaChannelFormatDesc const & desc - ) -{ - enum { TEXTURE_BOUND_1D = 2u << 27 }; - - if ( tracker.attribute() == NULL ) { - // check for correct allocator - const bool ok_alloc = tracker.allocator()->support_texture_binding(); - - const bool ok_count = (tracker.alloc_size() / type_size) < TEXTURE_BOUND_1D; - - if (ok_alloc && ok_count) { - Impl::TextureAttribute * attr = new Impl::TextureAttribute( tracker.alloc_ptr(), tracker.alloc_size(), desc ); - tracker.set_attribute( attr ); - } - else { - std::ostringstream oss; - oss << "Error: Cannot attach texture object"; - if (!ok_alloc) { - oss << ", incompatabile allocator " << tracker.allocator()->name(); - } - if (!ok_count) { - oss << ", array " << tracker.label() << " too large"; - } - oss << "."; - Kokkos::Impl::throw_runtime_exception( oss.str() ); - } - } - - if ( NULL == dynamic_cast(tracker.attribute()) ) { - std::ostringstream oss; - oss << "Error: Allocation " << tracker.label() << " already has an attribute attached."; - Kokkos::Impl::throw_runtime_exception( oss.str() ); - } - -} - -} // unnamed namespace - -/*--------------------------------------------------------------------------*/ - -Impl::AllocationTracker CudaSpace::allocate_and_track( const std::string & label, const size_t size ) -{ - return Impl::AllocationTracker( allocator(), size, label); -} - -void CudaSpace::texture_object_attach( Impl::AllocationTracker const & tracker - , unsigned type_size - , ::cudaChannelFormatDesc const & desc - ) -{ - texture_object_attach_impl( tracker, type_size, desc ); -} - -void CudaSpace::access_error() -{ - const std::string msg("Kokkos::CudaSpace::access_error attempt to execute Cuda function from non-Cuda space" ); - Kokkos::Impl::throw_runtime_exception( msg ); -} - -void CudaSpace::access_error( const void * const ) -{ - const std::string msg("Kokkos::CudaSpace::access_error attempt to execute Cuda function from non-Cuda space" ); - Kokkos::Impl::throw_runtime_exception( msg ); -} - -/*--------------------------------------------------------------------------*/ - -Impl::AllocationTracker CudaUVMSpace::allocate_and_track( const std::string & label, const size_t size ) -{ - return Impl::AllocationTracker( allocator(), size, label); -} - -void CudaUVMSpace::texture_object_attach( Impl::AllocationTracker const & tracker - , unsigned type_size - , ::cudaChannelFormatDesc const & desc - ) -{ - texture_object_attach_impl( tracker, type_size, desc ); -} - -bool CudaUVMSpace::available() -{ -#if defined( CUDA_VERSION ) && ( 6000 <= CUDA_VERSION ) && !defined(__APPLE__) - enum { UVM_available = true }; -#else - enum { UVM_available = false }; -#endif - return UVM_available; -} - -/*--------------------------------------------------------------------------*/ - -Impl::AllocationTracker CudaHostPinnedSpace::allocate_and_track( const std::string & label, const size_t size ) -{ - return Impl::AllocationTracker( allocator(), size, label); -} - -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -CudaSpace::CudaSpace() - : m_device( Kokkos::Cuda().cuda_device() ) -{ -} - -CudaUVMSpace::CudaUVMSpace() - : m_device( Kokkos::Cuda().cuda_device() ) -{ -} - -CudaHostPinnedSpace::CudaHostPinnedSpace() -{ -} - -void * CudaSpace::allocate( const size_t arg_alloc_size ) const -{ - void * ptr = NULL; - - CUDA_SAFE_CALL( cudaMalloc( &ptr, arg_alloc_size ) ); - - return ptr ; -} - -void * CudaUVMSpace::allocate( const size_t arg_alloc_size ) const -{ - void * ptr = NULL; - - CUDA_SAFE_CALL( cudaMallocManaged( &ptr, arg_alloc_size , cudaMemAttachGlobal ) ); - - return ptr ; -} - -void * CudaHostPinnedSpace::allocate( const size_t arg_alloc_size ) const -{ - void * ptr = NULL; - - CUDA_SAFE_CALL( cudaHostAlloc( &ptr, arg_alloc_size , cudaHostAllocDefault ) ); - - return ptr ; -} - -void CudaSpace::deallocate( void * const arg_alloc_ptr , const size_t /* arg_alloc_size */ ) const -{ - try { - CUDA_SAFE_CALL( cudaFree( arg_alloc_ptr ) ); - } catch(...) {} -} - -void CudaUVMSpace::deallocate( void * const arg_alloc_ptr , const size_t /* arg_alloc_size */ ) const -{ - try { - CUDA_SAFE_CALL( cudaFree( arg_alloc_ptr ) ); - } catch(...) {} -} - -void CudaHostPinnedSpace::deallocate( void * const arg_alloc_ptr , const size_t /* arg_alloc_size */ ) const -{ - try { - CUDA_SAFE_CALL( cudaFreeHost( arg_alloc_ptr ) ); - } catch(...) {} -} - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -SharedAllocationRecord< void , void > -SharedAllocationRecord< Kokkos::CudaSpace , void >::s_root_record ; - -SharedAllocationRecord< void , void > -SharedAllocationRecord< Kokkos::CudaUVMSpace , void >::s_root_record ; - -SharedAllocationRecord< void , void > -SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void >::s_root_record ; - -::cudaTextureObject_t -SharedAllocationRecord< Kokkos::CudaSpace , void >:: -attach_texture_object( const unsigned sizeof_alias - , void * const alloc_ptr - , size_t const alloc_size ) -{ - // Only valid for 300 <= __CUDA_ARCH__ - // otherwise return zero. - - ::cudaTextureObject_t tex_obj ; - - struct cudaResourceDesc resDesc ; - struct cudaTextureDesc texDesc ; - - memset( & resDesc , 0 , sizeof(resDesc) ); - memset( & texDesc , 0 , sizeof(texDesc) ); - - resDesc.resType = cudaResourceTypeLinear ; - resDesc.res.linear.desc = ( sizeof_alias == 4 ? cudaCreateChannelDesc< int >() : - ( sizeof_alias == 8 ? cudaCreateChannelDesc< ::int2 >() : - /* sizeof_alias == 16 */ cudaCreateChannelDesc< ::int4 >() ) ); - resDesc.res.linear.sizeInBytes = alloc_size ; - resDesc.res.linear.devPtr = alloc_ptr ; - - CUDA_SAFE_CALL( cudaCreateTextureObject( & tex_obj , & resDesc, & texDesc, NULL ) ); - - return tex_obj ; -} - -std::string -SharedAllocationRecord< Kokkos::CudaSpace , void >::get_label() const -{ - SharedAllocationHeader header ; - - Kokkos::Impl::DeepCopy< Kokkos::HostSpace , Kokkos::CudaSpace >( & header , RecordBase::head() , sizeof(SharedAllocationHeader) ); - - return std::string( header.m_label ); -} - -std::string -SharedAllocationRecord< Kokkos::CudaUVMSpace , void >::get_label() const -{ - return std::string( RecordBase::head()->m_label ); -} - -std::string -SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void >::get_label() const -{ - return std::string( RecordBase::head()->m_label ); -} - -SharedAllocationRecord< Kokkos::CudaSpace , void > * -SharedAllocationRecord< Kokkos::CudaSpace , void >:: -allocate( const Kokkos::CudaSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - ) -{ - return new SharedAllocationRecord( arg_space , arg_label , arg_alloc_size ); -} - -SharedAllocationRecord< Kokkos::CudaUVMSpace , void > * -SharedAllocationRecord< Kokkos::CudaUVMSpace , void >:: -allocate( const Kokkos::CudaUVMSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - ) -{ - return new SharedAllocationRecord( arg_space , arg_label , arg_alloc_size ); -} - -SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void > * -SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void >:: -allocate( const Kokkos::CudaHostPinnedSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - ) -{ - return new SharedAllocationRecord( arg_space , arg_label , arg_alloc_size ); -} - -void -SharedAllocationRecord< Kokkos::CudaSpace , void >:: -deallocate( SharedAllocationRecord< void , void > * arg_rec ) -{ - delete static_cast(arg_rec); -} - -void -SharedAllocationRecord< Kokkos::CudaUVMSpace , void >:: -deallocate( SharedAllocationRecord< void , void > * arg_rec ) -{ - delete static_cast(arg_rec); -} - -void -SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void >:: -deallocate( SharedAllocationRecord< void , void > * arg_rec ) -{ - delete static_cast(arg_rec); -} - -SharedAllocationRecord< Kokkos::CudaSpace , void >:: -~SharedAllocationRecord() -{ - m_space.deallocate( SharedAllocationRecord< void , void >::m_alloc_ptr - , SharedAllocationRecord< void , void >::m_alloc_size - ); -} - -SharedAllocationRecord< Kokkos::CudaUVMSpace , void >:: -~SharedAllocationRecord() -{ - m_space.deallocate( SharedAllocationRecord< void , void >::m_alloc_ptr - , SharedAllocationRecord< void , void >::m_alloc_size - ); -} - -SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void >:: -~SharedAllocationRecord() -{ - m_space.deallocate( SharedAllocationRecord< void , void >::m_alloc_ptr - , SharedAllocationRecord< void , void >::m_alloc_size - ); -} - -SharedAllocationRecord< Kokkos::CudaSpace , void >:: -SharedAllocationRecord( const Kokkos::CudaSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - , const SharedAllocationRecord< void , void >::function_type arg_dealloc - ) - // Pass through allocated [ SharedAllocationHeader , user_memory ] - // Pass through deallocation function - : SharedAllocationRecord< void , void > - ( & SharedAllocationRecord< Kokkos::CudaSpace , void >::s_root_record - , reinterpret_cast( arg_space.allocate( sizeof(SharedAllocationHeader) + arg_alloc_size ) ) - , sizeof(SharedAllocationHeader) + arg_alloc_size - , arg_dealloc - ) - , m_tex_obj( 0 ) - , m_space( arg_space ) -{ - SharedAllocationHeader header ; - - // Fill in the Header information - header.m_record = static_cast< SharedAllocationRecord< void , void > * >( this ); - - strncpy( header.m_label - , arg_label.c_str() - , SharedAllocationHeader::maximum_label_length - ); - - // Copy to device memory - Kokkos::Impl::DeepCopy::DeepCopy( RecordBase::m_alloc_ptr , & header , sizeof(SharedAllocationHeader) ); -} - -SharedAllocationRecord< Kokkos::CudaUVMSpace , void >:: -SharedAllocationRecord( const Kokkos::CudaUVMSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - , const SharedAllocationRecord< void , void >::function_type arg_dealloc - ) - // Pass through allocated [ SharedAllocationHeader , user_memory ] - // Pass through deallocation function - : SharedAllocationRecord< void , void > - ( & SharedAllocationRecord< Kokkos::CudaUVMSpace , void >::s_root_record - , reinterpret_cast( arg_space.allocate( sizeof(SharedAllocationHeader) + arg_alloc_size ) ) - , sizeof(SharedAllocationHeader) + arg_alloc_size - , arg_dealloc - ) - , m_tex_obj( 0 ) - , m_space( arg_space ) -{ - // Fill in the Header information, directly accessible via UVM - - RecordBase::m_alloc_ptr->m_record = this ; - - strncpy( RecordBase::m_alloc_ptr->m_label - , arg_label.c_str() - , SharedAllocationHeader::maximum_label_length - ); -} - -SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void >:: -SharedAllocationRecord( const Kokkos::CudaHostPinnedSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - , const SharedAllocationRecord< void , void >::function_type arg_dealloc - ) - // Pass through allocated [ SharedAllocationHeader , user_memory ] - // Pass through deallocation function - : SharedAllocationRecord< void , void > - ( & SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void >::s_root_record - , reinterpret_cast( arg_space.allocate( sizeof(SharedAllocationHeader) + arg_alloc_size ) ) - , sizeof(SharedAllocationHeader) + arg_alloc_size - , arg_dealloc - ) - , m_space( arg_space ) -{ - // Fill in the Header information, directly accessible via UVM - - RecordBase::m_alloc_ptr->m_record = this ; - - strncpy( RecordBase::m_alloc_ptr->m_label - , arg_label.c_str() - , SharedAllocationHeader::maximum_label_length - ); -} - -SharedAllocationRecord< Kokkos::CudaSpace , void > * -SharedAllocationRecord< Kokkos::CudaSpace , void >::get_record( void * alloc_ptr ) -{ - using Header = SharedAllocationHeader ; - using RecordBase = SharedAllocationRecord< void , void > ; - using RecordCuda = SharedAllocationRecord< Kokkos::CudaSpace , void > ; - -#if 0 - // Copy the header from the allocation - SharedAllocationHeader head ; - - SharedAllocationHeader const * const head_cuda = Header::get_header( alloc_ptr ); - - Kokkos::Impl::DeepCopy::DeepCopy( & head , head_cuda , sizeof(SharedAllocationHeader) ); - - RecordCuda * const record = static_cast< RecordCuda * >( head.m_record ); - - if ( record->m_alloc_ptr != head_cuda ) { - Kokkos::Impl::throw_runtime_exception( std::string("Kokkos::Experimental::Impl::SharedAllocationRecord< Kokkos::CudaSpace , void >::get_record ERROR" ) ); - } - -#else - - // Iterate the list to search for the record among all allocations - // requires obtaining the root of the list and then locking the list. - - RecordCuda * const record = static_cast< RecordCuda * >( RecordBase::find( & s_root_record , alloc_ptr ) ); - - if ( record == 0 ) { - Kokkos::Impl::throw_runtime_exception( std::string("Kokkos::Experimental::Impl::SharedAllocationRecord< Kokkos::CudaSpace , void >::get_record ERROR" ) ); - } - -#endif - - return record ; -} - -SharedAllocationRecord< Kokkos::CudaUVMSpace , void > * -SharedAllocationRecord< Kokkos::CudaUVMSpace , void >::get_record( void * alloc_ptr ) -{ - using Header = SharedAllocationHeader ; - using RecordCuda = SharedAllocationRecord< Kokkos::CudaUVMSpace , void > ; - - Header * const h = reinterpret_cast< Header * >( alloc_ptr ) - 1 ; - - if ( h->m_record->m_alloc_ptr != h ) { - Kokkos::Impl::throw_runtime_exception( std::string("Kokkos::Experimental::Impl::SharedAllocationRecord< Kokkos::CudaUVMSpace , void >::get_record ERROR" ) ); - } - - return static_cast< RecordCuda * >( h->m_record ); -} - -SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void > * -SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void >::get_record( void * alloc_ptr ) -{ - using Header = SharedAllocationHeader ; - using RecordCuda = SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void > ; - - Header * const h = reinterpret_cast< Header * >( alloc_ptr ) - 1 ; - - if ( h->m_record->m_alloc_ptr != h ) { - Kokkos::Impl::throw_runtime_exception( std::string("Kokkos::Experimental::Impl::SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void >::get_record ERROR" ) ); - } - - return static_cast< RecordCuda * >( h->m_record ); -} - -// Iterate records to print orphaned memory ... -void -SharedAllocationRecord< Kokkos::CudaSpace , void >:: -print_records( std::ostream & s , const Kokkos::CudaSpace & space , bool detail ) -{ - SharedAllocationRecord< void , void > * r = & s_root_record ; - - char buffer[256] ; - - SharedAllocationHeader head ; - - if ( detail ) { - do { - if ( r->m_alloc_ptr ) { - Kokkos::Impl::DeepCopy::DeepCopy( & head , r->m_alloc_ptr , sizeof(SharedAllocationHeader) ); - } - else { - head.m_label[0] = 0 ; - } - - snprintf( buffer , 256 , "Cuda addr( 0x%.12lx ) list( 0x%.12lx 0x%.12lx ) extent[ 0x%.12lx + %.8ld ] count(%d) dealloc(0x%.12lx) %s\n" - , reinterpret_cast( r ) - , reinterpret_cast( r->m_prev ) - , reinterpret_cast( r->m_next ) - , reinterpret_cast( r->m_alloc_ptr ) - , r->m_alloc_size - , r->m_count - , reinterpret_cast( r->m_dealloc ) - , head.m_label - ); - std::cout << buffer ; - r = r->m_next ; - } while ( r != & s_root_record ); - } - else { - do { - if ( r->m_alloc_ptr ) { - - Kokkos::Impl::DeepCopy::DeepCopy( & head , r->m_alloc_ptr , sizeof(SharedAllocationHeader) ); - - snprintf( buffer , 256 , "Cuda [ 0x%.12lx + %ld ] %s\n" - , reinterpret_cast< unsigned long >( r->data() ) - , r->size() - , head.m_label - ); - } - else { - snprintf( buffer , 256 , "Cuda [ 0 + 0 ]\n" ); - } - std::cout << buffer ; - r = r->m_next ; - } while ( r != & s_root_record ); - } -} - -void -SharedAllocationRecord< Kokkos::CudaUVMSpace , void >:: -print_records( std::ostream & s , const Kokkos::CudaUVMSpace & space , bool detail ) -{ - SharedAllocationRecord< void , void >::print_host_accessible_records( s , "CudaUVM" , & s_root_record , detail ); -} - -void -SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void >:: -print_records( std::ostream & s , const Kokkos::CudaHostPinnedSpace & space , bool detail ) -{ - SharedAllocationRecord< void , void >::print_host_accessible_records( s , "CudaHostPinned" , & s_root_record , detail ); -} - -} // namespace Impl -} // namespace Experimental -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace { - __global__ void init_lock_array_kernel() { - unsigned i = blockIdx.x*blockDim.x + threadIdx.x; - - if(i>>(); - } -} - -} -} -#endif // KOKKOS_HAVE_CUDA - diff --git a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Alloc.hpp b/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Alloc.hpp deleted file mode 100644 index e1314c0e51..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Alloc.hpp +++ /dev/null @@ -1,183 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CUDA_ALLOCATION_TRACKING_HPP -#define KOKKOS_CUDA_ALLOCATION_TRACKING_HPP - -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#ifdef KOKKOS_HAVE_CUDA - -#include -#include // AllocatorAttributeBase - -namespace Kokkos { -namespace Impl { - -template< class DestructFunctor > -SharedAllocationRecord * -shared_allocation_record( Kokkos::CudaSpace const & arg_space - , void * const arg_alloc_ptr - , DestructFunctor const & arg_destruct ) -{ - SharedAllocationRecord * const record = SharedAllocationRecord::get_record( arg_alloc_ptr ); - - // assert: record != 0 - - // assert: sizeof(DestructFunctor) <= record->m_destruct_size - - // assert: record->m_destruct_function == 0 - - DestructFunctor * const functor = - reinterpret_cast< DestructFunctor * >( - reinterpret_cast< unsigned long >( record ) + sizeof(SharedAllocationRecord) ); - - new( functor ) DestructFunctor( arg_destruct ); - - record->m_destruct_functor = & shared_allocation_destroy< DestructFunctor > ; - - return record ; -} - - -/// class CudaUnmanagedAllocator -/// does nothing when deallocate(ptr,size) is called -struct CudaUnmanagedAllocator -{ - static const char * name() - { - return "Cuda Unmanaged Allocator"; - } - - static void deallocate(void * /*ptr*/, size_t /*size*/) {} - - static bool support_texture_binding() { return true; } -}; - -/// class CudaUnmanagedAllocator -/// does nothing when deallocate(ptr,size) is called -struct CudaUnmanagedUVMAllocator -{ - static const char * name() - { - return "Cuda Unmanaged UVM Allocator"; - } - - static void deallocate(void * /*ptr*/, size_t /*size*/) {} - - static bool support_texture_binding() { return true; } -}; - -/// class CudaUnmanagedHostAllocator -/// does nothing when deallocate(ptr,size) is called -class CudaUnmanagedHostAllocator -{ -public: - static const char * name() - { - return "Cuda Unmanaged Host Allocator"; - } - // Unmanaged deallocate does nothing - static void deallocate(void * /*ptr*/, size_t /*size*/) {} -}; - -/// class CudaMallocAllocator -class CudaMallocAllocator -{ -public: - static const char * name() - { - return "Cuda Malloc Allocator"; - } - - static void* allocate(size_t size); - - static void deallocate(void * ptr, size_t); - - static void * reallocate(void * old_ptr, size_t old_size, size_t new_size); - - static bool support_texture_binding() { return true; } -}; - -/// class CudaUVMAllocator -class CudaUVMAllocator -{ -public: - static const char * name() - { - return "Cuda UVM Allocator"; - } - - static void* allocate(size_t size); - - static void deallocate(void * ptr, size_t); - - static void * reallocate(void * old_ptr, size_t old_size, size_t new_size); - - static bool support_texture_binding() { return true; } -}; - -/// class CudaHostAllocator -class CudaHostAllocator -{ -public: - static const char * name() - { - return "Cuda Host Allocator"; - } - - static void* allocate(size_t size); - - static void deallocate(void * ptr, size_t); - - static void * reallocate(void * old_ptr, size_t old_size, size_t new_size); -}; - - -}} // namespace Kokkos::Impl - -#endif //KOKKOS_HAVE_CUDA - -#endif // #ifndef KOKKOS_CUDA_ALLOCATION_TRACKING_HPP - diff --git a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_BasicAllocators.cpp b/lib/kokkos/core/src/Cuda/Kokkos_Cuda_BasicAllocators.cpp deleted file mode 100644 index 8c8c5e47a5..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_BasicAllocators.cpp +++ /dev/null @@ -1,192 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#ifdef KOKKOS_HAVE_CUDA - -#include -#include -#include - -#include - -namespace Kokkos { namespace Impl { - - -/*--------------------------------------------------------------------------*/ -TextureAttribute::TextureAttribute( void * const alloc_ptr - , size_t alloc_size - , cudaChannelFormatDesc const & desc - ) - : m_tex_obj(0) -{ - cuda_device_synchronize(); - - struct cudaResourceDesc resDesc ; - struct cudaTextureDesc texDesc ; - - memset( & resDesc , 0 , sizeof(resDesc) ); - memset( & texDesc , 0 , sizeof(texDesc) ); - - resDesc.resType = cudaResourceTypeLinear ; - resDesc.res.linear.desc = desc ; - resDesc.res.linear.sizeInBytes = alloc_size ; - resDesc.res.linear.devPtr = alloc_ptr ; - - CUDA_SAFE_CALL( cudaCreateTextureObject( & m_tex_obj , & resDesc, & texDesc, NULL) ); - - cuda_device_synchronize(); -} - - -TextureAttribute::~TextureAttribute() -{ - if (m_tex_obj) { - cudaDestroyTextureObject( m_tex_obj ); - } -} - -/*--------------------------------------------------------------------------*/ - -void * CudaMallocAllocator::allocate( size_t size ) -{ - void * ptr = NULL; - - CUDA_SAFE_CALL( cudaMalloc( &ptr, size ) ); - - return ptr; -} - -void CudaMallocAllocator::deallocate( void * ptr, size_t /*size*/ ) -{ - try { - CUDA_SAFE_CALL( cudaFree( ptr ) ); - } catch(...) {} -} - -void * CudaMallocAllocator::reallocate(void * old_ptr, size_t old_size, size_t new_size) -{ - void * ptr = old_ptr; - if (old_size != new_size) { - ptr = allocate( new_size ); - size_t copy_size = old_size < new_size ? old_size : new_size; - - CUDA_SAFE_CALL( cudaMemcpy( ptr , old_ptr , copy_size , cudaMemcpyDefault ) ); - - deallocate( old_ptr, old_size ); - } - return ptr; -} - -/*--------------------------------------------------------------------------*/ - -void * CudaUVMAllocator::allocate( size_t size ) -{ -#if defined( CUDA_VERSION ) && ( 6000 <= CUDA_VERSION ) - void * ptr = NULL; - CUDA_SAFE_CALL( cudaMallocManaged( &ptr, size, cudaMemAttachGlobal ) ); - return ptr; -#else - throw_runtime_exception( "CUDA VERSION does not support UVM" ); - return NULL; -#endif -} - -void CudaUVMAllocator::deallocate( void * ptr, size_t /*size*/ ) -{ - try { - CUDA_SAFE_CALL( cudaFree( ptr ) ); - } catch(...) {} -} - -void * CudaUVMAllocator::reallocate(void * old_ptr, size_t old_size, size_t new_size) -{ - void * ptr = old_ptr; - if (old_size != new_size) { - ptr = allocate( new_size ); - size_t copy_size = old_size < new_size ? old_size : new_size; - - CUDA_SAFE_CALL( cudaMemcpy( ptr , old_ptr , copy_size , cudaMemcpyDefault ) ); - - deallocate( old_ptr, old_size ); - } - return ptr; -} - -/*--------------------------------------------------------------------------*/ - -void * CudaHostAllocator::allocate( size_t size ) -{ - void * ptr = NULL; - CUDA_SAFE_CALL( cudaHostAlloc( &ptr , size , cudaHostAllocDefault ) ); - return ptr; -} - -void CudaHostAllocator::deallocate( void * ptr, size_t /*size*/ ) -{ - try { - CUDA_SAFE_CALL( cudaFreeHost( ptr ) ); - } catch(...) {} -} - -void * CudaHostAllocator::reallocate(void * old_ptr, size_t old_size, size_t new_size) -{ - void * ptr = old_ptr; - if (old_size != new_size) { - ptr = allocate( new_size ); - size_t copy_size = old_size < new_size ? old_size : new_size; - - CUDA_SAFE_CALL( cudaMemcpy( ptr , old_ptr , copy_size , cudaMemcpyHostToHost ) ); - - deallocate( old_ptr, old_size ); - } - return ptr; -} - -/*--------------------------------------------------------------------------*/ - -}} // namespace Kokkos::Impl - -#endif //KOKKOS_HAVE_CUDA diff --git a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_BasicAllocators.hpp b/lib/kokkos/core/src/Cuda/Kokkos_Cuda_BasicAllocators.hpp deleted file mode 100644 index 86fe1c901b..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_BasicAllocators.hpp +++ /dev/null @@ -1,187 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CUDA_BASIC_ALLOCATORS_HPP -#define KOKKOS_CUDA_BASIC_ALLOCATORS_HPP - -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#ifdef KOKKOS_HAVE_CUDA - -#include -#include // AllocatorAttributeBase - -namespace Kokkos { namespace Impl { - - -// Cuda 5.0 defines 'cudaTextureObject_t' -// to be an 'unsigned long long'. This chould change with -// future version of Cuda and this typedef would have to -// change accordingly. - -#if defined( CUDA_VERSION ) && ( 5000 <= CUDA_VERSION ) - -typedef enable_if< - sizeof(::cudaTextureObject_t) == sizeof(const void *) , - ::cudaTextureObject_t >::type cuda_texture_object_type ; - -#else - -typedef const void * cuda_texture_object_type ; - -#endif - - -struct TextureAttribute : public AllocatorAttributeBase -{ - cuda_texture_object_type m_tex_obj ; - - TextureAttribute( void * const alloc_ptr - , size_t alloc_size - , cudaChannelFormatDesc const & desc - ); - - ~TextureAttribute(); -}; - - -/// class CudaUnmanagedAllocator -/// does nothing when deallocate(ptr,size) is called -struct CudaUnmanagedAllocator -{ - static const char * name() - { - return "Cuda Unmanaged Allocator"; - } - - static void deallocate(void * /*ptr*/, size_t /*size*/) {} - - static bool support_texture_binding() { return true; } -}; - -/// class CudaUnmanagedAllocator -/// does nothing when deallocate(ptr,size) is called -struct CudaUnmanagedUVMAllocator -{ - static const char * name() - { - return "Cuda Unmanaged UVM Allocator"; - } - - static void deallocate(void * /*ptr*/, size_t /*size*/) {} - - static bool support_texture_binding() { return true; } -}; - -/// class CudaUnmanagedHostAllocator -/// does nothing when deallocate(ptr,size) is called -class CudaUnmanagedHostAllocator -{ -public: - static const char * name() - { - return "Cuda Unmanaged Host Allocator"; - } - // Unmanaged deallocate does nothing - static void deallocate(void * /*ptr*/, size_t /*size*/) {} -}; - -/// class CudaMallocAllocator -class CudaMallocAllocator -{ -public: - static const char * name() - { - return "Cuda Malloc Allocator"; - } - - static void* allocate(size_t size); - - static void deallocate(void * ptr, size_t); - - static void * reallocate(void * old_ptr, size_t old_size, size_t new_size); - - static bool support_texture_binding() { return true; } -}; - -/// class CudaUVMAllocator -class CudaUVMAllocator -{ -public: - static const char * name() - { - return "Cuda UVM Allocator"; - } - - static void* allocate(size_t size); - - static void deallocate(void * ptr, size_t); - - static void * reallocate(void * old_ptr, size_t old_size, size_t new_size); - - static bool support_texture_binding() { return true; } -}; - -/// class CudaHostAllocator -class CudaHostAllocator -{ -public: - static const char * name() - { - return "Cuda Host Allocator"; - } - - static void* allocate(size_t size); - - static void deallocate(void * ptr, size_t); - - static void * reallocate(void * old_ptr, size_t old_size, size_t new_size); -}; - - -}} // namespace Kokkos::Impl - -#endif //KOKKOS_HAVE_CUDA - -#endif //KOKKOS_CUDA_BASIC_ALLOCATORS_HPP diff --git a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Error.hpp b/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Error.hpp deleted file mode 100644 index a0b29ddc2b..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Error.hpp +++ /dev/null @@ -1,69 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CUDA_ERROR_HPP -#define KOKKOS_CUDA_ERROR_HPP - -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#ifdef KOKKOS_HAVE_CUDA - -namespace Kokkos { namespace Impl { - -void cuda_device_synchronize(); - -void cuda_internal_error_throw( cudaError e , const char * name, const char * file = NULL, const int line = 0 ); - -inline void cuda_internal_safe_call( cudaError e , const char * name, const char * file = NULL, const int line = 0) -{ - if ( cudaSuccess != e ) { cuda_internal_error_throw( e , name, file, line ); } -} - -#define CUDA_SAFE_CALL( call ) \ - Kokkos::Impl::cuda_internal_safe_call( call , #call, __FILE__, __LINE__ ) - -}} // namespace Kokkos::Impl - -#endif //KOKKOS_HAVE_CUDA -#endif //KOKKOS_CUDA_ERROR_HPP diff --git a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Impl.cpp b/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Impl.cpp deleted file mode 100644 index b7c3a62d39..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Impl.cpp +++ /dev/null @@ -1,678 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -/*--------------------------------------------------------------------------*/ -/* Kokkos interfaces */ - -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#ifdef KOKKOS_HAVE_CUDA - -#include -#include -#include -#include - -/*--------------------------------------------------------------------------*/ -/* Standard 'C' libraries */ -#include - -/* Standard 'C++' libraries */ -#include -#include -#include -#include - -#ifdef KOKKOS_CUDA_USE_RELOCATABLE_DEVICE_CODE -__device__ __constant__ -Kokkos::Impl::CudaTraits::ConstantGlobalBufferType -kokkos_impl_cuda_constant_memory_buffer ; -#endif - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -namespace { - -__global__ -void query_cuda_kernel_arch( int * d_arch ) -{ -#if defined( __CUDA_ARCH__ ) - *d_arch = __CUDA_ARCH__ ; -#else - *d_arch = 0 ; -#endif -} - -/** Query what compute capability is actually launched to the device: */ -int cuda_kernel_arch() -{ - int * d_arch = 0 ; - cudaMalloc( (void **) & d_arch , sizeof(int) ); - query_cuda_kernel_arch<<<1,1>>>( d_arch ); - int arch = 0 ; - cudaMemcpy( & arch , d_arch , sizeof(int) , cudaMemcpyDefault ); - cudaFree( d_arch ); - return arch ; -} - -bool cuda_launch_blocking() -{ - const char * env = getenv("CUDA_LAUNCH_BLOCKING"); - - if (env == 0) return false; - - return atoi(env); -} - -} - -void cuda_device_synchronize() -{ -// static const bool launch_blocking = cuda_launch_blocking(); - -// if (!launch_blocking) { - CUDA_SAFE_CALL( cudaDeviceSynchronize() ); -// } -} - -void cuda_internal_error_throw( cudaError e , const char * name, const char * file, const int line ) -{ - std::ostringstream out ; - out << name << " error( " << cudaGetErrorName(e) << "): " << cudaGetErrorString(e); - if (file) { - out << " " << file << ":" << line; - } - throw_runtime_exception( out.str() ); -} - -//---------------------------------------------------------------------------- -// Some significant cuda device properties: -// -// cudaDeviceProp::name : Text label for device -// cudaDeviceProp::major : Device major number -// cudaDeviceProp::minor : Device minor number -// cudaDeviceProp::warpSize : number of threads per warp -// cudaDeviceProp::multiProcessorCount : number of multiprocessors -// cudaDeviceProp::sharedMemPerBlock : capacity of shared memory per block -// cudaDeviceProp::totalConstMem : capacity of constant memory -// cudaDeviceProp::totalGlobalMem : capacity of global memory -// cudaDeviceProp::maxGridSize[3] : maximum grid size - -// -// Section 4.4.2.4 of the CUDA Toolkit Reference Manual -// -// struct cudaDeviceProp { -// char name[256]; -// size_t totalGlobalMem; -// size_t sharedMemPerBlock; -// int regsPerBlock; -// int warpSize; -// size_t memPitch; -// int maxThreadsPerBlock; -// int maxThreadsDim[3]; -// int maxGridSize[3]; -// size_t totalConstMem; -// int major; -// int minor; -// int clockRate; -// size_t textureAlignment; -// int deviceOverlap; -// int multiProcessorCount; -// int kernelExecTimeoutEnabled; -// int integrated; -// int canMapHostMemory; -// int computeMode; -// int concurrentKernels; -// int ECCEnabled; -// int pciBusID; -// int pciDeviceID; -// int tccDriver; -// int asyncEngineCount; -// int unifiedAddressing; -// int memoryClockRate; -// int memoryBusWidth; -// int l2CacheSize; -// int maxThreadsPerMultiProcessor; -// }; - - -namespace { - - - -class CudaInternalDevices { -public: - enum { MAXIMUM_DEVICE_COUNT = 8 }; - struct cudaDeviceProp m_cudaProp[ MAXIMUM_DEVICE_COUNT ] ; - int m_cudaDevCount ; - - CudaInternalDevices(); - - static const CudaInternalDevices & singleton(); -}; - -CudaInternalDevices::CudaInternalDevices() -{ - // See 'cudaSetDeviceFlags' for host-device thread interaction - // Section 4.4.2.6 of the CUDA Toolkit Reference Manual - - CUDA_SAFE_CALL (cudaGetDeviceCount( & m_cudaDevCount ) ); - - for ( int i = 0 ; i < m_cudaDevCount ; ++i ) { - CUDA_SAFE_CALL( cudaGetDeviceProperties( m_cudaProp + i , i ) ); - } -} - -const CudaInternalDevices & CudaInternalDevices::singleton() -{ - static CudaInternalDevices self ; return self ; -} - -} - -//---------------------------------------------------------------------------- - -class CudaInternal { -private: - - CudaInternal( const CudaInternal & ); - CudaInternal & operator = ( const CudaInternal & ); - - AllocationTracker m_scratchFlagsTracker; - AllocationTracker m_scratchSpaceTracker; - AllocationTracker m_scratchUnifiedTracker; - - -public: - - typedef Cuda::size_type size_type ; - - int m_cudaDev ; - int m_cudaArch ; - unsigned m_maxWarpCount ; - unsigned m_maxBlock ; - unsigned m_maxSharedWords ; - size_type m_scratchSpaceCount ; - size_type m_scratchFlagsCount ; - size_type m_scratchUnifiedCount ; - size_type m_scratchUnifiedSupported ; - size_type m_streamCount ; - size_type * m_scratchSpace ; - size_type * m_scratchFlags ; - size_type * m_scratchUnified ; - cudaStream_t * m_stream ; - - - static CudaInternal & singleton(); - - int verify_is_initialized( const char * const label ) const ; - - int is_initialized() const - { return 0 != m_scratchSpace && 0 != m_scratchFlags ; } - - void initialize( int cuda_device_id , int stream_count ); - void finalize(); - - void print_configuration( std::ostream & ) const ; - - ~CudaInternal(); - - CudaInternal() - : m_cudaDev( -1 ) - , m_cudaArch( -1 ) - , m_maxWarpCount( 0 ) - , m_maxBlock( 0 ) - , m_maxSharedWords( 0 ) - , m_scratchSpaceCount( 0 ) - , m_scratchFlagsCount( 0 ) - , m_scratchUnifiedCount( 0 ) - , m_scratchUnifiedSupported( 0 ) - , m_streamCount( 0 ) - , m_scratchSpace( 0 ) - , m_scratchFlags( 0 ) - , m_scratchUnified( 0 ) - , m_stream( 0 ) - {} - - size_type * scratch_space( const size_type size ); - size_type * scratch_flags( const size_type size ); - size_type * scratch_unified( const size_type size ); -}; - -//---------------------------------------------------------------------------- - - -void CudaInternal::print_configuration( std::ostream & s ) const -{ - const CudaInternalDevices & dev_info = CudaInternalDevices::singleton(); - -#if defined( KOKKOS_HAVE_CUDA ) - s << "macro KOKKOS_HAVE_CUDA : defined" << std::endl ; -#endif -#if defined( CUDA_VERSION ) - s << "macro CUDA_VERSION = " << CUDA_VERSION - << " = version " << CUDA_VERSION / 1000 - << "." << ( CUDA_VERSION % 1000 ) / 10 - << std::endl ; -#endif - - for ( int i = 0 ; i < dev_info.m_cudaDevCount ; ++i ) { - s << "Kokkos::Cuda[ " << i << " ] " - << dev_info.m_cudaProp[i].name - << " capability " << dev_info.m_cudaProp[i].major << "." << dev_info.m_cudaProp[i].minor - << ", Total Global Memory: " << human_memory_size(dev_info.m_cudaProp[i].totalGlobalMem) - << ", Shared Memory per Block: " << human_memory_size(dev_info.m_cudaProp[i].sharedMemPerBlock); - if ( m_cudaDev == i ) s << " : Selected" ; - s << std::endl ; - } -} - -//---------------------------------------------------------------------------- - -CudaInternal::~CudaInternal() -{ - if ( m_stream || - m_scratchSpace || - m_scratchFlags || - m_scratchUnified ) { - std::cerr << "Kokkos::Cuda ERROR: Failed to call Kokkos::Cuda::finalize()" - << std::endl ; - std::cerr.flush(); - } - - m_cudaDev = -1 ; - m_cudaArch = -1 ; - m_maxWarpCount = 0 ; - m_maxBlock = 0 ; - m_maxSharedWords = 0 ; - m_scratchSpaceCount = 0 ; - m_scratchFlagsCount = 0 ; - m_scratchUnifiedCount = 0 ; - m_scratchUnifiedSupported = 0 ; - m_streamCount = 0 ; - m_scratchSpace = 0 ; - m_scratchFlags = 0 ; - m_scratchUnified = 0 ; - m_stream = 0 ; -} - -int CudaInternal::verify_is_initialized( const char * const label ) const -{ - if ( m_cudaDev < 0 ) { - std::cerr << "Kokkos::Cuda::" << label << " : ERROR device not initialized" << std::endl ; - } - return 0 <= m_cudaDev ; -} - -CudaInternal & CudaInternal::singleton() -{ - static CudaInternal self ; - return self ; -} - -void CudaInternal::initialize( int cuda_device_id , int stream_count ) -{ - enum { WordSize = sizeof(size_type) }; - - if ( ! HostSpace::execution_space::is_initialized() ) { - const std::string msg("Cuda::initialize ERROR : HostSpace::execution_space is not initialized"); - throw_runtime_exception( msg ); - } - - const CudaInternalDevices & dev_info = CudaInternalDevices::singleton(); - - const bool ok_init = 0 == m_scratchSpace || 0 == m_scratchFlags ; - - const bool ok_id = 0 <= cuda_device_id && - cuda_device_id < dev_info.m_cudaDevCount ; - - // Need device capability 2.0 or better - - const bool ok_dev = ok_id && - ( 2 <= dev_info.m_cudaProp[ cuda_device_id ].major && - 0 <= dev_info.m_cudaProp[ cuda_device_id ].minor ); - - if ( ok_init && ok_dev ) { - - const struct cudaDeviceProp & cudaProp = - dev_info.m_cudaProp[ cuda_device_id ]; - - m_cudaDev = cuda_device_id ; - - CUDA_SAFE_CALL( cudaSetDevice( m_cudaDev ) ); - CUDA_SAFE_CALL( cudaDeviceReset() ); - Kokkos::Impl::cuda_device_synchronize(); - - // Query what compute capability architecture a kernel executes: - m_cudaArch = cuda_kernel_arch(); - - if ( m_cudaArch != cudaProp.major * 100 + cudaProp.minor * 10 ) { - std::cerr << "Kokkos::Cuda::initialize WARNING: running kernels compiled for compute capability " - << ( m_cudaArch / 100 ) << "." << ( ( m_cudaArch % 100 ) / 10 ) - << " on device with compute capability " - << cudaProp.major << "." << cudaProp.minor - << " , this will likely reduce potential performance." - << std::endl ; - } - - //---------------------------------- - // Maximum number of warps, - // at most one warp per thread in a warp for reduction. - - // HCE 2012-February : - // Found bug in CUDA 4.1 that sometimes a kernel launch would fail - // if the thread count == 1024 and a functor is passed to the kernel. - // Copying the kernel to constant memory and then launching with - // thread count == 1024 would work fine. - // - // HCE 2012-October : - // All compute capabilities support at least 16 warps (512 threads). - // However, we have found that 8 warps typically gives better performance. - - m_maxWarpCount = 8 ; - - // m_maxWarpCount = cudaProp.maxThreadsPerBlock / Impl::CudaTraits::WarpSize ; - - if ( Impl::CudaTraits::WarpSize < m_maxWarpCount ) { - m_maxWarpCount = Impl::CudaTraits::WarpSize ; - } - - m_maxSharedWords = cudaProp.sharedMemPerBlock / WordSize ; - - //---------------------------------- - // Maximum number of blocks: - - m_maxBlock = m_cudaArch < 300 ? 65535 : cudaProp.maxGridSize[0] ; - - //---------------------------------- - - m_scratchUnifiedSupported = cudaProp.unifiedAddressing ; - - if ( ! m_scratchUnifiedSupported ) { - std::cout << "Kokkos::Cuda device " - << cudaProp.name << " capability " - << cudaProp.major << "." << cudaProp.minor - << " does not support unified virtual address space" - << std::endl ; - } - - //---------------------------------- - // Multiblock reduction uses scratch flags for counters - // and scratch space for partial reduction values. - // Allocate some initial space. This will grow as needed. - - { - const unsigned reduce_block_count = m_maxWarpCount * Impl::CudaTraits::WarpSize ; - - (void) scratch_unified( 16 * sizeof(size_type) ); - (void) scratch_flags( reduce_block_count * 2 * sizeof(size_type) ); - (void) scratch_space( reduce_block_count * 16 * sizeof(size_type) ); - } - //---------------------------------- - - if ( stream_count ) { - m_stream = (cudaStream_t*) ::malloc( stream_count * sizeof(cudaStream_t) ); - m_streamCount = stream_count ; - for ( size_type i = 0 ; i < m_streamCount ; ++i ) m_stream[i] = 0 ; - } - } - else { - - std::ostringstream msg ; - msg << "Kokkos::Cuda::initialize(" << cuda_device_id << ") FAILED" ; - - if ( ! ok_init ) { - msg << " : Already initialized" ; - } - if ( ! ok_id ) { - msg << " : Device identifier out of range " - << "[0.." << dev_info.m_cudaDevCount << "]" ; - } - else if ( ! ok_dev ) { - msg << " : Device " ; - msg << dev_info.m_cudaProp[ cuda_device_id ].major ; - msg << "." ; - msg << dev_info.m_cudaProp[ cuda_device_id ].minor ; - msg << " has insufficient capability, required 2.0 or better" ; - } - Kokkos::Impl::throw_runtime_exception( msg.str() ); - } - - // Init the array for used for arbitrarily sized atomics - Impl::init_lock_array_cuda_space(); - -} - -//---------------------------------------------------------------------------- - -typedef Cuda::size_type ScratchGrain[ Impl::CudaTraits::WarpSize ] ; -enum { sizeScratchGrain = sizeof(ScratchGrain) }; - - -Cuda::size_type * -CudaInternal::scratch_flags( const Cuda::size_type size ) -{ - if ( verify_is_initialized("scratch_flags") && m_scratchFlagsCount * sizeScratchGrain < size ) { - - - m_scratchFlagsCount = ( size + sizeScratchGrain - 1 ) / sizeScratchGrain ; - - m_scratchFlagsTracker = CudaSpace::allocate_and_track( std::string("InternalScratchFlags") , sizeof( ScratchGrain ) * m_scratchFlagsCount ); - m_scratchFlags = reinterpret_cast(m_scratchFlagsTracker.alloc_ptr()); - - CUDA_SAFE_CALL( cudaMemset( m_scratchFlags , 0 , m_scratchFlagsCount * sizeScratchGrain ) ); - } - - return m_scratchFlags ; -} - -Cuda::size_type * -CudaInternal::scratch_space( const Cuda::size_type size ) -{ - if ( verify_is_initialized("scratch_space") && m_scratchSpaceCount * sizeScratchGrain < size ) { - - m_scratchSpaceCount = ( size + sizeScratchGrain - 1 ) / sizeScratchGrain ; - - m_scratchSpaceTracker = CudaSpace::allocate_and_track( std::string("InternalScratchSpace") , sizeof( ScratchGrain ) * m_scratchSpaceCount ); - m_scratchSpace = reinterpret_cast(m_scratchSpaceTracker.alloc_ptr()); - - } - - return m_scratchSpace ; -} - -Cuda::size_type * -CudaInternal::scratch_unified( const Cuda::size_type size ) -{ - if ( verify_is_initialized("scratch_unified") && - m_scratchUnifiedSupported && m_scratchUnifiedCount * sizeScratchGrain < size ) { - - m_scratchUnifiedCount = ( size + sizeScratchGrain - 1 ) / sizeScratchGrain ; - - m_scratchUnifiedTracker = CudaHostPinnedSpace::allocate_and_track( std::string("InternalScratchUnified") , sizeof( ScratchGrain ) * m_scratchUnifiedCount ); - m_scratchUnified = reinterpret_cast( m_scratchUnifiedTracker.alloc_ptr() ); - } - - return m_scratchUnified ; -} - -//---------------------------------------------------------------------------- - -void CudaInternal::finalize() -{ - if ( 0 != m_scratchSpace || 0 != m_scratchFlags ) { - - lock_array_cuda_space_ptr(true); - if ( m_stream ) { - for ( size_type i = 1 ; i < m_streamCount ; ++i ) { - cudaStreamDestroy( m_stream[i] ); - m_stream[i] = 0 ; - } - ::free( m_stream ); - } - - m_scratchSpaceTracker.clear(); - m_scratchFlagsTracker.clear(); - m_scratchUnifiedTracker.clear(); - - m_cudaDev = -1 ; - m_maxWarpCount = 0 ; - m_maxBlock = 0 ; - m_maxSharedWords = 0 ; - m_scratchSpaceCount = 0 ; - m_scratchFlagsCount = 0 ; - m_scratchUnifiedCount = 0 ; - m_streamCount = 0 ; - m_scratchSpace = 0 ; - m_scratchFlags = 0 ; - m_scratchUnified = 0 ; - m_stream = 0 ; - } -} - -//---------------------------------------------------------------------------- - -Cuda::size_type cuda_internal_maximum_warp_count() -{ return CudaInternal::singleton().m_maxWarpCount ; } - -Cuda::size_type cuda_internal_maximum_grid_count() -{ return CudaInternal::singleton().m_maxBlock ; } - -Cuda::size_type cuda_internal_maximum_shared_words() -{ return CudaInternal::singleton().m_maxSharedWords ; } - -Cuda::size_type * cuda_internal_scratch_space( const Cuda::size_type size ) -{ return CudaInternal::singleton().scratch_space( size ); } - -Cuda::size_type * cuda_internal_scratch_flags( const Cuda::size_type size ) -{ return CudaInternal::singleton().scratch_flags( size ); } - -Cuda::size_type * cuda_internal_scratch_unified( const Cuda::size_type size ) -{ return CudaInternal::singleton().scratch_unified( size ); } - - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- - -namespace Kokkos { - -Cuda::size_type Cuda::detect_device_count() -{ return Impl::CudaInternalDevices::singleton().m_cudaDevCount ; } - -int Cuda::is_initialized() -{ return Impl::CudaInternal::singleton().is_initialized(); } - -void Cuda::initialize( const Cuda::SelectDevice config , size_t num_instances ) -{ Impl::CudaInternal::singleton().initialize( config.cuda_device_id , num_instances ); } - -std::vector -Cuda::detect_device_arch() -{ - const Impl::CudaInternalDevices & s = Impl::CudaInternalDevices::singleton(); - - std::vector output( s.m_cudaDevCount ); - - for ( int i = 0 ; i < s.m_cudaDevCount ; ++i ) { - output[i] = s.m_cudaProp[i].major * 100 + s.m_cudaProp[i].minor ; - } - - return output ; -} - -Cuda::size_type Cuda::device_arch() -{ - const int dev_id = Impl::CudaInternal::singleton().m_cudaDev ; - - int dev_arch = 0 ; - - if ( 0 <= dev_id ) { - const struct cudaDeviceProp & cudaProp = - Impl::CudaInternalDevices::singleton().m_cudaProp[ dev_id ] ; - - dev_arch = cudaProp.major * 100 + cudaProp.minor ; - } - - return dev_arch ; -} - -void Cuda::finalize() -{ Impl::CudaInternal::singleton().finalize(); } - -Cuda::Cuda() - : m_device( Impl::CudaInternal::singleton().m_cudaDev ) - , m_stream( 0 ) -{ - Impl::CudaInternal::singleton().verify_is_initialized( "Cuda instance constructor" ); -} - -Cuda::Cuda( const int instance_id ) - : m_device( Impl::CudaInternal::singleton().m_cudaDev ) - , m_stream( - Impl::CudaInternal::singleton().verify_is_initialized( "Cuda instance constructor" ) - ? Impl::CudaInternal::singleton().m_stream[ instance_id % Impl::CudaInternal::singleton().m_streamCount ] - : 0 ) -{} - -void Cuda::print_configuration( std::ostream & s , const bool ) -{ Impl::CudaInternal::singleton().print_configuration( s ); } - -bool Cuda::sleep() { return false ; } - -bool Cuda::wake() { return true ; } - -void Cuda::fence() -{ - Kokkos::Impl::cuda_device_synchronize(); -} - -} // namespace Kokkos - -#endif // KOKKOS_HAVE_CUDA -//---------------------------------------------------------------------------- - diff --git a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Internal.hpp b/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Internal.hpp deleted file mode 100644 index dd8a08729b..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Internal.hpp +++ /dev/null @@ -1,165 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CUDA_INTERNAL_HPP -#define KOKKOS_CUDA_INTERNAL_HPP - -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#ifdef KOKKOS_HAVE_CUDA - -#include - -namespace Kokkos { namespace Impl { - - -template -int cuda_get_max_block_size(const typename DriverType::functor_type & f) { -#if ( CUDA_VERSION < 6050 ) - return 256; -#else - bool Large = ( CudaTraits::ConstantMemoryUseThreshold < sizeof(DriverType) ); - - int numBlocks; - if(Large) { - int blockSize=32; - int sharedmem = FunctorTeamShmemSize< typename DriverType::functor_type >::value( f , blockSize ); - cudaOccupancyMaxActiveBlocksPerMultiprocessor( - &numBlocks, - cuda_parallel_launch_constant_memory, - blockSize, - sharedmem); - - while (blockSize<1024 && numBlocks>0) { - blockSize*=2; - sharedmem = FunctorTeamShmemSize< typename DriverType::functor_type >::value( f , blockSize ); - - cudaOccupancyMaxActiveBlocksPerMultiprocessor( - &numBlocks, - cuda_parallel_launch_constant_memory, - blockSize, - sharedmem); - } - if(numBlocks>0) return blockSize; - else return blockSize/2; - } else { - int blockSize=32; - int sharedmem = FunctorTeamShmemSize< typename DriverType::functor_type >::value( f , blockSize ); - cudaOccupancyMaxActiveBlocksPerMultiprocessor( - &numBlocks, - cuda_parallel_launch_local_memory, - blockSize, - sharedmem); - - while (blockSize<1024 && numBlocks>0) { - blockSize*=2; - sharedmem = FunctorTeamShmemSize< typename DriverType::functor_type >::value( f , blockSize ); - - cudaOccupancyMaxActiveBlocksPerMultiprocessor( - &numBlocks, - cuda_parallel_launch_local_memory, - blockSize, - sharedmem); - } - if(numBlocks>0) return blockSize; - else return blockSize/2; - } -#endif -} - -template -int cuda_get_opt_block_size(const typename DriverType::functor_type & f) { -#if ( CUDA_VERSION < 6050 ) - return 256; -#else - bool Large = ( CudaTraits::ConstantMemoryUseThreshold < sizeof(DriverType) ); - - int blockSize=16; - int numBlocks; - int sharedmem; - int maxOccupancy=0; - int bestBlockSize=0; - - if(Large) { - while(blockSize<1024) { - blockSize*=2; - - //calculate the occupancy with that optBlockSize and check whether its larger than the largest one found so far - sharedmem = FunctorTeamShmemSize< typename DriverType::functor_type >::value( f , blockSize ); - cudaOccupancyMaxActiveBlocksPerMultiprocessor( - &numBlocks, - cuda_parallel_launch_constant_memory, - blockSize, - sharedmem); - if(maxOccupancy < numBlocks*blockSize) { - maxOccupancy = numBlocks*blockSize; - bestBlockSize = blockSize; - } - } - } else { - while(blockSize<1024) { - blockSize*=2; - sharedmem = FunctorTeamShmemSize< typename DriverType::functor_type >::value( f , blockSize ); - - cudaOccupancyMaxActiveBlocksPerMultiprocessor( - &numBlocks, - cuda_parallel_launch_local_memory, - blockSize, - sharedmem); - - if(maxOccupancy < numBlocks*blockSize) { - maxOccupancy = numBlocks*blockSize; - bestBlockSize = blockSize; - } - } - } - return bestBlockSize; -#endif -} - -}} // namespace Kokkos::Impl - -#endif // KOKKOS_HAVE_CUDA -#endif /* #ifndef KOKKOS_CUDA_INTERNAL_HPP */ - diff --git a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Parallel.hpp b/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Parallel.hpp deleted file mode 100644 index 3aea9be1d9..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Parallel.hpp +++ /dev/null @@ -1,1862 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CUDA_PARALLEL_HPP -#define KOKKOS_CUDA_PARALLEL_HPP - -#include -#include - -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#if defined( __CUDACC__ ) && defined( KOKKOS_HAVE_CUDA ) - -#include -#include - -#include -#include -#include -#include - -#ifdef KOKKOSP_ENABLE_PROFILING -#include -#include -#endif - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< typename Type > -struct CudaJoinFunctor { - typedef Type value_type ; - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - volatile const value_type & input ) - { update += input ; } -}; - -class CudaTeamMember { -private: - - typedef Kokkos::Cuda execution_space ; - typedef execution_space::scratch_memory_space scratch_memory_space ; - - void * m_team_reduce ; - scratch_memory_space m_team_shared ; - int m_league_rank ; - int m_league_size ; - -public: - -#if defined( __CUDA_ARCH__ ) - - __device__ inline - const execution_space::scratch_memory_space & team_shmem() const - { return m_team_shared ; } - - __device__ inline int league_rank() const { return m_league_rank ; } - __device__ inline int league_size() const { return m_league_size ; } - __device__ inline int team_rank() const { return threadIdx.y ; } - __device__ inline int team_size() const { return blockDim.y ; } - - __device__ inline void team_barrier() const { __syncthreads(); } - - template - __device__ inline void team_broadcast(ValueType& value, const int& thread_id) const { - __shared__ ValueType sh_val; - if(threadIdx.x == 0 && threadIdx.y == thread_id) { - sh_val = val; - } - team_barrier(); - val = sh_val; - } - -#ifdef KOKKOS_HAVE_CXX11 - template< class ValueType, class JoinOp > - __device__ inline - typename JoinOp::value_type team_reduce( const ValueType & value - , const JoinOp & op_in ) const - { - typedef JoinLambdaAdapter JoinOpFunctor ; - const JoinOpFunctor op(op_in); - ValueType * const base_data = (ValueType *) m_team_reduce ; -#else - template< class JoinOp > - __device__ inline - typename JoinOp::value_type team_reduce( const typename JoinOp::value_type & value - , const JoinOp & op ) const - { - typedef JoinOp JoinOpFunctor ; - typename JoinOp::value_type * const base_data = (typename JoinOp::value_type *) m_team_reduce ; -#endif - - __syncthreads(); // Don't write in to shared data until all threads have entered this function - - if ( 0 == threadIdx.y ) { base_data[0] = 0 ; } - - base_data[ threadIdx.y ] = value ; - - Impl::cuda_intra_block_reduce_scan( op , base_data ); - - return base_data[ blockDim.y - 1 ]; - } - - /** \brief Intra-team exclusive prefix sum with team_rank() ordering - * with intra-team non-deterministic ordering accumulation. - * - * The global inter-team accumulation value will, at the end of the - * league's parallel execution, be the scan's total. - * Parallel execution ordering of the league's teams is non-deterministic. - * As such the base value for each team's scan operation is similarly - * non-deterministic. - */ - template< typename Type > - __device__ inline Type team_scan( const Type & value , Type * const global_accum ) const - { - Type * const base_data = (Type *) m_team_reduce ; - - __syncthreads(); // Don't write in to shared data until all threads have entered this function - - if ( 0 == threadIdx.y ) { base_data[0] = 0 ; } - - base_data[ threadIdx.y + 1 ] = value ; - - Impl::cuda_intra_block_reduce_scan,void>( Impl::CudaJoinFunctor() , base_data + 1 ); - - if ( global_accum ) { - if ( blockDim.y == threadIdx.y + 1 ) { - base_data[ blockDim.y ] = atomic_fetch_add( global_accum , base_data[ blockDim.y ] ); - } - __syncthreads(); // Wait for atomic - base_data[ threadIdx.y ] += base_data[ blockDim.y ] ; - } - - return base_data[ threadIdx.y ]; - } - - /** \brief Intra-team exclusive prefix sum with team_rank() ordering. - * - * The highest rank thread can compute the reduction total as - * reduction_total = dev.team_scan( value ) + value ; - */ - template< typename Type > - __device__ inline Type team_scan( const Type & value ) const - { return this->template team_scan( value , 0 ); } - - //---------------------------------------- - // Private for the driver - - __device__ inline - CudaTeamMember( void * shared - , const int shared_begin - , const int shared_size - , const int arg_league_rank - , const int arg_league_size ) - : m_team_reduce( shared ) - , m_team_shared( ((char *)shared) + shared_begin , shared_size ) - , m_league_rank( arg_league_rank ) - , m_league_size( arg_league_size ) - {} - -#else - - const execution_space::scratch_memory_space & team_shmem() const {return m_team_shared;} - - int league_rank() const {return 0;} - int league_size() const {return 1;} - int team_rank() const {return 0;} - int team_size() const {return 1;} - - void team_barrier() const {} - template - void team_broadcast(ValueType& value, const int& thread_id) const {} - - template< class JoinOp > - typename JoinOp::value_type team_reduce( const typename JoinOp::value_type & value - , const JoinOp & op ) const {return typename JoinOp::value_type();} - - template< typename Type > - Type team_scan( const Type & value , Type * const global_accum ) const {return Type();} - - template< typename Type > - Type team_scan( const Type & value ) const {return Type();} - - //---------------------------------------- - // Private for the driver - - CudaTeamMember( void * shared - , const int shared_begin - , const int shared_end - , const int arg_league_rank - , const int arg_league_size ); - -#endif /* #if ! defined( __CUDA_ARCH__ ) */ - -}; - -} // namespace Impl - -template< class Arg0 , class Arg1 > -class TeamPolicy< Arg0 , Arg1 , Kokkos::Cuda > -{ -private: - - enum { MAX_WARP = 8 }; - - const int m_league_size ; - const int m_team_size ; - const int m_vector_length ; - -public: - - //! Tag this class as a kokkos execution policy - typedef TeamPolicy execution_policy ; - - //! Execution space of this execution policy - typedef Kokkos::Cuda execution_space ; - - typedef typename - Impl::if_c< ! Impl::is_same< Kokkos::Cuda , Arg0 >::value , Arg0 , Arg1 >::type - work_tag ; - - //---------------------------------------- - - template< class FunctorType > - inline static - int team_size_max( const FunctorType & functor ) - { - int n = MAX_WARP * Impl::CudaTraits::WarpSize ; - - for ( ; n ; n >>= 1 ) { - const int shmem_size = - /* for global reduce */ Impl::cuda_single_inter_block_reduce_scan_shmem( functor , n ) - /* for team reduce */ + ( n + 2 ) * sizeof(double) - /* for team shared */ + Impl::FunctorTeamShmemSize< FunctorType >::value( functor , n ); - - if ( shmem_size < Impl::CudaTraits::SharedMemoryCapacity ) break ; - } - - return n ; - } - - template< class FunctorType > - static int team_size_recommended( const FunctorType & functor ) - { return team_size_max( functor ); } - - template< class FunctorType > - static int team_size_recommended( const FunctorType & functor , const int vector_length) - { - int max = team_size_max( functor )/vector_length; - if(max<1) max = 1; - return max; - } - - inline static - int vector_length_max() - { return Impl::CudaTraits::WarpSize; } - - //---------------------------------------- - - inline int vector_length() const { return m_vector_length ; } - inline int team_size() const { return m_team_size ; } - inline int league_size() const { return m_league_size ; } - - /** \brief Specify league size, request team size */ - TeamPolicy( execution_space & , int league_size_ , int team_size_request , int vector_length_request = 1 ) - : m_league_size( league_size_ ) - , m_team_size( team_size_request ) - , m_vector_length ( vector_length_request ) - { - // Allow only power-of-two vector_length - int check = 0; - for(int k = 1; k <= vector_length_max(); k*=2) - if(k == vector_length_request) - check = 1; - if(!check) - Impl::throw_runtime_exception( "Requested non-power-of-two vector length for TeamPolicy."); - - // Make sure league size is permissable - if(league_size_ >= int(Impl::cuda_internal_maximum_grid_count())) - Impl::throw_runtime_exception( "Requested too large league_size for TeamPolicy on Cuda execution space."); - } - - TeamPolicy( int league_size_ , int team_size_request , int vector_length_request = 1 ) - : m_league_size( league_size_ ) - , m_team_size( team_size_request ) - , m_vector_length ( vector_length_request ) - { - // Allow only power-of-two vector_length - int check = 0; - for(int k = 1; k <= vector_length_max(); k*=2) - if(k == vector_length_request) - check = 1; - if(!check) - Impl::throw_runtime_exception( "Requested non-power-of-two vector length for TeamPolicy."); - - // Make sure league size is permissable - if(league_size_ >= int(Impl::cuda_internal_maximum_grid_count())) - Impl::throw_runtime_exception( "Requested too large league_size for TeamPolicy on Cuda execution space."); - - } - - typedef Kokkos::Impl::CudaTeamMember member_type ; -}; - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelFor< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Cuda > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Cuda > Policy ; - - const FunctorType m_functor ; - const Policy m_policy ; - - ParallelFor(); - ParallelFor & operator = ( const ParallelFor & ); - - template< class Tag > - inline static - __device__ - void driver( const FunctorType & functor - , typename Impl::enable_if< Impl::is_same< Tag , void >::value - , typename Policy::member_type const & >::type iwork - ) - { functor( iwork ); } - - template< class Tag > - inline static - __device__ - void driver( const FunctorType & functor - , typename Impl::enable_if< ! Impl::is_same< Tag , void >::value - , typename Policy::member_type const & >::type iwork - ) - { functor( Tag() , iwork ); } - -public: - - typedef FunctorType functor_type ; - - inline - __device__ - void operator()(void) const - { - const typename Policy::member_type work_stride = blockDim.y * gridDim.x ; - const typename Policy::member_type work_end = m_policy.end(); - - for ( typename Policy::member_type - iwork = m_policy.begin() + threadIdx.y + blockDim.y * blockIdx.x ; - iwork < work_end ; - iwork += work_stride ) { - ParallelFor::template driver< typename Policy::work_tag >( m_functor, iwork ); - } - } - - ParallelFor( const FunctorType & functor , - const Policy & policy ) - : m_functor( functor ) - , m_policy( policy ) - { - const dim3 block( 1 , CudaTraits::WarpSize * cuda_internal_maximum_warp_count(), 1); - const dim3 grid( std::min( ( int( policy.end() - policy.begin() ) + block.y - 1 ) / block.y - , cuda_internal_maximum_grid_count() ) - , 1 , 1); - - CudaParallelLaunch< ParallelFor >( *this , grid , block , 0 ); - } -}; - -template< class FunctorType , class Arg0 , class Arg1 > -class ParallelFor< FunctorType , Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::Cuda > > -{ -private: - - typedef Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::Cuda > Policy ; - -public: - - typedef FunctorType functor_type ; - typedef Cuda::size_type size_type ; - -private: - - // Algorithmic constraints: blockDim.y is a power of two AND blockDim.y == blockDim.z == 1 - // shared memory utilization: - // - // [ team reduce space ] - // [ team shared space ] - // - - const FunctorType m_functor ; - size_type m_shmem_begin ; - size_type m_shmem_size ; - size_type m_league_size ; - - template< class TagType > - __device__ inline - void driver( typename Impl::enable_if< Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member ) const - { m_functor( member ); } - - template< class TagType > - __device__ inline - void driver( typename Impl::enable_if< ! Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member ) const - { m_functor( TagType() , member ); } - -public: - - __device__ inline - void operator()(void) const - { - // Iterate this block through the league - for ( int league_rank = blockIdx.x ; league_rank < m_league_size ; league_rank += gridDim.x ) { - - ParallelFor::template driver< typename Policy::work_tag >( - typename Policy::member_type( kokkos_impl_cuda_shared_memory() - , m_shmem_begin - , m_shmem_size - , league_rank - , m_league_size ) ); - } - } - - - ParallelFor( const FunctorType & functor - , const Policy & policy - ) - : m_functor( functor ) - , m_shmem_begin( sizeof(double) * ( policy.team_size() + 2 ) ) - , m_shmem_size( FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ) ) - , m_league_size( policy.league_size() ) - { - // Functor's reduce memory, team scan memory, and team shared memory depend upon team size. - - const int shmem_size_total = m_shmem_begin + m_shmem_size ; - - if ( CudaTraits::SharedMemoryCapacity < shmem_size_total ) { - Kokkos::Impl::throw_runtime_exception(std::string("Kokkos::Impl::ParallelFor< Cuda > insufficient shared memory")); - } - - const dim3 grid( int(policy.league_size()) , 1 , 1 ); - const dim3 block( policy.vector_length() , policy.team_size() , 1 ); - - CudaParallelLaunch< ParallelFor >( *this, grid, block, shmem_size_total ); // copy to device and execute - } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelReduce< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Cuda > > -{ -private: - - typedef Kokkos::RangePolicy Policy ; - typedef typename Policy::WorkRange work_range ; - typedef typename Policy::work_tag work_tag ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , work_tag > ValueInit ; - -public: - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::value_type value_type ; - typedef typename ValueTraits::reference_type reference_type ; - typedef FunctorType functor_type ; - typedef Cuda::size_type size_type ; - - // Algorithmic constraints: blockSize is a power of two AND blockDim.y == blockDim.z == 1 - - const FunctorType m_functor ; - const Policy m_policy ; - size_type * m_scratch_space ; - size_type * m_scratch_flags ; - size_type * m_unified_space ; - - // Determine block size constrained by shared memory: - static inline - unsigned local_block_size( const FunctorType & f ) - { - unsigned n = CudaTraits::WarpSize * 8 ; - while ( n && CudaTraits::SharedMemoryCapacity < cuda_single_inter_block_reduce_scan_shmem( f , n ) ) { n >>= 1 ; } - return n ; - } - - template< class Tag > - inline static - __device__ - void driver( const FunctorType & functor - , typename Impl::enable_if< Impl::is_same< Tag , void >::value - , typename Policy::member_type const & >::type iwork - , reference_type value ) - { functor( iwork , value ); } - - template< class Tag > - inline static - __device__ - void driver( const FunctorType & functor - , typename Impl::enable_if< ! Impl::is_same< Tag , void >::value - , typename Policy::member_type const & >::type iwork - , reference_type value ) - { functor( Tag() , iwork , value ); } - -#ifndef KOKKOS_EXPERIMENTAL_CUDA_SHFL_REDUCTION - __device__ inline - void operator()(void) const - { - const integral_nonzero_constant< size_type , ValueTraits::StaticValueSize / sizeof(size_type) > - word_count( ValueTraits::value_size( m_functor ) / sizeof(size_type) ); - - { - reference_type value = - ValueInit::init( m_functor , kokkos_impl_cuda_shared_memory() + threadIdx.y * word_count.value ); - - // Number of blocks is bounded so that the reduction can be limited to two passes. - // Each thread block is given an approximately equal amount of work to perform. - // Accumulate the values for this block. - // The accumulation ordering does not match the final pass, but is arithmatically equivalent. - - const work_range range( m_policy , blockIdx.x , gridDim.x ); - - for ( typename work_range::member_type iwork = range.begin() + threadIdx.y , iwork_end = range.end() ; - iwork < iwork_end ; iwork += blockDim.y ) { - ParallelReduce::template driver< work_tag >( m_functor , iwork , value ); - } - } - - // Reduce with final value at blockDim.y - 1 location. - if ( cuda_single_inter_block_reduce_scan( - m_functor , blockIdx.x , gridDim.x , - kokkos_impl_cuda_shared_memory() , m_scratch_space , m_scratch_flags ) ) { - - // This is the final block with the final result at the final threads' location - - size_type * const shared = kokkos_impl_cuda_shared_memory() + ( blockDim.y - 1 ) * word_count.value ; - size_type * const global = m_unified_space ? m_unified_space : m_scratch_space ; - - if ( threadIdx.y == 0 ) { - Kokkos::Impl::FunctorFinal< FunctorType , work_tag >::final( m_functor , shared ); - } - - if ( CudaTraits::WarpSize < word_count.value ) { __syncthreads(); } - - for ( unsigned i = threadIdx.y ; i < word_count.value ; i += blockDim.y ) { global[i] = shared[i]; } - } - } -#else - __device__ inline - void operator()(void) const - { - - value_type value = 0; - - // Number of blocks is bounded so that the reduction can be limited to two passes. - // Each thread block is given an approximately equal amount of work to perform. - // Accumulate the values for this block. - // The accumulation ordering does not match the final pass, but is arithmatically equivalent. - - const Policy range( m_policy , blockIdx.x , gridDim.x ); - - for ( typename Policy::member_type iwork = range.begin() + threadIdx.y , iwork_end = range.end() ; - iwork < iwork_end ; iwork += blockDim.y ) { - ParallelReduce::template driver< work_tag >( m_functor , iwork , value ); - } - - pointer_type const result = (pointer_type) (m_unified_space ? m_unified_space : m_scratch_space) ; - int max_active_thread = range.end()-range.begin() < blockDim.y ? range.end() - range.begin():blockDim.y; - max_active_thread = max_active_thread == 0?blockDim.y:max_active_thread; - if(Impl::cuda_inter_block_reduction > - (value,Impl::JoinAdd(),m_scratch_space,result,m_scratch_flags,max_active_thread)) { - const unsigned id = threadIdx.y*blockDim.x + threadIdx.x; - if(id==0) { - Kokkos::Impl::FunctorFinal< FunctorType , work_tag >::final( m_functor , (void*) &value ); - *result = value; - } - } - } -#endif - template< class HostViewType > - ParallelReduce( const FunctorType & functor - , const Policy & policy - , const HostViewType & result - ) - : m_functor( functor ) - , m_policy( policy ) - , m_scratch_space( 0 ) - , m_scratch_flags( 0 ) - , m_unified_space( 0 ) - { - const int block_size = local_block_size( functor ); - const int block_count = std::min( int(block_size) - , ( int(policy.end() - policy.begin()) + block_size - 1 ) / block_size - ); - - m_scratch_space = cuda_internal_scratch_space( ValueTraits::value_size( functor ) * block_count ); - m_scratch_flags = cuda_internal_scratch_flags( sizeof(size_type) ); - m_unified_space = cuda_internal_scratch_unified( ValueTraits::value_size( functor ) ); - - const dim3 grid( block_count , 1 , 1 ); - const dim3 block( 1 , block_size , 1 ); // REQUIRED DIMENSIONS ( 1 , N , 1 ) -#ifdef KOKKOS_EXPERIMENTAL_CUDA_SHFL_REDUCTION - const int shmem = 0; -#else - const int shmem = cuda_single_inter_block_reduce_scan_shmem( m_functor , block.y ); -#endif - - CudaParallelLaunch< ParallelReduce >( *this, grid, block, shmem ); // copy to device and execute - - Cuda::fence(); - - if ( result.ptr_on_device() ) { - if ( m_unified_space ) { - const int count = ValueTraits::value_count( m_functor ); - for ( int i = 0 ; i < count ; ++i ) { result.ptr_on_device()[i] = pointer_type(m_unified_space)[i] ; } - } - else { - const int size = ValueTraits::value_size( m_functor ); - DeepCopy( result.ptr_on_device() , m_scratch_space , size ); - } - } - } -}; - -template< class FunctorType , class Arg0 , class Arg1 > -class ParallelReduce< FunctorType , Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::Cuda > > -{ -private: - - typedef Kokkos::TeamPolicy Policy ; - typedef typename Policy::work_tag work_tag ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , work_tag > ValueInit ; - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - -public: - - typedef FunctorType functor_type ; - typedef Cuda::size_type size_type ; - -private: - - // Algorithmic constraints: blockDim.y is a power of two AND blockDim.y == blockDim.z == 1 - // shared memory utilization: - // - // [ global reduce space ] - // [ team reduce space ] - // [ team shared space ] - // - - const FunctorType m_functor ; - size_type * m_scratch_space ; - size_type * m_scratch_flags ; - size_type * m_unified_space ; - size_type m_team_begin ; - size_type m_shmem_begin ; - size_type m_shmem_size ; - size_type m_league_size ; - - template< class TagType > - __device__ inline - void driver( typename Impl::enable_if< Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member - , reference_type update ) const - { m_functor( member , update ); } - - template< class TagType > - __device__ inline - void driver( typename Impl::enable_if< ! Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member - , reference_type update ) const - { m_functor( TagType() , member , update ); } - -public: - - __device__ inline - void operator()(void) const - { - const integral_nonzero_constant< size_type , ValueTraits::StaticValueSize / sizeof(size_type) > - word_count( ValueTraits::value_size( m_functor ) / sizeof(size_type) ); - - reference_type value = - ValueInit::init( m_functor , kokkos_impl_cuda_shared_memory() + threadIdx.y * word_count.value ); - - // Iterate this block through the league - for ( int league_rank = blockIdx.x ; league_rank < m_league_size ; league_rank += gridDim.x ) { - - ParallelReduce::template driver< work_tag > - ( typename Policy::member_type( kokkos_impl_cuda_shared_memory() + m_team_begin - , m_shmem_begin - , m_shmem_size - , league_rank - , m_league_size ) - , value ); - } - - // Reduce with final value at blockDim.y - 1 location. - if ( cuda_single_inter_block_reduce_scan( - m_functor , blockIdx.x , gridDim.x , - kokkos_impl_cuda_shared_memory() , m_scratch_space , m_scratch_flags ) ) { - - // This is the final block with the final result at the final threads' location - - size_type * const shared = kokkos_impl_cuda_shared_memory() + ( blockDim.y - 1 ) * word_count.value ; - size_type * const global = m_unified_space ? m_unified_space : m_scratch_space ; - - if ( threadIdx.y == 0 ) { - Kokkos::Impl::FunctorFinal< FunctorType , work_tag >::final( m_functor , shared ); - } - - if ( CudaTraits::WarpSize < word_count.value ) { __syncthreads(); } - - for ( unsigned i = threadIdx.y ; i < word_count.value ; i += blockDim.y ) { global[i] = shared[i]; } - } - } - - - template< class HostViewType > - ParallelReduce( const FunctorType & functor - , const Policy & policy - , const HostViewType & result - ) - : m_functor( functor ) - , m_scratch_space( 0 ) - , m_scratch_flags( 0 ) - , m_unified_space( 0 ) - , m_team_begin( cuda_single_inter_block_reduce_scan_shmem( functor , policy.team_size() ) ) - , m_shmem_begin( sizeof(double) * ( policy.team_size() + 2 ) ) - , m_shmem_size( FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ) ) - , m_league_size( policy.league_size() ) - { - - // The global parallel_reduce does not support vector_length other than 1 at the moment - if(policy.vector_length() > 1) - Impl::throw_runtime_exception( "Kokkos::parallel_reduce with a TeamPolicy using a vector length of greater than 1 is not currently supported for CUDA."); - - // Functor's reduce memory, team scan memory, and team shared memory depend upon team size. - - const int shmem_size_total = m_team_begin + m_shmem_begin + m_shmem_size ; - const int not_power_of_two = 0 != ( policy.team_size() & ( policy.team_size() - 1 ) ); - - if ( not_power_of_two || CudaTraits::SharedMemoryCapacity < shmem_size_total ) { - Kokkos::Impl::throw_runtime_exception(std::string("Kokkos::Impl::ParallelReduce< Cuda > bad team size")); - } - - const int block_count = std::min( policy.league_size() , policy.team_size() ); - - m_scratch_space = cuda_internal_scratch_space( ValueTraits::value_size( functor ) * block_count ); - m_scratch_flags = cuda_internal_scratch_flags( sizeof(size_type) ); - m_unified_space = cuda_internal_scratch_unified( ValueTraits::value_size( functor ) ); - - const dim3 grid( block_count , 1 , 1 ); - const dim3 block( 1 , policy.team_size() , 1 ); // REQUIRED DIMENSIONS ( 1 , N , 1 ) - - CudaParallelLaunch< ParallelReduce >( *this, grid, block, shmem_size_total ); // copy to device and execute - - Cuda::fence(); - - if ( result.ptr_on_device() ) { - if ( m_unified_space ) { - const int count = ValueTraits::value_count( m_functor ); - for ( int i = 0 ; i < count ; ++i ) { result.ptr_on_device()[i] = pointer_type(m_unified_space)[i] ; } - } - else { - const int size = ValueTraits::value_size( m_functor ); - DeepCopy( result.ptr_on_device() , m_scratch_space , size ); - } - } - } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelScan< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Cuda > > -{ -private: - - typedef Kokkos::RangePolicy Policy ; - typedef typename Policy::WorkRange work_range ; - typedef typename Policy::work_tag work_tag ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , work_tag > ValueInit ; - typedef Kokkos::Impl::FunctorValueOps< FunctorType , work_tag > ValueOps ; - -public: - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - typedef FunctorType functor_type ; - typedef Cuda::size_type size_type ; - - // Algorithmic constraints: - // (a) blockDim.y is a power of two - // (b) blockDim.y == blockDim.z == 1 - // (c) gridDim.x <= blockDim.y * blockDim.y - // (d) gridDim.y == gridDim.z == 1 - - // Determine block size constrained by shared memory: - static inline - unsigned local_block_size( const FunctorType & f ) - { - // blockDim.y must be power of two = 128 (4 warps) or 256 (8 warps) or 512 (16 warps) - // gridDim.x <= blockDim.y * blockDim.y - // - // 4 warps was 10% faster than 8 warps and 20% faster than 16 warps in unit testing - - unsigned n = CudaTraits::WarpSize * 4 ; - while ( n && CudaTraits::SharedMemoryCapacity < cuda_single_inter_block_reduce_scan_shmem( f , n ) ) { n >>= 1 ; } - return n ; - } - - const FunctorType m_functor ; - const Policy m_policy ; - size_type * m_scratch_space ; - size_type * m_scratch_flags ; - size_type m_final ; - - template< class Tag > - inline static - __device__ - void driver( const FunctorType & functor - , typename Impl::enable_if< Impl::is_same< Tag , void >::value - , typename Policy::member_type const & >::type iwork - , reference_type value - , const bool final ) - { functor( iwork , value , final ); } - - template< class Tag > - inline static - __device__ - void driver( const FunctorType & functor - , typename Impl::enable_if< ! Impl::is_same< Tag , void >::value - , typename Policy::member_type const & >::type iwork - , reference_type value - , const bool final ) - { functor( Tag() , iwork , value , final ); } - - //---------------------------------------- - - __device__ inline - void initial(void) const - { - const integral_nonzero_constant< size_type , ValueTraits::StaticValueSize / sizeof(size_type) > - word_count( ValueTraits::value_size( m_functor ) / sizeof(size_type) ); - - size_type * const shared_value = kokkos_impl_cuda_shared_memory() + word_count.value * threadIdx.y ; - - ValueInit::init( m_functor , shared_value ); - - // Number of blocks is bounded so that the reduction can be limited to two passes. - // Each thread block is given an approximately equal amount of work to perform. - // Accumulate the values for this block. - // The accumulation ordering does not match the final pass, but is arithmatically equivalent. - - const work_range range( m_policy , blockIdx.x , gridDim.x ); - - for ( typename Policy::member_type iwork = range.begin() + threadIdx.y , iwork_end = range.end() ; - iwork < iwork_end ; iwork += blockDim.y ) { - ParallelScan::template driver< work_tag > - ( m_functor , iwork , ValueOps::reference( shared_value ) , false ); - } - - // Reduce and scan, writing out scan of blocks' totals and block-groups' totals. - // Blocks' scan values are written to 'blockIdx.x' location. - // Block-groups' scan values are at: i = ( j * blockDim.y - 1 ) for i < gridDim.x - cuda_single_inter_block_reduce_scan( m_functor , blockIdx.x , gridDim.x , kokkos_impl_cuda_shared_memory() , m_scratch_space , m_scratch_flags ); - } - - //---------------------------------------- - - __device__ inline - void final(void) const - { - const integral_nonzero_constant< size_type , ValueTraits::StaticValueSize / sizeof(size_type) > - word_count( ValueTraits::value_size( m_functor ) / sizeof(size_type) ); - - // Use shared memory as an exclusive scan: { 0 , value[0] , value[1] , value[2] , ... } - size_type * const shared_data = kokkos_impl_cuda_shared_memory(); - size_type * const shared_prefix = shared_data + word_count.value * threadIdx.y ; - size_type * const shared_accum = shared_data + word_count.value * ( blockDim.y + 1 ); - - // Starting value for this thread block is the previous block's total. - if ( blockIdx.x ) { - size_type * const block_total = m_scratch_space + word_count.value * ( blockIdx.x - 1 ); - for ( unsigned i = threadIdx.y ; i < word_count.value ; ++i ) { shared_accum[i] = block_total[i] ; } - } - else if ( 0 == threadIdx.y ) { - ValueInit::init( m_functor , shared_accum ); - } - - const work_range range( m_policy , blockIdx.x , gridDim.x ); - - for ( typename Policy::member_type iwork_base = range.begin(); iwork_base < range.end() ; iwork_base += blockDim.y ) { - - const typename Policy::member_type iwork = iwork_base + threadIdx.y ; - - __syncthreads(); // Don't overwrite previous iteration values until they are used - - ValueInit::init( m_functor , shared_prefix + word_count.value ); - - // Copy previous block's accumulation total into thread[0] prefix and inclusive scan value of this block - for ( unsigned i = threadIdx.y ; i < word_count.value ; ++i ) { - shared_data[i + word_count.value] = shared_data[i] = shared_accum[i] ; - } - - if ( CudaTraits::WarpSize < word_count.value ) { __syncthreads(); } // Protect against large scan values. - - // Call functor to accumulate inclusive scan value for this work item - if ( iwork < range.end() ) { - ParallelScan::template driver< work_tag > - ( m_functor , iwork , ValueOps::reference( shared_prefix + word_count.value ) , false ); - } - - // Scan block values into locations shared_data[1..blockDim.y] - cuda_intra_block_reduce_scan( m_functor , ValueTraits::pointer_type(shared_data+word_count.value) ); - - { - size_type * const block_total = shared_data + word_count.value * blockDim.y ; - for ( unsigned i = threadIdx.y ; i < word_count.value ; ++i ) { shared_accum[i] = block_total[i]; } - } - - // Call functor with exclusive scan value - if ( iwork < range.end() ) { - ParallelScan::template driver< work_tag > - ( m_functor , iwork , ValueOps::reference( shared_prefix ) , true ); - } - } - } - - //---------------------------------------- - - __device__ inline - void operator()(void) const - { - if ( ! m_final ) { - initial(); - } - else { - final(); - } - } - - ParallelScan( const FunctorType & functor , - const Policy & policy ) - : m_functor( functor ) - , m_policy( policy ) - , m_scratch_space( 0 ) - , m_scratch_flags( 0 ) - , m_final( false ) - { - enum { GridMaxComputeCapability_2x = 0x0ffff }; - - const int block_size = local_block_size( functor ); - - const int grid_max = ( block_size * block_size ) < GridMaxComputeCapability_2x ? - ( block_size * block_size ) : GridMaxComputeCapability_2x ; - - // At most 'max_grid' blocks: - const int nwork = policy.end() - policy.begin(); - const int max_grid = std::min( int(grid_max) , int(( nwork + block_size - 1 ) / block_size )); - - // How much work per block: - const int work_per_block = ( nwork + max_grid - 1 ) / max_grid ; - - // How many block are really needed for this much work: - const dim3 grid( ( nwork + work_per_block - 1 ) / work_per_block , 1 , 1 ); - const dim3 block( 1 , block_size , 1 ); // REQUIRED DIMENSIONS ( 1 , N , 1 ) - const int shmem = ValueTraits::value_size( functor ) * ( block_size + 2 ); - - m_scratch_space = cuda_internal_scratch_space( ValueTraits::value_size( functor ) * grid.x ); - m_scratch_flags = cuda_internal_scratch_flags( sizeof(size_type) * 1 ); - - m_final = false ; - CudaParallelLaunch< ParallelScan >( *this, grid, block, shmem ); // copy to device and execute - - m_final = true ; - CudaParallelLaunch< ParallelScan >( *this, grid, block, shmem ); // copy to device and execute - } - - void wait() const { Cuda::fence(); } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - template - struct TeamThreadRangeBoundariesStruct { - typedef iType index_type; - const iType start; - const iType end; - const iType increment; - const CudaTeamMember& thread; - -#ifdef __CUDA_ARCH__ - __device__ inline - TeamThreadRangeBoundariesStruct (const CudaTeamMember& thread_, const iType& count): - start( threadIdx.y ), - end( count ), - increment( blockDim.y ), - thread(thread_) - {} - __device__ inline - TeamThreadRangeBoundariesStruct (const CudaTeamMember& thread_, const iType& begin_, const iType& end_): - start( begin_+threadIdx.y ), - end( end_ ), - increment( blockDim.y ), - thread(thread_) - {} -#else - KOKKOS_INLINE_FUNCTION - TeamThreadRangeBoundariesStruct (const CudaTeamMember& thread_, const iType& count): - start( 0 ), - end( count ), - increment( 1 ), - thread(thread_) - {} - KOKKOS_INLINE_FUNCTION - TeamThreadRangeBoundariesStruct (const CudaTeamMember& thread_, const iType& begin_, const iType& end_): - start( begin_ ), - end( end_ ), - increment( 1 ), - thread(thread_) - {} -#endif - }; - - template - struct ThreadVectorRangeBoundariesStruct { - typedef iType index_type; - const iType start; - const iType end; - const iType increment; - -#ifdef __CUDA_ARCH__ - __device__ inline - ThreadVectorRangeBoundariesStruct (const CudaTeamMember& thread, const iType& count): - start( threadIdx.x ), - end( count ), - increment( blockDim.x ) - {} -#else - KOKKOS_INLINE_FUNCTION - ThreadVectorRangeBoundariesStruct (const CudaTeamMember& thread_, const iType& count): - start( 0 ), - end( count ), - increment( 1 ) - {} -#endif - }; - -} // namespace Impl - -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct - TeamThreadRange(const Impl::CudaTeamMember& thread, const iType& count) { - return Impl::TeamThreadRangeBoundariesStruct(thread,count); -} - -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct - TeamThreadRange(const Impl::CudaTeamMember& thread, const iType& begin, const iType& end) { - return Impl::TeamThreadRangeBoundariesStruct(thread,begin,end); -} - -template -KOKKOS_INLINE_FUNCTION -Impl::ThreadVectorRangeBoundariesStruct - ThreadVectorRange(const Impl::CudaTeamMember& thread, const iType& count) { - return Impl::ThreadVectorRangeBoundariesStruct(thread,count); -} - -KOKKOS_INLINE_FUNCTION -Impl::ThreadSingleStruct PerTeam(const Impl::CudaTeamMember& thread) { - return Impl::ThreadSingleStruct(thread); -} - -KOKKOS_INLINE_FUNCTION -Impl::VectorSingleStruct PerThread(const Impl::CudaTeamMember& thread) { - return Impl::VectorSingleStruct(thread); -} - -} // namespace Kokkos - -namespace Kokkos { - - /** \brief Inter-thread parallel_for. Executes lambda(iType i) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all threads of the the calling thread team. - * This functionality requires C++11 support.*/ -template -KOKKOS_INLINE_FUNCTION -void parallel_for(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, const Lambda& lambda) { - #ifdef __CUDA_ARCH__ - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) - lambda(i); - #endif -} - -/** \brief Inter-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all threads of the the calling thread team and a summation of - * val is performed and put into result. This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, - const Lambda & lambda, ValueType& result) { - -#ifdef __CUDA_ARCH__ - result = ValueType(); - - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - lambda(i,result); - } - - Impl::cuda_intra_warp_reduction(result,[&] (ValueType& dst, const ValueType& src) { dst+=src; }); - Impl::cuda_inter_warp_reduction(result,[&] (ValueType& dst, const ValueType& src) { dst+=src; }); - -#endif -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a reduction of - * val is performed using JoinType(ValueType& val, const ValueType& update) and put into init_result. - * The input value of init_result is used as initializer for temporary variables of ValueType. Therefore - * the input value should be the neutral element with respect to the join operation (e.g. '0 for +-' or - * '1 for *'). This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType, class JoinType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, - const Lambda & lambda, const JoinType& join, ValueType& init_result) { - -#ifdef __CUDA_ARCH__ - ValueType result = init_result; - - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - lambda(i,result); - } - - Impl::cuda_intra_warp_reduction(result, join ); - Impl::cuda_inter_warp_reduction(result, join ); - - init_result = result; -#endif -} - -} //namespace Kokkos - -namespace Kokkos { -/** \brief Intra-thread vector parallel_for. Executes lambda(iType i) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread. - * This functionality requires C++11 support.*/ -template -KOKKOS_INLINE_FUNCTION -void parallel_for(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda& lambda) { -#ifdef __CUDA_ARCH__ - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) - lambda(i); -#endif -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a summation of - * val is performed and put into result. This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda & lambda, ValueType& result) { -#ifdef __CUDA_ARCH__ - ValueType val = ValueType(); - - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - lambda(i,val); - } - - result = val; - - if (loop_boundaries.increment > 1) - result += shfl_down(result, 1,loop_boundaries.increment); - if (loop_boundaries.increment > 2) - result += shfl_down(result, 2,loop_boundaries.increment); - if (loop_boundaries.increment > 4) - result += shfl_down(result, 4,loop_boundaries.increment); - if (loop_boundaries.increment > 8) - result += shfl_down(result, 8,loop_boundaries.increment); - if (loop_boundaries.increment > 16) - result += shfl_down(result, 16,loop_boundaries.increment); - - result = shfl(result,0,loop_boundaries.increment); -#endif -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a reduction of - * val is performed using JoinType(ValueType& val, const ValueType& update) and put into init_result. - * The input value of init_result is used as initializer for temporary variables of ValueType. Therefore - * the input value should be the neutral element with respect to the join operation (e.g. '0 for +-' or - * '1 for *'). This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType, class JoinType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda & lambda, const JoinType& join, ValueType& init_result) { - -#ifdef __CUDA_ARCH__ - ValueType result = init_result; - - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - lambda(i,result); - } - - if (loop_boundaries.increment > 1) - join( result, shfl_down(result, 1,loop_boundaries.increment)); - if (loop_boundaries.increment > 2) - join( result, shfl_down(result, 2,loop_boundaries.increment)); - if (loop_boundaries.increment > 4) - join( result, shfl_down(result, 4,loop_boundaries.increment)); - if (loop_boundaries.increment > 8) - join( result, shfl_down(result, 8,loop_boundaries.increment)); - if (loop_boundaries.increment > 16) - join( result, shfl_down(result, 16,loop_boundaries.increment)); - - init_result = shfl(result,0,loop_boundaries.increment); -#endif -} - -/** \brief Intra-thread vector parallel exclusive prefix sum. Executes lambda(iType i, ValueType & val, bool final) - * for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes in the thread and a scan operation is performed. - * Depending on the target execution space the operator might be called twice: once with final=false - * and once with final=true. When final==true val contains the prefix sum value. The contribution of this - * "i" needs to be added to val no matter whether final==true or not. In a serial execution - * (i.e. team_size==1) the operator is only called once with final==true. Scan_val will be set - * to the final sum value over all vector lanes. - * This functionality requires C++11 support.*/ -template< typename iType, class FunctorType > -KOKKOS_INLINE_FUNCTION -void parallel_scan(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const FunctorType & lambda) { - -#ifdef __CUDA_ARCH__ - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , void > ValueTraits ; - typedef typename ValueTraits::value_type value_type ; - - value_type scan_val = value_type(); - const int VectorLength = blockDim.x; - - iType loop_bound = ((loop_boundaries.end+VectorLength-1)/VectorLength) * VectorLength; - for(int _i = threadIdx.x; _i < loop_bound; _i += VectorLength) { - value_type val = value_type(); - if(_i 1) { - const value_type tmp2 = shfl_up(tmp, 1,VectorLength); - if(threadIdx.x > 0) - tmp+=tmp2; - } - if(threadIdx.x%VectorLength == 1) - result_i = tmp; - if (VectorLength > 3) { - const value_type tmp2 = shfl_up(tmp, 2,VectorLength); - if(threadIdx.x > 1) - tmp+=tmp2; - } - if ((threadIdx.x%VectorLength >= 2) && - (threadIdx.x%VectorLength < 4)) - result_i = tmp; - if (VectorLength > 7) { - const value_type tmp2 = shfl_up(tmp, 4,VectorLength); - if(threadIdx.x > 3) - tmp+=tmp2; - } - if ((threadIdx.x%VectorLength >= 4) && - (threadIdx.x%VectorLength < 8)) - result_i = tmp; - if (VectorLength > 15) { - const value_type tmp2 = shfl_up(tmp, 8,VectorLength); - if(threadIdx.x > 7) - tmp+=tmp2; - } - if ((threadIdx.x%VectorLength >= 8) && - (threadIdx.x%VectorLength < 16)) - result_i = tmp; - if (VectorLength > 31) { - const value_type tmp2 = shfl_up(tmp, 16,VectorLength); - if(threadIdx.x > 15) - tmp+=tmp2; - } - if (threadIdx.x%VectorLength >= 16) - result_i = tmp; - - val = scan_val + result_i - val; - scan_val += shfl(tmp,VectorLength-1,VectorLength); - if(_i -KOKKOS_INLINE_FUNCTION -void single(const Impl::VectorSingleStruct& , const FunctorType& lambda) { -#ifdef __CUDA_ARCH__ - if(threadIdx.x == 0) lambda(); -#endif -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::ThreadSingleStruct& , const FunctorType& lambda) { -#ifdef __CUDA_ARCH__ - if(threadIdx.x == 0 && threadIdx.y == 0) lambda(); -#endif -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::VectorSingleStruct& , const FunctorType& lambda, ValueType& val) { -#ifdef __CUDA_ARCH__ - if(threadIdx.x == 0) lambda(val); - val = shfl(val,0,blockDim.x); -#endif -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::ThreadSingleStruct& single_struct, const FunctorType& lambda, ValueType& val) { -#ifdef __CUDA_ARCH__ - if(threadIdx.x == 0 && threadIdx.y == 0) { - lambda(val); - } - single_struct.team_member.team_broadcast(val,0); -#endif -} - -} - -namespace Kokkos { - -namespace Impl { - template< class FunctorType, class ExecPolicy, class ValueType , class Tag = typename ExecPolicy::work_tag> - struct CudaFunctorAdapter { - const FunctorType f; - typedef ValueType value_type; - CudaFunctorAdapter(const FunctorType& f_):f(f_) {} - - __device__ inline - void operator() (typename ExecPolicy::work_tag, const typename ExecPolicy::member_type& i, ValueType& val) const { - //Insert Static Assert with decltype on ValueType equals third argument type of FunctorType::operator() - f(typename ExecPolicy::work_tag(), i,val); - } - }; - - template< class FunctorType, class ExecPolicy, class ValueType > - struct CudaFunctorAdapter { - const FunctorType f; - typedef ValueType value_type; - CudaFunctorAdapter(const FunctorType& f_):f(f_) {} - - __device__ inline - void operator() (const typename ExecPolicy::member_type& i, ValueType& val) const { - //Insert Static Assert with decltype on ValueType equals second argument type of FunctorType::operator() - f(i,val); - } - - }; - - template< class FunctorType, class Enable = void> - struct ReduceFunctorHasInit { - enum {value = false}; - }; - - template< class FunctorType> - struct ReduceFunctorHasInit::type > { - enum {value = true}; - }; - - template< class FunctorType, class Enable = void> - struct ReduceFunctorHasJoin { - enum {value = false}; - }; - - template< class FunctorType> - struct ReduceFunctorHasJoin::type > { - enum {value = true}; - }; - - template< class FunctorType, class Enable = void> - struct ReduceFunctorHasFinal { - enum {value = false}; - }; - - template< class FunctorType> - struct ReduceFunctorHasFinal::type > { - enum {value = true}; - }; - - template< class FunctorType, bool Enable = - ( FunctorDeclaresValueType::value) || - ( ReduceFunctorHasInit::value ) || - ( ReduceFunctorHasJoin::value ) || - ( ReduceFunctorHasFinal::value ) - > - struct IsNonTrivialReduceFunctor { - enum {value = false}; - }; - - template< class FunctorType> - struct IsNonTrivialReduceFunctor { - enum {value = true}; - }; - - template::value > - struct FunctorReferenceType { - typedef ResultType& reference_type; - }; - - template - struct FunctorReferenceType { - typedef typename Kokkos::Impl::FunctorValueTraits< FunctorType ,Tag >::reference_type reference_type; - }; - -} - -// general policy and view ouput -template< class ExecPolicy , class FunctorTypeIn , class ViewType > -inline -void parallel_reduce( const ExecPolicy & policy - , const FunctorTypeIn & functor_in - , const ViewType & result_view - , const std::string& str = "" - , typename Impl::enable_if< - ( Impl::is_view::value && ! Impl::is_integral< ExecPolicy >::value && - Impl::is_same::value - )>::type * = 0 ) -{ - enum {FunctorHasValueType = Impl::IsNonTrivialReduceFunctor::value }; - typedef typename Kokkos::Impl::if_c >::type FunctorType; - FunctorType functor = Impl::if_c::select(functor_in,FunctorType(functor_in)); - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelScan("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType, ExecPolicy >( functor , policy , result_view ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelScan(kpID); - } -#endif -} - -// general policy and pod or array of pod output -template< class ExecPolicy , class FunctorTypeIn , class ResultType> -inline -void parallel_reduce( const ExecPolicy & policy - , const FunctorTypeIn & functor_in - , ResultType& result_ref - , const std::string& str = "" - , typename Impl::enable_if< - ( ! Impl::is_view::value && - ! Impl::IsNonTrivialReduceFunctor::value && - ! Impl::is_integral< ExecPolicy >::value && - Impl::is_same::value )>::type * = 0 ) -{ - typedef typename Impl::CudaFunctorAdapter FunctorType; - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , typename ExecPolicy::work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueOps< FunctorType , typename ExecPolicy::work_tag > ValueOps ; - - // Wrap the result output request in a view to inform the implementation - // of the type and memory space. - - typedef typename Kokkos::Impl::if_c< (ValueTraits::StaticValueSize != 0) - , typename ValueTraits::value_type - , typename ValueTraits::pointer_type - >::type value_type ; - Kokkos::View< value_type - , HostSpace - , Kokkos::MemoryUnmanaged - > - result_view( ValueOps::pointer( result_ref ) - , 1 - ); - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelScan("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType, ExecPolicy >( FunctorType(functor_in) , policy , result_view ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelScan(kpID); - } -#endif -} - -// general policy and pod or array of pod output -template< class ExecPolicy , class FunctorType> -inline -void parallel_reduce( const ExecPolicy & policy - , const FunctorType & functor - , typename Kokkos::Impl::FunctorValueTraits< FunctorType , typename ExecPolicy::work_tag >::reference_type result_ref - , const std::string& str = "" - , typename Impl::enable_if< - ( Impl::IsNonTrivialReduceFunctor::value && - ! Impl::is_integral< ExecPolicy >::value && - Impl::is_same::value )>::type * = 0 ) -{ - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , typename ExecPolicy::work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueOps< FunctorType , typename ExecPolicy::work_tag > ValueOps ; - - // Wrap the result output request in a view to inform the implementation - // of the type and memory space. - - typedef typename Kokkos::Impl::if_c< (ValueTraits::StaticValueSize != 0) - , typename ValueTraits::value_type - , typename ValueTraits::pointer_type - >::type value_type ; - - Kokkos::View< value_type - , HostSpace - , Kokkos::MemoryUnmanaged - > - result_view( ValueOps::pointer( result_ref ) - , ValueTraits::value_count( functor ) - ); - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelScan("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType, ExecPolicy >( functor , policy , result_view ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelScan(kpID); - } -#endif -} - -// integral range policy and view ouput -template< class FunctorTypeIn , class ViewType > -inline -void parallel_reduce( const size_t work_count - , const FunctorTypeIn & functor_in - , const ViewType & result_view - , const std::string& str = "" - , typename Impl::enable_if<( Impl::is_view::value && - Impl::is_same< - typename Impl::FunctorPolicyExecutionSpace< FunctorTypeIn , void >::execution_space, - Kokkos::Cuda>::value - )>::type * = 0 ) -{ - enum {FunctorHasValueType = Impl::IsNonTrivialReduceFunctor::value }; - typedef typename - Impl::FunctorPolicyExecutionSpace< FunctorTypeIn , void >::execution_space - execution_space ; - - typedef RangePolicy< execution_space > ExecPolicy ; - - typedef typename Kokkos::Impl::if_c >::type FunctorType; - - FunctorType functor = Impl::if_c::select(functor_in,FunctorType(functor_in)); - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelScan("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType, ExecPolicy >( functor , ExecPolicy(0,work_count) , result_view ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelScan(kpID); - } -#endif - -} - -// integral range policy and pod or array of pod output -template< class FunctorTypeIn , class ResultType> -inline -void parallel_reduce( const size_t work_count - , const FunctorTypeIn & functor_in - , ResultType& result - , const std::string& str = "" - , typename Impl::enable_if< ! Impl::is_view::value && - ! Impl::IsNonTrivialReduceFunctor::value && - Impl::is_same< - typename Impl::FunctorPolicyExecutionSpace< FunctorTypeIn , void >::execution_space, - Kokkos::Cuda>::value >::type * = 0 ) -{ - typedef typename - Kokkos::Impl::FunctorPolicyExecutionSpace< FunctorTypeIn , void >::execution_space - execution_space ; - typedef Kokkos::RangePolicy< execution_space > ExecPolicy ; - - typedef Impl::CudaFunctorAdapter FunctorType; - - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , void > ValueTraits ; - typedef Kokkos::Impl::FunctorValueOps< FunctorType , void > ValueOps ; - - - // Wrap the result output request in a view to inform the implementation - // of the type and memory space. - - typedef typename Kokkos::Impl::if_c< (ValueTraits::StaticValueSize != 0) - , typename ValueTraits::value_type - , typename ValueTraits::pointer_type - >::type value_type ; - - Kokkos::View< value_type - , HostSpace - , Kokkos::MemoryUnmanaged - > - result_view( ValueOps::pointer( result ) - , 1 - ); - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelScan("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType , ExecPolicy >( FunctorType(functor_in) , ExecPolicy(0,work_count) , result_view ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelScan(kpID); - } -#endif -} - -template< class FunctorType> -inline -void parallel_reduce( const size_t work_count - , const FunctorType & functor - , typename Kokkos::Impl::FunctorValueTraits< FunctorType , void >::reference_type result - , const std::string& str = "" - , typename Impl::enable_if< Impl::IsNonTrivialReduceFunctor::value && - Impl::is_same< - typename Impl::FunctorPolicyExecutionSpace< FunctorType , void >::execution_space, - Kokkos::Cuda>::value >::type * = 0 ) -{ - - typedef typename - Kokkos::Impl::FunctorPolicyExecutionSpace< FunctorType , void >::execution_space - execution_space ; - typedef Kokkos::RangePolicy< execution_space > ExecPolicy ; - - - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , void > ValueTraits ; - typedef Kokkos::Impl::FunctorValueOps< FunctorType , void > ValueOps ; - - - // Wrap the result output request in a view to inform the implementation - // of the type and memory space. - - typedef typename Kokkos::Impl::if_c< (ValueTraits::StaticValueSize != 0) - , typename ValueTraits::value_type - , typename ValueTraits::pointer_type - >::type value_type ; - - Kokkos::View< value_type - , HostSpace - , Kokkos::MemoryUnmanaged - > - result_view( ValueOps::pointer( result ) - , ValueTraits::value_count( functor ) - ); - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelScan("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType , ExecPolicy >( functor , ExecPolicy(0,work_count) , result_view ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelScan(kpID); - } -#endif -} - -#ifdef KOKKOS_HAVE_CUDA -template< class ExecPolicy , class FunctorType , class ResultType > -inline -void parallel_reduce( const std::string & str - , const ExecPolicy & policy - , const FunctorType & functor - , ResultType * result) -{ - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG Start parallel_reduce kernel: " << str << std::endl; - #endif - - parallel_reduce(policy,functor,result,str); - - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG End parallel_reduce kernel: " << str << std::endl; - #endif - (void) str; -} - -template< class ExecPolicy , class FunctorType , class ResultType > -inline -void parallel_reduce( const std::string & str - , const ExecPolicy & policy - , const FunctorType & functor - , ResultType & result) -{ - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG Start parallel_reduce kernel: " << str << std::endl; - #endif - - parallel_reduce(policy,functor,result,str); - - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG End parallel_reduce kernel: " << str << std::endl; - #endif - (void) str; -} - -template< class ExecPolicy , class FunctorType > -inline -void parallel_reduce( const std::string & str - , const ExecPolicy & policy - , const FunctorType & functor) -{ - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG Start parallel_reduce kernel: " << str << std::endl; - #endif - - parallel_reduce(policy,functor,str); - - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG End parallel_reduce kernel: " << str << std::endl; - #endif - (void) str; -} -#endif -} // namespace Kokkos -#endif /* defined( __CUDACC__ ) */ - -#endif /* #ifndef KOKKOS_CUDA_PARALLEL_HPP */ - diff --git a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_ReduceScan.hpp b/lib/kokkos/core/src/Cuda/Kokkos_Cuda_ReduceScan.hpp deleted file mode 100644 index 5ef16711ee..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_ReduceScan.hpp +++ /dev/null @@ -1,424 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CUDA_REDUCESCAN_HPP -#define KOKKOS_CUDA_REDUCESCAN_HPP - -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#if defined( __CUDACC__ ) && defined( KOKKOS_HAVE_CUDA ) - -#include - -#include -#include -#include -#include -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - - - -//Shfl based reductions -/* - * Algorithmic constraints: - * (a) threads with same threadIdx.y have same value - * (b) blockDim.x == power of two - * (c) blockDim.z == 1 - */ - -template< class ValueType , class JoinOp> -__device__ -inline void cuda_intra_warp_reduction( ValueType& result, - const JoinOp& join, - const int max_active_thread = blockDim.y) { - - unsigned int shift = 1; - - //Reduce over values from threads with different threadIdx.y - while(blockDim.x * shift < 32 ) { - const ValueType tmp = shfl_down(result, blockDim.x*shift,32u); - //Only join if upper thread is active (this allows non power of two for blockDim.y - if(threadIdx.y + shift < max_active_thread) - join(result , tmp); - shift*=2; - } - - result = shfl(result,0,32); -} - -template< class ValueType , class JoinOp> -__device__ -inline void cuda_inter_warp_reduction( ValueType& value, - const JoinOp& join, - const int max_active_thread = blockDim.y) { - - #define STEP_WIDTH 4 - __shared__ char sh_result[sizeof(ValueType)*STEP_WIDTH]; - ValueType* result = (ValueType*) & sh_result; - const unsigned step = 32 / blockDim.x; - unsigned shift = STEP_WIDTH; - const int id = threadIdx.y%step==0?threadIdx.y/step:65000; - if(id < STEP_WIDTH ) { - result[id] = value; - } - __syncthreads(); - while (shift<=max_active_thread/step) { - if(shift<=id && shift+STEP_WIDTH>id && threadIdx.x==0) { - join(result[id%STEP_WIDTH],value); - } - __syncthreads(); - shift+=STEP_WIDTH; - } - - - value = result[0]; - for(int i = 1; (i*step<=max_active_thread) && i -__device__ -inline void cuda_intra_block_reduction( ValueType& value, - const JoinOp& join, - const int max_active_thread = blockDim.y) { - cuda_intra_warp_reduction(value,join,max_active_thread); - cuda_inter_warp_reduction(value,join,max_active_thread); -} - -template< class FunctorType , class JoinOp> -__device__ -bool cuda_inter_block_reduction( typename FunctorValueTraits< FunctorType , void >::reference_type value, - const JoinOp& join, - Cuda::size_type * const m_scratch_space, - typename FunctorValueTraits< FunctorType , void >::pointer_type const result, - Cuda::size_type * const m_scratch_flags, - const int max_active_thread = blockDim.y) { - typedef typename FunctorValueTraits< FunctorType , void >::pointer_type pointer_type; - typedef typename FunctorValueTraits< FunctorType , void >::value_type value_type; - - //Do the intra-block reduction with shfl operations and static shared memory - cuda_intra_block_reduction(value,join,max_active_thread); - - const unsigned id = threadIdx.y*blockDim.x + threadIdx.x; - - //One thread in the block writes block result to global scratch_memory - if(id == 0 ) { - pointer_type global = ((pointer_type) m_scratch_space) + blockIdx.x; - *global = value; - } - - //One warp of last block performs inter block reduction through loading the block values from global scratch_memory - bool last_block = false; - - __syncthreads(); - if ( id < 32 ) { - Cuda::size_type count; - - //Figure out whether this is the last block - if(id == 0) - count = Kokkos::atomic_fetch_add(m_scratch_flags,1); - count = Kokkos::shfl(count,0,32); - - //Last block does the inter block reduction - if( count == gridDim.x - 1) { - //set flag back to zero - if(id == 0) - *m_scratch_flags = 0; - last_block = true; - value = 0; - - pointer_type const volatile global = (pointer_type) m_scratch_space ; - - //Reduce all global values with splitting work over threads in one warp - const int step_size = blockDim.x*blockDim.y < 32 ? blockDim.x*blockDim.y : 32; - for(int i=id; i 1) { - value_type tmp = Kokkos::shfl_down(value, 1,32); - if( id + 1 < gridDim.x ) - join(value, tmp); - } - if (blockDim.x*blockDim.y > 2) { - value_type tmp = Kokkos::shfl_down(value, 2,32); - if( id + 2 < gridDim.x ) - join(value, tmp); - } - if (blockDim.x*blockDim.y > 4) { - value_type tmp = Kokkos::shfl_down(value, 4,32); - if( id + 4 < gridDim.x ) - join(value, tmp); - } - if (blockDim.x*blockDim.y > 8) { - value_type tmp = Kokkos::shfl_down(value, 8,32); - if( id + 8 < gridDim.x ) - join(value, tmp); - } - if (blockDim.x*blockDim.y > 16) { - value_type tmp = Kokkos::shfl_down(value, 16,32); - if( id + 16 < gridDim.x ) - join(value, tmp); - } - } - } - - //The last block has in its thread=0 the global reduction value through "value" - return last_block; -} - -//---------------------------------------------------------------------------- -// See section B.17 of Cuda C Programming Guide Version 3.2 -// for discussion of -// __launch_bounds__(maxThreadsPerBlock,minBlocksPerMultiprocessor) -// function qualifier which could be used to improve performance. -//---------------------------------------------------------------------------- -// Maximize shared memory and minimize L1 cache: -// cudaFuncSetCacheConfig(MyKernel, cudaFuncCachePreferShared ); -// For 2.0 capability: 48 KB shared and 16 KB L1 -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- -/* - * Algorithmic constraints: - * (a) blockDim.y is a power of two - * (b) blockDim.y <= 512 - * (c) blockDim.x == blockDim.z == 1 - */ - -template< bool DoScan , class FunctorType , class ArgTag > -__device__ -void cuda_intra_block_reduce_scan( const FunctorType & functor , - const typename FunctorValueTraits< FunctorType , ArgTag >::pointer_type base_data ) -{ - typedef FunctorValueTraits< FunctorType , ArgTag > ValueTraits ; - typedef FunctorValueJoin< FunctorType , ArgTag > ValueJoin ; - - typedef typename ValueTraits::pointer_type pointer_type ; - - const unsigned value_count = ValueTraits::value_count( functor ); - const unsigned BlockSizeMask = blockDim.y - 1 ; - - // Must have power of two thread count - - if ( BlockSizeMask & blockDim.y ) { Kokkos::abort("Cuda::cuda_intra_block_scan requires power-of-two blockDim"); } - -#define BLOCK_REDUCE_STEP( R , TD , S ) \ - if ( ! ( R & ((1<<(S+1))-1) ) ) { ValueJoin::join( functor , TD , (TD - (value_count< -__device__ -bool cuda_single_inter_block_reduce_scan( const FunctorType & functor , - const Cuda::size_type block_id , - const Cuda::size_type block_count , - Cuda::size_type * const shared_data , - Cuda::size_type * const global_data , - Cuda::size_type * const global_flags ) -{ - typedef Cuda::size_type size_type ; - typedef FunctorValueTraits< FunctorType , ArgTag > ValueTraits ; - typedef FunctorValueJoin< FunctorType , ArgTag > ValueJoin ; - typedef FunctorValueInit< FunctorType , ArgTag > ValueInit ; - typedef FunctorValueOps< FunctorType , ArgTag > ValueOps ; - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - const unsigned BlockSizeMask = blockDim.y - 1 ; - const unsigned BlockSizeShift = power_of_two_if_valid( blockDim.y ); - - // Must have power of two thread count - if ( BlockSizeMask & blockDim.y ) { Kokkos::abort("Cuda::cuda_single_inter_block_reduce_scan requires power-of-two blockDim"); } - - const integral_nonzero_constant< size_type , ValueTraits::StaticValueSize / sizeof(size_type) > - word_count( ValueTraits::value_size( functor ) / sizeof(size_type) ); - - // Reduce the accumulation for the entire block. - cuda_intra_block_reduce_scan( functor , pointer_type(shared_data) ); - - { - // Write accumulation total to global scratch space. - // Accumulation total is the last thread's data. - size_type * const shared = shared_data + word_count.value * BlockSizeMask ; - size_type * const global = global_data + word_count.value * block_id ; - - for ( size_type i = threadIdx.y ; i < word_count.value ; i += blockDim.y ) { global[i] = shared[i] ; } - } - - // Contributing blocks note that their contribution has been completed via an atomic-increment flag - // If this block is not the last block to contribute to this group then the block is done. - const bool is_last_block = - ! __syncthreads_or( threadIdx.y ? 0 : ( 1 + atomicInc( global_flags , block_count - 1 ) < block_count ) ); - - if ( is_last_block ) { - - const size_type b = ( long(block_count) * long(threadIdx.y) ) >> BlockSizeShift ; - const size_type e = ( long(block_count) * long( threadIdx.y + 1 ) ) >> BlockSizeShift ; - - { - void * const shared_ptr = shared_data + word_count.value * threadIdx.y ; - reference_type shared_value = ValueInit::init( functor , shared_ptr ); - - for ( size_type i = b ; i < e ; ++i ) { - ValueJoin::join( functor , shared_ptr , global_data + word_count.value * i ); - } - } - - cuda_intra_block_reduce_scan( functor , pointer_type(shared_data) ); - - if ( DoScan ) { - - size_type * const shared_value = shared_data + word_count.value * ( threadIdx.y ? threadIdx.y - 1 : blockDim.y ); - - if ( ! threadIdx.y ) { ValueInit::init( functor , shared_value ); } - - // Join previous inclusive scan value to each member - for ( size_type i = b ; i < e ; ++i ) { - size_type * const global_value = global_data + word_count.value * i ; - ValueJoin::join( functor , shared_value , global_value ); - ValueOps ::copy( functor , global_value , shared_value ); - } - } - } - - return is_last_block ; -} - -// Size in bytes required for inter block reduce or scan -template< bool DoScan , class FunctorType , class ArgTag > -inline -unsigned cuda_single_inter_block_reduce_scan_shmem( const FunctorType & functor , const unsigned BlockSize ) -{ - return ( BlockSize + 2 ) * Impl::FunctorValueTraits< FunctorType , ArgTag >::value_size( functor ); -} - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #if defined( __CUDACC__ ) */ -#endif /* KOKKOS_CUDA_REDUCESCAN_HPP */ - diff --git a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Vectorization.hpp b/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Vectorization.hpp deleted file mode 100644 index 0b8427cbe1..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_Vectorization.hpp +++ /dev/null @@ -1,298 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ -#ifndef KOKKOS_CUDA_VECTORIZATION_HPP -#define KOKKOS_CUDA_VECTORIZATION_HPP - -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#ifdef KOKKOS_HAVE_CUDA - -#include - -namespace Kokkos { - - -// Shuffle only makes sense on >= Kepler GPUs; it doesn't work on CPUs -// or other GPUs. We provide a generic definition (which is trivial -// and doesn't do what it claims to do) because we don't actually use -// this function unless we are on a suitable GPU, with a suitable -// Scalar type. (For example, in the mat-vec, the "ThreadsPerRow" -// internal parameter depends both on the ExecutionSpace and the Scalar type, -// and it controls whether shfl_down() gets called.) -namespace Impl { - - template< typename Scalar > - struct shfl_union { - enum {n = sizeof(Scalar)/4}; - float fval[n]; - KOKKOS_INLINE_FUNCTION - Scalar value() { - return *(Scalar*) fval; - } - KOKKOS_INLINE_FUNCTION - void operator= (Scalar& value_) { - float* const val_ptr = (float*) &value_; - for(int i=0; i= 300) - - KOKKOS_INLINE_FUNCTION - int shfl(const int &val, const int& srcLane, const int& width ) { - return __shfl(val,srcLane,width); - } - - KOKKOS_INLINE_FUNCTION - float shfl(const float &val, const int& srcLane, const int& width ) { - return __shfl(val,srcLane,width); - } - - template - KOKKOS_INLINE_FUNCTION - Scalar shfl(const Scalar &val, const int& srcLane, const typename Impl::enable_if< (sizeof(Scalar) == 4) , int >::type& width - ) { - Scalar tmp1 = val; - float tmp = *reinterpret_cast(&tmp1); - tmp = __shfl(tmp,srcLane,width); - return *reinterpret_cast(&tmp); - } - - KOKKOS_INLINE_FUNCTION - double shfl(const double &val, const int& srcLane, const int& width) { - int lo = __double2loint(val); - int hi = __double2hiint(val); - lo = __shfl(lo,srcLane,width); - hi = __shfl(hi,srcLane,width); - return __hiloint2double(hi,lo); - } - - template - KOKKOS_INLINE_FUNCTION - Scalar shfl(const Scalar &val, const int& srcLane, const typename Impl::enable_if< (sizeof(Scalar) == 8) ,int>::type& width) { - int lo = __double2loint(*reinterpret_cast(&val)); - int hi = __double2hiint(*reinterpret_cast(&val)); - lo = __shfl(lo,srcLane,width); - hi = __shfl(hi,srcLane,width); - const double tmp = __hiloint2double(hi,lo); - return *(reinterpret_cast(&tmp)); - } - - template - KOKKOS_INLINE_FUNCTION - Scalar shfl(const Scalar &val, const int& srcLane, const typename Impl::enable_if< (sizeof(Scalar) > 8) ,int>::type& width) { - Impl::shfl_union s_val; - Impl::shfl_union r_val; - s_val = val; - - for(int i = 0; i - KOKKOS_INLINE_FUNCTION - Scalar shfl_down(const Scalar &val, const int& delta, const typename Impl::enable_if< (sizeof(Scalar) == 4) , int >::type & width) { - Scalar tmp1 = val; - float tmp = *reinterpret_cast(&tmp1); - tmp = __shfl_down(tmp,delta,width); - return *reinterpret_cast(&tmp); - } - - KOKKOS_INLINE_FUNCTION - double shfl_down(const double &val, const int& delta, const int& width) { - int lo = __double2loint(val); - int hi = __double2hiint(val); - lo = __shfl_down(lo,delta,width); - hi = __shfl_down(hi,delta,width); - return __hiloint2double(hi,lo); - } - - template - KOKKOS_INLINE_FUNCTION - Scalar shfl_down(const Scalar &val, const int& delta, const typename Impl::enable_if< (sizeof(Scalar) == 8) , int >::type & width) { - int lo = __double2loint(*reinterpret_cast(&val)); - int hi = __double2hiint(*reinterpret_cast(&val)); - lo = __shfl_down(lo,delta,width); - hi = __shfl_down(hi,delta,width); - const double tmp = __hiloint2double(hi,lo); - return *(reinterpret_cast(&tmp)); - } - - template - KOKKOS_INLINE_FUNCTION - Scalar shfl_down(const Scalar &val, const int& delta, const typename Impl::enable_if< (sizeof(Scalar) > 8) , int >::type & width) { - Impl::shfl_union s_val; - Impl::shfl_union r_val; - s_val = val; - - for(int i = 0; i - KOKKOS_INLINE_FUNCTION - Scalar shfl_up(const Scalar &val, const int& delta, const typename Impl::enable_if< (sizeof(Scalar) == 4) , int >::type & width) { - Scalar tmp1 = val; - float tmp = *reinterpret_cast(&tmp1); - tmp = __shfl_up(tmp,delta,width); - return *reinterpret_cast(&tmp); - } - - KOKKOS_INLINE_FUNCTION - double shfl_up(const double &val, const int& delta, const int& width ) { - int lo = __double2loint(val); - int hi = __double2hiint(val); - lo = __shfl_up(lo,delta,width); - hi = __shfl_up(hi,delta,width); - return __hiloint2double(hi,lo); - } - - template - KOKKOS_INLINE_FUNCTION - Scalar shfl_up(const Scalar &val, const int& delta, const typename Impl::enable_if< (sizeof(Scalar) == 8) , int >::type & width) { - int lo = __double2loint(*reinterpret_cast(&val)); - int hi = __double2hiint(*reinterpret_cast(&val)); - lo = __shfl_up(lo,delta,width); - hi = __shfl_up(hi,delta,width); - const double tmp = __hiloint2double(hi,lo); - return *(reinterpret_cast(&tmp)); - } - - template - KOKKOS_INLINE_FUNCTION - Scalar shfl_up(const Scalar &val, const int& delta, const typename Impl::enable_if< (sizeof(Scalar) > 8) , int >::type & width) { - Impl::shfl_union s_val; - Impl::shfl_union r_val; - s_val = val; - - for(int i = 0; i - KOKKOS_INLINE_FUNCTION - Scalar shfl(const Scalar &val, const int& srcLane, const int& width) { - if(width > 1) Kokkos::abort("Error: calling shfl from a device with CC<3.0."); - return val; - } - - template - KOKKOS_INLINE_FUNCTION - Scalar shfl_down(const Scalar &val, const int& delta, const int& width) { - if(width > 1) Kokkos::abort("Error: calling shfl_down from a device with CC<3.0."); - return val; - } - - template - KOKKOS_INLINE_FUNCTION - Scalar shfl_up(const Scalar &val, const int& delta, const int& width) { - if(width > 1) Kokkos::abort("Error: calling shfl_down from a device with CC<3.0."); - return val; - } - #endif -#else - template - inline - Scalar shfl(const Scalar &val, const int& srcLane, const int& width) { - if(width > 1) Kokkos::abort("Error: calling shfl from a device with CC<3.0."); - return val; - } - - template - inline - Scalar shfl_down(const Scalar &val, const int& delta, const int& width) { - if(width > 1) Kokkos::abort("Error: calling shfl_down from a device with CC<3.0."); - return val; - } - - template - inline - Scalar shfl_up(const Scalar &val, const int& delta, const int& width) { - if(width > 1) Kokkos::abort("Error: calling shfl_down from a device with CC<3.0."); - return val; - } -#endif - - - -} - -#endif // KOKKOS_HAVE_CUDA -#endif diff --git a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_View.hpp b/lib/kokkos/core/src/Cuda/Kokkos_Cuda_View.hpp deleted file mode 100644 index 9074c249fc..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_View.hpp +++ /dev/null @@ -1,427 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CUDA_VIEW_HPP -#define KOKKOS_CUDA_VIEW_HPP - -#include - -/* only compile this file if CUDA is enabled for Kokkos */ -#ifdef KOKKOS_HAVE_CUDA - -#include - -#include -#include -#include - -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template<> -struct AssertShapeBoundsAbort< CudaSpace > -{ - KOKKOS_INLINE_FUNCTION - static void apply( const size_t /* rank */ , - const size_t /* n0 */ , const size_t /* n1 */ , - const size_t /* n2 */ , const size_t /* n3 */ , - const size_t /* n4 */ , const size_t /* n5 */ , - const size_t /* n6 */ , const size_t /* n7 */ , - - const size_t /* arg_rank */ , - const size_t /* i0 */ , const size_t /* i1 */ , - const size_t /* i2 */ , const size_t /* i3 */ , - const size_t /* i4 */ , const size_t /* i5 */ , - const size_t /* i6 */ , const size_t /* i7 */ ) - { - Kokkos::abort("Kokkos::View array bounds violation"); - } -}; - -} -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -//---------------------------------------------------------------------------- -// Cuda Texture fetches can be performed for 4, 8 and 16 byte objects (int,int2,int4) -// Via reinterpret_case this can be used to support all scalar types of those sizes. -// Any other scalar type falls back to either normal reads out of global memory, -// or using the __ldg intrinsic on Kepler GPUs or newer (Compute Capability >= 3.0) - -template< typename ValueType - , class MemorySpace - , class AliasType = - typename Kokkos::Impl::if_c< ( sizeof(ValueType) == 4 ) , int , - typename Kokkos::Impl::if_c< ( sizeof(ValueType) == 8 ) , ::int2 , - typename Kokkos::Impl::if_c< ( sizeof(ValueType) == 16 ) , ::int4 , - typename Kokkos::Impl::if_c< ( sizeof(ValueType) == 32 ) , ::float4 ,void - >::type - >::type - >::type - >::type - > -class CudaTextureFetch { -private: - - cuda_texture_object_type m_obj ; - const ValueType * m_alloc_ptr ; - int m_offset ; - - void attach( const ValueType * const arg_ptr, AllocationTracker const & tracker ) - { - typedef char const * const byte; - - m_alloc_ptr = reinterpret_cast(tracker.alloc_ptr()); - - size_t byte_offset = reinterpret_cast(arg_ptr) - reinterpret_cast(m_alloc_ptr); - const bool ok_aligned = 0 == byte_offset % sizeof(ValueType); - - const size_t count = tracker.alloc_size() / sizeof(ValueType); - const bool ok_contains = (m_alloc_ptr <= arg_ptr) && (arg_ptr < (m_alloc_ptr + count)); - - if (ok_aligned && ok_contains) { - if (tracker.attribute() == NULL ) { - MemorySpace::texture_object_attach( - tracker - , sizeof(ValueType) - , cudaCreateChannelDesc< AliasType >() - ); - } - m_obj = dynamic_cast(tracker.attribute())->m_tex_obj; - m_offset = arg_ptr - m_alloc_ptr; - } - else if( !ok_contains ) { - throw_runtime_exception("Error: cannot attach a texture object to a tracker which does not bound the pointer."); - } - else { - throw_runtime_exception("Error: cannot attach a texture object to an incorrectly aligned pointer."); - } - } - -public: - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch() : m_obj() , m_alloc_ptr() , m_offset() {} - - KOKKOS_INLINE_FUNCTION - ~CudaTextureFetch() {} - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch( const CudaTextureFetch & rhs ) - : m_obj( rhs.m_obj ) - , m_alloc_ptr( rhs.m_alloc_ptr ) - , m_offset( rhs.m_offset ) - {} - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch & operator = ( const CudaTextureFetch & rhs ) - { - m_obj = rhs.m_obj ; - m_alloc_ptr = rhs.m_alloc_ptr ; - m_offset = rhs.m_offset ; - return *this ; - } - - KOKKOS_INLINE_FUNCTION explicit - CudaTextureFetch( const ValueType * const arg_ptr, AllocationTracker const & tracker ) - : m_obj( 0 ) , m_alloc_ptr(0) , m_offset(0) - { - #if defined( KOKKOS_USE_LDG_INTRINSIC ) - m_alloc_ptr(arg_ptr); - #elif defined( __CUDACC__ ) && ! defined( __CUDA_ARCH__ ) - if ( arg_ptr != NULL ) { - if ( tracker.is_valid() ) { - attach( arg_ptr, tracker ); - } - else { - AllocationTracker found_tracker = AllocationTracker::find(arg_ptr); - if ( found_tracker.is_valid() ) { - attach( arg_ptr, found_tracker ); - } else { - throw_runtime_exception("Error: cannot attach a texture object to an untracked pointer!"); - } - } - } - #endif - } - - KOKKOS_INLINE_FUNCTION - operator const ValueType * () const { return m_alloc_ptr + m_offset ; } - - - template< typename iType > - KOKKOS_INLINE_FUNCTION - ValueType operator[]( const iType & i ) const - { - #if defined( KOKKOS_USE_LDG_INTRINSIC ) && defined( __CUDA_ARCH__ ) && ( 300 <= __CUDA_ARCH__ ) - AliasType v = __ldg(reinterpret_cast(&m_alloc_ptr[i])); - return *(reinterpret_cast (&v)); - #elif defined( __CUDA_ARCH__ ) && ( 300 <= __CUDA_ARCH__ ) - AliasType v = tex1Dfetch( m_obj , i + m_offset ); - return *(reinterpret_cast (&v)); - #else - return m_alloc_ptr[ i + m_offset ]; - #endif - } -}; - - -template< typename ValueType, class MemorySpace > -class CudaTextureFetch< const ValueType, MemorySpace, float4 > { -private: - typedef float4 AliasType; - cuda_texture_object_type m_obj ; - const ValueType * m_alloc_ptr ; - int m_offset ; - - void attach( const ValueType * const arg_ptr, AllocationTracker const & tracker ) - { - typedef char const * const byte; - - m_alloc_ptr = reinterpret_cast(tracker.alloc_ptr()); - - size_t byte_offset = reinterpret_cast(arg_ptr) - reinterpret_cast(m_alloc_ptr); - const bool ok_aligned = 0 == byte_offset % sizeof(ValueType); - - const size_t count = tracker.alloc_size() / sizeof(ValueType); - const bool ok_contains = (m_alloc_ptr <= arg_ptr) && (arg_ptr < (m_alloc_ptr + count)); - - if (ok_aligned && ok_contains) { - if (tracker.attribute() == NULL ) { - MemorySpace::texture_object_attach( - tracker - , sizeof(ValueType) - , cudaCreateChannelDesc< AliasType >() - ); - } - m_obj = dynamic_cast(tracker.attribute())->m_tex_obj; - m_offset = arg_ptr - m_alloc_ptr; - } - else if( !ok_contains ) { - throw_runtime_exception("Error: cannot attach a texture object to a tracker which does not bound the pointer."); - } - else { - throw_runtime_exception("Error: cannot attach a texture object to an incorrectly aligned pointer."); - } - } - -public: - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch() : m_obj() , m_alloc_ptr() , m_offset() {} - - KOKKOS_INLINE_FUNCTION - ~CudaTextureFetch() {} - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch( const CudaTextureFetch & rhs ) - : m_obj( rhs.m_obj ) - , m_alloc_ptr( rhs.m_alloc_ptr ) - , m_offset( rhs.m_offset ) - {} - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch & operator = ( const CudaTextureFetch & rhs ) - { - m_obj = rhs.m_obj ; - m_alloc_ptr = rhs.m_alloc_ptr ; - m_offset = rhs.m_offset ; - return *this ; - } - - KOKKOS_INLINE_FUNCTION explicit - CudaTextureFetch( const ValueType * const arg_ptr, AllocationTracker const & tracker ) - : m_obj( 0 ) , m_alloc_ptr(0) , m_offset(0) - { - #if defined( KOKKOS_USE_LDG_INTRINSIC ) - m_alloc_ptr(arg_ptr); - #elif defined( __CUDACC__ ) && ! defined( __CUDA_ARCH__ ) - if ( arg_ptr != NULL ) { - if ( tracker.is_valid() ) { - attach( arg_ptr, tracker ); - } - else { - AllocationTracker found_tracker = AllocationTracker::find(arg_ptr); - if ( found_tracker.is_valid() ) { - attach( arg_ptr, found_tracker ); - } else { - throw_runtime_exception("Error: cannot attach a texture object to an untracked pointer!"); - } - } - } - #endif - } - - KOKKOS_INLINE_FUNCTION - operator const ValueType * () const { return m_alloc_ptr + m_offset ; } - - - template< typename iType > - KOKKOS_INLINE_FUNCTION - ValueType operator[]( const iType & i ) const - { - #if defined( KOKKOS_USE_LDG_INTRINSIC ) && defined( __CUDA_ARCH__ ) && ( 300 <= __CUDA_ARCH__ ) - AliasType v = __ldg(reinterpret_cast(&m_alloc_ptr[i])); - return *(reinterpret_cast (&v)); - #elif defined( __CUDA_ARCH__ ) && ( 300 <= __CUDA_ARCH__ ) - union Float4ValueType { - float4 f4[2]; - ValueType val; - }; - Float4ValueType convert; - convert.f4[0] = tex1Dfetch( m_obj , 2*(i + m_offset) ); - convert.f4[1] = tex1Dfetch( m_obj , 2*(i + m_offset)+1 ); - return convert.val; - #else - return m_alloc_ptr[ i + m_offset ]; - #endif - } -}; - -template< typename ValueType, class MemorySpace > -class CudaTextureFetch< const ValueType, MemorySpace, void > -{ -private: - const ValueType * m_ptr ; -public: - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch() : m_ptr(0) {}; - - KOKKOS_INLINE_FUNCTION - ~CudaTextureFetch() { - } - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch( const ValueType * ptr, const AllocationTracker & ) : m_ptr(ptr) {} - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch( const CudaTextureFetch & rhs ) : m_ptr(rhs.m_ptr) {} - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch & operator = ( const CudaTextureFetch & rhs ) { - m_ptr = rhs.m_ptr; - return *this ; - } - - explicit KOKKOS_INLINE_FUNCTION - CudaTextureFetch( ValueType * const base_view_ptr, AllocationTracker const & /*tracker*/ ) { - m_ptr = base_view_ptr; - } - - KOKKOS_INLINE_FUNCTION - CudaTextureFetch & operator = (const ValueType* base_view_ptr) { - m_ptr = base_view_ptr; - return *this; - } - - - KOKKOS_INLINE_FUNCTION - operator const ValueType * () const { return m_ptr ; } - - - template< typename iType > - KOKKOS_INLINE_FUNCTION - ValueType operator[]( const iType & i ) const - { - return m_ptr[ i ]; - } -}; - -} // namespace Impl -} // namespace Kokkos - - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -/** \brief Replace Default ViewDataHandle with Cuda texture fetch specialization - * if 'const' value type, CudaSpace and random access. - */ -template< class ViewTraits > -class ViewDataHandle< ViewTraits , - typename enable_if< ( is_same< typename ViewTraits::memory_space,CudaSpace>::value || - is_same< typename ViewTraits::memory_space,CudaUVMSpace>::value ) - && - is_same::value - && - ViewTraits::memory_traits::RandomAccess - >::type > -{ -public: - enum { ReturnTypeIsReference = false }; - - typedef Impl::CudaTextureFetch< typename ViewTraits::value_type - , typename ViewTraits::memory_space> handle_type; - - KOKKOS_INLINE_FUNCTION - static handle_type create_handle( typename ViewTraits::value_type * arg_data_ptr, AllocationTracker const & arg_tracker ) - { - return handle_type(arg_data_ptr, arg_tracker); - } - - typedef typename ViewTraits::value_type return_type; -}; - -} -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif // KOKKOS_HAVE_CUDA -#endif /* #ifndef KOKKOS_CUDA_VIEW_HPP */ - diff --git a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_abort.hpp b/lib/kokkos/core/src/Cuda/Kokkos_Cuda_abort.hpp deleted file mode 100644 index deb955ccd4..0000000000 --- a/lib/kokkos/core/src/Cuda/Kokkos_Cuda_abort.hpp +++ /dev/null @@ -1,119 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CUDA_ABORT_HPP -#define KOKKOS_CUDA_ABORT_HPP - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- -#include "Kokkos_Macros.hpp" -#if defined( __CUDACC__ ) && defined( __CUDA_ARCH__ ) && defined( KOKKOS_HAVE_CUDA ) - -#include - -#if ! defined( CUDA_VERSION ) || ( CUDA_VERSION < 4010 ) -#error "Cuda version 4.1 or greater required" -#endif - -#if ( __CUDA_ARCH__ < 200 ) -#error "Cuda device capability 2.0 or greater required" -#endif - -extern "C" { -/* Cuda runtime function, declared in - * Requires capability 2.x or better. - */ -extern __device__ void __assertfail( - const void *message, - const void *file, - unsigned int line, - const void *function, - size_t charsize); -} - -namespace Kokkos { -namespace Impl { - -__device__ inline -void cuda_abort( const char * const message ) -{ -#ifndef __APPLE__ - const char empty[] = "" ; - - __assertfail( (const void *) message , - (const void *) empty , - (unsigned int) 0 , - (const void *) empty , - sizeof(char) ); -#endif -} - -} // namespace Impl -} // namespace Kokkos - -#else - -namespace Kokkos { -namespace Impl { -KOKKOS_INLINE_FUNCTION -void cuda_abort( const char * const ) {} -} -} - -#endif /* #if defined( __CUDACC__ ) && defined( __CUDA_ARCH__ ) */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_CUDA ) -namespace Kokkos { -__device__ inline -void abort( const char * const message ) { Kokkos::Impl::cuda_abort(message); } -} -#endif /* defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_CUDA ) */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_CUDA_ABORT_HPP */ - diff --git a/lib/kokkos/core/src/KokkosExp_View.hpp b/lib/kokkos/core/src/KokkosExp_View.hpp deleted file mode 100644 index fef76a4570..0000000000 --- a/lib/kokkos/core/src/KokkosExp_View.hpp +++ /dev/null @@ -1,1989 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXPERIMENTAL_VIEW_HPP -#define KOKKOS_EXPERIMENTAL_VIEW_HPP - -#include -#include -#include - -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -template< class DataType > -struct ViewArrayAnalysis ; - -template< class DataType , class ValueType , class ArrayLayout > -struct ViewDataAnalysis ; - -template< class , class = void , typename Enable = void > -class ViewMapping { enum { is_assignable = false }; }; - -template< class DstMemorySpace , class SrcMemorySpace > -struct DeepCopy ; - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -/** \class ViewTraits - * \brief Traits class for accessing attributes of a View. - * - * This is an implementation detail of View. It is only of interest - * to developers implementing a new specialization of View. - * - * Template argument permutations: - * - View< DataType , void , void , void > - * - View< DataType , Space , void , void > - * - View< DataType , Space , MemoryTraits , void > - * - View< DataType , Space , void , MemoryTraits > - * - View< DataType , ArrayLayout , void , void > - * - View< DataType , ArrayLayout , Space , void > - * - View< DataType , ArrayLayout , MemoryTraits , void > - * - View< DataType , ArrayLayout , Space , MemoryTraits > - * - View< DataType , MemoryTraits , void , void > - */ - -template< class DataType , - class Arg1 = void , - class Arg2 = void , - class Arg3 = void > -class ViewTraits { -private: - - // Layout, Space, and MemoryTraits are optional - // but need to appear in that order. That means Layout - // can only be Arg1, Space can be Arg1 or Arg2, and - // MemoryTraits can be Arg1, Arg2 or Arg3 - - enum { Arg1IsLayout = Kokkos::Impl::is_array_layout::value }; - - enum { Arg1IsSpace = Kokkos::Impl::is_space::value }; - enum { Arg2IsSpace = Kokkos::Impl::is_space::value }; - - enum { Arg1IsMemoryTraits = Kokkos::Impl::is_memory_traits::value }; - enum { Arg2IsMemoryTraits = Kokkos::Impl::is_memory_traits::value }; - enum { Arg3IsMemoryTraits = Kokkos::Impl::is_memory_traits::value }; - - enum { Arg1IsVoid = std::is_same< Arg1 , void >::value }; - enum { Arg2IsVoid = std::is_same< Arg2 , void >::value }; - enum { Arg3IsVoid = std::is_same< Arg3 , void >::value }; - - static_assert( 1 == Arg1IsLayout + Arg1IsSpace + Arg1IsMemoryTraits + Arg1IsVoid - , "Template argument #1 must be layout, space, traits, or void" ); - - // If Arg1 is Layout then Arg2 is Space, MemoryTraits, or void - // If Arg1 is Space then Arg2 is MemoryTraits or void - // If Arg1 is MemoryTraits then Arg2 is void - // If Arg1 is Void then Arg2 is void - - static_assert( ( Arg1IsLayout && ( 1 == Arg2IsSpace + Arg2IsMemoryTraits + Arg2IsVoid ) ) || - ( Arg1IsSpace && ( 0 == Arg2IsSpace ) && ( 1 == Arg2IsMemoryTraits + Arg2IsVoid ) ) || - ( Arg1IsMemoryTraits && Arg2IsVoid ) || - ( Arg1IsVoid && Arg2IsVoid ) - , "Template argument #2 must be space, traits, or void" ); - - // Arg3 is MemoryTraits or void and at most one argument is MemoryTraits - static_assert( ( 1 == Arg3IsMemoryTraits + Arg3IsVoid ) && - ( Arg1IsMemoryTraits + Arg2IsMemoryTraits + Arg3IsMemoryTraits <= 1 ) - , "Template argument #3 must be traits or void" ); - - typedef - typename std::conditional< Arg1IsSpace , Arg1 , - typename std::conditional< Arg2IsSpace , Arg2 , Kokkos::DefaultExecutionSpace - >::type >::type::execution_space - ExecutionSpace ; - - typedef - typename std::conditional< Arg1IsSpace , Arg1 , - typename std::conditional< Arg2IsSpace , Arg2 , Kokkos::DefaultExecutionSpace - >::type >::type::memory_space - MemorySpace ; - - typedef - typename Kokkos::Impl::is_space< - typename std::conditional< Arg1IsSpace , Arg1 , - typename std::conditional< Arg2IsSpace , Arg2 , Kokkos::DefaultExecutionSpace - >::type >::type >::host_mirror_space - HostMirrorSpace ; - - typedef - typename std::conditional< Arg1IsLayout , Arg1 , typename ExecutionSpace::array_layout >::type - ArrayLayout ; - - // Arg1, Arg2, or Arg3 may be memory traits - typedef - typename std::conditional< Arg1IsMemoryTraits , Arg1 , - typename std::conditional< Arg2IsMemoryTraits , Arg2 , - typename std::conditional< Arg3IsMemoryTraits , Arg3 , MemoryManaged - >::type >::type >::type - MemoryTraits ; - - // Analyze data type's array properties - typedef Kokkos::Experimental::Impl::ViewArrayAnalysis< DataType > array_analysis ; - - // Analyze data type's properties with opportunity to specialize based upon the array value type - typedef Kokkos::Experimental::Impl:: - ViewDataAnalysis< DataType - , typename array_analysis::non_const_value_type - , ArrayLayout - > data_analysis ; - -public: - - //------------------------------------ - // Data type traits: - - typedef typename data_analysis::type data_type ; - typedef typename data_analysis::const_type const_data_type ; - typedef typename data_analysis::non_const_type non_const_data_type ; - - //------------------------------------ - // Compatible array of trivial type traits: - - typedef typename data_analysis::array_scalar_type array_scalar_type ; - typedef typename data_analysis::const_array_scalar_type const_array_scalar_type ; - typedef typename data_analysis::non_const_array_scalar_type non_const_array_scalar_type ; - - //------------------------------------ - // Value type traits: - - typedef typename data_analysis::value_type value_type ; - typedef typename data_analysis::const_value_type const_value_type ; - typedef typename data_analysis::non_const_value_type non_const_value_type ; - - //------------------------------------ - // Mapping traits: - - typedef ArrayLayout array_layout ; - typedef typename data_analysis::dimension dimension ; - typedef typename data_analysis::specialize specialize /* mapping specialization tag */ ; - - enum { rank = dimension::rank }; - enum { rank_dynamic = dimension::rank_dynamic }; - - //------------------------------------ - // Execution space, memory space, memory access traits, and host mirror space. - - typedef ExecutionSpace execution_space ; - typedef MemorySpace memory_space ; - typedef Device device_type ; - typedef MemoryTraits memory_traits ; - typedef HostMirrorSpace host_mirror_space ; - - typedef typename memory_space::size_type size_type ; - - enum { is_hostspace = std::is_same< memory_space , HostSpace >::value }; - enum { is_managed = memory_traits::Unmanaged == 0 }; - enum { is_random_access = memory_traits::RandomAccess == 1 }; - - //------------------------------------ -}; - -/** \class View - * \brief View to an array of data. - * - * A View represents an array of one or more dimensions. - * For details, please refer to Kokkos' tutorial materials. - * - * \section Kokkos_View_TemplateParameters Template parameters - * - * This class has both required and optional template parameters. The - * \c DataType parameter must always be provided, and must always be - * first. The parameters \c Arg1Type, \c Arg2Type, and \c Arg3Type are - * placeholders for different template parameters. The default value - * of the fifth template parameter \c Specialize suffices for most use - * cases. When explaining the template parameters, we won't refer to - * \c Arg1Type, \c Arg2Type, and \c Arg3Type; instead, we will refer - * to the valid categories of template parameters, in whatever order - * they may occur. - * - * Valid ways in which template arguments may be specified: - * - View< DataType , Space > - * - View< DataType , Space , MemoryTraits > - * - View< DataType , Space , void , MemoryTraits > - * - View< DataType , Layout , Space > - * - View< DataType , Layout , Space , MemoryTraits > - * - * \tparam DataType (required) This indicates both the type of each - * entry of the array, and the combination of compile-time and - * run-time array dimension(s). For example, double* - * indicates a one-dimensional array of \c double with run-time - * dimension, and int*[3] a two-dimensional array of \c int - * with run-time first dimension and compile-time second dimension - * (of 3). In general, the run-time dimensions (if any) must go - * first, followed by zero or more compile-time dimensions. For - * more examples, please refer to the tutorial materials. - * - * \tparam Space (required) The memory space. - * - * \tparam Layout (optional) The array's layout in memory. For - * example, LayoutLeft indicates a column-major (Fortran style) - * layout, and LayoutRight a row-major (C style) layout. If not - * specified, this defaults to the preferred layout for the - * Space. - * - * \tparam MemoryTraits (optional) Assertion of the user's intended - * access behavior. For example, RandomAccess indicates read-only - * access with limited spatial locality, and Unmanaged lets users - * wrap externally allocated memory in a View without automatic - * deallocation. - * - * \section Kokkos_View_MT MemoryTraits discussion - * - * \subsection Kokkos_View_MT_Interp MemoryTraits interpretation depends on Space - * - * Some \c MemoryTraits options may have different interpretations for - * different \c Space types. For example, with the Cuda device, - * \c RandomAccess tells Kokkos to fetch the data through the texture - * cache, whereas the non-GPU devices have no such hardware construct. - * - * \subsection Kokkos_View_MT_PrefUse Preferred use of MemoryTraits - * - * Users should defer applying the optional \c MemoryTraits parameter - * until the point at which they actually plan to rely on it in a - * computational kernel. This minimizes the number of template - * parameters exposed in their code, which reduces the cost of - * compilation. Users may always assign a View without specified - * \c MemoryTraits to a compatible View with that specification. - * For example: - * \code - * // Pass in the simplest types of View possible. - * void - * doSomething (View out, - * View in) - * { - * // Assign the "generic" View in to a RandomAccess View in_rr. - * // Note that RandomAccess View objects must have const data. - * View in_rr = in; - * // ... do something with in_rr and out ... - * } - * \endcode - */ -template< class DataType - , class Arg1 = void /* ArrayLayout, SpaceType, or MemoryTraits */ - , class Arg2 = void /* SpaceType or MemoryTraits */ - , class Arg3 = void /* MemoryTraits */ > -class View ; - -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -namespace { - -constexpr Kokkos::Experimental::Impl::ALL_t - ALL = Kokkos::Experimental::Impl::ALL_t(); - -constexpr Kokkos::Experimental::Impl::WithoutInitializing_t - WithoutInitializing = Kokkos::Experimental::Impl::WithoutInitializing_t(); - -constexpr Kokkos::Experimental::Impl::AllowPadding_t - AllowPadding = Kokkos::Experimental::Impl::AllowPadding_t(); - -} - -/** \brief Create View allocation parameter bundle from argument list. - * - * Valid argument list members are: - * 1) label as a "string" or std::string - * 2) memory space instance of the View::memory_space type - * 3) execution space instance compatible with the View::memory_space - * 4) Kokkos::WithoutInitializing to bypass initialization - * 4) Kokkos::AllowPadding to allow allocation to pad dimensions for memory alignment - */ -template< class ... Args > -inline -Kokkos::Experimental::Impl::ViewAllocProp< Args ... > -view_alloc( Args ... args ) -{ - return Kokkos::Experimental::Impl::ViewAllocProp< Args ... >( args ... ); -} - -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -/**\brief Each R? template argument designates whether the subview argument is a range */ -template< class V - , bool R0 = false , bool R1 = false , bool R2 = false , bool R3 = false - , bool R4 = false , bool R5 = false , bool R6 = false , bool R7 = false > -using Subview = typename Kokkos::Experimental::Impl::SubviewType< V, R0 , R1 , R2 , R3 , R4 , R5 , R6 , R7 >::type ; - -template< class DataType , class Arg1 , class Arg2 , class Arg3 > -class View : public ViewTraits< DataType , Arg1 , Arg2 , Arg3 > { -private: - - template< class , class , class , class > friend class View ; - - typedef ViewTraits< DataType , Arg1 , Arg2 , Arg3 > traits ; - typedef Kokkos::Experimental::Impl::ViewMapping< traits > map_type ; - typedef Kokkos::Experimental::Impl::SharedAllocationTracker track_type ; - - track_type m_track ; - map_type m_map ; - -public: - - //---------------------------------------- - /** \brief Compatible view of array of scalar types */ - typedef View< typename traits::array_scalar_type , - typename traits::array_layout , - typename traits::device_type , - typename traits::memory_traits > - array_type ; - - /** \brief Compatible view of const data type */ - typedef View< typename traits::const_data_type , - typename traits::array_layout , - typename traits::device_type , - typename traits::memory_traits > - const_type ; - - /** \brief Compatible view of non-const data type */ - typedef View< typename traits::non_const_data_type , - typename traits::array_layout , - typename traits::device_type , - typename traits::memory_traits > - non_const_type ; - - /** \brief Compatible HostMirror view */ - typedef View< typename traits::non_const_data_type , - typename traits::array_layout , - typename traits::host_mirror_space , - void > - HostMirror ; - - //---------------------------------------- - // Domain dimensions - - enum { Rank = map_type::Rank }; - - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_0() const { return m_map.dimension_0(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_1() const { return m_map.dimension_1(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_2() const { return m_map.dimension_2(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_3() const { return m_map.dimension_3(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_4() const { return m_map.dimension_4(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_5() const { return m_map.dimension_5(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_6() const { return m_map.dimension_6(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_7() const { return m_map.dimension_7(); } - - KOKKOS_INLINE_FUNCTION constexpr size_t stride_0() const { return m_map.stride_0(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_1() const { return m_map.stride_1(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_2() const { return m_map.stride_2(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_3() const { return m_map.stride_3(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_4() const { return m_map.stride_4(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_5() const { return m_map.stride_5(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_6() const { return m_map.stride_6(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_7() const { return m_map.stride_7(); } - - //---------------------------------------- - // Range span is the span which contains all members. - - typedef typename map_type::reference_type reference_type ; - - enum { reference_type_is_lvalue_reference = std::is_lvalue_reference< reference_type >::value }; - - KOKKOS_INLINE_FUNCTION constexpr size_t span() const { return m_map.span(); } - KOKKOS_INLINE_FUNCTION constexpr bool span_is_contiguous() const { return m_map.span_is_contiguous(); } - KOKKOS_INLINE_FUNCTION constexpr typename traits::value_type * data() const { return m_map.data(); } - - // Deprecated, use 'span_is_contigous()' instead - KOKKOS_INLINE_FUNCTION constexpr bool is_contiguous() const { return m_map.span_is_contiguous(); } - // Deprecated, use 'data()' instead - KOKKOS_INLINE_FUNCTION constexpr typename traits::value_type * ptr_on_device() const { return m_map.data(); } - - //---------------------------------------- - // Allow specializations to query their specialized map - - KOKKOS_INLINE_FUNCTION - const map_type & implementation_map() const { return m_map ; } - - //---------------------------------------- - -private: - - typedef typename - std::conditional< Rank == 0 , reference_type - , Kokkos::Experimental::Impl::Error_view_scalar_reference_to_non_scalar_view >::type - scalar_operator_reference_type ; - - typedef typename - std::conditional< Rank == 0 , const int - , Kokkos::Experimental::Impl::Error_view_scalar_reference_to_non_scalar_view >::type - scalar_operator_index_type ; - -public: - - // Rank == 0 - - KOKKOS_FORCEINLINE_FUNCTION - scalar_operator_reference_type operator()() const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, 0, 0, 0, 0, 0, 0, 0, 0 ); - return scalar_operator_reference_type( m_map.reference() ); - } - - KOKKOS_FORCEINLINE_FUNCTION - reference_type - operator()( scalar_operator_index_type i0 - , const int i1 = 0 , const int i2 = 0 , const int i3 = 0 - , const int i4 = 0 , const int i5 = 0 , const int i6 = 0 , const int i7 = 0 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, i5, i6, i7 ); - return m_map.reference(); - } - - // Rank == 1 - - template< typename I0 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( Rank == 1 && std::is_integral::value - ), reference_type >::type - operator[]( const I0 & i0 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, 0, 0, 0, 0, 0, 0, 0 ); - return m_map.reference(i0); - } - - template< typename I0 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( Rank == 1 && std::is_integral::value - ), reference_type >::type - operator()( const I0 & i0 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, 0, 0, 0, 0, 0, 0, 0 ); - return m_map.reference(i0); - } - - template< typename I0 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type - operator()( const I0 & i0 - , typename std::enable_if<( Rank == 1 && std::is_integral::value ), const int >::type i1 - , const int i2 = 0 , const int i3 = 0 - , const int i4 = 0 , const int i5 = 0 , const int i6 = 0 , const int i7 = 0 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, i5, i6, i7 ); - return m_map.reference(i0); - } - - // Rank == 2 - - template< typename I0 , typename I1 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( Rank == 2 && - std::is_integral::value && - std::is_integral::value - ), reference_type >::type - operator()( const I0 & i0 , const I1 & i1 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, 0, 0, 0, 0, 0, 0 ); - return m_map.reference(i0,i1); - } - - template< typename I0 , typename I1 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type - operator()( const I0 & i0 , const I1 & i1 - , typename std::enable_if<( Rank == 2 && - std::is_integral::value && - std::is_integral::value - ), const int >::type i2 - , const int i3 = 0 - , const int i4 = 0 , const int i5 = 0 , const int i6 = 0 , const int i7 = 0 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, i5, i6, i7 ); - return m_map.reference(i0,i1); - } - - // Rank == 3 - - template< typename I0 , typename I1 , typename I2 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( Rank == 3 && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value - ), reference_type >::type - operator()( const I0 & i0 , const I1 & i1 , const I2 & i2 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, 0, 0, 0, 0, 0 ); - return m_map.reference(i0,i1,i2); - } - - template< typename I0 , typename I1 , typename I2 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type - operator()( const I0 & i0 , const I1 & i1 , const I2 & i2 - , typename std::enable_if<( Rank == 3 && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value - ), const int >::type i3 - , const int i4 = 0 , const int i5 = 0 , const int i6 = 0 , const int i7 = 0 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, i5, i6, i7 ); - return m_map.reference(i0,i1,i2); - } - - // Rank == 4 - - template< typename I0 , typename I1 , typename I2 , typename I3 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( Rank == 4 && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value - ), reference_type >::type - operator()( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, 0, 0, 0, 0 ); - return m_map.reference(i0,i1,i2,i3); - } - - template< typename I0 , typename I1 , typename I2 , typename I3 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type - operator()( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , typename std::enable_if<( Rank == 4 && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value - ), const int >::type i4 - , const int i5 = 0 , const int i6 = 0 , const int i7 = 0 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, i5, i6, i7 ); - return m_map.reference(i0,i1,i2,i3); - } - - // Rank == 5 - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( Rank == 5 && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value - ), reference_type >::type - operator()( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, 0, 0, 0 ); - return m_map.reference(i0,i1,i2,i3,i4); - } - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type - operator()( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 - , typename std::enable_if<( Rank == 5 && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value - ), const int >::type i5 - , const int i6 = 0 , const int i7 = 0 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, i5, i6, i7 ); - return m_map.reference(i0,i1,i2,i3,i4); - } - - // Rank == 6 - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 , typename I5 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( Rank == 6 && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value - ), reference_type >::type - operator()( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 , const I5 & i5 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, i5, 0, 0 ); - return m_map.reference(i0,i1,i2,i3,i4,i5); - } - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 , typename I5 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type - operator()( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 , const I5 & i5 - , typename std::enable_if<( Rank == 6 && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value - ), const int >::type i6 - , const int i7 = 0 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, i5, i6, i7 ); - return m_map.reference(i0,i1,i2,i3,i4,i5); - } - - // Rank == 7 - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 , typename I5 , typename I6 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( Rank == 7 && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value - ), reference_type >::type - operator()( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 , const I5 & i5 , const I6 & i6 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, i5, i6, 0 ); - return m_map.reference(i0,i1,i2,i3,i4,i5,i6); - } - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 , typename I5 , typename I6 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type - operator()( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 , const I5 & i5 , const I6 & i6 - , typename std::enable_if<( Rank == 7 && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value - ), const int >::type i7 - ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, i5, i6, i7 ); - return m_map.reference(i0,i1,i2,i3,i4,i5,i6); - } - - // Rank == 8 - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 , typename I5 , typename I6 , typename I7 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if<( Rank == 8 && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value && - std::is_integral::value - ), reference_type >::type - operator()( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 , const I5 & i5 , const I6 & i6 , const I7 & i7 ) const - { - KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( typename traits::memory_space, m_map, Rank, i0, i1, i2, i3, i4, i5, i6, i7 ); - return m_map.reference(i0,i1,i2,i3,i4,i5,i6,i7); - } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION - ~View() {} - - KOKKOS_INLINE_FUNCTION - View() : m_track(), m_map() {} - - KOKKOS_INLINE_FUNCTION - View( const View & rhs ) : m_track( rhs.m_track ), m_map( rhs.m_map ) {} - - KOKKOS_INLINE_FUNCTION - View( View && rhs ) : m_track( rhs.m_track ), m_map( rhs.m_map ) {} - - KOKKOS_INLINE_FUNCTION - View & operator = ( const View & rhs ) { m_track = rhs.m_track ; m_map = rhs.m_map ; return *this ; } - - KOKKOS_INLINE_FUNCTION - View & operator = ( View && rhs ) { m_track = rhs.m_track ; m_map = rhs.m_map ; return *this ; } - - //---------------------------------------- - - template< class RT , class R1 , class R2 , class R3 > - KOKKOS_INLINE_FUNCTION - View( const View & rhs ) - : m_track( rhs.m_track ) - , m_map() - { - typedef typename View::traits SrcTraits ; - typedef Kokkos::Experimental::Impl::ViewMapping< traits , SrcTraits > Mapping ; - static_assert( Mapping::is_assignable , "Incompatible View copy construction" ); - Mapping::assign( m_map , rhs.m_map , rhs.m_track ); - } - - template< class RT , class R1 , class R2 , class R3 > - KOKKOS_INLINE_FUNCTION - View( View && rhs ) - : m_track( rhs.m_track ) - , m_map() - { - typedef typename View::traits SrcTraits ; - typedef Kokkos::Experimental::Impl::ViewMapping< traits , SrcTraits > Mapping ; - static_assert( Mapping::is_assignable , "Incompatible View move construction" ); - Mapping::assign( m_map , rhs.m_map , rhs.m_track ); - } - - template< class RT , class R1 , class R2 , class R3 > - KOKKOS_INLINE_FUNCTION - View & operator = ( const View & rhs ) - { - typedef typename View::traits SrcTraits ; - typedef Kokkos::Experimental::Impl::ViewMapping< traits , SrcTraits > Mapping ; - static_assert( Mapping::is_assignable , "Incompatible View copy assignment" ); - Mapping::assign( m_map , rhs.m_map , rhs.m_track ); - m_track.operator=( rhs.m_track ); - return *this ; - } - - template< class RT , class R1 , class R2 , class R3 > - KOKKOS_INLINE_FUNCTION - View & operator = ( View && rhs ) - { - typedef typename View::traits SrcTraits ; - typedef Kokkos::Experimental::Impl::ViewMapping< traits , SrcTraits > Mapping ; - static_assert( Mapping::is_assignable , "Incompatible View move assignment" ); - Mapping::assign( m_map , rhs.m_map , rhs.m_track ); - m_track.operator=( rhs.m_track ); - return *this ; - } - - //---------------------------------------- - // Allocation according to allocation properties - -private: - - // Must call destructor for non-trivial types - template< class ExecSpace > - struct DestroyFunctor { - map_type m_map ; - ExecSpace m_space ; - - KOKKOS_INLINE_FUNCTION - void destroy_shared_allocation() { m_map.destroy( m_space ); } - }; - -public: - - inline - const std::string label() const { return m_track.template get_label< typename traits::memory_space >(); } - - template< class Prop > - explicit inline - View( const Prop & arg_prop - , const size_t arg_N0 = 0 - , const size_t arg_N1 = 0 - , const size_t arg_N2 = 0 - , const size_t arg_N3 = 0 - , const size_t arg_N4 = 0 - , const size_t arg_N5 = 0 - , const size_t arg_N6 = 0 - , const size_t arg_N7 = 0 - ) - : m_track() - , m_map() - { - // Merge the < execution_space , memory_space > into the properties. - typedef Kokkos::Experimental::Impl::ViewAllocProp< typename traits::device_type , Prop > alloc_prop ; - - typedef typename alloc_prop::execution_space execution_space ; - typedef typename traits::memory_space memory_space ; - typedef DestroyFunctor< execution_space > destroy_functor ; - typedef Kokkos::Experimental::Impl::SharedAllocationRecord< memory_space , destroy_functor > record_type ; - - static_assert( traits::is_managed , "View allocation constructor requires managed memory" ); - - const alloc_prop prop( arg_prop ); - - // If initializing view data then the execution space must be initialized. - if ( prop.initialize.value && ! prop.execution.is_initialized() ) { - Kokkos::Impl::throw_runtime_exception("Constructing View and initializing data with uninitialized execution space"); - } - - // Query the mapping for byte-size of allocation. - const size_t alloc_size = map_type::memory_span( prop.allow_padding - , arg_N0 , arg_N1 , arg_N2 , arg_N3 - , arg_N4 , arg_N5 , arg_N6 , arg_N7 ); - - // Allocate memory from the memory space. - record_type * const record = record_type::allocate( prop.memory , prop.label , alloc_size ); - - // Construct the mapping object prior to start of tracking - // to assign destroy functor and possibly initialize. - m_map = map_type( record->data() - , prop.allow_padding - , arg_N0 , arg_N1 , arg_N2 , arg_N3 - , arg_N4 , arg_N5 , arg_N6 , arg_N7 ); - - // Copy the destroy functor into the allocation record before initiating tracking. - record->m_destroy.m_map = m_map ; - record->m_destroy.m_space = prop.execution ; - - if ( prop.initialize.value ) { - m_map.construct( prop.execution ); - } - - // Destroy functor assigned and initialization complete, start tracking - m_track = track_type( record ); - } - - template< class Prop > - explicit inline - View( const Prop & arg_prop - , const typename traits::array_layout & arg_layout - ) - : m_track() - , m_map() - { - // Merge the < execution_space , memory_space > into the properties. - typedef Kokkos::Experimental::Impl::ViewAllocProp< typename traits::device_type , Prop > alloc_prop ; - - typedef typename alloc_prop::execution_space execution_space ; - typedef typename traits::memory_space memory_space ; - typedef DestroyFunctor< execution_space > destroy_functor ; - typedef Kokkos::Experimental::Impl::SharedAllocationRecord< memory_space , destroy_functor > record_type ; - - static_assert( traits::is_managed , "View allocation constructor requires managed memory" ); - - const alloc_prop prop( arg_prop ); - - // If initializing view data then the execution space must be initialized. - if ( prop.initialize.value && ! prop.execution.is_initialized() ) { - Kokkos::Impl::throw_runtime_exception("Constructing View and initializing data with uninitialized execution space"); - } - - // Query the mapping for byte-size of allocation. - const size_t alloc_size = map_type::memory_span( prop.allow_padding , arg_layout ); - - // Allocate memory from the memory space. - record_type * const record = record_type::allocate( prop.memory , prop.label , alloc_size ); - - // Construct the mapping object prior to start of tracking - // to assign destroy functor and possibly initialize. - m_map = map_type( record->data() , prop.allow_padding , arg_layout ); - - // Copy the destroy functor into the allocation record before initiating tracking. - record->m_destroy.m_map = m_map ; - record->m_destroy.m_space = prop.execution ; - - if ( prop.initialize.value ) { - m_map.construct( prop.execution ); - } - - // Destroy functor assigned and initialization complete, start tracking - m_track = track_type( record ); - } - - //---------------------------------------- - // Memory span required to wrap these dimensions. - static constexpr size_t memory_span( const size_t arg_N0 = 0 - , const size_t arg_N1 = 0 - , const size_t arg_N2 = 0 - , const size_t arg_N3 = 0 - , const size_t arg_N4 = 0 - , const size_t arg_N5 = 0 - , const size_t arg_N6 = 0 - , const size_t arg_N7 = 0 - ) - { - return map_type::memory_span( std::integral_constant() - , arg_N0 , arg_N1 , arg_N2 , arg_N3 - , arg_N4 , arg_N5 , arg_N6 , arg_N7 ); - } - - explicit inline - View( typename traits::value_type * const arg_ptr - , const size_t arg_N0 = 0 - , const size_t arg_N1 = 0 - , const size_t arg_N2 = 0 - , const size_t arg_N3 = 0 - , const size_t arg_N4 = 0 - , const size_t arg_N5 = 0 - , const size_t arg_N6 = 0 - , const size_t arg_N7 = 0 - ) - : m_track() // No memory tracking - , m_map( arg_ptr , std::integral_constant() - , arg_N0 , arg_N1 , arg_N2 , arg_N3 - , arg_N4 , arg_N5 , arg_N6 , arg_N7 ) - {} - - explicit inline - View( typename traits::value_type * const arg_ptr - , typename traits::array_layout & arg_layout - ) - : m_track() // No memory tracking - , m_map( arg_ptr , std::integral_constant(), arg_layout ) - {} - - //---------------------------------------- - // Shared scratch memory constructor - - static inline - size_t shmem_size( const size_t arg_N0 = 0 , - const size_t arg_N1 = 0 , - const size_t arg_N2 = 0 , - const size_t arg_N3 = 0 , - const size_t arg_N4 = 0 , - const size_t arg_N5 = 0 , - const size_t arg_N6 = 0 , - const size_t arg_N7 = 0 ) - { - return map_type::memory_span( std::integral_constant() - , arg_N0 , arg_N1 , arg_N2 , arg_N3 - , arg_N4 , arg_N5 , arg_N6 , arg_N7 ); - } - - explicit KOKKOS_INLINE_FUNCTION - View( const typename traits::execution_space::scratch_memory_space & arg_space - , const size_t arg_N0 = 0 - , const size_t arg_N1 = 0 - , const size_t arg_N2 = 0 - , const size_t arg_N3 = 0 - , const size_t arg_N4 = 0 - , const size_t arg_N5 = 0 - , const size_t arg_N6 = 0 - , const size_t arg_N7 = 0 ) - : m_track() // No memory tracking - , m_map( arg_space.get_shmem( map_type::memory_span( std::integral_constant() - , arg_N0 , arg_N1 , arg_N2 , arg_N3 - , arg_N4 , arg_N5 , arg_N6 , arg_N7 ) ) - , std::integral_constant() - , arg_N0 , arg_N1 , arg_N2 , arg_N3 - , arg_N4 , arg_N5 , arg_N6 , arg_N7 ) - {} - - //---------------------------------------- - // Subviews - -private: - - /**\brief Private method to support extensibility of subview construction */ - KOKKOS_INLINE_FUNCTION - View( const track_type & arg_track , const map_type & arg_map ) - : m_track( arg_track ) - , m_map( arg_map ) - {} - - explicit KOKKOS_INLINE_FUNCTION - View( const track_type & rhs ) - : m_track( rhs ) - , m_map() - {} - -public: - - template< class D , class A1 , class A2 , class A3 - , class T0 , class T1 , class T2 , class T3 - , class T4 , class T5 , class T6 , class T7 > - friend - KOKKOS_INLINE_FUNCTION - Kokkos::Experimental::Subview< View< D , A1 , A2 , A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > - subview( const View< D , A1 , A2 , A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 , T3 const & arg3 - , T4 const & arg4 , T5 const & arg5 , T6 const & arg6 , T7 const & arg7 - ); - - template< class D , class A1 , class A2 , class A3 - , class T0 , class T1 , class T2 , class T3 - , class T4 , class T5 , class T6 > - friend - KOKKOS_INLINE_FUNCTION - Kokkos::Experimental::Subview< View< D , A1 , A2 , A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > - subview( const View< D , A1 , A2 , A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 , T3 const & arg3 - , T4 const & arg4 , T5 const & arg5 , T6 const & arg6 - ); - - template< class D , class A1 , class A2 , class A3 - , class T0 , class T1 , class T2 , class T3 - , class T4 , class T5 > - friend - KOKKOS_INLINE_FUNCTION - Kokkos::Experimental::Subview< View< D , A1 , A2 , A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > - subview( const View< D , A1 , A2 , A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 , T3 const & arg3 - , T4 const & arg4 , T5 const & arg5 - ); - - template< class D , class A1 , class A2 , class A3 - , class T0 , class T1 , class T2 , class T3 - , class T4 > - friend - KOKKOS_INLINE_FUNCTION - Kokkos::Experimental::Subview< View< D , A1 , A2 , A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > - subview( const View< D , A1 , A2 , A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 , T3 const & arg3 - , T4 const & arg4 - ); - - template< class D , class A1 , class A2 , class A3 - , class T0 , class T1 , class T2 , class T3 > - friend - KOKKOS_INLINE_FUNCTION - Kokkos::Experimental::Subview< View< D , A1 , A2 , A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > - subview( const View< D , A1 , A2 , A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 , T3 const & arg3 - ); - - template< class D , class A1 , class A2 , class A3 - , class T0 , class T1 , class T2 > - friend - KOKKOS_INLINE_FUNCTION - Kokkos::Experimental::Subview< View< D , A1 , A2 , A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > - subview( const View< D , A1 , A2 , A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 - ); - - template< class D , class A1 , class A2 , class A3 - , class T0 , class T1 > - friend - KOKKOS_INLINE_FUNCTION - Kokkos::Experimental::Subview< View< D , A1 , A2 , A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > - subview( const View< D , A1 , A2 , A3 > & src - , T0 const & arg0 , T1 const & arg1 - ); - - template< class D, class A1, class A2, class A3, class T0 > - friend - KOKKOS_INLINE_FUNCTION - Kokkos::Experimental::Subview< View< D, A1, A2, A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > - subview( const View< D, A1, A2, A3 > & src , T0 const & arg0 ); - -}; - -template< class > struct is_view : public std::false_type {}; - -template< class D, class A1, class A2, class A3 > -struct is_view< View > : public std::true_type {}; - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -template< class D, class A1, class A2, class A3 - , class T0 , class T1 , class T2 , class T3 - , class T4 , class T5 , class T6 , class T7 > -KOKKOS_INLINE_FUNCTION -Kokkos::Experimental::Subview< View< D, A1, A2, A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > -subview( const View< D, A1, A2, A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 , T3 const & arg3 - , T4 const & arg4 , T5 const & arg5 , T6 const & arg6 , T7 const & arg7 - ) -{ - typedef View< D, A1, A2, A3 > SrcView ; - - typedef Kokkos::Experimental::Impl::SubviewMapping - < typename SrcView::traits - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > Mapping ; - - typedef typename Mapping::type DstView ; - - static_assert( SrcView::Rank == 8 , "Subview of rank 8 View requires 8 arguments" ); - - DstView dst( src.m_track ); - - Mapping::assign( dst.m_map, src.m_map, arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7 ); - - return dst ; -} - -template< class D, class A1, class A2, class A3 - , class T0 , class T1 , class T2 , class T3 - , class T4 , class T5 , class T6 > -KOKKOS_INLINE_FUNCTION -Kokkos::Experimental::Subview< View< D, A1, A2, A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > -subview( const View< D, A1, A2, A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 , T3 const & arg3 - , T4 const & arg4 , T5 const & arg5 , T6 const & arg6 - ) -{ - typedef View< D, A1, A2, A3 > SrcView ; - - typedef Kokkos::Experimental::Impl::SubviewMapping - < typename SrcView::traits - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > Mapping ; - - typedef typename Mapping::type DstView ; - - static_assert( SrcView::Rank == 7 , "Subview of rank 7 View requires 7 arguments" ); - - DstView dst( src.m_track ); - - Mapping::assign( dst.m_map, src.m_map, arg0, arg1, arg2, arg3, arg4, arg5, arg6, 0 ); - - return dst ; -} - -template< class D, class A1, class A2, class A3 - , class T0 , class T1 , class T2 , class T3 - , class T4 , class T5 > -KOKKOS_INLINE_FUNCTION -Kokkos::Experimental::Subview< View< D, A1, A2, A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > -subview( const View< D, A1, A2, A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 , T3 const & arg3 - , T4 const & arg4 , T5 const & arg5 - ) -{ - typedef View< D, A1, A2, A3 > SrcView ; - - typedef Kokkos::Experimental::Impl::SubviewMapping - < typename SrcView::traits - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > Mapping ; - - typedef typename Mapping::type DstView ; - - static_assert( SrcView::Rank == 6 , "Subview of rank 6 View requires 6 arguments" ); - - DstView dst( src.m_track ); - - Mapping::assign( dst.m_map, src.m_map, arg0, arg1, arg2, arg3, arg4, arg5, 0, 0 ); - - return dst ; -} - -template< class D, class A1, class A2, class A3 - , class T0 , class T1 , class T2 , class T3 - , class T4 > -KOKKOS_INLINE_FUNCTION -Kokkos::Experimental::Subview< View< D, A1, A2, A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > -subview( const View< D, A1, A2, A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 , T3 const & arg3 - , T4 const & arg4 - ) -{ - typedef View< D, A1, A2, A3 > SrcView ; - - typedef Kokkos::Experimental::Impl::SubviewMapping - < typename SrcView::traits - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > Mapping ; - - typedef typename Mapping::type DstView ; - - static_assert( SrcView::Rank == 5 , "Subview of rank 5 View requires 5 arguments" ); - - DstView dst( src.m_track ); - - Mapping::assign( dst.m_map, src.m_map, arg0, arg1, arg2, arg3, arg4, 0, 0, 0 ); - - return dst ; -} - -template< class D, class A1, class A2, class A3 - , class T0 , class T1 , class T2 , class T3 > -KOKKOS_INLINE_FUNCTION -Kokkos::Experimental::Subview< View< D, A1, A2, A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > -subview( const View< D, A1, A2, A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 , T3 const & arg3 - ) -{ - typedef View< D, A1, A2, A3 > SrcView ; - - typedef Kokkos::Experimental::Impl::SubviewMapping - < typename SrcView::traits - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > Mapping ; - - typedef typename Mapping::type DstView ; - - static_assert( SrcView::Rank == 4 , "Subview of rank 4 View requires 4 arguments" ); - - DstView dst( src.m_track ); - - Mapping::assign( dst.m_map, src.m_map, arg0, arg1, arg2, arg3, 0, 0, 0, 0 ); - - return dst ; -} - -template< class D, class A1, class A2, class A3 - , class T0 , class T1 , class T2 > -KOKKOS_INLINE_FUNCTION -Kokkos::Experimental::Subview< View< D, A1, A2, A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > -subview( const View< D, A1, A2, A3 > & src - , T0 const & arg0 , T1 const & arg1 , T2 const & arg2 - ) -{ - typedef View< D, A1, A2, A3 > SrcView ; - - typedef Kokkos::Experimental::Impl::SubviewMapping - < typename SrcView::traits - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > Mapping ; - - typedef typename Mapping::type DstView ; - - static_assert( SrcView::Rank == 3 , "Subview of rank 3 View requires 3 arguments" ); - - DstView dst( src.m_track ); - - Mapping::assign( dst.m_map, src.m_map, arg0, arg1, arg2, 0, 0, 0, 0, 0 ); - - return dst ; -} - -template< class D, class A1, class A2, class A3 - , class T0 , class T1 > -KOKKOS_INLINE_FUNCTION -Kokkos::Experimental::Subview< View< D, A1, A2, A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > -subview( const View< D, A1, A2, A3 > & src - , T0 const & arg0 , T1 const & arg1 - ) -{ - typedef View< D, A1, A2, A3 > SrcView ; - - typedef Kokkos::Experimental::Impl::SubviewMapping - < typename SrcView::traits - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > Mapping ; - - typedef typename Mapping::type DstView ; - - static_assert( SrcView::Rank == 2 , "Subview of rank 2 View requires 2 arguments" ); - - DstView dst( src.m_track ); - - Mapping::assign( dst.m_map, src.m_map, arg0, arg1, 0, 0, 0, 0, 0, 0 ); - - return dst ; -} - -template< class D, class A1, class A2, class A3, class T0 > -KOKKOS_INLINE_FUNCTION -Kokkos::Experimental::Subview< View< D, A1, A2, A3 > - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > -subview( const View< D, A1, A2, A3 > & src , T0 const & arg0 ) -{ - typedef View< D, A1, A2, A3 > SrcView ; - - typedef Kokkos::Experimental::Impl::SubviewMapping - < typename SrcView::traits - , Kokkos::Experimental::Impl::ViewOffsetRange::is_range - > Mapping ; - - typedef typename Mapping::type DstView ; - - static_assert( SrcView::Rank == 1 , "Subview of rank 1 View requires 1 arguments" ); - - DstView dst( src.m_track ); - - Mapping::assign( dst.m_map , src.m_map , arg0, 0, 0, 0, 0, 0, 0, 0 ); - - return dst ; -} - -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -template< class LT , class L1 , class L2 , class L3 - , class RT , class R1 , class R2 , class R3 > -KOKKOS_INLINE_FUNCTION -bool operator == ( const View & lhs , - const View & rhs ) -{ - // Same data, layout, dimensions - typedef ViewTraits lhs_traits ; - typedef ViewTraits rhs_traits ; - - return - std::is_same< typename lhs_traits::const_value_type , - typename rhs_traits::const_value_type >::value && - std::is_same< typename lhs_traits::array_layout , - typename rhs_traits::array_layout >::value && - std::is_same< typename lhs_traits::memory_space , - typename rhs_traits::memory_space >::value && - lhs_traits::Rank == rhs_traits::Rank && - lhs.data() == rhs.data() && - lhs.span() == rhs.span() && - lhs.dimension_0() == rhs.dimension_0() && - lhs.dimension_1() == rhs.dimension_1() && - lhs.dimension_2() == rhs.dimension_2() && - lhs.dimension_3() == rhs.dimension_3() && - lhs.dimension_4() == rhs.dimension_4() && - lhs.dimension_5() == rhs.dimension_5() && - lhs.dimension_6() == rhs.dimension_6() && - lhs.dimension_7() == rhs.dimension_7(); -} - -template< class LT , class L1 , class L2 , class L3 - , class RT , class R1 , class R2 , class R3 > -KOKKOS_INLINE_FUNCTION -bool operator != ( const View & lhs , - const View & rhs ) -{ - return ! ( operator==(lhs,rhs) ); -} - -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -template< class OutputView , typename Enable = void > -struct ViewFill { - - typedef typename OutputView::const_value_type const_value_type ; - - const OutputView output ; - const_value_type input ; - - KOKKOS_INLINE_FUNCTION - void operator()( const size_t i0 ) const - { - const size_t n1 = output.dimension_1(); - const size_t n2 = output.dimension_2(); - const size_t n3 = output.dimension_3(); - const size_t n4 = output.dimension_4(); - const size_t n5 = output.dimension_5(); - const size_t n6 = output.dimension_6(); - const size_t n7 = output.dimension_7(); - - for ( size_t i1 = 0 ; i1 < n1 ; ++i1 ) { - for ( size_t i2 = 0 ; i2 < n2 ; ++i2 ) { - for ( size_t i3 = 0 ; i3 < n3 ; ++i3 ) { - for ( size_t i4 = 0 ; i4 < n4 ; ++i4 ) { - for ( size_t i5 = 0 ; i5 < n5 ; ++i5 ) { - for ( size_t i6 = 0 ; i6 < n6 ; ++i6 ) { - for ( size_t i7 = 0 ; i7 < n7 ; ++i7 ) { - output(i0,i1,i2,i3,i4,i5,i6,i7) = input ; - }}}}}}} - } - - ViewFill( const OutputView & arg_out , const_value_type & arg_in ) - : output( arg_out ), input( arg_in ) - { - typedef typename OutputView::execution_space execution_space ; - typedef Kokkos::RangePolicy< execution_space > Policy ; - - (void) Kokkos::Impl::ParallelFor< ViewFill , Policy >( *this , Policy( 0 , output.dimension_0() ) ); - - execution_space::fence(); - } -}; - -template< class OutputView > -struct ViewFill< OutputView , typename std::enable_if< OutputView::Rank == 0 >::type > { - ViewFill( const OutputView & dst , const typename OutputView::const_value_type & src ) - { - Kokkos::Impl::DeepCopy< typename OutputView::memory_space , Kokkos::HostSpace > - ( dst.data() , & src , sizeof(typename OutputView::const_value_type) ); - } -}; - -template< class OutputView , class InputView > -struct ViewRemap { - - const OutputView output ; - const InputView input ; - const size_t n0 ; - const size_t n1 ; - const size_t n2 ; - const size_t n3 ; - const size_t n4 ; - const size_t n5 ; - const size_t n6 ; - const size_t n7 ; - - ViewRemap( const OutputView & arg_out , const InputView & arg_in ) - : output( arg_out ), input( arg_in ) - , n0( std::min( (size_t)arg_out.dimension_0() , (size_t)arg_in.dimension_0() ) ) - , n1( std::min( (size_t)arg_out.dimension_1() , (size_t)arg_in.dimension_1() ) ) - , n2( std::min( (size_t)arg_out.dimension_2() , (size_t)arg_in.dimension_2() ) ) - , n3( std::min( (size_t)arg_out.dimension_3() , (size_t)arg_in.dimension_3() ) ) - , n4( std::min( (size_t)arg_out.dimension_4() , (size_t)arg_in.dimension_4() ) ) - , n5( std::min( (size_t)arg_out.dimension_5() , (size_t)arg_in.dimension_5() ) ) - , n6( std::min( (size_t)arg_out.dimension_6() , (size_t)arg_in.dimension_6() ) ) - , n7( std::min( (size_t)arg_out.dimension_7() , (size_t)arg_in.dimension_7() ) ) - { - typedef typename OutputView::execution_space execution_space ; - typedef Kokkos::RangePolicy< execution_space > Policy ; - (void) Kokkos::Impl::ParallelFor< ViewRemap , Policy >( *this , Policy( 0 , n0 ) ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_t i0 ) const - { - for ( size_t i1 = 0 ; i1 < n1 ; ++i1 ) { - for ( size_t i2 = 0 ; i2 < n2 ; ++i2 ) { - for ( size_t i3 = 0 ; i3 < n3 ; ++i3 ) { - for ( size_t i4 = 0 ; i4 < n4 ; ++i4 ) { - for ( size_t i5 = 0 ; i5 < n5 ; ++i5 ) { - for ( size_t i6 = 0 ; i6 < n6 ; ++i6 ) { - for ( size_t i7 = 0 ; i7 < n7 ; ++i7 ) { - output(i0,i1,i2,i3,i4,i5,i6,i7) = input(i0,i1,i2,i3,i4,i5,i6,i7); - }}}}}}} - } -}; - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -/** \brief Deep copy a value from Host memory into a view. */ -template< class DT , class D1 , class D2 , class D3 > -inline -void deep_copy( const View & dst - , typename ViewTraits::const_value_type & value ) -{ - static_assert( std::is_same< typename ViewTraits::non_const_value_type , - typename ViewTraits::value_type >::value - , "ERROR: Incompatible deep_copy( View , value )" ); - - Kokkos::Experimental::Impl::ViewFill< View >( dst , value ); -} - -/** \brief Deep copy into a value in Host memory from a view. */ -template< class ST , class S1 , class S2 , class S3 > -inline -void deep_copy( ST & dst , const View & src ) -{ - static_assert( ViewTraits::rank == 0 - , "ERROR: Non-rank-zero view in deep_copy( value , View )" ); - - typedef ViewTraits src_traits ; - typedef typename src_traits::memory_space src_memory_space ; - Kokkos::Impl::DeepCopy< HostSpace , src_memory_space >( & dst , src.data() , sizeof(ST) ); -} - -//---------------------------------------------------------------------------- -/** \brief A deep copy between views of compatible type, and rank zero. */ -template< class DT , class D1 , class D2 , class D3 - , class ST , class S1 , class S2 , class S3 > -inline -void deep_copy( const View & dst , - const View & src , - typename std::enable_if<( - // Rank zero: - ( unsigned(ViewTraits::rank) == unsigned(0) ) && - ( unsigned(ViewTraits::rank) == unsigned(0) ) && - // Same type and destination is not constant: - std::is_same< typename ViewTraits::value_type , - typename ViewTraits::non_const_value_type >::value - )>::type * = 0 ) -{ - typedef View dst_type ; - typedef View src_type ; - - typedef typename dst_type::value_type value_type ; - typedef typename dst_type::memory_space dst_memory_space ; - typedef typename src_type::memory_space src_memory_space ; - - if ( dst.data() != src.data() ) { - Kokkos::Impl::DeepCopy< dst_memory_space , src_memory_space >( dst.data() , src.data() , sizeof(value_type) ); - } -} - -//---------------------------------------------------------------------------- -/** \brief A deep copy between views of the default specialization, compatible type, - * same non-zero rank, same contiguous layout. - */ -template< class DT , class D1 , class D2 , class D3 , - class ST , class S1 , class S2 , class S3 > -inline -void deep_copy( const View & dst , - const View & src , - typename std::enable_if<( - // destination is non-const. - std::is_same< typename ViewTraits::value_type , - typename ViewTraits::non_const_value_type >::value - && - // Same non-zero rank: - ( unsigned(ViewTraits::rank) != 0 ) - && - ( unsigned(ViewTraits::rank) == - unsigned(ViewTraits::rank) ) - && - // Not specialized, default ViewMapping - std::is_same< typename ViewTraits::specialize , void >::value - && - std::is_same< typename ViewTraits::specialize , void >::value - )>::type * = 0 ) -{ - typedef View dst_type ; - typedef View src_type ; - - typedef typename dst_type::execution_space dst_execution_space ; - typedef typename dst_type::memory_space dst_memory_space ; - typedef typename src_type::memory_space src_memory_space ; - - enum { DstExecCanAccessSrc = - Kokkos::Impl::VerifyExecutionCanAccessMemorySpace< typename dst_execution_space::memory_space , src_memory_space >::value }; - - if ( (void *) dst.data() != (void*) src.data() ) { - - // Concern: If overlapping views then a parallel copy will be erroneous. - // ... - - // If same type, equal layout, equal dimensions, equal span, and contiguous memory then can byte-wise copy - - if ( std::is_same< typename ViewTraits::value_type , - typename ViewTraits::non_const_value_type >::value && - std::is_same< typename ViewTraits::array_layout , - typename ViewTraits::array_layout >::value && - dst.span_is_contiguous() && - src.span_is_contiguous() && - dst.span() == src.span() && - dst.dimension_0() == src.dimension_0() && - dst.dimension_1() == src.dimension_1() && - dst.dimension_2() == src.dimension_2() && - dst.dimension_3() == src.dimension_3() && - dst.dimension_4() == src.dimension_4() && - dst.dimension_5() == src.dimension_5() && - dst.dimension_6() == src.dimension_6() && - dst.dimension_7() == src.dimension_7() ) { - - const size_t nbytes = sizeof(typename dst_type::value_type) * dst.span(); - - Kokkos::Impl::DeepCopy< dst_memory_space , src_memory_space >( dst.data() , src.data() , nbytes ); - } - else if ( DstExecCanAccessSrc ) { - // Copying data between views in accessible memory spaces and either non-contiguous or incompatible shape. - Kokkos::Experimental::Impl::ViewRemap< dst_type , src_type >( dst , src ); - } - else { - Kokkos::Impl::throw_runtime_exception("deep_copy given views that would require a temporary allocation"); - } - } -} - -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -template< class T , class A1, class A2, class A3 > -inline -typename Kokkos::Experimental::View::HostMirror -create_mirror( const Kokkos::Experimental::View & src - , typename std::enable_if< - ! std::is_same< typename Kokkos::Experimental::ViewTraits::array_layout - , Kokkos::LayoutStride >::value - >::type * = 0 - ) -{ - typedef View src_type ; - typedef typename src_type::HostMirror dst_type ; - - return dst_type( std::string( src.label() ).append("_mirror") - , src.dimension_0() - , src.dimension_1() - , src.dimension_2() - , src.dimension_3() - , src.dimension_4() - , src.dimension_5() - , src.dimension_6() - , src.dimension_7() ); -} - -template< class T , class A1, class A2, class A3 > -inline -typename Kokkos::Experimental::View::HostMirror -create_mirror( const Kokkos::Experimental::View & src - , typename std::enable_if< - std::is_same< typename Kokkos::Experimental::ViewTraits::array_layout - , Kokkos::LayoutStride >::value - >::type * = 0 - ) -{ - typedef View src_type ; - typedef typename src_type::HostMirror dst_type ; - - Kokkos::LayoutStride layout ; - - layout.dimension[0] = src.dimension_0(); - layout.dimension[1] = src.dimension_1(); - layout.dimension[2] = src.dimension_2(); - layout.dimension[3] = src.dimension_3(); - layout.dimension[4] = src.dimension_4(); - layout.dimension[5] = src.dimension_5(); - layout.dimension[6] = src.dimension_6(); - layout.dimension[7] = src.dimension_7(); - - layout.stride[0] = src.stride_0(); - layout.stride[1] = src.stride_1(); - layout.stride[2] = src.stride_2(); - layout.stride[3] = src.stride_3(); - layout.stride[4] = src.stride_4(); - layout.stride[5] = src.stride_5(); - layout.stride[6] = src.stride_6(); - layout.stride[7] = src.stride_7(); - - return dst_type( std::string( src.label() ).append("_mirror") , layout ); -} - -template< class T , class A1 , class A2 , class A3 > -inline -typename Kokkos::Experimental::View::HostMirror -create_mirror_view( const Kokkos::Experimental::View & src - , typename std::enable_if<( - std::is_same< typename Kokkos::Experimental::View::memory_space - , typename Kokkos::Experimental::View::HostMirror::memory_space - >::value - && - std::is_same< typename Kokkos::Experimental::View::data_type - , typename Kokkos::Experimental::View::HostMirror::data_type - >::value - )>::type * = 0 - ) -{ - return src ; -} - -template< class T , class A1 , class A2 , class A3 > -inline -typename Kokkos::Experimental::View::HostMirror -create_mirror_view( const Kokkos::Experimental::View & src - , typename std::enable_if< ! ( - std::is_same< typename Kokkos::Experimental::View::memory_space - , typename Kokkos::Experimental::View::HostMirror::memory_space - >::value - && - std::is_same< typename Kokkos::Experimental::View::data_type - , typename Kokkos::Experimental::View::HostMirror::data_type - >::value - )>::type * = 0 - ) -{ - return Kokkos::Experimental::create_mirror( src ); -} - -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -/** \brief Resize a view with copying old data to new data at the corresponding indices. */ -template< class T , class A1 , class A2 , class A3 > -inline -void resize( Kokkos::Experimental::View & v , - const size_t n0 = 0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 ) -{ - typedef Kokkos::Experimental::View view_type ; - - static_assert( Kokkos::Experimental::ViewTraits::is_managed , "Can only resize managed views" ); - - view_type v_resized( v.label(), n0, n1, n2, n3, n4, n5, n6, n7 ); - - Kokkos::Experimental::Impl::ViewRemap< view_type , view_type >( v_resized , v ); - - v = v_resized ; -} - -/** \brief Resize a view with copying old data to new data at the corresponding indices. */ -template< class T , class A1 , class A2 , class A3 > -inline -void realloc( Kokkos::Experimental::View & v , - const size_t n0 = 0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 ) -{ - typedef Kokkos::Experimental::View view_type ; - - static_assert( Kokkos::Experimental::ViewTraits::is_managed , "Can only realloc managed views" ); - - const std::string label = v.label(); - - v = view_type(); // Deallocate first, if the only view to allocation - v = view_type( label, n0, n1, n2, n3, n4, n5, n6, n7 ); -} - -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - -namespace Kokkos { - -template< class D , class A1 = void , class A2 = void , class A3 = void > -using ViewTraits = Kokkos::Experimental::ViewTraits ; - -template< class D , class A1 = void , class A2 = void , class A3 = void , class S = void > -using View = Kokkos::Experimental::View ; - -using Kokkos::Experimental::deep_copy ; -using Kokkos::Experimental::create_mirror ; -using Kokkos::Experimental::create_mirror_view ; -using Kokkos::Experimental::subview ; -using Kokkos::Experimental::resize ; -using Kokkos::Experimental::realloc ; - -namespace Impl { - -using Kokkos::Experimental::is_view ; - -class ViewDefault {}; - -template< class SrcViewType - , class Arg0Type - , class Arg1Type - , class Arg2Type - , class Arg3Type - , class Arg4Type - , class Arg5Type - , class Arg6Type - , class Arg7Type - > -struct ViewSubview /* { typedef ... type ; } */ ; - -} - -} /* namespace Kokkos */ - -#include - -#endif /* #if defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif - diff --git a/lib/kokkos/core/src/Kokkos_Array.hpp b/lib/kokkos/core/src/Kokkos_Array.hpp deleted file mode 100644 index 7fe8b1c394..0000000000 --- a/lib/kokkos/core/src/Kokkos_Array.hpp +++ /dev/null @@ -1,300 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_ARRAY -#define KOKKOS_ARRAY - -#include -#include - -namespace Kokkos { - -/**\brief Derived from the C++17 'std::array'. - * Dropping the iterator interface. - */ -template< class T = void - , size_t N = ~size_t(0) - , class Proxy = void - > -struct Array { -private: - T m_elem[N]; -public: - - typedef T & reference ; - typedef typename std::add_const::type & const_reference ; - typedef size_t size_type ; - typedef ptrdiff_t difference_type ; - typedef T value_type ; - typedef T * pointer ; - typedef typename std::add_const::type * const_pointer ; - - KOKKOS_INLINE_FUNCTION static constexpr size_type size() { return N ; } - KOKKOS_INLINE_FUNCTION static constexpr bool empty(){ return false ; } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - reference operator[]( const iType & i ) - { - static_assert( std::is_integral::value , "Must be integral argument" ); - return m_elem[i]; - } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - const_reference operator[]( const iType & i ) const - { - static_assert( std::is_integral::value , "Must be integral argument" ); - return m_elem[i]; - } - - KOKKOS_INLINE_FUNCTION pointer data() { return & m_elem[0] ; } - KOKKOS_INLINE_FUNCTION const_pointer data() const { return & m_elem[0] ; } - - ~Array() = default ; - Array() = default ; - Array( const Array & ) = default ; - Array & operator = ( const Array & ) = default ; - - // Some supported compilers are not sufficiently C++11 compliant - // for default move constructor and move assignment operator. - // Array( Array && ) = default ; - // Array & operator = ( Array && ) = default ; -}; - - -template< class T , class Proxy > -struct Array { -public: - - typedef typename std::add_const::type & reference ; - typedef typename std::add_const::type & const_reference ; - typedef size_t size_type ; - typedef ptrdiff_t difference_type ; - typedef typename std::add_const::type value_type ; - typedef typename std::add_const::type * pointer ; - typedef typename std::add_const::type * const_pointer ; - - KOKKOS_INLINE_FUNCTION static constexpr size_type size() { return 0 ; } - KOKKOS_INLINE_FUNCTION static constexpr bool empty() { return true ; } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - value_type operator[]( const iType & ) - { - static_assert( std::is_integral::value , "Must be integer argument" ); - return value_type(); - } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - value_type operator[]( const iType & ) const - { - static_assert( std::is_integral::value , "Must be integer argument" ); - return value_type(); - } - - KOKKOS_INLINE_FUNCTION pointer data() { return pointer(0) ; } - KOKKOS_INLINE_FUNCTION const_pointer data() const { return const_pointer(0); } - - ~Array() = default ; - Array() = default ; - Array( const Array & ) = default ; - Array & operator = ( const Array & ) = default ; - - // Some supported compilers are not sufficiently C++11 compliant - // for default move constructor and move assignment operator. - // Array( Array && ) = default ; - // Array & operator = ( Array && ) = default ; -}; - - -template<> -struct Array -{ - struct contiguous {}; - struct strided {}; -}; - -template< class T > -struct Array< T , ~size_t(0) , Array<>::contiguous > -{ -private: - T * m_elem ; - size_t m_size ; -public: - - typedef T & reference ; - typedef typename std::add_const::type & const_reference ; - typedef size_t size_type ; - typedef ptrdiff_t difference_type ; - typedef T value_type ; - typedef T * pointer ; - typedef typename std::add_const::type * const_pointer ; - - KOKKOS_INLINE_FUNCTION constexpr size_type size() const { return m_size ; } - KOKKOS_INLINE_FUNCTION constexpr bool empty() const { return 0 != m_size ; } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - reference operator[]( const iType & i ) - { - static_assert( std::is_integral::value , "Must be integral argument" ); - return m_elem[i]; - } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - const_reference operator[]( const iType & i ) const - { - static_assert( std::is_integral::value , "Must be integral argument" ); - return m_elem[i]; - } - - KOKKOS_INLINE_FUNCTION pointer data() { return m_elem ; } - KOKKOS_INLINE_FUNCTION const_pointer data() const { return m_elem ; } - - ~Array() = default ; - Array() = delete ; - Array( const Array & rhs ) = delete ; - - // Some supported compilers are not sufficiently C++11 compliant - // for default move constructor and move assignment operator. - // Array( Array && rhs ) = default ; - // Array & operator = ( Array && rhs ) = delete ; - - KOKKOS_INLINE_FUNCTION - Array & operator = ( const Array & rhs ) - { - const size_t n = std::min( m_size , rhs.size() ); - for ( size_t i = 0 ; i < n ; ++i ) m_elem[i] = rhs[i] ; - return *this ; - } - - template< size_t N , class P > - KOKKOS_INLINE_FUNCTION - Array & operator = ( const Array & rhs ) - { - const size_t n = std::min( m_size , rhs.size() ); - for ( size_t i = 0 ; i < n ; ++i ) m_elem[i] = rhs[i] ; - return *this ; - } - - KOKKOS_INLINE_FUNCTION constexpr Array( pointer arg_ptr , size_type arg_size , size_type = 0 ) - : m_elem(arg_ptr), m_size(arg_size) {} -}; - -template< class T > -struct Array< T , ~size_t(0) , Array<>::strided > -{ -private: - T * m_elem ; - size_t m_size ; - size_t m_stride ; -public: - - typedef T & reference ; - typedef typename std::add_const::type & const_reference ; - typedef size_t size_type ; - typedef ptrdiff_t difference_type ; - typedef T value_type ; - typedef T * pointer ; - typedef typename std::add_const::type * const_pointer ; - - KOKKOS_INLINE_FUNCTION constexpr size_type size() const { return m_size ; } - KOKKOS_INLINE_FUNCTION constexpr bool empty() const { return 0 != m_size ; } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - reference operator[]( const iType & i ) - { - static_assert( std::is_integral::value , "Must be integral argument" ); - return m_elem[i*m_stride]; - } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - const_reference operator[]( const iType & i ) const - { - static_assert( std::is_integral::value , "Must be integral argument" ); - return m_elem[i*m_stride]; - } - - KOKKOS_INLINE_FUNCTION pointer data() { return m_elem ; } - KOKKOS_INLINE_FUNCTION const_pointer data() const { return m_elem ; } - - ~Array() = default ; - Array() = delete ; - Array( const Array & ) = delete ; - - - // Some supported compilers are not sufficiently C++11 compliant - // for default move constructor and move assignment operator. - // Array( Array && rhs ) = default ; - // Array & operator = ( Array && rhs ) = delete ; - - KOKKOS_INLINE_FUNCTION - Array & operator = ( const Array & rhs ) - { - const size_t n = std::min( m_size , rhs.size() ); - for ( size_t i = 0 ; i < n ; ++i ) m_elem[i] = rhs[i] ; - return *this ; - } - - template< size_t N , class P > - KOKKOS_INLINE_FUNCTION - Array & operator = ( const Array & rhs ) - { - const size_t n = std::min( m_size , rhs.size() ); - for ( size_t i = 0 ; i < n ; ++i ) m_elem[i] = rhs[i] ; - return *this ; - } - - KOKKOS_INLINE_FUNCTION constexpr Array( pointer arg_ptr , size_type arg_size , size_type arg_stride ) - : m_elem(arg_ptr), m_size(arg_size), m_stride(arg_stride) {} -}; - -} // namespace Kokkos - -#endif /* #ifndef KOKKOS_ARRAY */ - diff --git a/lib/kokkos/core/src/Kokkos_Atomic.hpp b/lib/kokkos/core/src/Kokkos_Atomic.hpp deleted file mode 100644 index 60009e6d4d..0000000000 --- a/lib/kokkos/core/src/Kokkos_Atomic.hpp +++ /dev/null @@ -1,285 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -/// \file Kokkos_Atomic.hpp -/// \brief Atomic functions -/// -/// This header file defines prototypes for the following atomic functions: -/// - exchange -/// - compare and exchange -/// - add -/// -/// Supported types include: -/// - signed and unsigned 4 and 8 byte integers -/// - float -/// - double -/// -/// They are implemented through GCC compatible intrinsics, OpenMP -/// directives and native CUDA intrinsics. -/// -/// Including this header file requires one of the following -/// compilers: -/// - NVCC (for CUDA device code only) -/// - GCC (for host code only) -/// - Intel (for host code only) -/// - A compiler that supports OpenMP 3.1 (for host code only) - -#ifndef KOKKOS_ATOMIC_HPP -#define KOKKOS_ATOMIC_HPP - -#include -#include -#include - -//---------------------------------------------------------------------------- -#if defined(_WIN32) -#define KOKKOS_ATOMICS_USE_WINDOWS -#else -#if defined( __CUDA_ARCH__ ) && defined( KOKKOS_HAVE_CUDA ) - -// Compiling NVIDIA device code, must use Cuda atomics: - -#define KOKKOS_ATOMICS_USE_CUDA - -#elif ! defined( KOKKOS_ATOMICS_USE_GCC ) && \ - ! defined( KOKKOS_ATOMICS_USE_INTEL ) && \ - ! defined( KOKKOS_ATOMICS_USE_OMP31 ) - -// Compiling for non-Cuda atomic implementation has not been pre-selected. -// Choose the best implementation for the detected compiler. -// Preference: GCC, INTEL, OMP31 - -#if defined( KOKKOS_COMPILER_GNU ) || \ - defined( KOKKOS_COMPILER_CLANG ) || \ - ( defined ( KOKKOS_COMPILER_NVCC ) && defined ( __GNUC__ ) ) - -#define KOKKOS_ATOMICS_USE_GCC - -#elif defined( KOKKOS_COMPILER_INTEL ) || \ - defined( KOKKOS_COMPILER_CRAYC ) - -#define KOKKOS_ATOMICS_USE_INTEL - -#elif defined( _OPENMP ) && ( 201107 <= _OPENMP ) - -#define KOKKOS_ATOMICS_USE_OMP31 - -#else - -#error "KOKKOS_ATOMICS_USE : Unsupported compiler" - -#endif - -#endif /* Not pre-selected atomic implementation */ -#endif - -//---------------------------------------------------------------------------- - -// Forward decalaration of functions supporting arbitrary sized atomics -// This is necessary since Kokkos_Atomic.hpp is internally included very early -// through Kokkos_HostSpace.hpp as well as the allocation tracker. -#ifdef KOKKOS_HAVE_CUDA -namespace Kokkos { -namespace Impl { -/// \brief Aquire a lock for the address -/// -/// This function tries to aquire the lock for the hash value derived -/// from the provided ptr. If the lock is successfully aquired the -/// function returns true. Otherwise it returns false. -__device__ inline -bool lock_address_cuda_space(void* ptr); - -/// \brief Release lock for the address -/// -/// This function releases the lock for the hash value derived -/// from the provided ptr. This function should only be called -/// after previously successfully aquiring a lock with -/// lock_address. -__device__ inline -void unlock_address_cuda_space(void* ptr); -} -} -#endif - - -namespace Kokkos { -template -KOKKOS_INLINE_FUNCTION -void atomic_add(volatile T * const dest, const T src); - -// Atomic increment -template -KOKKOS_INLINE_FUNCTION -void atomic_increment(volatile T* a); - -template -KOKKOS_INLINE_FUNCTION -void atomic_decrement(volatile T* a); -} - -#if ! defined(_WIN32) -#include -#endif - -namespace Kokkos { - - -inline -const char * atomic_query_version() -{ -#if defined( KOKKOS_ATOMICS_USE_CUDA ) - return "KOKKOS_ATOMICS_USE_CUDA" ; -#elif defined( KOKKOS_ATOMICS_USE_GCC ) - return "KOKKOS_ATOMICS_USE_GCC" ; -#elif defined( KOKKOS_ATOMICS_USE_INTEL ) - return "KOKKOS_ATOMICS_USE_INTEL" ; -#elif defined( KOKKOS_ATOMICS_USE_OMP31 ) - return "KOKKOS_ATOMICS_USE_OMP31" ; -#elif defined( KOKKOS_ATOMICS_USE_WINDOWS ) - return "KOKKOS_ATOMICS_USE_WINDOWS"; -#endif -} - -} // namespace Kokkos - -#ifdef _WIN32 -#include "impl/Kokkos_Atomic_Windows.hpp" -#else -//#include "impl/Kokkos_Atomic_Assembly_X86.hpp" - -//---------------------------------------------------------------------------- -// Atomic exchange -// -// template< typename T > -// T atomic_exchange( volatile T* const dest , const T val ) -// { T tmp = *dest ; *dest = val ; return tmp ; } - -#include "impl/Kokkos_Atomic_Exchange.hpp" - -//---------------------------------------------------------------------------- -// Atomic compare-and-exchange -// -// template -// bool atomic_compare_exchange_strong(volatile T* const dest, const T compare, const T val) -// { bool equal = compare == *dest ; if ( equal ) { *dest = val ; } return equal ; } - -#include "impl/Kokkos_Atomic_Compare_Exchange_Strong.hpp" - -//---------------------------------------------------------------------------- -// Atomic fetch and add -// -// template -// T atomic_fetch_add(volatile T* const dest, const T val) -// { T tmp = *dest ; *dest += val ; return tmp ; } - -#include "impl/Kokkos_Atomic_Fetch_Add.hpp" - -//---------------------------------------------------------------------------- -// Atomic fetch and sub -// -// template -// T atomic_fetch_sub(volatile T* const dest, const T val) -// { T tmp = *dest ; *dest -= val ; return tmp ; } - -#include "impl/Kokkos_Atomic_Fetch_Sub.hpp" - -//---------------------------------------------------------------------------- -// Atomic fetch and or -// -// template -// T atomic_fetch_or(volatile T* const dest, const T val) -// { T tmp = *dest ; *dest = tmp | val ; return tmp ; } - -#include "impl/Kokkos_Atomic_Fetch_Or.hpp" - -//---------------------------------------------------------------------------- -// Atomic fetch and and -// -// template -// T atomic_fetch_and(volatile T* const dest, const T val) -// { T tmp = *dest ; *dest = tmp & val ; return tmp ; } - -#include "impl/Kokkos_Atomic_Fetch_And.hpp" -#endif /*Not _WIN32*/ - -//---------------------------------------------------------------------------- -// Memory fence -// -// All loads and stores from this thread will be globally consistent before continuing -// -// void memory_fence() {...}; -#include "impl/Kokkos_Memory_Fence.hpp" - -//---------------------------------------------------------------------------- -// Provide volatile_load and safe_load -// -// T volatile_load(T const volatile * const ptr); -// -// T const& safe_load(T const * const ptr); -// XEON PHI -// T safe_load(T const * const ptr - -#include "impl/Kokkos_Volatile_Load.hpp" - -#ifndef _WIN32 -#include "impl/Kokkos_Atomic_Generic.hpp" -#endif -//---------------------------------------------------------------------------- -// This atomic-style macro should be an inlined function, not a macro - -#if defined( KOKKOS_COMPILER_GNU ) && !defined(__PGIC__) - - #define KOKKOS_NONTEMPORAL_PREFETCH_LOAD(addr) __builtin_prefetch(addr,0,0) - #define KOKKOS_NONTEMPORAL_PREFETCH_STORE(addr) __builtin_prefetch(addr,1,0) - -#else - - #define KOKKOS_NONTEMPORAL_PREFETCH_LOAD(addr) ((void)0) - #define KOKKOS_NONTEMPORAL_PREFETCH_STORE(addr) ((void)0) - -#endif - -//---------------------------------------------------------------------------- - -#endif /* KOKKOS_ATOMIC_HPP */ - diff --git a/lib/kokkos/core/src/Kokkos_Core.hpp b/lib/kokkos/core/src/Kokkos_Core.hpp deleted file mode 100644 index 2578313d77..0000000000 --- a/lib/kokkos/core/src/Kokkos_Core.hpp +++ /dev/null @@ -1,235 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CORE_HPP -#define KOKKOS_CORE_HPP - -//---------------------------------------------------------------------------- -// Include the execution space header files for the enabled execution spaces. - -#include - -#if defined( KOKKOS_HAVE_CUDA ) -#include -#endif - -#if defined( KOKKOS_HAVE_OPENMP ) -#include -#endif - -#if defined( KOKKOS_HAVE_SERIAL ) -#include -#endif - -#if defined( KOKKOS_HAVE_PTHREAD ) -#include -#endif - -#include -#include -#include -#include -#include -#include - -#include - -#ifdef KOKKOS_HAVE_CXX11 -////#include -#endif - - -//---------------------------------------------------------------------------- - -namespace Kokkos { - -struct InitArguments { - int num_threads; - int num_numa; - int device_id; - - InitArguments() { - num_threads = -1; - num_numa = -1; - device_id = -1; - } -}; - -void initialize(int& narg, char* arg[]); - -void initialize(const InitArguments& args = InitArguments()); - -/** \brief Finalize the spaces that were initialized via Kokkos::initialize */ -void finalize(); - -/** \brief Finalize all known execution spaces */ -void finalize_all(); - -void fence(); - -} - -#ifdef KOKKOS_HAVE_CXX11 -namespace Kokkos { - -namespace Impl { -// should only by used by kokkos_malloc and kokkos_free -struct MallocHelper -{ - static void increment_ref_count( AllocationTracker const & tracker ) - { - tracker.increment_ref_count(); - } - - static void decrement_ref_count( AllocationTracker const & tracker ) - { - tracker.decrement_ref_count(); - } -}; -} // namespace Impl - -/* Allocate memory from a memory space. - * The allocation is tracked in Kokkos memory tracking system, so - * leaked memory can be identified. - */ -template< class Arg = DefaultExecutionSpace> -void* kokkos_malloc(const std::string label, size_t count) { - if(count == 0) return NULL; - typedef typename Arg::memory_space MemorySpace; - Impl::AllocationTracker tracker = MemorySpace::allocate_and_track(label,count);; - Impl::MallocHelper::increment_ref_count( tracker ); - return tracker.alloc_ptr(); -} - -template< class Arg = DefaultExecutionSpace> -void* kokkos_malloc(const size_t& count) { - return kokkos_malloc("DefaultLabel",count); -} - - -/* Free memory from a memory space. - */ -template< class Arg = DefaultExecutionSpace> -void kokkos_free(const void* ptr) { - typedef typename Arg::memory_space MemorySpace; - typedef typename MemorySpace::allocator allocator; - Impl::AllocationTracker tracker = Impl::AllocationTracker::find(ptr); - if (tracker.is_valid()) { - Impl::MallocHelper::decrement_ref_count( tracker ); - } -} - - -template< class Arg = DefaultExecutionSpace> -const void* kokkos_realloc(const void* old_ptr, size_t size) { - typedef typename Arg::memory_space MemorySpace; - typedef typename MemorySpace::allocator allocator; - Impl::AllocationTracker tracker = Impl::AllocationTracker::find(old_ptr); - - tracker.reallocate(size); - - return tracker.alloc_ptr(); -} - -} // namespace Kokkos -#endif - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -template< class Space = typename Kokkos::DefaultExecutionSpace::memory_space > -inline -void * kokkos_malloc( const size_t arg_alloc_size ) -{ - typedef typename Space::memory_space MemorySpace ; - typedef Kokkos::Experimental::Impl::SharedAllocationRecord< void , void > RecordBase ; - typedef Kokkos::Experimental::Impl::SharedAllocationRecord< MemorySpace , void > RecordHost ; - - RecordHost * const r = RecordHost::allocate( MemorySpace() , "kokkos_malloc" , arg_alloc_size ); - - RecordBase::increment( r ); - - return r->data(); -} - -template< class Space = typename Kokkos::DefaultExecutionSpace::memory_space > -inline -void kokkos_free( void * arg_alloc ) -{ - typedef typename Space::memory_space MemorySpace ; - typedef Kokkos::Experimental::Impl::SharedAllocationRecord< void , void > RecordBase ; - typedef Kokkos::Experimental::Impl::SharedAllocationRecord< MemorySpace , void > RecordHost ; - - RecordHost * const r = RecordHost::get_record( arg_alloc ); - - RecordBase::decrement( r ); -} - -template< class Space = typename Kokkos::DefaultExecutionSpace::memory_space > -inline -void * kokkos_realloc( void * arg_alloc , const size_t arg_alloc_size ) -{ - typedef typename Space::memory_space MemorySpace ; - typedef Kokkos::Experimental::Impl::SharedAllocationRecord< void , void > RecordBase ; - typedef Kokkos::Experimental::Impl::SharedAllocationRecord< MemorySpace , void > RecordHost ; - - RecordHost * const r_old = RecordHost::get_record( arg_alloc ); - RecordHost * const r_new = RecordHost::allocate( MemorySpace() , "kokkos_malloc" , arg_alloc_size ); - - Kokkos::Impl::DeepCopy( r_new->data() , r_old->data() - , std::min( r_old->size() , r_new->size() ) ); - - RecordBase::increment( r_new ); - RecordBase::decrement( r_old ); - - return r_new->data(); -} - -} // namespace Experimental -} // namespace Kokkos - -#endif - diff --git a/lib/kokkos/core/src/Kokkos_Core_fwd.hpp b/lib/kokkos/core/src/Kokkos_Core_fwd.hpp deleted file mode 100644 index 2cde9299a4..0000000000 --- a/lib/kokkos/core/src/Kokkos_Core_fwd.hpp +++ /dev/null @@ -1,170 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CORE_FWD_HPP -#define KOKKOS_CORE_FWD_HPP - -//---------------------------------------------------------------------------- -// Kokkos_Macros.hpp does introspection on configuration options -// and compiler environment then sets a collection of #define macros. - -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- -// Forward declarations for class inter-relationships - -namespace Kokkos { - -class HostSpace ; ///< Memory space for main process and CPU execution spaces - -#if defined( KOKKOS_HAVE_SERIAL ) -class Serial ; ///< Execution space main process on CPU -#endif // defined( KOKKOS_HAVE_SERIAL ) - -#if defined( KOKKOS_HAVE_PTHREAD ) -class Threads ; ///< Execution space with pthreads back-end -#endif - -#if defined( KOKKOS_HAVE_OPENMP ) -class OpenMP ; ///< OpenMP execution space -#endif - -#if defined( KOKKOS_HAVE_CUDA ) -class CudaSpace ; ///< Memory space on Cuda GPU -class CudaUVMSpace ; ///< Memory space on Cuda GPU with UVM -class CudaHostPinnedSpace ; ///< Memory space on Host accessible to Cuda GPU -class Cuda ; ///< Execution space for Cuda GPU -#endif - -template -struct Device; -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- -// Set the default execution space. - -/// Define Kokkos::DefaultExecutionSpace as per configuration option -/// or chosen from the enabled execution spaces in the following order: -/// Kokkos::Cuda, Kokkos::OpenMP, Kokkos::Threads, Kokkos::Serial - -namespace Kokkos { - -#if defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_CUDA ) - typedef Cuda DefaultExecutionSpace ; -#elif defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_OPENMP ) - typedef OpenMP DefaultExecutionSpace ; -#elif defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_THREADS ) - typedef Threads DefaultExecutionSpace ; -#elif defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_SERIAL ) - typedef Serial DefaultExecutionSpace ; -#else -# error "At least one of the following execution spaces must be defined in order to use Kokkos: Kokkos::Cuda, Kokkos::OpenMP, Kokkos::Serial, or Kokkos::Threads." -#endif - -#if defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_OPENMP ) - typedef OpenMP DefaultHostExecutionSpace ; -#elif defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_THREADS ) - typedef Threads DefaultHostExecutionSpace ; -#elif defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_SERIAL ) - typedef Serial DefaultHostExecutionSpace ; -#elif defined ( KOKKOS_HAVE_OPENMP ) - typedef OpenMP DefaultHostExecutionSpace ; -#elif defined ( KOKKOS_HAVE_PTHREAD ) - typedef Threads DefaultHostExecutionSpace ; -#elif defined ( KOKKOS_HAVE_SERIAL ) - typedef Serial DefaultHostExecutionSpace ; -#else -# error "At least one of the following execution spaces must be defined in order to use Kokkos: Kokkos::OpenMP, Kokkos::Serial, or Kokkos::Threads." -#endif - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- -// Detect the active execution space and define its memory space. -// This is used to verify whether a running kernel can access -// a given memory space. - -namespace Kokkos { -namespace Impl { - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_CUDA ) && defined (KOKKOS_HAVE_CUDA) -typedef Kokkos::CudaSpace ActiveExecutionMemorySpace ; -#elif defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) -typedef Kokkos::HostSpace ActiveExecutionMemorySpace ; -#else -typedef void ActiveExecutionMemorySpace ; -#endif - -template< class ActiveSpace , class MemorySpace > -struct VerifyExecutionCanAccessMemorySpace { - enum {value = 0}; -}; - -template< class Space > -struct VerifyExecutionCanAccessMemorySpace< Space , Space > -{ - enum {value = 1}; - KOKKOS_INLINE_FUNCTION static void verify(void) {} - KOKKOS_INLINE_FUNCTION static void verify(const void *) {} -}; - -} // namespace Impl -} // namespace Kokkos - -#define KOKKOS_RESTRICT_EXECUTION_TO_DATA( DATA_SPACE , DATA_PTR ) \ - Kokkos::Impl::VerifyExecutionCanAccessMemorySpace< \ - Kokkos::Impl::ActiveExecutionMemorySpace , DATA_SPACE >::verify( DATA_PTR ) - -#define KOKKOS_RESTRICT_EXECUTION_TO_( DATA_SPACE ) \ - Kokkos::Impl::VerifyExecutionCanAccessMemorySpace< \ - Kokkos::Impl::ActiveExecutionMemorySpace , DATA_SPACE >::verify() - -namespace Kokkos { - void fence(); -} - -#endif /* #ifndef KOKKOS_CORE_FWD_HPP */ - diff --git a/lib/kokkos/core/src/Kokkos_Cuda.hpp b/lib/kokkos/core/src/Kokkos_Cuda.hpp deleted file mode 100644 index d736459b54..0000000000 --- a/lib/kokkos/core/src/Kokkos_Cuda.hpp +++ /dev/null @@ -1,268 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CUDA_HPP -#define KOKKOS_CUDA_HPP - -#include - -// If CUDA execution space is enabled then use this header file. - -#if defined( KOKKOS_HAVE_CUDA ) - -#include -#include - -#include - -#include -#include -#include -#include -#include - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { -class CudaExec ; -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -/// \class Cuda -/// \brief Kokkos Execution Space that uses CUDA to run on GPUs. -/// -/// An "execution space" represents a parallel execution model. It tells Kokkos -/// how to parallelize the execution of kernels in a parallel_for or -/// parallel_reduce. For example, the Threads execution space uses Pthreads or -/// C++11 threads on a CPU, the OpenMP execution space uses the OpenMP language -/// extensions, and the Serial execution space executes "parallel" kernels -/// sequentially. The Cuda execution space uses NVIDIA's CUDA programming -/// model to execute kernels in parallel on GPUs. -class Cuda { -public: - //! \name Type declarations that all Kokkos execution spaces must provide. - //@{ - - //! Tag this class as a kokkos execution space - typedef Cuda execution_space ; - -#if defined( KOKKOS_USE_CUDA_UVM ) - //! This execution space's preferred memory space. - typedef CudaUVMSpace memory_space ; -#else - //! This execution space's preferred memory space. - typedef CudaSpace memory_space ; -#endif - - //! This execution space preferred device_type - typedef Kokkos::Device device_type; - - //! The size_type best suited for this execution space. - typedef memory_space::size_type size_type ; - - //! This execution space's preferred array layout. - typedef LayoutLeft array_layout ; - - //! - typedef ScratchMemorySpace< Cuda > scratch_memory_space ; - - //@} - //-------------------------------------------------- - //! \name Functions that all Kokkos devices must implement. - //@{ - - /// \brief True if and only if this method is being called in a - /// thread-parallel function. - KOKKOS_INLINE_FUNCTION static int in_parallel() { -#if defined( __CUDA_ARCH__ ) - return true; -#else - return false; -#endif - } - - /** \brief Set the device in a "sleep" state. - * - * This function sets the device in a "sleep" state in which it is - * not ready for work. This may consume less resources than if the - * device were in an "awake" state, but it may also take time to - * bring the device from a sleep state to be ready for work. - * - * \return True if the device is in the "sleep" state, else false if - * the device is actively working and could not enter the "sleep" - * state. - */ - static bool sleep(); - - /// \brief Wake the device from the 'sleep' state so it is ready for work. - /// - /// \return True if the device is in the "ready" state, else "false" - /// if the device is actively working (which also means that it's - /// awake). - static bool wake(); - - /// \brief Wait until all dispatched functors complete. - /// - /// The parallel_for or parallel_reduce dispatch of a functor may - /// return asynchronously, before the functor completes. This - /// method does not return until all dispatched functors on this - /// device have completed. - static void fence(); - - //! Free any resources being consumed by the device. - static void finalize(); - - //! Has been initialized - static int is_initialized(); - - //! Print configuration information to the given output stream. - static void print_configuration( std::ostream & , const bool detail = false ); - - //@} - //-------------------------------------------------- - //! \name Cuda space instances - - ~Cuda() {} - Cuda(); - explicit Cuda( const int instance_id ); - - Cuda( const Cuda & ) = default ; - Cuda( Cuda && ) = default ; - Cuda & operator = ( const Cuda & ) = default ; - Cuda & operator = ( Cuda && ) = default ; - - //-------------------------------------------------------------------------- - //! \name Device-specific functions - //@{ - - struct SelectDevice { - int cuda_device_id ; - SelectDevice() : cuda_device_id(0) {} - explicit SelectDevice( int id ) : cuda_device_id( id ) {} - }; - - //! Initialize, telling the CUDA run-time library which device to use. - static void initialize( const SelectDevice = SelectDevice() - , const size_t num_instances = 1 ); - - /// \brief Cuda device architecture of the selected device. - /// - /// This matches the __CUDA_ARCH__ specification. - static size_type device_arch(); - - //! Query device count. - static size_type detect_device_count(); - - /** \brief Detect the available devices and their architecture - * as defined by the __CUDA_ARCH__ specification. - */ - static std::vector detect_device_arch(); - - cudaStream_t cuda_stream() const { return m_stream ; } - int cuda_device() const { return m_device ; } - - //@} - //-------------------------------------------------------------------------- - -private: - - cudaStream_t m_stream ; - int m_device ; -}; - -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -template<> -struct VerifyExecutionCanAccessMemorySpace - < Kokkos::CudaSpace - , Kokkos::Cuda::scratch_memory_space - > -{ - enum { value = true }; - KOKKOS_INLINE_FUNCTION static void verify( void ) { } - KOKKOS_INLINE_FUNCTION static void verify( const void * ) { } -}; - -template<> -struct VerifyExecutionCanAccessMemorySpace - < Kokkos::HostSpace - , Kokkos::Cuda::scratch_memory_space - > -{ - enum { value = false }; - inline static void verify( void ) { CudaSpace::access_error(); } - inline static void verify( const void * p ) { CudaSpace::access_error(p); } -}; - -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -#include -#include - -#include -#include - -#include - -//---------------------------------------------------------------------------- - -#endif /* #if defined( KOKKOS_HAVE_CUDA ) */ -#endif /* #ifndef KOKKOS_CUDA_HPP */ - - - diff --git a/lib/kokkos/core/src/Kokkos_CudaSpace.hpp b/lib/kokkos/core/src/Kokkos_CudaSpace.hpp deleted file mode 100644 index 3caf250536..0000000000 --- a/lib/kokkos/core/src/Kokkos_CudaSpace.hpp +++ /dev/null @@ -1,790 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_CUDASPACE_HPP -#define KOKKOS_CUDASPACE_HPP - -#include - -#if defined( KOKKOS_HAVE_CUDA ) - -#include -#include -#include - -#include - -#include - -#include -#include - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -/** \brief Cuda on-device memory management */ - -class CudaSpace { -public: - - //! Tag this class as a kokkos memory space - typedef CudaSpace memory_space ; - typedef Kokkos::Cuda execution_space ; - typedef Kokkos::Device device_type; - - typedef unsigned int size_type ; - - typedef Impl::CudaMallocAllocator allocator; - - /** \brief Allocate a contiguous block of memory. - * - * The input label is associated with the block of memory. - * The block of memory is tracked via reference counting where - * allocation gives it a reference count of one. - */ - static Impl::AllocationTracker allocate_and_track( const std::string & label, const size_t size ); - - /*--------------------------------*/ - /** \brief Cuda specific function to attached texture object to an allocation. - * Output the texture object, base pointer, and offset from the input pointer. - */ -#if defined( __CUDACC__ ) - static void texture_object_attach( Impl::AllocationTracker const & tracker - , unsigned type_size - , ::cudaChannelFormatDesc const & desc - ); -#endif - - /*--------------------------------*/ - - CudaSpace(); - CudaSpace( const CudaSpace & rhs ) = default ; - CudaSpace & operator = ( const CudaSpace & rhs ) = default ; - ~CudaSpace() = default ; - - /**\brief Allocate memory in the cuda space */ - void * allocate( const size_t arg_alloc_size ) const ; - - /**\brief Deallocate memory in the cuda space */ - void deallocate( void * const arg_alloc_ptr - , const size_t arg_alloc_size ) const ; - - /*--------------------------------*/ - /** \brief Error reporting for HostSpace attempt to access CudaSpace */ - static void access_error(); - static void access_error( const void * const ); - -private: - - int m_device ; ///< Which Cuda device - - // friend class Kokkos::Experimental::Impl::SharedAllocationRecord< Kokkos::CudaSpace , void > ; -}; - -namespace Impl { -/// \brief Initialize lock array for arbitrary size atomics. -/// -/// Arbitrary atomics are implemented using a hash table of locks -/// where the hash value is derived from the address of the -/// object for which an atomic operation is performed. -/// This function initializes the locks to zero (unset). -void init_lock_array_cuda_space(); - -/// \brief Retrieve the pointer to the lock array for arbitrary size atomics. -/// -/// Arbitrary atomics are implemented using a hash table of locks -/// where the hash value is derived from the address of the -/// object for which an atomic operation is performed. -/// This function retrieves the lock array pointer. -/// If the array is not yet allocated it will do so. -int* lock_array_cuda_space_ptr(bool deallocate = false); -} -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -/** \brief Cuda memory that is accessible to Host execution space - * through Cuda's unified virtual memory (UVM) runtime. - */ -class CudaUVMSpace { -public: - - //! Tag this class as a kokkos memory space - typedef CudaUVMSpace memory_space ; - typedef Cuda execution_space ; - typedef Kokkos::Device device_type; - typedef unsigned int size_type ; - - /** \brief If UVM capability is available */ - static bool available(); - - typedef Impl::CudaUVMAllocator allocator; - - /** \brief Allocate a contiguous block of memory. - * - * The input label is associated with the block of memory. - * The block of memory is tracked via reference counting where - * allocation gives it a reference count of one. - */ - static Impl::AllocationTracker allocate_and_track( const std::string & label, const size_t size ); - - - /** \brief Cuda specific function to attached texture object to an allocation. - * Output the texture object, base pointer, and offset from the input pointer. - */ -#if defined( __CUDACC__ ) - static void texture_object_attach( Impl::AllocationTracker const & tracker - , unsigned type_size - , ::cudaChannelFormatDesc const & desc - ); -#endif - /*--------------------------------*/ - - CudaUVMSpace(); - CudaUVMSpace( const CudaUVMSpace & rhs ) = default ; - CudaUVMSpace & operator = ( const CudaUVMSpace & rhs ) = default ; - ~CudaUVMSpace() = default ; - - /**\brief Allocate memory in the cuda space */ - void * allocate( const size_t arg_alloc_size ) const ; - - /**\brief Deallocate memory in the cuda space */ - void deallocate( void * const arg_alloc_ptr - , const size_t arg_alloc_size ) const ; - - /*--------------------------------*/ - -private: - - int m_device ; ///< Which Cuda device -}; - -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -/** \brief Host memory that is accessible to Cuda execution space - * through Cuda's host-pinned memory allocation. - */ -class CudaHostPinnedSpace { -public: - - //! Tag this class as a kokkos memory space - /** \brief Memory is in HostSpace so use the HostSpace::execution_space */ - typedef HostSpace::execution_space execution_space ; - typedef CudaHostPinnedSpace memory_space ; - typedef Kokkos::Device device_type; - typedef unsigned int size_type ; - - - typedef Impl::CudaHostAllocator allocator ; - - /** \brief Allocate a contiguous block of memory. - * - * The input label is associated with the block of memory. - * The block of memory is tracked via reference counting where - * allocation gives it a reference count of one. - */ - static Impl::AllocationTracker allocate_and_track( const std::string & label, const size_t size ); - - /*--------------------------------*/ - - CudaHostPinnedSpace(); - CudaHostPinnedSpace( const CudaHostPinnedSpace & rhs ) = default ; - CudaHostPinnedSpace & operator = ( const CudaHostPinnedSpace & rhs ) = default ; - ~CudaHostPinnedSpace() = default ; - - /**\brief Allocate memory in the cuda space */ - void * allocate( const size_t arg_alloc_size ) const ; - - /**\brief Deallocate memory in the cuda space */ - void deallocate( void * const arg_alloc_ptr - , const size_t arg_alloc_size ) const ; - - /*--------------------------------*/ -}; - -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -void DeepCopyAsyncCuda( void * dst , const void * src , size_t n); - -template<> struct DeepCopy< CudaSpace , CudaSpace , Cuda> -{ - DeepCopy( void * dst , const void * src , size_t ); - DeepCopy( const Cuda & , void * dst , const void * src , size_t ); -}; - -template<> struct DeepCopy< CudaSpace , HostSpace , Cuda > -{ - DeepCopy( void * dst , const void * src , size_t ); - DeepCopy( const Cuda & , void * dst , const void * src , size_t ); -}; - -template<> struct DeepCopy< HostSpace , CudaSpace , Cuda > -{ - DeepCopy( void * dst , const void * src , size_t ); - DeepCopy( const Cuda & , void * dst , const void * src , size_t ); -}; - -template struct DeepCopy< CudaSpace , CudaSpace , ExecutionSpace > -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< CudaSpace , CudaSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -template struct DeepCopy< CudaSpace , HostSpace , ExecutionSpace > -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< CudaSpace , HostSpace , Cuda>( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -template -struct DeepCopy< HostSpace , CudaSpace , ExecutionSpace > -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< HostSpace , CudaSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -template -struct DeepCopy< CudaSpace , CudaUVMSpace , ExecutionSpace > -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< CudaSpace , CudaSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -template -struct DeepCopy< CudaSpace , CudaHostPinnedSpace , ExecutionSpace> -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< CudaSpace , HostSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - - -template -struct DeepCopy< CudaUVMSpace , CudaSpace , ExecutionSpace> -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< CudaSpace , CudaSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -template -struct DeepCopy< CudaUVMSpace , CudaUVMSpace , ExecutionSpace> -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< CudaSpace , CudaSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -template -struct DeepCopy< CudaUVMSpace , CudaHostPinnedSpace , ExecutionSpace> -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< CudaSpace , HostSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -template struct DeepCopy< CudaUVMSpace , HostSpace , ExecutionSpace > -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< CudaSpace , HostSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - - -template struct DeepCopy< CudaHostPinnedSpace , CudaSpace , ExecutionSpace > -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< HostSpace , CudaSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -template struct DeepCopy< CudaHostPinnedSpace , CudaUVMSpace , ExecutionSpace > -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< HostSpace , CudaSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -template struct DeepCopy< CudaHostPinnedSpace , CudaHostPinnedSpace , ExecutionSpace > -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< HostSpace , HostSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -template struct DeepCopy< CudaHostPinnedSpace , HostSpace , ExecutionSpace > -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< HostSpace , HostSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - - -template struct DeepCopy< HostSpace , CudaUVMSpace , ExecutionSpace > -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< HostSpace , CudaSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -template struct DeepCopy< HostSpace , CudaHostPinnedSpace , ExecutionSpace > -{ - inline - DeepCopy( void * dst , const void * src , size_t n ) - { (void) DeepCopy< HostSpace , HostSpace , Cuda >( dst , src , n ); } - - inline - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) - { - exec.fence(); - DeepCopyAsyncCuda (dst,src,n); - } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -/** Running in CudaSpace attempting to access HostSpace: error */ -template<> -struct VerifyExecutionCanAccessMemorySpace< Kokkos::CudaSpace , Kokkos::HostSpace > -{ - enum { value = false }; - KOKKOS_INLINE_FUNCTION static void verify( void ) - { Kokkos::abort("Cuda code attempted to access HostSpace memory"); } - - KOKKOS_INLINE_FUNCTION static void verify( const void * ) - { Kokkos::abort("Cuda code attempted to access HostSpace memory"); } -}; - -/** Running in CudaSpace accessing CudaUVMSpace: ok */ -template<> -struct VerifyExecutionCanAccessMemorySpace< Kokkos::CudaSpace , Kokkos::CudaUVMSpace > -{ - enum { value = true }; - KOKKOS_INLINE_FUNCTION static void verify( void ) { } - KOKKOS_INLINE_FUNCTION static void verify( const void * ) { } -}; - -/** Running in CudaSpace accessing CudaHostPinnedSpace: ok */ -template<> -struct VerifyExecutionCanAccessMemorySpace< Kokkos::CudaSpace , Kokkos::CudaHostPinnedSpace > -{ - enum { value = true }; - KOKKOS_INLINE_FUNCTION static void verify( void ) { } - KOKKOS_INLINE_FUNCTION static void verify( const void * ) { } -}; - -/** Running in CudaSpace attempting to access an unknown space: error */ -template< class OtherSpace > -struct VerifyExecutionCanAccessMemorySpace< - typename enable_if< ! is_same::value , Kokkos::CudaSpace >::type , - OtherSpace > -{ - enum { value = false }; - KOKKOS_INLINE_FUNCTION static void verify( void ) - { Kokkos::abort("Cuda code attempted to access unknown Space memory"); } - - KOKKOS_INLINE_FUNCTION static void verify( const void * ) - { Kokkos::abort("Cuda code attempted to access unknown Space memory"); } -}; - -//---------------------------------------------------------------------------- -/** Running in HostSpace attempting to access CudaSpace */ -template<> -struct VerifyExecutionCanAccessMemorySpace< Kokkos::HostSpace , Kokkos::CudaSpace > -{ - enum { value = false }; - inline static void verify( void ) { CudaSpace::access_error(); } - inline static void verify( const void * p ) { CudaSpace::access_error(p); } -}; - -/** Running in HostSpace accessing CudaUVMSpace is OK */ -template<> -struct VerifyExecutionCanAccessMemorySpace< Kokkos::HostSpace , Kokkos::CudaUVMSpace > -{ - enum { value = true }; - inline static void verify( void ) { } - inline static void verify( const void * ) { } -}; - -/** Running in HostSpace accessing CudaHostPinnedSpace is OK */ -template<> -struct VerifyExecutionCanAccessMemorySpace< Kokkos::HostSpace , Kokkos::CudaHostPinnedSpace > -{ - enum { value = true }; - KOKKOS_INLINE_FUNCTION static void verify( void ) {} - KOKKOS_INLINE_FUNCTION static void verify( const void * ) {} -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -template<> -class SharedAllocationRecord< Kokkos::CudaSpace , void > - : public SharedAllocationRecord< void , void > -{ -private: - - friend class SharedAllocationRecord< Kokkos::CudaUVMSpace , void > ; - - typedef SharedAllocationRecord< void , void > RecordBase ; - - SharedAllocationRecord( const SharedAllocationRecord & ) = delete ; - SharedAllocationRecord & operator = ( const SharedAllocationRecord & ) = delete ; - - static void deallocate( RecordBase * ); - - static ::cudaTextureObject_t - attach_texture_object( const unsigned sizeof_alias - , void * const alloc_ptr - , const size_t alloc_size ); - - static RecordBase s_root_record ; - - ::cudaTextureObject_t m_tex_obj ; - const Kokkos::CudaSpace m_space ; - -protected: - - ~SharedAllocationRecord(); - SharedAllocationRecord() : RecordBase(), m_tex_obj(0), m_space() {} - - SharedAllocationRecord( const Kokkos::CudaSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - , const RecordBase::function_type arg_dealloc = & deallocate - ); - -public: - - std::string get_label() const ; - - static SharedAllocationRecord * allocate( const Kokkos::CudaSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - ); - - template< typename AliasType > - inline - ::cudaTextureObject_t attach_texture_object() - { - static_assert( ( std::is_same< AliasType , int >::value || - std::is_same< AliasType , ::int2 >::value || - std::is_same< AliasType , ::int4 >::value ) - , "Cuda texture fetch only supported for alias types of int, ::int2, or ::int4" ); - - if ( m_tex_obj == 0 ) { - m_tex_obj = attach_texture_object( sizeof(AliasType) - , (void*) RecordBase::m_alloc_ptr - , RecordBase::m_alloc_size ); - } - - return m_tex_obj ; - } - - template< typename AliasType > - inline - int attach_texture_object_offset( const AliasType * const ptr ) - { - // Texture object is attached to the entire allocation range - return ptr - reinterpret_cast( RecordBase::m_alloc_ptr ); - } - - static SharedAllocationRecord * get_record( void * arg_alloc_ptr ); - - static void print_records( std::ostream & , const Kokkos::CudaSpace & , bool detail = false ); -}; - - -template<> -class SharedAllocationRecord< Kokkos::CudaUVMSpace , void > - : public SharedAllocationRecord< void , void > -{ -private: - - typedef SharedAllocationRecord< void , void > RecordBase ; - - SharedAllocationRecord( const SharedAllocationRecord & ) = delete ; - SharedAllocationRecord & operator = ( const SharedAllocationRecord & ) = delete ; - - static void deallocate( RecordBase * ); - - static RecordBase s_root_record ; - - ::cudaTextureObject_t m_tex_obj ; - const Kokkos::CudaUVMSpace m_space ; - -protected: - - ~SharedAllocationRecord(); - SharedAllocationRecord() : RecordBase(), m_tex_obj(0), m_space() {} - - SharedAllocationRecord( const Kokkos::CudaUVMSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - , const RecordBase::function_type arg_dealloc = & deallocate - ); - -public: - - std::string get_label() const ; - - static SharedAllocationRecord * allocate( const Kokkos::CudaUVMSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - ); - - template< typename AliasType > - inline - ::cudaTextureObject_t attach_texture_object() - { - static_assert( ( std::is_same< AliasType , int >::value || - std::is_same< AliasType , ::int2 >::value || - std::is_same< AliasType , ::int4 >::value ) - , "Cuda texture fetch only supported for alias types of int, ::int2, or ::int4" ); - - if ( m_tex_obj == 0 ) { - m_tex_obj = SharedAllocationRecord< Kokkos::CudaSpace , void >:: - attach_texture_object( sizeof(AliasType) - , (void*) RecordBase::m_alloc_ptr - , RecordBase::m_alloc_size ); - } - - return m_tex_obj ; - } - - template< typename AliasType > - inline - int attach_texture_object_offset( const AliasType * const ptr ) - { - // Texture object is attached to the entire allocation range - return ptr - reinterpret_cast( RecordBase::m_alloc_ptr ); - } - - static SharedAllocationRecord * get_record( void * arg_alloc_ptr ); - - static void print_records( std::ostream & , const Kokkos::CudaUVMSpace & , bool detail = false ); -}; - -template<> -class SharedAllocationRecord< Kokkos::CudaHostPinnedSpace , void > - : public SharedAllocationRecord< void , void > -{ -private: - - typedef SharedAllocationRecord< void , void > RecordBase ; - - SharedAllocationRecord( const SharedAllocationRecord & ) = delete ; - SharedAllocationRecord & operator = ( const SharedAllocationRecord & ) = delete ; - - static void deallocate( RecordBase * ); - - static RecordBase s_root_record ; - - const Kokkos::CudaHostPinnedSpace m_space ; - -protected: - - ~SharedAllocationRecord(); - SharedAllocationRecord() : RecordBase(), m_space() {} - - SharedAllocationRecord( const Kokkos::CudaHostPinnedSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - , const RecordBase::function_type arg_dealloc = & deallocate - ); - -public: - - std::string get_label() const ; - - static SharedAllocationRecord * allocate( const Kokkos::CudaHostPinnedSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - ); - - static SharedAllocationRecord * get_record( void * arg_alloc_ptr ); - - static void print_records( std::ostream & , const Kokkos::CudaHostPinnedSpace & , bool detail = false ); -}; - -} // namespace Impl -} // namespace Experimental -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #if defined( KOKKOS_HAVE_CUDA ) */ -#endif /* #define KOKKOS_CUDASPACE_HPP */ - diff --git a/lib/kokkos/core/src/Kokkos_ExecPolicy.hpp b/lib/kokkos/core/src/Kokkos_ExecPolicy.hpp deleted file mode 100644 index 807cb5cb43..0000000000 --- a/lib/kokkos/core/src/Kokkos_ExecPolicy.hpp +++ /dev/null @@ -1,497 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXECPOLICY_HPP -#define KOKKOS_EXECPOLICY_HPP - -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { - -/** \brief Execution policy for work over a range of an integral type. - * - * Valid template argument options: - * - * With a specified execution space: - * < ExecSpace , WorkTag , { IntConst | IntType } > - * < ExecSpace , WorkTag , void > - * < ExecSpace , { IntConst | IntType } , void > - * < ExecSpace , void , void > - * - * With the default execution space: - * < WorkTag , { IntConst | IntType } , void > - * < WorkTag , void , void > - * < { IntConst | IntType } , void , void > - * < void , void , void > - * - * IntType is a fundamental integral type - * IntConst is an Impl::integral_constant< IntType , Blocking > - * - * Blocking is the granularity of partitioning the range among threads. - */ -template< class Arg0 = void , class Arg1 = void , class Arg2 = void - , class ExecSpace = - // The first argument is the execution space, - // otherwise use the default execution space. - typename Impl::if_c< Impl::is_execution_space< Arg0 >::value , Arg0 - , Kokkos::DefaultExecutionSpace >::type - > -class RangePolicy { -private: - - // Default integral type and blocking factor: - typedef int DefaultIntType ; - enum { DefaultIntValue = 8 }; - - enum { Arg0_Void = Impl::is_same< Arg0 , void >::value }; - enum { Arg1_Void = Impl::is_same< Arg1 , void >::value }; - enum { Arg2_Void = Impl::is_same< Arg2 , void >::value }; - - enum { Arg0_ExecSpace = Impl::is_execution_space< Arg0 >::value }; - - enum { Arg0_IntConst = Impl::is_integral_constant< Arg0 >::value }; - enum { Arg1_IntConst = Impl::is_integral_constant< Arg1 >::value }; - enum { Arg2_IntConst = Impl::is_integral_constant< Arg2 >::value }; - - enum { Arg0_IntType = Impl::is_integral< Arg0 >::value }; - enum { Arg1_IntType = Impl::is_integral< Arg1 >::value }; - enum { Arg2_IntType = Impl::is_integral< Arg2 >::value }; - - enum { Arg0_WorkTag = ! Arg0_ExecSpace && ! Arg0_IntConst && ! Arg0_IntType && ! Arg0_Void }; - enum { Arg1_WorkTag = Arg0_ExecSpace && ! Arg1_IntConst && ! Arg1_IntType && ! Arg1_Void }; - - enum { ArgOption_OK = Impl::StaticAssert< ( - ( Arg0_ExecSpace && Arg1_WorkTag && ( Arg2_IntConst || Arg2_IntType ) ) || - ( Arg0_ExecSpace && Arg1_WorkTag && Arg2_Void ) || - ( Arg0_ExecSpace && ( Arg1_IntConst || Arg1_IntType ) && Arg2_Void ) || - ( Arg0_ExecSpace && Arg1_Void && Arg2_Void ) || - ( Arg0_WorkTag && ( Arg1_IntConst || Arg1_IntType ) && Arg2_Void ) || - ( Arg0_WorkTag && Arg1_Void && Arg2_Void ) || - ( ( Arg0_IntConst || Arg0_IntType ) && Arg1_Void && Arg2_Void ) || - ( Arg0_Void && Arg1_Void && Arg2_Void ) - ) >::value }; - - // The work argument tag is the first or second argument - typedef typename Impl::if_c< Arg0_WorkTag , Arg0 , - typename Impl::if_c< Arg1_WorkTag , Arg1 , void - >::type >::type - WorkTag ; - - enum { Granularity = Arg0_IntConst ? unsigned(Impl::is_integral_constant::integral_value) : ( - Arg1_IntConst ? unsigned(Impl::is_integral_constant::integral_value) : ( - Arg2_IntConst ? unsigned(Impl::is_integral_constant::integral_value) : ( - unsigned(DefaultIntValue) ))) }; - - // Only accept the integral type if the blocking is a power of two - typedef typename Impl::enable_if< Impl::is_power_of_two< Granularity >::value , - typename Impl::if_c< Arg0_IntType , Arg0 , - typename Impl::if_c< Arg1_IntType , Arg1 , - typename Impl::if_c< Arg2_IntType , Arg2 , - typename Impl::if_c< Arg0_IntConst , typename Impl::is_integral_constant::integral_type , - typename Impl::if_c< Arg1_IntConst , typename Impl::is_integral_constant::integral_type , - typename Impl::if_c< Arg2_IntConst , typename Impl::is_integral_constant::integral_type , - DefaultIntType - >::type >::type >::type - >::type >::type >::type - >::type - IntType ; - - enum { GranularityMask = IntType(Granularity) - 1 }; - - ExecSpace m_space ; - IntType m_begin ; - IntType m_end ; - -public: - - //! Tag this class as an execution policy - typedef ExecSpace execution_space ; - typedef RangePolicy execution_policy ; - typedef WorkTag work_tag ; - typedef IntType member_type ; - - KOKKOS_INLINE_FUNCTION const execution_space & space() const { return m_space ; } - KOKKOS_INLINE_FUNCTION member_type begin() const { return m_begin ; } - KOKKOS_INLINE_FUNCTION member_type end() const { return m_end ; } - - inline RangePolicy() : m_space(), m_begin(0), m_end(0) {} - - /** \brief Total range */ - inline - RangePolicy( const member_type work_begin - , const member_type work_end - ) - : m_space() - , m_begin( work_begin < work_end ? work_begin : 0 ) - , m_end( work_begin < work_end ? work_end : 0 ) - {} - - /** \brief Total range */ - inline - RangePolicy( const execution_space & work_space - , const member_type work_begin - , const member_type work_end - ) - : m_space( work_space ) - , m_begin( work_begin < work_end ? work_begin : 0 ) - , m_end( work_begin < work_end ? work_end : 0 ) - {} - - /** \brief Subrange for a partition's rank and size. - * - * Typically used to partition a range over a group of threads. - */ - struct WorkRange { - typedef RangePolicy::work_tag work_tag ; - typedef RangePolicy::member_type member_type ; - - KOKKOS_INLINE_FUNCTION member_type begin() const { return m_begin ; } - KOKKOS_INLINE_FUNCTION member_type end() const { return m_end ; } - - /** \brief Subrange for a partition's rank and size. - * - * Typically used to partition a range over a group of threads. - */ - KOKKOS_INLINE_FUNCTION - WorkRange( const RangePolicy & range - , const int part_rank - , const int part_size - ) - : m_begin(0), m_end(0) - { - if ( part_size ) { - - // Split evenly among partitions, then round up to the granularity. - const member_type work_part = - ( ( ( ( range.end() - range.begin() ) + ( part_size - 1 ) ) / part_size ) - + GranularityMask ) & ~member_type(GranularityMask); - - m_begin = range.begin() + work_part * part_rank ; - m_end = m_begin + work_part ; - - if ( range.end() < m_begin ) m_begin = range.end() ; - if ( range.end() < m_end ) m_end = range.end() ; - } - } - private: - member_type m_begin ; - member_type m_end ; - WorkRange(); - WorkRange & operator = ( const WorkRange & ); - }; -}; - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -/** \brief Execution policy for parallel work over a league of teams of threads. - * - * The work functor is called for each thread of each team such that - * the team's member threads are guaranteed to be concurrent. - * - * The team's threads have access to team shared scratch memory and - * team collective operations. - * - * If the WorkTag is non-void then the first calling argument of the - * work functor's parentheses operator is 'const WorkTag &'. - * This allows a functor to have multiple work member functions. - * - * template argument option with specified execution space: - * < ExecSpace , WorkTag > - * < ExecSpace , void > - * - * template argument option with default execution space: - * < WorkTag , void > - * < void , void > - */ -template< class Arg0 = void - , class Arg1 = void - , class ExecSpace = - // If the first argument is not an execution - // then use the default execution space. - typename Impl::if_c< Impl::is_execution_space< Arg0 >::value , Arg0 - , Kokkos::DefaultExecutionSpace >::type - > -class TeamPolicy { -private: - - enum { Arg0_ExecSpace = Impl::is_execution_space< Arg0 >::value }; - enum { Arg1_Void = Impl::is_same< Arg1 , void >::value }; - enum { ArgOption_OK = Impl::StaticAssert< ( Arg0_ExecSpace || Arg1_Void ) >::value }; - - typedef typename Impl::if_c< Arg0_ExecSpace , Arg1 , Arg0 >::type WorkTag ; - -public: - - //! Tag this class as an execution policy - typedef TeamPolicy execution_policy ; - typedef ExecSpace execution_space ; - typedef WorkTag work_tag ; - - //---------------------------------------- - /** \brief Query maximum team size for a given functor. - * - * This size takes into account execution space concurrency limitations and - * scratch memory space limitations for reductions, team reduce/scan, and - * team shared memory. - */ - template< class FunctorType > - static int team_size_max( const FunctorType & ); - - /** \brief Query recommended team size for a given functor. - * - * This size takes into account execution space concurrency limitations and - * scratch memory space limitations for reductions, team reduce/scan, and - * team shared memory. - */ - template< class FunctorType > - static int team_size_recommended( const FunctorType & ); - - template< class FunctorType > - static int team_size_recommended( const FunctorType & , const int&); - //---------------------------------------- - /** \brief Construct policy with the given instance of the execution space */ - TeamPolicy( const execution_space & , int league_size_request , int team_size_request ); - - /** \brief Construct policy with the default instance of the execution space */ - TeamPolicy( int league_size_request , int team_size_request ); - - /** \brief The actual league size (number of teams) of the policy. - * - * This may be smaller than the requested league size due to limitations - * of the execution space. - */ - KOKKOS_INLINE_FUNCTION int league_size() const ; - - /** \brief The actual team size (number of threads per team) of the policy. - * - * This may be smaller than the requested team size due to limitations - * of the execution space. - */ - KOKKOS_INLINE_FUNCTION int team_size() const ; - - /** \brief Parallel execution of a functor calls the functor once with - * each member of the execution policy. - */ - struct member_type { - - /** \brief Handle to the currently executing team shared scratch memory */ - KOKKOS_INLINE_FUNCTION - typename execution_space::scratch_memory_space team_shmem() const ; - - /** \brief Rank of this team within the league of teams */ - KOKKOS_INLINE_FUNCTION int league_rank() const ; - - /** \brief Number of teams in the league */ - KOKKOS_INLINE_FUNCTION int league_size() const ; - - /** \brief Rank of this thread within this team */ - KOKKOS_INLINE_FUNCTION int team_rank() const ; - - /** \brief Number of threads in this team */ - KOKKOS_INLINE_FUNCTION int team_size() const ; - - /** \brief Barrier among the threads of this team */ - KOKKOS_INLINE_FUNCTION void team_barrier() const ; - - /** \brief Intra-team reduction. Returns join of all values of the team members. */ - template< class JoinOp > - KOKKOS_INLINE_FUNCTION - typename JoinOp::value_type team_reduce( const typename JoinOp::value_type - , const JoinOp & ) const ; - - /** \brief Intra-team exclusive prefix sum with team_rank() ordering. - * - * The highest rank thread can compute the reduction total as - * reduction_total = dev.team_scan( value ) + value ; - */ - template< typename Type > - KOKKOS_INLINE_FUNCTION Type team_scan( const Type & value ) const ; - - /** \brief Intra-team exclusive prefix sum with team_rank() ordering - * with intra-team non-deterministic ordering accumulation. - * - * The global inter-team accumulation value will, at the end of the - * league's parallel execution, be the scan's total. - * Parallel execution ordering of the league's teams is non-deterministic. - * As such the base value for each team's scan operation is similarly - * non-deterministic. - */ - template< typename Type > - KOKKOS_INLINE_FUNCTION Type team_scan( const Type & value , Type * const global_accum ) const ; - }; -}; - -} // namespace Kokkos - -namespace Kokkos { - -namespace Impl { - -template -struct TeamThreadRangeBoundariesStruct { -private: - - KOKKOS_INLINE_FUNCTION static - iType ibegin( const iType & arg_begin - , const iType & arg_end - , const iType & arg_rank - , const iType & arg_size - ) - { - return arg_begin + ( ( arg_end - arg_begin + arg_size - 1 ) / arg_size ) * arg_rank ; - } - - KOKKOS_INLINE_FUNCTION static - iType iend( const iType & arg_begin - , const iType & arg_end - , const iType & arg_rank - , const iType & arg_size - ) - { - const iType end_ = arg_begin + ( ( arg_end - arg_begin + arg_size - 1 ) / arg_size ) * ( arg_rank + 1 ); - return end_ < arg_end ? end_ : arg_end ; - } - -public: - - typedef iType index_type; - const iType start; - const iType end; - enum {increment = 1}; - const TeamMemberType& thread; - - KOKKOS_INLINE_FUNCTION - TeamThreadRangeBoundariesStruct( const TeamMemberType& arg_thread - , const iType& arg_end - ) - : start( ibegin( 0 , arg_end , arg_thread.team_rank() , arg_thread.team_size() ) ) - , end( iend( 0 , arg_end , arg_thread.team_rank() , arg_thread.team_size() ) ) - , thread( arg_thread ) - {} - - KOKKOS_INLINE_FUNCTION - TeamThreadRangeBoundariesStruct( const TeamMemberType& arg_thread - , const iType& arg_begin - , const iType& arg_end - ) - : start( ibegin( arg_begin , arg_end , arg_thread.team_rank() , arg_thread.team_size() ) ) - , end( iend( arg_begin , arg_end , arg_thread.team_rank() , arg_thread.team_size() ) ) - , thread( arg_thread ) - {} -}; - - template - struct ThreadVectorRangeBoundariesStruct { - typedef iType index_type; - enum {start = 0}; - const iType end; - enum {increment = 1}; - - KOKKOS_INLINE_FUNCTION - ThreadVectorRangeBoundariesStruct (const TeamMemberType& thread, const iType& count): - end( count ) - {} - }; - - template - struct ThreadSingleStruct { - const TeamMemberType& team_member; - KOKKOS_INLINE_FUNCTION - ThreadSingleStruct(const TeamMemberType& team_member_):team_member(team_member_){} - }; - - template - struct VectorSingleStruct { - const TeamMemberType& team_member; - KOKKOS_INLINE_FUNCTION - VectorSingleStruct(const TeamMemberType& team_member_):team_member(team_member_){} - }; -} // namespace Impl - -/** \brief Execution policy for parallel work over a threads within a team. - * - * The range is split over all threads in a team. The Mapping scheme depends on the architecture. - * This policy is used together with a parallel pattern as a nested layer within a kernel launched - * with the TeamPolicy. This variant expects a single count. So the range is (0,count]. - */ -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct TeamThreadRange(const TeamMemberType&, const iType& count); - -/** \brief Execution policy for parallel work over a threads within a team. - * - * The range is split over all threads in a team. The Mapping scheme depends on the architecture. - * This policy is used together with a parallel pattern as a nested layer within a kernel launched - * with the TeamPolicy. This variant expects a begin and end. So the range is (begin,end]. - */ -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct TeamThreadRange(const TeamMemberType&, const iType& begin, const iType& end); - -/** \brief Execution policy for a vector parallel loop. - * - * The range is split over all vector lanes in a thread. The Mapping scheme depends on the architecture. - * This policy is used together with a parallel pattern as a nested layer within a kernel launched - * with the TeamPolicy. This variant expects a single count. So the range is (0,count]. - */ -template -KOKKOS_INLINE_FUNCTION -Impl::ThreadVectorRangeBoundariesStruct ThreadVectorRange(const TeamMemberType&, const iType& count); - -} // namespace Kokkos - -#endif /* #define KOKKOS_EXECPOLICY_HPP */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - diff --git a/lib/kokkos/core/src/Kokkos_HostSpace.hpp b/lib/kokkos/core/src/Kokkos_HostSpace.hpp deleted file mode 100644 index 2aa809e7ce..0000000000 --- a/lib/kokkos/core/src/Kokkos_HostSpace.hpp +++ /dev/null @@ -1,276 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_HOSTSPACE_HPP -#define KOKKOS_HOSTSPACE_HPP - -#include -#include -#include -#include - -#include -#include - -#include -#include - -#include -#include - -#include - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -/// \brief Initialize lock array for arbitrary size atomics. -/// -/// Arbitrary atomics are implemented using a hash table of locks -/// where the hash value is derived from the address of the -/// object for which an atomic operation is performed. -/// This function initializes the locks to zero (unset). -void init_lock_array_host_space(); - -/// \brief Aquire a lock for the address -/// -/// This function tries to aquire the lock for the hash value derived -/// from the provided ptr. If the lock is successfully aquired the -/// function returns true. Otherwise it returns false. -bool lock_address_host_space(void* ptr); - -/// \brief Release lock for the address -/// -/// This function releases the lock for the hash value derived -/// from the provided ptr. This function should only be called -/// after previously successfully aquiring a lock with -/// lock_address. -void unlock_address_host_space(void* ptr); - -} // namespace Impl -} // namespace Kokkos - -namespace Kokkos { - -/// \class HostSpace -/// \brief Memory management for host memory. -/// -/// HostSpace is a memory space that governs host memory. "Host" -/// memory means the usual CPU-accessible memory. -class HostSpace { -public: - - //! Tag this class as a kokkos memory space - typedef HostSpace memory_space ; - typedef size_t size_type ; - - /// \typedef execution_space - /// \brief Default execution space for this memory space. - /// - /// Every memory space has a default execution space. This is - /// useful for things like initializing a View (which happens in - /// parallel using the View's default execution space). -#if defined( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_OPENMP ) - typedef Kokkos::OpenMP execution_space ; -#elif defined( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_THREADS ) - typedef Kokkos::Threads execution_space ; -#elif defined( KOKKOS_HAVE_OPENMP ) - typedef Kokkos::OpenMP execution_space ; -#elif defined( KOKKOS_HAVE_PTHREAD ) - typedef Kokkos::Threads execution_space ; -#elif defined( KOKKOS_HAVE_SERIAL ) - typedef Kokkos::Serial execution_space ; -#else -# error "At least one of the following host execution spaces must be defined: Kokkos::OpenMP, Kokkos::Serial, or Kokkos::Threads. You might be seeing this message if you disabled the Kokkos::Serial device explicitly using the Kokkos_ENABLE_Serial:BOOL=OFF CMake option, but did not enable any of the other host execution space devices." -#endif - - //! This memory space preferred device_type - typedef Kokkos::Device device_type; - - -#if defined( KOKKOS_USE_PAGE_ALIGNED_HOST_MEMORY ) - typedef Impl::PageAlignedAllocator allocator ; -#else - typedef Impl::AlignedAllocator allocator ; -#endif - - /** \brief Allocate a contiguous block of memory. - * - * The input label is associated with the block of memory. - * The block of memory is tracked via reference counting where - * allocation gives it a reference count of one. - */ - static Impl::AllocationTracker allocate_and_track( const std::string & label, const size_t size ); - - /*--------------------------------*/ - /* Functions unique to the HostSpace */ - static int in_parallel(); - - static void register_in_parallel( int (*)() ); - - /*--------------------------------*/ - - /**\brief Default memory space instance */ - HostSpace(); - HostSpace( const HostSpace & rhs ) = default ; - HostSpace & operator = ( const HostSpace & ) = default ; - ~HostSpace() = default ; - - /**\brief Non-default memory space instance to choose allocation mechansim, if available */ - - enum AllocationMechanism { STD_MALLOC , POSIX_MEMALIGN , POSIX_MMAP , INTEL_MM_ALLOC }; - - explicit - HostSpace( const AllocationMechanism & ); - - /**\brief Allocate memory in the host space */ - void * allocate( const size_t arg_alloc_size ) const ; - - /**\brief Deallocate memory in the host space */ - void deallocate( void * const arg_alloc_ptr - , const size_t arg_alloc_size ) const ; - -private: - - AllocationMechanism m_alloc_mech ; - - friend class Kokkos::Experimental::Impl::SharedAllocationRecord< Kokkos::HostSpace , void > ; -}; - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -template<> -class SharedAllocationRecord< Kokkos::HostSpace , void > - : public SharedAllocationRecord< void , void > -{ -private: - - friend Kokkos::HostSpace ; - - typedef SharedAllocationRecord< void , void > RecordBase ; - - SharedAllocationRecord( const SharedAllocationRecord & ) = delete ; - SharedAllocationRecord & operator = ( const SharedAllocationRecord & ) = delete ; - - static void deallocate( RecordBase * ); - - /**\brief Root record for tracked allocations from this HostSpace instance */ - static RecordBase s_root_record ; - - const Kokkos::HostSpace m_space ; - -protected: - - ~SharedAllocationRecord(); - SharedAllocationRecord() = default ; - - SharedAllocationRecord( const Kokkos::HostSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - , const RecordBase::function_type arg_dealloc = & deallocate - ); - -public: - - inline - std::string get_label() const - { - return std::string( RecordBase::head()->m_label ); - } - - KOKKOS_INLINE_FUNCTION static - SharedAllocationRecord * allocate( const Kokkos::HostSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - ) - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - return new SharedAllocationRecord( arg_space , arg_label , arg_alloc_size ); -#else - return (SharedAllocationRecord *) 0 ; -#endif - } - - - static SharedAllocationRecord * get_record( void * arg_alloc_ptr ); - - static void print_records( std::ostream & , const Kokkos::HostSpace & , bool detail = false ); -}; - -} // namespace Impl -} // namespace Experimental -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class DstSpace, class SrcSpace, class ExecutionSpace = typename DstSpace::execution_space> struct DeepCopy ; - -template -struct DeepCopy { - DeepCopy( void * dst , const void * src , size_t n ) { - memcpy( dst , src , n ); - } - DeepCopy( const ExecutionSpace& exec, void * dst , const void * src , size_t n ) { - exec.fence(); - memcpy( dst , src , n ); - } -}; - -} // namespace Impl -} // namespace Kokkos - - -#endif /* #define KOKKOS_HOSTSPACE_HPP */ - diff --git a/lib/kokkos/core/src/Kokkos_Layout.hpp b/lib/kokkos/core/src/Kokkos_Layout.hpp deleted file mode 100644 index 32822889df..0000000000 --- a/lib/kokkos/core/src/Kokkos_Layout.hpp +++ /dev/null @@ -1,174 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -/// \file Kokkos_Layout.hpp -/// \brief Declaration of various \c MemoryLayout options. - -#ifndef KOKKOS_LAYOUT_HPP -#define KOKKOS_LAYOUT_HPP - -#include -#include -#include - -namespace Kokkos { - -//---------------------------------------------------------------------------- -/// \struct LayoutLeft -/// \brief Memory layout tag indicating left-to-right (Fortran scheme) -/// striding of multi-indices. -/// -/// This is an example of a \c MemoryLayout template parameter of -/// View. The memory layout describes how View maps from a -/// multi-index (i0, i1, ..., ik) to a memory location. -/// -/// "Layout left" indicates a mapping where the leftmost index i0 -/// refers to contiguous access, and strides increase for dimensions -/// going right from there (i1, i2, ...). This layout imitates how -/// Fortran stores multi-dimensional arrays. For the special case of -/// a two-dimensional array, "layout left" is also called "column -/// major." -struct LayoutLeft { - //! Tag this class as a kokkos array layout - typedef LayoutLeft array_layout ; -}; - -//---------------------------------------------------------------------------- -/// \struct LayoutRight -/// \brief Memory layout tag indicating right-to-left (C or -/// lexigraphical scheme) striding of multi-indices. -/// -/// This is an example of a \c MemoryLayout template parameter of -/// View. The memory layout describes how View maps from a -/// multi-index (i0, i1, ..., ik) to a memory location. -/// -/// "Right layout" indicates a mapping where the rightmost index ik -/// refers to contiguous access, and strides increase for dimensions -/// going left from there. This layout imitates how C stores -/// multi-dimensional arrays. For the special case of a -/// two-dimensional array, "layout right" is also called "row major." -struct LayoutRight { - //! Tag this class as a kokkos array layout - typedef LayoutRight array_layout ; -}; - -//---------------------------------------------------------------------------- -/// \struct LayoutStride -/// \brief Memory layout tag indicated arbitrarily strided -/// multi-index mapping into contiguous memory. -struct LayoutStride { - - //! Tag this class as a kokkos array layout - typedef LayoutStride array_layout ; - - enum { MAX_RANK = 8 }; - - size_t dimension[ MAX_RANK ] ; - size_t stride[ MAX_RANK ] ; - - /** \brief Compute strides from ordered dimensions. - * - * Values of order uniquely form the set [0..rank) - * and specify ordering of the dimensions. - * Order = {0,1,2,...} is LayoutLeft - * Order = {...,2,1,0} is LayoutRight - */ - template< typename iTypeOrder , typename iTypeDimen > - KOKKOS_INLINE_FUNCTION static - LayoutStride order_dimensions( int const rank - , iTypeOrder const * const order - , iTypeDimen const * const dimen ) - { - LayoutStride tmp ; - // Verify valid rank order: - int check_input = MAX_RANK < rank ? 0 : int( 1 << rank ) - 1 ; - for ( int r = 0 ; r < MAX_RANK ; ++r ) { - tmp.dimension[r] = 0 ; - tmp.stride[r] = 0 ; - check_input &= ~int( 1 << order[r] ); - } - if ( 0 == check_input ) { - size_t n = 1 ; - for ( int r = 0 ; r < rank ; ++r ) { - tmp.stride[ order[r] ] = n ; - n *= ( dimen[order[r]] ); - tmp.dimension[r] = dimen[r]; - } - } - return tmp ; - } -}; - -//---------------------------------------------------------------------------- -/// \struct LayoutTileLeft -/// \brief Memory layout tag indicating left-to-right (Fortran scheme) -/// striding of multi-indices by tiles. -/// -/// This is an example of a \c MemoryLayout template parameter of -/// View. The memory layout describes how View maps from a -/// multi-index (i0, i1, ..., ik) to a memory location. -/// -/// "Tiled layout" indicates a mapping to contiguously stored -/// ArgN0 by ArgN1 tiles for the rightmost two -/// dimensions. Indices are LayoutLeft within each tile, and the -/// tiles themselves are arranged using LayoutLeft. Note that the -/// dimensions ArgN0 and ArgN1 of the tiles must be -/// compile-time constants. This speeds up index calculations. If -/// both tile dimensions are powers of two, Kokkos can optimize -/// further. -template < unsigned ArgN0 , unsigned ArgN1 , - bool IsPowerOfTwo = ( Impl::is_power_of_two::value && - Impl::is_power_of_two::value ) - > -struct LayoutTileLeft { - //! Tag this class as a kokkos array layout - typedef LayoutTileLeft array_layout ; - - enum { N0 = ArgN0 }; - enum { N1 = ArgN1 }; -}; - -} // namespace Kokkos - -#endif // #ifndef KOKKOS_LAYOUT_HPP - diff --git a/lib/kokkos/core/src/Kokkos_Macros.hpp b/lib/kokkos/core/src/Kokkos_Macros.hpp deleted file mode 100644 index c221c2f9f3..0000000000 --- a/lib/kokkos/core/src/Kokkos_Macros.hpp +++ /dev/null @@ -1,420 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_MACROS_HPP -#define KOKKOS_MACROS_HPP - -//---------------------------------------------------------------------------- -/** Pick up configure/build options via #define macros: - * - * KOKKOS_HAVE_CUDA Kokkos::Cuda execution and memory spaces - * KOKKOS_HAVE_PTHREAD Kokkos::Threads execution space - * KOKKOS_HAVE_QTHREAD Kokkos::Qthread execution space - * KOKKOS_HAVE_OPENMP Kokkos::OpenMP execution space - * KOKKOS_HAVE_HWLOC HWLOC library is available - * KOKKOS_ENABLE_DEBUG_BOUNDS_CHECK insert array bounds checks, is expensive! - * KOKKOS_HAVE_CXX11 enable C++11 features - * - * KOKKOS_HAVE_MPI negotiate MPI/execution space interactions - * - * KOKKOS_USE_CUDA_UVM Use CUDA UVM for Cuda memory space - */ - -#ifndef KOKKOS_DONT_INCLUDE_CORE_CONFIG_H -#include -#endif - -//---------------------------------------------------------------------------- -/** Pick up compiler specific #define macros: - * - * Macros for known compilers evaluate to an integral version value - * - * KOKKOS_COMPILER_NVCC - * KOKKOS_COMPILER_GNU - * KOKKOS_COMPILER_INTEL - * KOKKOS_COMPILER_IBM - * KOKKOS_COMPILER_CRAYC - * KOKKOS_COMPILER_APPLECC - * KOKKOS_COMPILER_CLANG - * KOKKOS_COMPILER_PGI - * - * Macros for which compiler extension to use for atomics on intrinsice types - * - * KOKKOS_ATOMICS_USE_CUDA - * KOKKOS_ATOMICS_USE_GNU - * KOKKOS_ATOMICS_USE_INTEL - * KOKKOS_ATOMICS_USE_OPENMP31 - * - * A suite of 'KOKKOS_HAVE_PRAGMA_...' are defined for internal use. - * - * Macros for marking functions to run in an execution space: - * - * KOKKOS_FUNCTION - * KOKKOS_INLINE_FUNCTION request compiler to inline - * KOKKOS_FORCEINLINE_FUNCTION force compiler to inline, use with care! - */ - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_HAVE_CUDA ) && defined( __CUDACC__ ) - -/* Compiling with a CUDA compiler. - * - * Include to pick up the CUDA_VERSION macro defined as: - * CUDA_VERSION = ( MAJOR_VERSION * 1000 ) + ( MINOR_VERSION * 10 ) - * - * When generating device code the __CUDA_ARCH__ macro is defined as: - * __CUDA_ARCH__ = ( MAJOR_CAPABILITY * 100 ) + ( MINOR_CAPABILITY * 10 ) - */ - -#include -#include - -#if ! defined( CUDA_VERSION ) -#error "#include did not define CUDA_VERSION" -#endif - -#if ( CUDA_VERSION < 6050 ) -// CUDA supports (inofficially) C++11 in device code starting with -// version 6.5. This includes auto type and device code internal -// lambdas. -#error "Cuda version 6.5 or greater required" -#endif - -#if defined( __CUDA_ARCH__ ) && ( __CUDA_ARCH__ < 300 ) -/* Compiling with CUDA compiler for device code. */ -#error "Cuda device capability >= 3.0 is required" -#endif - -#ifdef KOKKOS_CUDA_USE_LAMBDA -#if ( CUDA_VERSION < 7000 ) -// CUDA supports C++11 lambdas generated in host code to be given -// to the device starting with version 7.5. But the release candidate (7.5.6) -// still identifies as 7.0 -#error "Cuda version 7.5 or greater required for host-to-device Lambda support" -#endif -#define KOKKOS_LAMBDA [=]__device__ -#define KOKKOS_HAVE_CXX11_DISPATCH_LAMBDA 1 -#endif -#endif /* #if defined( KOKKOS_HAVE_CUDA ) && defined( __CUDACC__ ) */ - -/*--------------------------------------------------------------------------*/ -/* Language info: C++, CUDA, OPENMP */ - -#if defined( __CUDA_ARCH__ ) && defined( KOKKOS_HAVE_CUDA ) - // Compiling Cuda code to 'ptx' - - #define KOKKOS_FORCEINLINE_FUNCTION __device__ __host__ __forceinline__ - #define KOKKOS_INLINE_FUNCTION __device__ __host__ inline - #define KOKKOS_FUNCTION __device__ __host__ - -#endif /* #if defined( __CUDA_ARCH__ ) */ - -#if defined( _OPENMP ) - - /* Compiling with OpenMP. - * The value of _OPENMP is an integer value YYYYMM - * where YYYY and MM are the year and month designation - * of the supported OpenMP API version. - */ - -#endif /* #if defined( _OPENMP ) */ - -/*--------------------------------------------------------------------------*/ -/* Mapping compiler built-ins to KOKKOS_COMPILER_*** macros */ - -#if defined( __NVCC__ ) - // NVIDIA compiler is being used. - // Code is parsed and separated into host and device code. - // Host code is compiled again with another compiler. - // Device code is compile to 'ptx'. - #define KOKKOS_COMPILER_NVCC __NVCC__ - -#else -#if defined( KOKKOS_HAVE_CXX11 ) && ! defined( KOKKOS_HAVE_CXX11_DISPATCH_LAMBDA ) - // CUDA (including version 6.5) does not support giving lambdas as - // arguments to global functions. Thus its not currently possible - // to dispatch lambdas from the host. - #define KOKKOS_HAVE_CXX11_DISPATCH_LAMBDA 1 - #endif -#endif /* #if defined( __NVCC__ ) */ - -#if defined( KOKKOS_HAVE_CXX11 ) && !defined (KOKKOS_LAMBDA) - #define KOKKOS_LAMBDA [=] -#endif - -#if ! defined( __CUDA_ARCH__ ) /* Not compiling Cuda code to 'ptx'. */ - -/* Intel compiler for host code */ - -#if defined( __INTEL_COMPILER ) - #define KOKKOS_COMPILER_INTEL __INTEL_COMPILER -#elif defined( __ICC ) - // Old define - #define KOKKOS_COMPILER_INTEL __ICC -#elif defined( __ECC ) - // Very old define - #define KOKKOS_COMPILER_INTEL __ECC -#endif - -/* CRAY compiler for host code */ -#if defined( _CRAYC ) - #define KOKKOS_COMPILER_CRAYC _CRAYC -#endif - -#if defined( __IBMCPP__ ) - // IBM C++ - #define KOKKOS_COMPILER_IBM __IBMCPP__ -#elif defined( __IBMC__ ) - #define KOKKOS_COMPILER_IBM __IBMC__ -#endif - -#if defined( __APPLE_CC__ ) - #define KOKKOS_COMPILER_APPLECC __APPLE_CC__ -#endif - -#if defined (__clang__) && !defined (KOKKOS_COMPILER_INTEL) - #define KOKKOS_COMPILER_CLANG __clang_major__*100+__clang_minor__*10+__clang_patchlevel__ -#endif - -#if ! defined( __clang__ ) && ! defined( KOKKOS_COMPILER_INTEL ) &&defined( __GNUC__ ) - #define KOKKOS_COMPILER_GNU __GNUC__*100+__GNUC_MINOR__*10+__GNUC_PATCHLEVEL__ - #if ( 472 > KOKKOS_COMPILER_GNU ) - #error "Compiling with GCC version earlier than 4.7.2 is not supported." - #endif -#endif - -#if defined( __PGIC__ ) && ! defined( __GNUC__ ) - #define KOKKOS_COMPILER_PGI __PGIC__*100+__PGIC_MINOR__*10+__PGIC_PATCHLEVEL__ - #if ( 1540 > KOKKOS_COMPILER_PGI ) - #error "Compiling with PGI version earlier than 15.4 is not supported." - #endif -#endif - -#endif /* #if ! defined( __CUDA_ARCH__ ) */ - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ -/* Intel compiler macros */ - -#if defined( KOKKOS_COMPILER_INTEL ) - - #define KOKKOS_HAVE_PRAGMA_UNROLL 1 - #define KOKKOS_HAVE_PRAGMA_IVDEP 1 - #define KOKKOS_HAVE_PRAGMA_LOOPCOUNT 1 - #define KOKKOS_HAVE_PRAGMA_VECTOR 1 - #define KOKKOS_HAVE_PRAGMA_SIMD 1 - - #if ( 1400 > KOKKOS_COMPILER_INTEL ) - #if ( 1300 > KOKKOS_COMPILER_INTEL ) - #error "Compiling with Intel version earlier than 13.0 is not supported. Official minimal version is 14.0." - #else - #warning "Compiling with Intel version 13.x probably works but is not officially supported. Official minimal version is 14.0." - #endif - #endif - #if ( 1200 <= KOKKOS_COMPILER_INTEL ) && ! defined( KOKKOS_ENABLE_ASM ) && ! defined( _WIN32 ) - #define KOKKOS_ENABLE_ASM 1 - #endif - - #if ( 1200 <= KOKKOS_COMPILER_INTEL ) && ! defined( KOKKOS_FORCEINLINE_FUNCTION ) - #if !defined (_WIN32) - #define KOKKOS_FORCEINLINE_FUNCTION inline __attribute__((always_inline)) - #else - #define KOKKOS_FORCEINLINE_FUNCTION inline - #endif - #endif - - #if defined( __MIC__ ) - // Compiling for Xeon Phi - #endif - -#endif - -/*--------------------------------------------------------------------------*/ -/* Cray compiler macros */ - -#if defined( KOKKOS_COMPILER_CRAYC ) - - -#endif - -/*--------------------------------------------------------------------------*/ -/* IBM Compiler macros */ - -#if defined( KOKKOS_COMPILER_IBM ) - - #define KOKKOS_HAVE_PRAGMA_UNROLL 1 - //#define KOKKOS_HAVE_PRAGMA_IVDEP 1 - //#define KOKKOS_HAVE_PRAGMA_LOOPCOUNT 1 - //#define KOKKOS_HAVE_PRAGMA_VECTOR 1 - //#define KOKKOS_HAVE_PRAGMA_SIMD 1 - -#endif - -/*--------------------------------------------------------------------------*/ -/* CLANG compiler macros */ - -#if defined( KOKKOS_COMPILER_CLANG ) - - //#define KOKKOS_HAVE_PRAGMA_UNROLL 1 - //#define KOKKOS_HAVE_PRAGMA_IVDEP 1 - //#define KOKKOS_HAVE_PRAGMA_LOOPCOUNT 1 - //#define KOKKOS_HAVE_PRAGMA_VECTOR 1 - //#define KOKKOS_HAVE_PRAGMA_SIMD 1 - - #if ! defined( KOKKOS_FORCEINLINE_FUNCTION ) - #define KOKKOS_FORCEINLINE_FUNCTION inline __attribute__((always_inline)) - #endif - -#endif - -/*--------------------------------------------------------------------------*/ -/* GNU Compiler macros */ - -#if defined( KOKKOS_COMPILER_GNU ) - - //#define KOKKOS_HAVE_PRAGMA_UNROLL 1 - //#define KOKKOS_HAVE_PRAGMA_IVDEP 1 - //#define KOKKOS_HAVE_PRAGMA_LOOPCOUNT 1 - //#define KOKKOS_HAVE_PRAGMA_VECTOR 1 - //#define KOKKOS_HAVE_PRAGMA_SIMD 1 - - #if ! defined( KOKKOS_FORCEINLINE_FUNCTION ) - #define KOKKOS_FORCEINLINE_FUNCTION inline __attribute__((always_inline)) - #endif - - #if ! defined( KOKKOS_ENABLE_ASM ) && \ - ! ( defined( __powerpc) || \ - defined(__powerpc__) || \ - defined(__powerpc64__) || \ - defined(__POWERPC__) || \ - defined(__ppc__) || \ - defined(__ppc64__) || \ - defined(__PGIC__) ) - #define KOKKOS_ENABLE_ASM 1 - #endif - -#endif - -/*--------------------------------------------------------------------------*/ - -#if defined( KOKKOS_COMPILER_PGI ) - - #define KOKKOS_HAVE_PRAGMA_UNROLL 1 - #define KOKKOS_HAVE_PRAGMA_IVDEP 1 - //#define KOKKOS_HAVE_PRAGMA_LOOPCOUNT 1 - #define KOKKOS_HAVE_PRAGMA_VECTOR 1 - //#define KOKKOS_HAVE_PRAGMA_SIMD 1 - -#endif - -/*--------------------------------------------------------------------------*/ - -#if defined( KOKKOS_COMPILER_NVCC ) - - #if defined(__CUDA_ARCH__ ) - #define KOKKOS_HAVE_PRAGMA_UNROLL 1 - #endif - -#endif - -//---------------------------------------------------------------------------- -/** Define function marking macros if compiler specific macros are undefined: */ - -#if ! defined( KOKKOS_FORCEINLINE_FUNCTION ) -#define KOKKOS_FORCEINLINE_FUNCTION inline -#endif - -#if ! defined( KOKKOS_INLINE_FUNCTION ) -#define KOKKOS_INLINE_FUNCTION inline -#endif - -#if ! defined( KOKKOS_FUNCTION ) -#define KOKKOS_FUNCTION /**/ -#endif - -//---------------------------------------------------------------------------- -/** Determine the default execution space for parallel dispatch. - * There is zero or one default execution space specified. - */ - -#if 1 < ( ( defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_CUDA ) ? 1 : 0 ) + \ - ( defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_OPENMP ) ? 1 : 0 ) + \ - ( defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_THREADS ) ? 1 : 0 ) + \ - ( defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_SERIAL ) ? 1 : 0 ) ) - -#error "More than one KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_* specified" ; - -#endif - -/** If default is not specified then chose from enabled execution spaces. - * Priority: CUDA, OPENMP, THREADS, SERIAL - */ -#if defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_CUDA ) -#elif defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_OPENMP ) -#elif defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_THREADS ) -#elif defined ( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_SERIAL ) -#elif defined ( KOKKOS_HAVE_CUDA ) -#define KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_CUDA -#elif defined ( KOKKOS_HAVE_OPENMP ) -#define KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_OPENMP -#elif defined ( KOKKOS_HAVE_PTHREAD ) -#define KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_THREADS -#else -#define KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_SERIAL -#endif - -//---------------------------------------------------------------------------- -/** Determine for what space the code is being compiled: */ - -#if defined( __CUDACC__ ) && defined( __CUDA_ARCH__ ) && defined (KOKKOS_HAVE_CUDA) -#define KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_CUDA -#else -#define KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST -#endif - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_MACROS_HPP */ - diff --git a/lib/kokkos/core/src/Kokkos_MemoryTraits.hpp b/lib/kokkos/core/src/Kokkos_MemoryTraits.hpp deleted file mode 100644 index b581c7da23..0000000000 --- a/lib/kokkos/core/src/Kokkos_MemoryTraits.hpp +++ /dev/null @@ -1,116 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_MEMORYTRAITS_HPP -#define KOKKOS_MEMORYTRAITS_HPP - -#include -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { - -/** \brief Memory access traits for views, an extension point. - * - * These traits should be orthogonal. If there are dependencies then - * the MemoryTraits template must detect and enforce dependencies. - * - * A zero value is the default for a View, indicating that none of - * these traits are present. - */ -enum MemoryTraitsFlags - { Unmanaged = 0x01 - , RandomAccess = 0x02 - , Atomic = 0x04 - }; - -template < unsigned T > -struct MemoryTraits { - //! Tag this class as a kokkos memory traits: - typedef MemoryTraits memory_traits ; - - enum { Unmanaged = T & unsigned(Kokkos::Unmanaged) }; - enum { RandomAccess = T & unsigned(Kokkos::RandomAccess) }; - enum { Atomic = T & unsigned(Kokkos::Atomic) }; - -}; - -} // namespace Kokkos - -//---------------------------------------------------------------------------- - -namespace Kokkos { - -typedef Kokkos::MemoryTraits<0> MemoryManaged ; -typedef Kokkos::MemoryTraits< Kokkos::Unmanaged > MemoryUnmanaged ; -typedef Kokkos::MemoryTraits< Kokkos::Unmanaged | Kokkos::RandomAccess > MemoryRandomAccess ; - -} // namespace Kokkos - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -/** \brief Memory alignment settings - * - * Sets global value for memory alignment. Must be a power of two! - * Enable compatibility of views from different devices with static stride. - * Use compiler flag to enable overwrites. - */ -enum { MEMORY_ALIGNMENT = -#if defined( KOKKOS_MEMORY_ALIGNMENT ) - ( 1 << Kokkos::Impl::power_of_two< KOKKOS_MEMORY_ALIGNMENT >::value ) -#else - ( 1 << Kokkos::Impl::power_of_two< 128 >::value ) -#endif - , MEMORY_ALIGNMENT_THRESHOLD = 4 - }; - - -} //namespace Impl -} // namespace Kokkos - -#endif /* #ifndef KOKKOS_MEMORYTRAITS_HPP */ - diff --git a/lib/kokkos/core/src/Kokkos_OpenMP.hpp b/lib/kokkos/core/src/Kokkos_OpenMP.hpp deleted file mode 100644 index 508da04c87..0000000000 --- a/lib/kokkos/core/src/Kokkos_OpenMP.hpp +++ /dev/null @@ -1,175 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_OPENMP_HPP -#define KOKKOS_OPENMP_HPP - -#include - -#if defined( KOKKOS_HAVE_OPENMP ) && defined( _OPENMP ) - -#include - -#include -#include -#include -#include -#include -#include -#include - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -/// \class OpenMP -/// \brief Kokkos device for multicore processors in the host memory space. -class OpenMP { -public: - //------------------------------------ - //! \name Type declarations that all Kokkos devices must provide. - //@{ - - //! Tag this class as a kokkos execution space - typedef OpenMP execution_space ; - typedef HostSpace memory_space ; - //! This execution space preferred device_type - typedef Kokkos::Device device_type; - - typedef LayoutRight array_layout ; - typedef HostSpace::size_type size_type ; - - typedef ScratchMemorySpace< OpenMP > scratch_memory_space ; - - //@} - //------------------------------------ - //! \name Functions that all Kokkos devices must implement. - //@{ - - inline static bool in_parallel() { return omp_in_parallel(); } - - /** \brief Set the device in a "sleep" state. A noop for OpenMP. */ - static bool sleep(); - - /** \brief Wake the device from the 'sleep' state. A noop for OpenMP. */ - static bool wake(); - - /** \brief Wait until all dispatched functors complete. A noop for OpenMP. */ - static void fence() {} - - /// \brief Print configuration information to the given output stream. - static void print_configuration( std::ostream & , const bool detail = false ); - - /// \brief Free any resources being consumed by the device. - static void finalize(); - - /** \brief Initialize the device. - * - * 1) If the hardware locality library is enabled and OpenMP has not - * already bound threads then bind OpenMP threads to maximize - * core utilization and group for memory hierarchy locality. - * - * 2) Allocate a HostThread for each OpenMP thread to hold its - * topology and fan in/out data. - */ - static void initialize( unsigned thread_count = 0 , - unsigned use_numa_count = 0 , - unsigned use_cores_per_numa = 0 ); - - static int is_initialized(); - //@} - //------------------------------------ - /** \brief This execution space has a topological thread pool which can be queried. - * - * All threads within a pool have a common memory space for which they are cache coherent. - * depth = 0 gives the number of threads in the whole pool. - * depth = 1 gives the number of threads in a NUMA region, typically sharing L3 cache. - * depth = 2 gives the number of threads at the finest granularity, typically sharing L1 cache. - */ - inline static int thread_pool_size( int depth = 0 ); - - /** \brief The rank of the executing thread in this thread pool */ - KOKKOS_INLINE_FUNCTION static int thread_pool_rank(); - - //------------------------------------ - - inline static unsigned max_hardware_threads() { return thread_pool_size(0); } - - KOKKOS_INLINE_FUNCTION static - unsigned hardware_thread_id() { return thread_pool_rank(); } -}; - -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -template<> -struct VerifyExecutionCanAccessMemorySpace - < Kokkos::OpenMP::memory_space - , Kokkos::OpenMP::scratch_memory_space - > -{ - enum { value = true }; - inline static void verify( void ) { } - inline static void verify( const void * ) { } -}; - -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -#include -#include - -/*--------------------------------------------------------------------------*/ - -#endif /* #if defined( KOKKOS_HAVE_OPENMP ) && defined( _OPENMP ) */ -#endif /* #ifndef KOKKOS_OPENMP_HPP */ - - diff --git a/lib/kokkos/core/src/Kokkos_Pair.hpp b/lib/kokkos/core/src/Kokkos_Pair.hpp deleted file mode 100644 index 52de637a56..0000000000 --- a/lib/kokkos/core/src/Kokkos_Pair.hpp +++ /dev/null @@ -1,498 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -/// \file Kokkos_Pair.hpp -/// \brief Declaration and definition of Kokkos::pair. -/// -/// This header file declares and defines Kokkos::pair and its related -/// nonmember functions. - -#ifndef KOKKOS_PAIR_HPP -#define KOKKOS_PAIR_HPP - -#include -#include - -namespace Kokkos { -/// \struct pair -/// \brief Replacement for std::pair that works on CUDA devices. -/// -/// The instance methods of std::pair, including its constructors, are -/// not marked as __device__ functions. Thus, they cannot be -/// called on a CUDA device, such as an NVIDIA GPU. This struct -/// implements the same interface as std::pair, but can be used on a -/// CUDA device as well as on the host. -template -struct pair -{ - //! The first template parameter of this class. - typedef T1 first_type; - //! The second template parameter of this class. - typedef T2 second_type; - - //! The first element of the pair. - first_type first; - //! The second element of the pair. - second_type second; - - /// \brief Default constructor. - /// - /// This calls the default constructors of T1 and T2. It won't - /// compile if those default constructors are not defined and - /// public. - KOKKOS_FORCEINLINE_FUNCTION - pair() - : first(), second() - {} - - /// \brief Constructor that takes both elements of the pair. - /// - /// This calls the copy constructors of T1 and T2. It won't compile - /// if those copy constructors are not defined and public. - KOKKOS_FORCEINLINE_FUNCTION - pair(first_type const& f, second_type const& s) - : first(f), second(s) - {} - - /// \brief Copy constructor. - /// - /// This calls the copy constructors of T1 and T2. It won't compile - /// if those copy constructors are not defined and public. - template - KOKKOS_FORCEINLINE_FUNCTION - pair( const pair &p) - : first(p.first), second(p.second) - {} - - /// \brief Assignment operator. - /// - /// This calls the assignment operators of T1 and T2. It won't - /// compile if the assignment operators are not defined and public. - template - KOKKOS_FORCEINLINE_FUNCTION - pair & operator=(const pair &p) - { - first = p.first; - second = p.second; - return *this; - } - - // from std::pair - template - pair( const std::pair &p) - : first(p.first), second(p.second) - {} - - /// \brief Return the std::pair version of this object. - /// - /// This is not a device function; you may not call it on a - /// CUDA device. It is meant to be called on the host, if the user - /// wants an std::pair instead of a Kokkos::pair. - /// - /// \note This is not a conversion operator, since defining a - /// conversion operator made the relational operators have - /// ambiguous definitions. - std::pair to_std_pair() const - { return std::make_pair(first,second); } -}; - -template -struct pair -{ - //! The first template parameter of this class. - typedef T1& first_type; - //! The second template parameter of this class. - typedef T2& second_type; - - //! The first element of the pair. - first_type first; - //! The second element of the pair. - second_type second; - - /// \brief Constructor that takes both elements of the pair. - /// - /// This calls the copy constructors of T1 and T2. It won't compile - /// if those copy constructors are not defined and public. - KOKKOS_FORCEINLINE_FUNCTION - pair(first_type f, second_type s) - : first(f), second(s) - {} - - /// \brief Copy constructor. - /// - /// This calls the copy constructors of T1 and T2. It won't compile - /// if those copy constructors are not defined and public. - template - KOKKOS_FORCEINLINE_FUNCTION - pair( const pair &p) - : first(p.first), second(p.second) - {} - - // from std::pair - template - pair( const std::pair &p) - : first(p.first), second(p.second) - {} - - /// \brief Assignment operator. - /// - /// This calls the assignment operators of T1 and T2. It won't - /// compile if the assignment operators are not defined and public. - template - KOKKOS_FORCEINLINE_FUNCTION - pair & operator=(const pair &p) - { - first = p.first; - second = p.second; - return *this; - } - - /// \brief Return the std::pair version of this object. - /// - /// This is not a device function; you may not call it on a - /// CUDA device. It is meant to be called on the host, if the user - /// wants an std::pair instead of a Kokkos::pair. - /// - /// \note This is not a conversion operator, since defining a - /// conversion operator made the relational operators have - /// ambiguous definitions. - std::pair to_std_pair() const - { return std::make_pair(first,second); } -}; - -template -struct pair -{ - //! The first template parameter of this class. - typedef T1 first_type; - //! The second template parameter of this class. - typedef T2& second_type; - - //! The first element of the pair. - first_type first; - //! The second element of the pair. - second_type second; - - /// \brief Constructor that takes both elements of the pair. - /// - /// This calls the copy constructors of T1 and T2. It won't compile - /// if those copy constructors are not defined and public. - KOKKOS_FORCEINLINE_FUNCTION - pair(first_type const& f, second_type s) - : first(f), second(s) - {} - - /// \brief Copy constructor. - /// - /// This calls the copy constructors of T1 and T2. It won't compile - /// if those copy constructors are not defined and public. - template - KOKKOS_FORCEINLINE_FUNCTION - pair( const pair &p) - : first(p.first), second(p.second) - {} - - // from std::pair - template - pair( const std::pair &p) - : first(p.first), second(p.second) - {} - - /// \brief Assignment operator. - /// - /// This calls the assignment operators of T1 and T2. It won't - /// compile if the assignment operators are not defined and public. - template - KOKKOS_FORCEINLINE_FUNCTION - pair & operator=(const pair &p) - { - first = p.first; - second = p.second; - return *this; - } - - /// \brief Return the std::pair version of this object. - /// - /// This is not a device function; you may not call it on a - /// CUDA device. It is meant to be called on the host, if the user - /// wants an std::pair instead of a Kokkos::pair. - /// - /// \note This is not a conversion operator, since defining a - /// conversion operator made the relational operators have - /// ambiguous definitions. - std::pair to_std_pair() const - { return std::make_pair(first,second); } -}; - -template -struct pair -{ - //! The first template parameter of this class. - typedef T1& first_type; - //! The second template parameter of this class. - typedef T2 second_type; - - //! The first element of the pair. - first_type first; - //! The second element of the pair. - second_type second; - - /// \brief Constructor that takes both elements of the pair. - /// - /// This calls the copy constructors of T1 and T2. It won't compile - /// if those copy constructors are not defined and public. - KOKKOS_FORCEINLINE_FUNCTION - pair(first_type f, second_type const& s) - : first(f), second(s) - {} - - /// \brief Copy constructor. - /// - /// This calls the copy constructors of T1 and T2. It won't compile - /// if those copy constructors are not defined and public. - template - KOKKOS_FORCEINLINE_FUNCTION - pair( const pair &p) - : first(p.first), second(p.second) - {} - - // from std::pair - template - pair( const std::pair &p) - : first(p.first), second(p.second) - {} - - /// \brief Assignment operator. - /// - /// This calls the assignment operators of T1 and T2. It won't - /// compile if the assignment operators are not defined and public. - template - KOKKOS_FORCEINLINE_FUNCTION - pair & operator=(const pair &p) - { - first = p.first; - second = p.second; - return *this; - } - - /// \brief Return the std::pair version of this object. - /// - /// This is not a device function; you may not call it on a - /// CUDA device. It is meant to be called on the host, if the user - /// wants an std::pair instead of a Kokkos::pair. - /// - /// \note This is not a conversion operator, since defining a - /// conversion operator made the relational operators have - /// ambiguous definitions. - std::pair to_std_pair() const - { return std::make_pair(first,second); } -}; - -//! Equality operator for Kokkos::pair. -template -KOKKOS_FORCEINLINE_FUNCTION -bool operator== (const pair& lhs, const pair& rhs) -{ return lhs.first==rhs.first && lhs.second==rhs.second; } - -//! Inequality operator for Kokkos::pair. -template -KOKKOS_FORCEINLINE_FUNCTION -bool operator!= (const pair& lhs, const pair& rhs) -{ return !(lhs==rhs); } - -//! Less-than operator for Kokkos::pair. -template -KOKKOS_FORCEINLINE_FUNCTION -bool operator< (const pair& lhs, const pair& rhs) -{ return lhs.first -KOKKOS_FORCEINLINE_FUNCTION -bool operator<= (const pair& lhs, const pair& rhs) -{ return !(rhs -KOKKOS_FORCEINLINE_FUNCTION -bool operator> (const pair& lhs, const pair& rhs) -{ return rhs -KOKKOS_FORCEINLINE_FUNCTION -bool operator>= (const pair& lhs, const pair& rhs) -{ return !(lhs -KOKKOS_FORCEINLINE_FUNCTION -pair make_pair (T1 x, T2 y) -{ return ( pair(x,y) ); } - -/// \brief Return a pair of references to the input arguments. -/// -/// This compares to std::tie (new in C++11). You can use it to -/// assign to two variables at once, from the result of a function -/// that returns a pair. For example (__device__ and -/// __host__ attributes omitted for brevity): -/// \code -/// // Declaration of the function to call. -/// // First return value: operation count. -/// // Second return value: whether all operations succeeded. -/// Kokkos::pair someFunction (); -/// -/// // Code that uses Kokkos::tie. -/// int myFunction () { -/// int count = 0; -/// bool success = false; -/// -/// // This assigns to both count and success. -/// Kokkos::tie (count, success) = someFunction (); -/// -/// if (! success) { -/// // ... Some operation failed; -/// // take corrective action ... -/// } -/// return count; -/// } -/// \endcode -/// -/// The line that uses tie() could have been written like this: -/// \code -/// Kokkos::pair result = someFunction (); -/// count = result.first; -/// success = result.second; -/// \endcode -/// -/// Using tie() saves two lines of code and avoids a copy of each -/// element of the pair. The latter could be significant if one or -/// both elements of the pair are more substantial objects than \c int -/// or \c bool. -template -KOKKOS_FORCEINLINE_FUNCTION -pair tie (T1 & x, T2 & y) -{ return ( pair(x,y) ); } - -// -// Specialization of Kokkos::pair for a \c void second argument. This -// is not actually a "pair"; it only contains one element, the first. -// -template -struct pair -{ - typedef T1 first_type; - typedef void second_type; - - first_type first; - enum { second = 0 }; - - KOKKOS_FORCEINLINE_FUNCTION - pair() - : first() - {} - - KOKKOS_FORCEINLINE_FUNCTION - pair(const first_type & f) - : first(f) - {} - - KOKKOS_FORCEINLINE_FUNCTION - pair(const first_type & f, int) - : first(f) - {} - - template - KOKKOS_FORCEINLINE_FUNCTION - pair( const pair &p) - : first(p.first) - {} - - template - KOKKOS_FORCEINLINE_FUNCTION - pair & operator=(const pair &p) - { - first = p.first; - return *this; - } -}; - -// -// Specialization of relational operators for Kokkos::pair. -// - -template -KOKKOS_FORCEINLINE_FUNCTION -bool operator== (const pair& lhs, const pair& rhs) -{ return lhs.first==rhs.first; } - -template -KOKKOS_FORCEINLINE_FUNCTION -bool operator!= (const pair& lhs, const pair& rhs) -{ return !(lhs==rhs); } - -template -KOKKOS_FORCEINLINE_FUNCTION -bool operator< (const pair& lhs, const pair& rhs) -{ return lhs.first -KOKKOS_FORCEINLINE_FUNCTION -bool operator<= (const pair& lhs, const pair& rhs) -{ return !(rhs -KOKKOS_FORCEINLINE_FUNCTION -bool operator> (const pair& lhs, const pair& rhs) -{ return rhs -KOKKOS_FORCEINLINE_FUNCTION -bool operator>= (const pair& lhs, const pair& rhs) -{ return !(lhs -#include -#include -#include - -#ifdef KOKKOSP_ENABLE_PROFILING -#include -#include -#endif - -#include -#include -#include -#include - -#ifdef KOKKOS_HAVE_DEBUG -#include -#endif - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -//---------------------------------------------------------------------------- -/** \brief Given a Functor and Execution Policy query an execution space. - * - * if the Policy has an execution space use that - * else if the Functor has an execution_space use that - * else if the Functor has a device_type use that for backward compatibility - * else use the default - */ -template< class Functor - , class Policy - , class EnableFunctor = void - , class EnablePolicy = void - > -struct FunctorPolicyExecutionSpace { - typedef Kokkos::DefaultExecutionSpace execution_space ; -}; - -template< class Functor , class Policy > -struct FunctorPolicyExecutionSpace - < Functor , Policy - , typename enable_if_type< typename Functor::device_type >::type - , typename enable_if_type< typename Policy ::execution_space >::type - > -{ - typedef typename Policy ::execution_space execution_space ; -}; - -template< class Functor , class Policy > -struct FunctorPolicyExecutionSpace - < Functor , Policy - , typename enable_if_type< typename Functor::execution_space >::type - , typename enable_if_type< typename Policy ::execution_space >::type - > -{ - typedef typename Policy ::execution_space execution_space ; -}; - -template< class Functor , class Policy , class EnableFunctor > -struct FunctorPolicyExecutionSpace - < Functor , Policy - , EnableFunctor - , typename enable_if_type< typename Policy::execution_space >::type - > -{ - typedef typename Policy ::execution_space execution_space ; -}; - -template< class Functor , class Policy , class EnablePolicy > -struct FunctorPolicyExecutionSpace - < Functor , Policy - , typename enable_if_type< typename Functor::device_type >::type - , EnablePolicy - > -{ - typedef typename Functor::device_type execution_space ; -}; - -template< class Functor , class Policy , class EnablePolicy > -struct FunctorPolicyExecutionSpace - < Functor , Policy - , typename enable_if_type< typename Functor::execution_space >::type - , EnablePolicy - > -{ - typedef typename Functor::execution_space execution_space ; -}; - -//---------------------------------------------------------------------------- -/// \class ParallelFor -/// \brief Implementation of the ParallelFor operator that has a -/// partial specialization for the device. -/// -/// This is an implementation detail of parallel_for. Users should -/// skip this and go directly to the nonmember function parallel_for. -template< class FunctorType , class ExecPolicy > class ParallelFor ; - -/// \class ParallelReduce -/// \brief Implementation detail of parallel_reduce. -/// -/// This is an implementation detail of parallel_reduce. Users should -/// skip this and go directly to the nonmember function parallel_reduce. -template< class FunctorType , class ExecPolicy > class ParallelReduce ; - -/// \class ParallelScan -/// \brief Implementation detail of parallel_scan. -/// -/// This is an implementation detail of parallel_scan. Users should -/// skip this and go directly to the documentation of the nonmember -/// template function Kokkos::parallel_scan. -template< class FunctorType , class ExecPolicy > class ParallelScan ; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -/** \brief Execute \c functor in parallel according to the execution \c policy. - * - * A "functor" is a class containing the function to execute in parallel, - * data needed for that execution, and an optional \c execution_space - * typedef. Here is an example functor for parallel_for: - * - * \code - * class FunctorType { - * public: - * typedef ... execution_space ; - * void operator() ( WorkType iwork ) const ; - * }; - * \endcode - * - * In the above example, \c WorkType is any integer type for which a - * valid conversion from \c size_t to \c IntType exists. Its - * operator() method defines the operation to parallelize, - * over the range of integer indices iwork=[0,work_count-1]. - * This compares to a single iteration \c iwork of a \c for loop. - * If \c execution_space is not defined DefaultExecutionSpace will be used. - */ -template< class ExecPolicy , class FunctorType > -inline -void parallel_for( const ExecPolicy & policy - , const FunctorType & functor - , const std::string& str = "" - , typename Impl::enable_if< ! Impl::is_integral< ExecPolicy >::value >::type * = 0 - ) -{ -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelFor("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelFor< FunctorType , ExecPolicy >( Impl::CopyWithoutTracking::apply(functor) , policy ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelFor(kpID); - } -#endif -} - -template< class FunctorType > -inline -void parallel_for( const size_t work_count - , const FunctorType & functor - , const std::string& str = "" - ) -{ - typedef typename - Impl::FunctorPolicyExecutionSpace< FunctorType , void >::execution_space - execution_space ; - typedef RangePolicy< execution_space > policy ; - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelFor("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelFor< FunctorType , policy >( Impl::CopyWithoutTracking::apply(functor) , policy(0,work_count) ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelFor(kpID); - } -#endif -} - -template< class ExecPolicy , class FunctorType > -inline -void parallel_for( const std::string & str - , const ExecPolicy & policy - , const FunctorType & functor ) -{ - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG Start parallel_for kernel: " << str << std::endl; - #endif - - parallel_for(policy,functor,str); - - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG End parallel_for kernel: " << str << std::endl; - #endif - (void) str; -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -/** \brief Parallel reduction - * - * Example of a parallel_reduce functor for a POD (plain old data) value type: - * \code - * class FunctorType { // For POD value type - * public: - * typedef ... execution_space ; - * typedef value_type ; - * void operator()( iwork , & update ) const ; - * void init( & update ) const ; - * void join( volatile & update , - * volatile const & input ) const ; - * - * typedef true_type has_final ; - * void final( & update ) const ; - * }; - * \endcode - * - * Example of a parallel_reduce functor for an array of POD (plain old data) values: - * \code - * class FunctorType { // For array of POD value - * public: - * typedef ... execution_space ; - * typedef value_type[] ; - * void operator()( , update[] ) const ; - * void init( update[] ) const ; - * void join( volatile update[] , - * volatile const input[] ) const ; - * - * typedef true_type has_final ; - * void final( update[] ) const ; - * }; - * \endcode - */ -template< class ExecPolicy , class FunctorType > -inline -void parallel_reduce( const ExecPolicy & policy - , const FunctorType & functor - , const std::string& str = "" - , typename Impl::enable_if< ! Impl::is_integral< ExecPolicy >::value >::type * = 0 - ) -{ - // typedef typename - // Impl::FunctorPolicyExecutionSpace< FunctorType , ExecPolicy >::execution_space - // execution_space ; - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , typename ExecPolicy::work_tag > ValueTraits ; - - typedef typename Kokkos::Impl::if_c< (ValueTraits::StaticValueSize != 0) - , typename ValueTraits::value_type - , typename ValueTraits::pointer_type - >::type value_type ; - - Kokkos::View< value_type - , HostSpace - , Kokkos::MemoryUnmanaged - > - result_view ; - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelReduce("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType , ExecPolicy >( Impl::CopyWithoutTracking::apply(functor) , policy , result_view ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelReduce(kpID); - } -#endif -} - -// integral range policy -template< class FunctorType > -inline -void parallel_reduce( const size_t work_count - , const FunctorType & functor - , const std::string& str = "" - ) -{ - typedef typename - Impl::FunctorPolicyExecutionSpace< FunctorType , void >::execution_space - execution_space ; - - typedef RangePolicy< execution_space > policy ; - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , void > ValueTraits ; - - typedef typename Kokkos::Impl::if_c< (ValueTraits::StaticValueSize != 0) - , typename ValueTraits::value_type - , typename ValueTraits::pointer_type - >::type value_type ; - - Kokkos::View< value_type - , HostSpace - , Kokkos::MemoryUnmanaged - > - result_view ; - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelReduce("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType , policy >( Impl::CopyWithoutTracking::apply(functor) , policy(0,work_count) , result_view ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelReduce(kpID); - } -#endif - -} - -// general policy and view ouput -template< class ExecPolicy , class FunctorType , class ViewType > -inline -void parallel_reduce( const ExecPolicy & policy - , const FunctorType & functor - , const ViewType & result_view - , const std::string& str = "" - , typename Impl::enable_if< - ( Impl::is_view::value && ! Impl::is_integral< ExecPolicy >::value -#ifdef KOKKOS_HAVE_CUDA - && ! Impl::is_same::value -#endif - )>::type * = 0 ) -{ - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelReduce("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType, ExecPolicy >( Impl::CopyWithoutTracking::apply(functor) , policy , Impl::CopyWithoutTracking::apply(result_view) ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelReduce(kpID); - } -#endif - -} - -// general policy and pod or array of pod output -template< class ExecPolicy , class FunctorType > -void parallel_reduce( const ExecPolicy & policy - , const FunctorType & functor -#ifdef KOKKOS_HAVE_CUDA - , typename Impl::enable_if< - ( ! Impl::is_integral< ExecPolicy >::value && - ! Impl::is_same::value ) - , typename Kokkos::Impl::FunctorValueTraits< FunctorType , typename ExecPolicy::work_tag >::reference_type>::type result_ref - , const std::string& str = "" - , typename Impl::enable_if::value >::type* = 0 - ) -#else - , typename Impl::enable_if< - ( ! Impl::is_integral< ExecPolicy >::value) - , typename Kokkos::Impl::FunctorValueTraits< FunctorType , typename ExecPolicy::work_tag >::reference_type - >::type result_ref - , const std::string& str = "" - ) -#endif -{ - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , typename ExecPolicy::work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueOps< FunctorType , typename ExecPolicy::work_tag > ValueOps ; - - // Wrap the result output request in a view to inform the implementation - // of the type and memory space. - - typedef typename Kokkos::Impl::if_c< (ValueTraits::StaticValueSize != 0) - , typename ValueTraits::value_type - , typename ValueTraits::pointer_type - >::type value_type ; - - Kokkos::View< value_type - , HostSpace - , Kokkos::MemoryUnmanaged - > - result_view( ValueOps::pointer( result_ref ) - , ValueTraits::value_count( functor ) - ); - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelReduce("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType, ExecPolicy >( Impl::CopyWithoutTracking::apply(functor) , policy , Impl::CopyWithoutTracking::apply(result_view) ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelReduce(kpID); - } -#endif - -} - -// integral range policy and view ouput -template< class FunctorType , class ViewType > -inline -void parallel_reduce( const size_t work_count - , const FunctorType & functor - , const ViewType & result_view - , const std::string& str = "" - , typename Impl::enable_if<( Impl::is_view::value -#ifdef KOKKOS_HAVE_CUDA - && ! Impl::is_same< - typename Impl::FunctorPolicyExecutionSpace< FunctorType , void >::execution_space, - Kokkos::Cuda>::value -#endif - )>::type * = 0 ) -{ - typedef typename - Impl::FunctorPolicyExecutionSpace< FunctorType , void >::execution_space - execution_space ; - - typedef RangePolicy< execution_space > ExecPolicy ; - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelReduce("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType, ExecPolicy >( Impl::CopyWithoutTracking::apply(functor) , ExecPolicy(0,work_count) , Impl::CopyWithoutTracking::apply(result_view) ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelReduce(kpID); - } -#endif - -} - -// integral range policy and pod or array of pod output -template< class FunctorType > -inline -void parallel_reduce( const size_t work_count - , const FunctorType & functor - , typename Kokkos::Impl::FunctorValueTraits< - typename Impl::if_c::value || - Impl::is_integral::value, - void,FunctorType>::type - , void >::reference_type result - , const std::string& str = "" - , typename Impl::enable_if< true -#ifdef KOKKOS_HAVE_CUDA - && ! Impl::is_same< - typename Impl::FunctorPolicyExecutionSpace< FunctorType , void >::execution_space, - Kokkos::Cuda>::value -#endif - >::type * = 0 ) -{ - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , void > ValueTraits ; - typedef Kokkos::Impl::FunctorValueOps< FunctorType , void > ValueOps ; - - typedef typename - Kokkos::Impl::FunctorPolicyExecutionSpace< FunctorType , void >::execution_space - execution_space ; - - typedef Kokkos::RangePolicy< execution_space > policy ; - - // Wrap the result output request in a view to inform the implementation - // of the type and memory space. - - typedef typename Kokkos::Impl::if_c< (ValueTraits::StaticValueSize != 0) - , typename ValueTraits::value_type - , typename ValueTraits::pointer_type - >::type value_type ; - - Kokkos::View< value_type - , HostSpace - , Kokkos::MemoryUnmanaged - > - result_view( ValueOps::pointer( result ) - , ValueTraits::value_count( functor ) - ); - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelReduce("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelReduce< FunctorType , policy >( Impl::CopyWithoutTracking::apply(functor) , policy(0,work_count) , Impl::CopyWithoutTracking::apply(result_view) ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelReduce(kpID); - } -#endif - -} -#ifndef KOKKOS_HAVE_CUDA -template< class ExecPolicy , class FunctorType , class ResultType > -inline -void parallel_reduce( const std::string & str - , const ExecPolicy & policy - , const FunctorType & functor - , ResultType * result) -{ - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG Start parallel_reduce kernel: " << str << std::endl; - #endif - - parallel_reduce(policy,functor,result,str); - - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG End parallel_reduce kernel: " << str << std::endl; - #endif - (void) str; -} - -template< class ExecPolicy , class FunctorType , class ResultType > -inline -void parallel_reduce( const std::string & str - , const ExecPolicy & policy - , const FunctorType & functor - , ResultType & result) -{ - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG Start parallel_reduce kernel: " << str << std::endl; - #endif - - parallel_reduce(policy,functor,result,str); - - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG End parallel_reduce kernel: " << str << std::endl; - #endif - (void) str; -} - -template< class ExecPolicy , class FunctorType > -inline -void parallel_reduce( const std::string & str - , const ExecPolicy & policy - , const FunctorType & functor) -{ - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG Start parallel_reduce kernel: " << str << std::endl; - #endif - - parallel_reduce(policy,functor,str); - - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG End parallel_reduce kernel: " << str << std::endl; - #endif - (void) str; -} -#endif - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -/// \fn parallel_scan -/// \tparam ExecutionPolicy The execution policy type. -/// \tparam FunctorType The scan functor type. -/// -/// \param policy [in] The execution policy. -/// \param functor [in] The scan functor. -/// -/// This function implements a parallel scan pattern. The scan can -/// be either inclusive or exclusive, depending on how you implement -/// the scan functor. -/// -/// A scan functor looks almost exactly like a reduce functor, except -/// that its operator() takes a third \c bool argument, \c final_pass, -/// which indicates whether this is the last pass of the scan -/// operation. We will show below how to use the \c final_pass -/// argument to control whether the scan is inclusive or exclusive. -/// -/// Here is the minimum required interface of a scan functor for a POD -/// (plain old data) value type \c PodType. That is, the result is a -/// View of zero or more PodType. It is also possible for the result -/// to be an array of (same-sized) arrays of PodType, but we do not -/// show the required interface for that here. -/// \code -/// template< class ExecPolicy , class FunctorType > -/// class ScanFunctor { -/// public: -/// // The Kokkos device type -/// typedef ... execution_space; -/// // Type of an entry of the array containing the result; -/// // also the type of each of the entries combined using -/// // operator() or join(). -/// typedef PodType value_type; -/// -/// void operator () (const ExecPolicy::member_type & i, value_type& update, const bool final_pass) const; -/// void init (value_type& update) const; -/// void join (volatile value_type& update, volatile const value_type& input) const -/// }; -/// \endcode -/// -/// Here is an example of a functor which computes an inclusive plus-scan -/// of an array of \c int, in place. If given an array [1, 2, 3, 4], this -/// scan will overwrite that array with [1, 3, 6, 10]. -/// -/// \code -/// template -/// class InclScanFunctor { -/// public: -/// typedef SpaceType execution_space; -/// typedef int value_type; -/// typedef typename SpaceType::size_type size_type; -/// -/// InclScanFunctor( Kokkos::View x -/// , Kokkos::View y ) : m_x(x), m_y(y) {} -/// -/// void operator () (const size_type i, value_type& update, const bool final_pass) const { -/// update += m_x(i); -/// if (final_pass) { -/// m_y(i) = update; -/// } -/// } -/// void init (value_type& update) const { -/// update = 0; -/// } -/// void join (volatile value_type& update, volatile const value_type& input) const { -/// update += input; -/// } -/// -/// private: -/// Kokkos::View m_x; -/// Kokkos::View m_y; -/// }; -/// \endcode -/// -/// Here is an example of a functor which computes an exclusive -/// scan of an array of \c int, in place. In operator(), note both -/// that the final_pass test and the update have switched places, and -/// the use of a temporary. If given an array [1, 2, 3, 4], this scan -/// will overwrite that array with [0, 1, 3, 6]. -/// -/// \code -/// template -/// class ExclScanFunctor { -/// public: -/// typedef SpaceType execution_space; -/// typedef int value_type; -/// typedef typename SpaceType::size_type size_type; -/// -/// ExclScanFunctor (Kokkos::View x) : x_ (x) {} -/// -/// void operator () (const size_type i, value_type& update, const bool final_pass) const { -/// const value_type x_i = x_(i); -/// if (final_pass) { -/// x_(i) = update; -/// } -/// update += x_i; -/// } -/// void init (value_type& update) const { -/// update = 0; -/// } -/// void join (volatile value_type& update, volatile const value_type& input) const { -/// update += input; -/// } -/// -/// private: -/// Kokkos::View x_; -/// }; -/// \endcode -/// -/// Here is an example of a functor which builds on the above -/// exclusive scan example, to compute an offsets array from a -/// population count array, in place. We assume that the pop count -/// array has an extra entry at the end to store the final count. If -/// given an array [1, 2, 3, 4, 0], this scan will overwrite that -/// array with [0, 1, 3, 6, 10]. -/// -/// \code -/// template -/// class OffsetScanFunctor { -/// public: -/// typedef SpaceType execution_space; -/// typedef int value_type; -/// typedef typename SpaceType::size_type size_type; -/// -/// // lastIndex_ is the last valid index (zero-based) of x. -/// // If x has length zero, then lastIndex_ won't be used anyway. -/// OffsetScanFunctor( Kokkos::View x -/// , Kokkos::View y ) -/// : m_x(x), m_y(y), last_index_ (x.dimension_0 () == 0 ? 0 : x.dimension_0 () - 1) -/// {} -/// -/// void operator () (const size_type i, int& update, const bool final_pass) const { -/// if (final_pass) { -/// m_y(i) = update; -/// } -/// update += m_x(i); -/// // The last entry of m_y gets the final sum. -/// if (final_pass && i == last_index_) { -/// m_y(i+1) = update; -/// } -/// } -/// void init (value_type& update) const { -/// update = 0; -/// } -/// void join (volatile value_type& update, volatile const value_type& input) const { -/// update += input; -/// } -/// -/// private: -/// Kokkos::View m_x; -/// Kokkos::View m_y; -/// const size_type last_index_; -/// }; -/// \endcode -/// -template< class ExecutionPolicy , class FunctorType > -inline -void parallel_scan( const ExecutionPolicy & policy - , const FunctorType & functor - , const std::string& str = "" - , typename Impl::enable_if< ! Impl::is_integral< ExecutionPolicy >::value >::type * = 0 - ) -{ -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelScan("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - Impl::ParallelScan< FunctorType , ExecutionPolicy > scan( Impl::CopyWithoutTracking::apply(functor) , policy ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelScan(kpID); - } -#endif - -} - -template< class FunctorType > -inline -void parallel_scan( const size_t work_count - , const FunctorType & functor - , const std::string& str = "" ) -{ - typedef typename - Kokkos::Impl::FunctorPolicyExecutionSpace< FunctorType , void >::execution_space - execution_space ; - - typedef Kokkos::RangePolicy< execution_space > policy ; - -#ifdef KOKKOSP_ENABLE_PROFILING - uint64_t kpID = 0; - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::beginParallelScan("" == str ? typeid(FunctorType).name() : str, 0, &kpID); - } -#endif - - (void) Impl::ParallelScan< FunctorType , policy >( Impl::CopyWithoutTracking::apply(functor) , policy(0,work_count) ); - -#ifdef KOKKOSP_ENABLE_PROFILING - if(Kokkos::Experimental::profileLibraryLoaded()) { - Kokkos::Experimental::endParallelScan(kpID); - } -#endif - -} - -template< class ExecutionPolicy , class FunctorType > -inline -void parallel_scan( const std::string& str - , const ExecutionPolicy & policy - , const FunctorType & functor) -{ - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG Start parallel_scan kernel: " << str << std::endl; - #endif - - parallel_scan(policy,functor,str); - - #if KOKKOS_ENABLE_DEBUG_PRINT_KERNEL_NAMES - Kokkos::fence(); - std::cout << "KOKKOS_DEBUG End parallel_scan kernel: " << str << std::endl; - #endif - (void) str; -} - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class Enable = void > -struct FunctorTeamShmemSize -{ - static inline size_t value( const FunctorType & , int ) { return 0 ; } -}; - -template< class FunctorType > -struct FunctorTeamShmemSize< FunctorType , typename Impl::enable_if< 0 < sizeof( & FunctorType::team_shmem_size ) >::type > -{ - static inline size_t value( const FunctorType & f , int team_size ) { return f.team_shmem_size( team_size ) ; } -}; - -template< class FunctorType > -struct FunctorTeamShmemSize< FunctorType , typename Impl::enable_if< 0 < sizeof( & FunctorType::shmem_size ) >::type > -{ - static inline size_t value( const FunctorType & f , int team_size ) { return f.shmem_size( team_size ) ; } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* KOKKOS_PARALLEL_HPP */ - diff --git a/lib/kokkos/core/src/Kokkos_Qthread.hpp b/lib/kokkos/core/src/Kokkos_Qthread.hpp deleted file mode 100644 index 4f12c02ba0..0000000000 --- a/lib/kokkos/core/src/Kokkos_Qthread.hpp +++ /dev/null @@ -1,165 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_QTHREAD_HPP -#define KOKKOS_QTHREAD_HPP - -#include -#include -#include -#include -#include -#include -#include -#include - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { -class QthreadExec ; -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -/** \brief Execution space supported by Qthread */ -class Qthread { -public: - //! \name Type declarations that all Kokkos devices must provide. - //@{ - - //! Tag this class as an execution space - typedef Qthread execution_space ; - typedef Kokkos::HostSpace memory_space ; - //! This execution space preferred device_type - typedef Kokkos::Device device_type; - - typedef Kokkos::LayoutRight array_layout ; - typedef memory_space::size_type size_type ; - - typedef ScratchMemorySpace< Qthread > scratch_memory_space ; - - //@} - /*------------------------------------------------------------------------*/ - - /** \brief Initialization will construct one or more instances */ - static Qthread & instance( int = 0 ); - - /** \brief Set the execution space to a "sleep" state. - * - * This function sets the "sleep" state in which it is not ready for work. - * This may consume less resources than in an "ready" state, - * but it may also take time to transition to the "ready" state. - * - * \return True if enters or is in the "sleep" state. - * False if functions are currently executing. - */ - bool sleep(); - - /** \brief Wake from the sleep state. - * - * \return True if enters or is in the "ready" state. - * False if functions are currently executing. - */ - static bool wake(); - - /** \brief Wait until all dispatched functions to complete. - * - * The parallel_for or parallel_reduce dispatch of a functor may - * return asynchronously, before the functor completes. This - * method does not return until all dispatched functors on this - * device have completed. - */ - static void fence(); - - /*------------------------------------------------------------------------*/ - - static void initialize( int thread_count ); - static void finalize(); - - /** \brief Print configuration information to the given output stream. */ - static void print_configuration( std::ostream & , const bool detail = false ); - - int shepherd_size() const ; - int shepherd_worker_size() const ; -}; - -/*--------------------------------------------------------------------------*/ - -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -template<> -struct VerifyExecutionCanAccessMemorySpace - < Kokkos::Qthread::memory_space - , Kokkos::Qthread::scratch_memory_space - > -{ - enum { value = true }; - inline static void verify( void ) { } - inline static void verify( const void * ) { } -}; - -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -#include -#include -#include - -#endif /* #define KOKKOS_QTHREAD_HPP */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - diff --git a/lib/kokkos/core/src/Kokkos_ScratchSpace.hpp b/lib/kokkos/core/src/Kokkos_ScratchSpace.hpp deleted file mode 100644 index 6e5b4f9624..0000000000 --- a/lib/kokkos/core/src/Kokkos_ScratchSpace.hpp +++ /dev/null @@ -1,125 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_SCRATCHSPACE_HPP -#define KOKKOS_SCRATCHSPACE_HPP - -#include -#include -#include - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -/** \brief Scratch memory space associated with an execution space. - * - */ -template< class ExecSpace > -class ScratchMemorySpace { -public: - - // Alignment of memory chunks returned by 'get' - // must be a power of two - enum { ALIGN = 8 }; - -private: - - mutable char * m_iter ; - char * m_end ; - - ScratchMemorySpace(); - ScratchMemorySpace & operator = ( const ScratchMemorySpace & ); - - enum { MASK = ALIGN - 1 }; // Alignment used by View::shmem_size - -public: - - //! Tag this class as a memory space - typedef ScratchMemorySpace memory_space ; - typedef ExecSpace execution_space ; - //! This execution space preferred device_type - typedef Kokkos::Device device_type; - - typedef typename ExecSpace::array_layout array_layout ; - typedef typename ExecSpace::size_type size_type ; - - template< typename IntType > - KOKKOS_INLINE_FUNCTION static - IntType align( const IntType & size ) - { return ( size + MASK ) & ~MASK ; } - - template< typename IntType > - KOKKOS_INLINE_FUNCTION - void* get_shmem (const IntType& size) const { - void* tmp = m_iter ; - if (m_end < (m_iter += align (size))) { - m_iter -= align (size); // put it back like it was - #ifdef KOKKOS_HAVE_DEBUG - // mfh 23 Jun 2015: printf call consumes 25 registers - // in a CUDA build, so only print in debug mode. The - // function still returns NULL if not enough memory. - printf ("ScratchMemorySpace<...>::get_shmem: Failed to allocate " - "%ld byte(s); remaining capacity is %ld byte(s)\n", long(size), - long(m_end-m_iter)); - #endif // KOKKOS_HAVE_DEBUG - tmp = 0; - } - return tmp; - } - - template< typename IntType > - KOKKOS_INLINE_FUNCTION - ScratchMemorySpace( void * ptr , const IntType & size ) - : m_iter( (char *) ptr ) - , m_end( m_iter + size ) - {} -}; - -} // namespace Kokkos - -#endif /* #ifndef KOKKOS_SCRATCHSPACE_HPP */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - diff --git a/lib/kokkos/core/src/Kokkos_Serial.hpp b/lib/kokkos/core/src/Kokkos_Serial.hpp deleted file mode 100644 index 5773a18b3f..0000000000 --- a/lib/kokkos/core/src/Kokkos_Serial.hpp +++ /dev/null @@ -1,892 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -/// \file Kokkos_Serial.hpp -/// \brief Declaration and definition of Kokkos::Serial device. - -#ifndef KOKKOS_SERIAL_HPP -#define KOKKOS_SERIAL_HPP - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#if defined( KOKKOS_HAVE_SERIAL ) - -namespace Kokkos { - -/// \class Serial -/// \brief Kokkos device for non-parallel execution -/// -/// A "device" represents a parallel execution model. It tells Kokkos -/// how to parallelize the execution of kernels in a parallel_for or -/// parallel_reduce. For example, the Threads device uses Pthreads or -/// C++11 threads on a CPU, the OpenMP device uses the OpenMP language -/// extensions, and the Cuda device uses NVIDIA's CUDA programming -/// model. The Serial device executes "parallel" kernels -/// sequentially. This is useful if you really do not want to use -/// threads, or if you want to explore different combinations of MPI -/// and shared-memory parallel programming models. -class Serial { -public: - //! \name Type declarations that all Kokkos devices must provide. - //@{ - - //! Tag this class as an execution space: - typedef Serial execution_space ; - //! The size_type typedef best suited for this device. - typedef HostSpace::size_type size_type ; - //! This device's preferred memory space. - typedef HostSpace memory_space ; - //! This execution space preferred device_type - typedef Kokkos::Device device_type; - - //! This device's preferred array layout. - typedef LayoutRight array_layout ; - - /// \brief Scratch memory space - typedef ScratchMemorySpace< Kokkos::Serial > scratch_memory_space ; - - //@} - - /// \brief True if and only if this method is being called in a - /// thread-parallel function. - /// - /// For the Serial device, this method always returns false, - /// because parallel_for or parallel_reduce with the Serial device - /// always execute sequentially. - inline static int in_parallel() { return false ; } - - /** \brief Set the device in a "sleep" state. - * - * This function sets the device in a "sleep" state in which it is - * not ready for work. This may consume less resources than if the - * device were in an "awake" state, but it may also take time to - * bring the device from a sleep state to be ready for work. - * - * \return True if the device is in the "sleep" state, else false if - * the device is actively working and could not enter the "sleep" - * state. - */ - static bool sleep(); - - /// \brief Wake the device from the 'sleep' state so it is ready for work. - /// - /// \return True if the device is in the "ready" state, else "false" - /// if the device is actively working (which also means that it's - /// awake). - static bool wake(); - - /// \brief Wait until all dispatched functors complete. - /// - /// The parallel_for or parallel_reduce dispatch of a functor may - /// return asynchronously, before the functor completes. This - /// method does not return until all dispatched functors on this - /// device have completed. - static void fence() {} - - static void initialize( unsigned threads_count = 1 , - unsigned use_numa_count = 0 , - unsigned use_cores_per_numa = 0 , - bool allow_asynchronous_threadpool = false) { - (void) threads_count; - (void) use_numa_count; - (void) use_cores_per_numa; - (void) allow_asynchronous_threadpool; - - // Init the array of locks used for arbitrarily sized atomics - Impl::init_lock_array_host_space(); - - } - - static int is_initialized() { return 1 ; } - - //! Free any resources being consumed by the device. - static void finalize() {} - - //! Print configuration information to the given output stream. - static void print_configuration( std::ostream & , const bool detail = false ) {} - - //-------------------------------------------------------------------------- - - inline static int thread_pool_size( int = 0 ) { return 1 ; } - KOKKOS_INLINE_FUNCTION static int thread_pool_rank() { return 0 ; } - - //-------------------------------------------------------------------------- - - KOKKOS_INLINE_FUNCTION static unsigned hardware_thread_id() { return thread_pool_rank(); } - inline static unsigned max_hardware_threads() { return thread_pool_size(0); } - - //-------------------------------------------------------------------------- - - static void * scratch_memory_resize( unsigned reduce_size , unsigned shared_size ); - - //-------------------------------------------------------------------------- -}; - -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -template<> -struct VerifyExecutionCanAccessMemorySpace - < Kokkos::Serial::memory_space - , Kokkos::Serial::scratch_memory_space - > -{ - enum { value = true }; - inline static void verify( void ) { } - inline static void verify( const void * ) { } -}; - -namespace SerialImpl { - -struct Sentinel { - - void * m_scratch ; - unsigned m_reduce_end ; - unsigned m_shared_end ; - - Sentinel(); - ~Sentinel(); - static Sentinel & singleton(); -}; - -inline -unsigned align( unsigned n ); -} -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -class SerialTeamMember { -private: - typedef Kokkos::ScratchMemorySpace< Kokkos::Serial > scratch_memory_space ; - const scratch_memory_space m_space ; - const int m_league_rank ; - const int m_league_size ; - - SerialTeamMember & operator = ( const SerialTeamMember & ); - -public: - - KOKKOS_INLINE_FUNCTION - const scratch_memory_space & team_shmem() const { return m_space ; } - - KOKKOS_INLINE_FUNCTION int league_rank() const { return m_league_rank ; } - KOKKOS_INLINE_FUNCTION int league_size() const { return m_league_size ; } - KOKKOS_INLINE_FUNCTION int team_rank() const { return 0 ; } - KOKKOS_INLINE_FUNCTION int team_size() const { return 1 ; } - - KOKKOS_INLINE_FUNCTION void team_barrier() const {} - - template - KOKKOS_INLINE_FUNCTION - void team_broadcast(const ValueType& , const int& ) const {} - - template< class ValueType, class JoinOp > - KOKKOS_INLINE_FUNCTION - ValueType team_reduce( const ValueType & value , const JoinOp & ) const - { - return value ; - } - - /** \brief Intra-team exclusive prefix sum with team_rank() ordering - * with intra-team non-deterministic ordering accumulation. - * - * The global inter-team accumulation value will, at the end of the - * league's parallel execution, be the scan's total. - * Parallel execution ordering of the league's teams is non-deterministic. - * As such the base value for each team's scan operation is similarly - * non-deterministic. - */ - template< typename Type > - KOKKOS_INLINE_FUNCTION Type team_scan( const Type & value , Type * const global_accum ) const - { - const Type tmp = global_accum ? *global_accum : Type(0) ; - if ( global_accum ) { *global_accum += value ; } - return tmp ; - } - - /** \brief Intra-team exclusive prefix sum with team_rank() ordering. - * - * The highest rank thread can compute the reduction total as - * reduction_total = dev.team_scan( value ) + value ; - */ - template< typename Type > - KOKKOS_INLINE_FUNCTION Type team_scan( const Type & ) const - { return Type(0); } - - //---------------------------------------- - // Execution space specific: - - SerialTeamMember( int arg_league_rank - , int arg_league_size - , int arg_shared_size - ); -}; - -} // namespace Impl - - -/* - * < Kokkos::Serial , WorkArgTag > - * < WorkArgTag , Impl::enable_if< Impl::is_same< Kokkos::Serial , Kokkos::DefaultExecutionSpace >::value >::type > - * - */ -template< class Arg0 , class Arg1 > -class TeamPolicy< Arg0 , Arg1 , Kokkos::Serial > -{ -private: - - const int m_league_size ; - -public: - - //! Tag this class as a kokkos execution policy - typedef TeamPolicy execution_policy ; - - //! Execution space of this execution policy: - typedef Kokkos::Serial execution_space ; - - typedef typename - Impl::if_c< ! Impl::is_same< Kokkos::Serial , Arg0 >::value , Arg0 , Arg1 >::type - work_tag ; - - //---------------------------------------- - - template< class FunctorType > - static - int team_size_max( const FunctorType & ) { return 1 ; } - - template< class FunctorType > - static - int team_size_recommended( const FunctorType & ) { return 1 ; } - - template< class FunctorType > - static - int team_size_recommended( const FunctorType & , const int& ) { return 1 ; } - - //---------------------------------------- - - inline int team_size() const { return 1 ; } - inline int league_size() const { return m_league_size ; } - - /** \brief Specify league size, request team size */ - TeamPolicy( execution_space & , int league_size_request , int /* team_size_request */ , int vector_length_request = 1 ) - : m_league_size( league_size_request ) - { (void) vector_length_request; } - - TeamPolicy( int league_size_request , int /* team_size_request */ , int vector_length_request = 1 ) - : m_league_size( league_size_request ) - { (void) vector_length_request; } - - typedef Impl::SerialTeamMember member_type ; -}; - -} /* namespace Kokkos */ - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelFor< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Serial > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Serial > Policy ; - -public: - // work tag is void - template< class PType > - inline - ParallelFor( typename Impl::enable_if< - ( Impl::is_same< PType , Policy >::value && - Impl::is_same< typename PType::work_tag , void >::value - ), const FunctorType & >::type functor - , const PType & policy ) - { - const typename PType::member_type e = policy.end(); - for ( typename PType::member_type i = policy.begin() ; i < e ; ++i ) { - functor( i ); - } - } - - // work tag is non-void - template< class PType > - inline - ParallelFor( typename Impl::enable_if< - ( Impl::is_same< PType , Policy >::value && - ! Impl::is_same< typename PType::work_tag , void >::value - ), const FunctorType & >::type functor - , const PType & policy ) - { - const typename PType::member_type e = policy.end(); - for ( typename PType::member_type i = policy.begin() ; i < e ; ++i ) { - functor( typename PType::work_tag() , i ); - } - } -}; - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelReduce< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Serial > > -{ -public: - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Serial > Policy ; - typedef typename Policy::work_tag WorkTag ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , WorkTag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , WorkTag > ValueInit ; - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - // Work tag is void - template< class ViewType , class PType > - ParallelReduce( typename Impl::enable_if< - ( Impl::is_view< ViewType >::value && - Impl::is_same< typename ViewType::memory_space , HostSpace >::value && - Impl::is_same< PType , Policy >::value && - Impl::is_same< typename PType::work_tag , void >::value - ), const FunctorType & >::type functor - , const PType & policy - , const ViewType & result - ) - { - pointer_type result_ptr = result.ptr_on_device(); - - if ( ! result_ptr ) { - result_ptr = (pointer_type) - Kokkos::Serial::scratch_memory_resize( ValueTraits::value_size( functor ) , 0 ); - } - - reference_type update = ValueInit::init( functor , result_ptr ); - - const typename PType::member_type e = policy.end(); - for ( typename PType::member_type i = policy.begin() ; i < e ; ++i ) { - functor( i , update ); - } - - Kokkos::Impl::FunctorFinal< FunctorType , WorkTag >::final( functor , result_ptr ); - } - - // Work tag is non-void - template< class ViewType , class PType > - ParallelReduce( typename Impl::enable_if< - ( Impl::is_view< ViewType >::value && - Impl::is_same< typename ViewType::memory_space , HostSpace >::value && - Impl::is_same< PType , Policy >::value && - ! Impl::is_same< typename PType::work_tag , void >::value - ), const FunctorType & >::type functor - , const PType & policy - , const ViewType & result - ) - { - pointer_type result_ptr = result.ptr_on_device(); - - if ( ! result_ptr ) { - result_ptr = (pointer_type) - Kokkos::Serial::scratch_memory_resize( ValueTraits::value_size( functor ) , 0 ); - } - - typename ValueTraits::reference_type update = ValueInit::init( functor , result_ptr ); - - const typename PType::member_type e = policy.end(); - for ( typename PType::member_type i = policy.begin() ; i < e ; ++i ) { - functor( typename PType::work_tag() , i , update ); - } - - Kokkos::Impl::FunctorFinal< FunctorType , WorkTag >::final( functor , result_ptr ); - } -}; - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelScan< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Serial > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Serial > Policy ; - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , typename Policy::work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , typename Policy::work_tag > ValueInit ; - -public: - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - // work tag is void - template< class PType > - inline - ParallelScan( typename Impl::enable_if< - ( Impl::is_same< PType , Policy >::value && - Impl::is_same< typename PType::work_tag , void >::value - ), const FunctorType & >::type functor - , const PType & policy ) - { - pointer_type result_ptr = (pointer_type) - Kokkos::Serial::scratch_memory_resize( ValueTraits::value_size( functor ) , 0 ); - - reference_type update = ValueInit::init( functor , result_ptr ); - - const typename PType::member_type e = policy.end(); - for ( typename PType::member_type i = policy.begin() ; i < e ; ++i ) { - functor( i , update , true ); - } - - Kokkos::Impl::FunctorFinal< FunctorType , typename Policy::work_tag >::final( functor , result_ptr ); - } - - // work tag is non-void - template< class PType > - inline - ParallelScan( typename Impl::enable_if< - ( Impl::is_same< PType , Policy >::value && - ! Impl::is_same< typename PType::work_tag , void >::value - ), const FunctorType & >::type functor - , const PType & policy ) - { - pointer_type result_ptr = (pointer_type) - Kokkos::Serial::scratch_memory_resize( ValueTraits::value_size( functor ) , 0 ); - - reference_type update = ValueInit::init( functor , result_ptr ); - - const typename PType::member_type e = policy.end(); - for ( typename PType::member_type i = policy.begin() ; i < e ; ++i ) { - functor( typename PType::work_tag() , i , update , true ); - } - - Kokkos::Impl::FunctorFinal< FunctorType , typename Policy::work_tag >::final( functor , result_ptr ); - } -}; - -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class Arg0 , class Arg1 > -class ParallelFor< FunctorType , Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::Serial > > -{ -private: - - typedef Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::Serial > Policy ; - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< Impl::is_same< TagType , void >::value , - const FunctorType & >::type functor - , const typename Policy::member_type & member ) - { functor( member ); } - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< ! Impl::is_same< TagType , void >::value , - const FunctorType & >::type functor - , const typename Policy::member_type & member ) - { functor( TagType() , member ); } - -public: - - ParallelFor( const FunctorType & functor - , const Policy & policy ) - { - const int shared_size = FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ); - - Kokkos::Serial::scratch_memory_resize( 0 , shared_size ); - - for ( int ileague = 0 ; ileague < policy.league_size() ; ++ileague ) { - ParallelFor::template driver< typename Policy::work_tag > - ( functor , typename Policy::member_type(ileague,policy.league_size(),shared_size) ); - // functor( typename Policy::member_type(ileague,policy.league_size(),shared_size) ); - } - } -}; - -template< class FunctorType , class Arg0 , class Arg1 > -class ParallelReduce< FunctorType , Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::Serial > > -{ -private: - - typedef Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::Serial > Policy ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , typename Policy::work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , typename Policy::work_tag > ValueInit ; - -public: - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - -private: - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< Impl::is_same< TagType , void >::value , - const FunctorType & >::type functor - , const typename Policy::member_type & member - , reference_type update ) - { functor( member , update ); } - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< ! Impl::is_same< TagType , void >::value , - const FunctorType & >::type functor - , const typename Policy::member_type & member - , reference_type update ) - { functor( TagType() , member , update ); } - -public: - - template< class ViewType > - ParallelReduce( const FunctorType & functor - , const Policy & policy - , const ViewType & result - ) - { - const int reduce_size = ValueTraits::value_size( functor ); - const int shared_size = FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ); - void * const scratch_reduce = Kokkos::Serial::scratch_memory_resize( reduce_size , shared_size ); - - const pointer_type result_ptr = - result.ptr_on_device() ? result.ptr_on_device() - : (pointer_type) scratch_reduce ; - - reference_type update = ValueInit::init( functor , result_ptr ); - - for ( int ileague = 0 ; ileague < policy.league_size() ; ++ileague ) { - ParallelReduce::template driver< typename Policy::work_tag > - ( functor , typename Policy::member_type(ileague,policy.league_size(),shared_size) , update ); - } - - Kokkos::Impl::FunctorFinal< FunctorType , typename Policy::work_tag >::final( functor , result_ptr ); - } -}; - -} // namespace Impl -} // namespace Kokkos - -namespace Kokkos { - -namespace Impl { - -template -struct TeamThreadRangeBoundariesStruct { - typedef iType index_type; - const iType begin ; - const iType end ; - enum {increment = 1}; - const SerialTeamMember& thread; - - KOKKOS_INLINE_FUNCTION - TeamThreadRangeBoundariesStruct (const SerialTeamMember& arg_thread, const iType& arg_count) - : begin(0) - , end(arg_count) - , thread(arg_thread) - {} - - KOKKOS_INLINE_FUNCTION - TeamThreadRangeBoundariesStruct (const SerialTeamMember& arg_thread, const iType& arg_begin, const iType & arg_end ) - : begin( arg_begin ) - , end( arg_end) - , thread( arg_thread ) - {} -}; - - template - struct ThreadVectorRangeBoundariesStruct { - typedef iType index_type; - enum {start = 0}; - const iType end; - enum {increment = 1}; - - KOKKOS_INLINE_FUNCTION - ThreadVectorRangeBoundariesStruct (const SerialTeamMember& thread, const iType& count): - end( count ) - {} - }; - -} // namespace Impl - -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct -TeamThreadRange( const Impl::SerialTeamMember& thread, const iType & count ) -{ - return Impl::TeamThreadRangeBoundariesStruct(thread,count); -} - -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct -TeamThreadRange( const Impl::SerialTeamMember& thread, const iType & begin , const iType & end ) -{ - return Impl::TeamThreadRangeBoundariesStruct(thread,begin,end); -} - -template -KOKKOS_INLINE_FUNCTION -Impl::ThreadVectorRangeBoundariesStruct - ThreadVectorRange(const Impl::SerialTeamMember& thread, const iType& count) { - return Impl::ThreadVectorRangeBoundariesStruct(thread,count); -} - -KOKKOS_INLINE_FUNCTION -Impl::ThreadSingleStruct PerTeam(const Impl::SerialTeamMember& thread) { - return Impl::ThreadSingleStruct(thread); -} - -KOKKOS_INLINE_FUNCTION -Impl::VectorSingleStruct PerThread(const Impl::SerialTeamMember& thread) { - return Impl::VectorSingleStruct(thread); -} - -} // namespace Kokkos - -namespace Kokkos { - - /** \brief Inter-thread parallel_for. Executes lambda(iType i) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all threads of the the calling thread team. - * This functionality requires C++11 support.*/ -template -KOKKOS_INLINE_FUNCTION -void parallel_for(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, const Lambda& lambda) { - for( iType i = loop_boundaries.begin; i < loop_boundaries.end; i+=loop_boundaries.increment) - lambda(i); -} - -/** \brief Inter-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all threads of the the calling thread team and a summation of - * val is performed and put into result. This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, - const Lambda & lambda, ValueType& result) { - - result = ValueType(); - - for( iType i = loop_boundaries.begin; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - result+=tmp; - } - - result = loop_boundaries.thread.team_reduce(result,Impl::JoinAdd()); -} - -#ifdef KOKKOS_HAVE_CXX11 - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a reduction of - * val is performed using JoinType(ValueType& val, const ValueType& update) and put into init_result. - * The input value of init_result is used as initializer for temporary variables of ValueType. Therefore - * the input value should be the neutral element with respect to the join operation (e.g. '0 for +-' or - * '1 for *'). This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType, class JoinType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, - const Lambda & lambda, const JoinType& join, ValueType& init_result) { - - ValueType result = init_result; - - for( iType i = loop_boundaries.begin; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - join(result,tmp); - } - - init_result = loop_boundaries.thread.team_reduce(result,Impl::JoinLambdaAdapter(join)); -} - -#endif // KOKKOS_HAVE_CXX11 - -} //namespace Kokkos - -namespace Kokkos { -/** \brief Intra-thread vector parallel_for. Executes lambda(iType i) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread. - * This functionality requires C++11 support.*/ -template -KOKKOS_INLINE_FUNCTION -void parallel_for(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda& lambda) { - #ifdef KOKKOS_HAVE_PRAGMA_IVDEP - #pragma ivdep - #endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) - lambda(i); -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a summation of - * val is performed and put into result. This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda & lambda, ValueType& result) { - result = ValueType(); -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - result+=tmp; - } -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a reduction of - * val is performed using JoinType(ValueType& val, const ValueType& update) and put into init_result. - * The input value of init_result is used as initializer for temporary variables of ValueType. Therefore - * the input value should be the neutral element with respect to the join operation (e.g. '0 for +-' or - * '1 for *'). This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType, class JoinType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda & lambda, const JoinType& join, ValueType& init_result) { - - ValueType result = init_result; -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - join(result,tmp); - } - init_result = result; -} - -/** \brief Intra-thread vector parallel exclusive prefix sum. Executes lambda(iType i, ValueType & val, bool final) - * for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes in the thread and a scan operation is performed. - * Depending on the target execution space the operator might be called twice: once with final=false - * and once with final=true. When final==true val contains the prefix sum value. The contribution of this - * "i" needs to be added to val no matter whether final==true or not. In a serial execution - * (i.e. team_size==1) the operator is only called once with final==true. Scan_val will be set - * to the final sum value over all vector lanes. - * This functionality requires C++11 support.*/ -template< typename iType, class FunctorType > -KOKKOS_INLINE_FUNCTION -void parallel_scan(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const FunctorType & lambda) { - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , void > ValueTraits ; - typedef typename ValueTraits::value_type value_type ; - - value_type scan_val = value_type(); - -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - lambda(i,scan_val,true); - } -} - -} // namespace Kokkos - -namespace Kokkos { - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::VectorSingleStruct& , const FunctorType& lambda) { - lambda(); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::ThreadSingleStruct& , const FunctorType& lambda) { - lambda(); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::VectorSingleStruct& , const FunctorType& lambda, ValueType& val) { - lambda(val); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::ThreadSingleStruct& , const FunctorType& lambda, ValueType& val) { - lambda(val); -} -} - -#endif // defined( KOKKOS_HAVE_SERIAL ) -#endif /* #define KOKKOS_SERIAL_HPP */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - diff --git a/lib/kokkos/core/src/Kokkos_TaskPolicy.hpp b/lib/kokkos/core/src/Kokkos_TaskPolicy.hpp deleted file mode 100644 index 6f6453fd46..0000000000 --- a/lib/kokkos/core/src/Kokkos_TaskPolicy.hpp +++ /dev/null @@ -1,376 +0,0 @@ - -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -// Experimental unified task-data parallel manycore LDRD - -#ifndef KOKKOS_TASKPOLICY_HPP -#define KOKKOS_TASKPOLICY_HPP - -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -struct FutureValueTypeIsVoidError {}; - -template < class ExecSpace , class ResultType , class FunctorType > -class TaskMember ; - -template< class ExecPolicy , class ResultType , class FunctorType > -class TaskForEach ; - -template< class ExecPolicy , class ResultType , class FunctorType > -class TaskReduce ; - -template< class ExecPolicy , class ResultType , class FunctorType > -struct TaskScan ; - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -/**\brief States of a task */ -enum TaskState - { TASK_STATE_NULL = 0 ///< Does not exist - , TASK_STATE_CONSTRUCTING = 1 ///< Is under construction - , TASK_STATE_WAITING = 2 ///< Is waiting for execution - , TASK_STATE_EXECUTING = 4 ///< Is executing - , TASK_STATE_COMPLETE = 8 ///< Execution is complete - }; - -/** - * - * Future< space > // value_type == void - * Future< value > // space == Default - * Future< value , space > - * - */ -template< class Arg1 = void , class Arg2 = void > -class Future { -private: - - template< class , class , class > friend class Impl::TaskMember ; - template< class > friend class TaskPolicy ; - template< class , class > friend class Future ; - - // Argument #2, if not void, must be the space. - enum { Arg1_is_space = Kokkos::Impl::is_execution_space< Arg1 >::value }; - enum { Arg2_is_space = Kokkos::Impl::is_execution_space< Arg2 >::value }; - enum { Arg2_is_void = Kokkos::Impl::is_same< Arg2 , void >::value }; - - struct ErrorNoExecutionSpace {}; - - enum { Opt1 = Arg1_is_space && Arg2_is_void - , Opt2 = ! Arg1_is_space && Arg2_is_void - , Opt3 = ! Arg1_is_space && Arg2_is_space - , OptOK = Kokkos::Impl::StaticAssert< Opt1 || Opt2 || Opt3 , ErrorNoExecutionSpace >::value - }; - - typedef typename - Kokkos::Impl::if_c< Opt2 || Opt3 , Arg1 , void >::type - ValueType ; - - typedef typename - Kokkos::Impl::if_c< Opt1 , Arg1 , typename - Kokkos::Impl::if_c< Opt2 , Kokkos::DefaultExecutionSpace , typename - Kokkos::Impl::if_c< Opt3 , Arg2 , void - >::type >::type >::type - ExecutionSpace ; - - typedef Impl::TaskMember< ExecutionSpace , void , void > TaskRoot ; - typedef Impl::TaskMember< ExecutionSpace , ValueType , void > TaskValue ; - - TaskRoot * m_task ; - -public: - - typedef ValueType value_type; - typedef ExecutionSpace execution_space ; - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION - TaskState get_task_state() const - { return 0 != m_task ? m_task->get_state() : TASK_STATE_NULL ; } - - //---------------------------------------- - - explicit - Future( TaskRoot * task ) - : m_task(0) - { TaskRoot::assign( & m_task , TaskRoot::template verify_type< value_type >( task ) ); } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION - ~Future() { TaskRoot::assign( & m_task , 0 ); } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION - Future() : m_task(0) {} - - KOKKOS_INLINE_FUNCTION - Future( const Future & rhs ) - : m_task(0) - { TaskRoot::assign( & m_task , rhs.m_task ); } - - KOKKOS_INLINE_FUNCTION - Future & operator = ( const Future & rhs ) - { TaskRoot::assign( & m_task , rhs.m_task ); return *this ; } - - //---------------------------------------- - - template< class A1 , class A2 > - KOKKOS_INLINE_FUNCTION - Future( const Future & rhs ) - : m_task(0) - { TaskRoot::assign( & m_task , TaskRoot::template verify_type< value_type >( rhs.m_task ) ); } - - template< class A1 , class A2 > - KOKKOS_INLINE_FUNCTION - Future & operator = ( const Future & rhs ) - { TaskRoot::assign( & m_task , TaskRoot::template verify_type< value_type >( rhs.m_task ) ); return *this ; } - - //---------------------------------------- - - typedef typename TaskValue::get_result_type get_result_type ; - - KOKKOS_INLINE_FUNCTION - get_result_type get() const - { return static_cast( m_task )->get(); } -}; - -namespace Impl { - -template< class T > -struct is_future : public Kokkos::Impl::bool_< false > {}; - -template< class Arg0 , class Arg1 > -struct is_future< Kokkos::Experimental::Future > : public Kokkos::Impl::bool_< true > {}; - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -/** \brief If the argument is an execution space then a serial task in that space */ -template< class Arg0 = Kokkos::DefaultExecutionSpace > -class TaskPolicy { -public: - - typedef typename Arg0::execution_space execution_space ; - - //---------------------------------------- - /** \brief Create a serial task with storage for dependences. - * - * Postcondition: Task is in the 'constructing' state. - */ - template< class FunctorType > - Future< typename FunctorType::value_type , execution_space > - create( const FunctorType & functor - , const unsigned dependence_capacity /* = default */ ) const ; - - /** \brief Create a foreach task with storage for dependences. */ - template< class ExecPolicy , class FunctorType > - Future< typename FunctorType::value_type , execution_space > - create_foreach( const ExecPolicy & policy - , const FunctorType & functor - , const unsigned dependence_capacity /* = default */ ) const ; - - /** \brief Create a reduce task with storage for dependences. */ - template< class ExecPolicy , class FunctorType > - Future< typename FunctorType::value_type , execution_space > - create_reduce( const ExecPolicy & policy - , const FunctorType & functor - , const unsigned dependence_capacity /* = default */ ) const ; - - /** \brief Create a scan task with storage for dependences. */ - template< class ExecPolicy , class FunctorType > - Future< typename FunctorType::value_type , execution_space > - create_scan( const ExecPolicy & policy - , const FunctorType & functor - , const unsigned dependence_capacity /* = default */ ) const ; - - /** \brief Set dependence that 'after' cannot start execution - * until 'before' has completed. - * - * Precondition: The 'after' task must be in then 'Constructing' state. - */ - template< class TA , class TB > - void set_dependence( const Future & after - , const Future & before ) const ; - - /** \brief Spawn a task in the 'Constructing' state - * - * Precondition: Task is in the 'constructing' state. - * Postcondition: Task is waiting, executing, or complete. - */ - template< class T > - const Future & - spawn( const Future & ) const ; - - //---------------------------------------- - /** \brief Query dependence of an executing task */ - - template< class FunctorType > - Future< execution_space > - get_dependence( FunctorType * , const int ) const ; - - //---------------------------------------- - /** \brief Clear current dependences of an executing task - * in preparation for setting new dependences and - * respawning. - * - * Precondition: The functor must be a task in the executing state. - */ - template< class FunctorType > - void clear_dependence( FunctorType * ) const ; - - /** \brief Set dependence that 'after' cannot start execution - * until 'before' has completed. - * - * The 'after' functor must be in the executing state - */ - template< class FunctorType , class TB > - void set_dependence( FunctorType * after - , const Future & before ) const ; - - /** \brief Respawn (reschedule) an executing task to be called again - * after all dependences have completed. - */ - template< class FunctorType > - void respawn( FunctorType * ) const ; -}; - -//---------------------------------------------------------------------------- -/** \brief Create and spawn a single-thread task */ -template< class ExecSpace , class FunctorType > -inline -Future< typename FunctorType::value_type , ExecSpace > -spawn( TaskPolicy & policy , const FunctorType & functor ) -{ return policy.spawn( policy.create( functor ) ); } - -/** \brief Create and spawn a single-thread task with dependences */ -template< class ExecSpace , class FunctorType , class Arg0 , class Arg1 > -inline -Future< typename FunctorType::value_type , ExecSpace > -spawn( TaskPolicy & policy - , const FunctorType & functor - , const Future & before_0 - , const Future & before_1 ) -{ - Future< typename FunctorType::value_type , ExecSpace > f ; - f = policy.create( functor , 2 ); - policy.add_dependence( f , before_0 ); - policy.add_dependence( f , before_1 ); - policy.spawn( f ); - return f ; -} - -//---------------------------------------------------------------------------- -/** \brief Create and spawn a parallel_for task */ -template< class ExecSpace , class ParallelPolicyType , class FunctorType > -inline -Future< typename FunctorType::value_type , ExecSpace > -spawn_foreach( TaskPolicy & task_policy - , const ParallelPolicyType & parallel_policy - , const FunctorType & functor ) -{ return task_policy.spawn( task_policy.create_foreach( parallel_policy , functor ) ); } - -/** \brief Create and spawn a parallel_reduce task */ -template< class ExecSpace , class ParallelPolicyType , class FunctorType > -inline -Future< typename FunctorType::value_type , ExecSpace > -spawn_reduce( TaskPolicy & task_policy - , const ParallelPolicyType & parallel_policy - , const FunctorType & functor ) -{ return task_policy.spawn( task_policy.create_reduce( parallel_policy , functor ) ); } - -//---------------------------------------------------------------------------- -/** \brief Respawn a task functor with dependences */ -template< class ExecSpace , class FunctorType , class Arg0 , class Arg1 > -inline -void respawn( TaskPolicy & policy - , FunctorType * functor - , const Future & before_0 - , const Future & before_1 - ) -{ - policy.clear_dependence( functor ); - policy.add_dependence( functor , before_0 ); - policy.add_dependence( functor , before_1 ); - policy.respawn( functor ); -} - -//---------------------------------------------------------------------------- - -template< class ExecSpace > -void wait( TaskPolicy< ExecSpace > & ); - -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #define KOKKOS_TASKPOLICY_HPP */ - diff --git a/lib/kokkos/core/src/Kokkos_Threads.hpp b/lib/kokkos/core/src/Kokkos_Threads.hpp deleted file mode 100644 index 4661b714b2..0000000000 --- a/lib/kokkos/core/src/Kokkos_Threads.hpp +++ /dev/null @@ -1,217 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_THREADS_HPP -#define KOKKOS_THREADS_HPP - -#include - -#if defined( KOKKOS_HAVE_PTHREAD ) - -#include -#include -#include -#include -#include -#include -#include - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { -class ThreadsExec ; -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -/** \brief Execution space for a pool of Pthreads or C11 threads on a CPU. */ -class Threads { -public: - //! \name Type declarations that all Kokkos devices must provide. - //@{ - //! Tag this class as a kokkos execution space - typedef Threads execution_space ; - typedef Kokkos::HostSpace memory_space ; - - //! This execution space preferred device_type - typedef Kokkos::Device device_type; - - typedef Kokkos::LayoutRight array_layout ; - typedef memory_space::size_type size_type ; - - typedef ScratchMemorySpace< Threads > scratch_memory_space ; - - - //@} - /*------------------------------------------------------------------------*/ - //! \name Static functions that all Kokkos devices must implement. - //@{ - - /// \brief True if and only if this method is being called in a - /// thread-parallel function. - static int in_parallel(); - - /** \brief Set the device in a "sleep" state. - * - * This function sets the device in a "sleep" state in which it is - * not ready for work. This may consume less resources than if the - * device were in an "awake" state, but it may also take time to - * bring the device from a sleep state to be ready for work. - * - * \return True if the device is in the "sleep" state, else false if - * the device is actively working and could not enter the "sleep" - * state. - */ - static bool sleep(); - - /// \brief Wake the device from the 'sleep' state so it is ready for work. - /// - /// \return True if the device is in the "ready" state, else "false" - /// if the device is actively working (which also means that it's - /// awake). - static bool wake(); - - /// \brief Wait until all dispatched functors complete. - /// - /// The parallel_for or parallel_reduce dispatch of a functor may - /// return asynchronously, before the functor completes. This - /// method does not return until all dispatched functors on this - /// device have completed. - static void fence(); - - /// \brief Free any resources being consumed by the device. - /// - /// For the Threads device, this terminates spawned worker threads. - static void finalize(); - - /// \brief Print configuration information to the given output stream. - static void print_configuration( std::ostream & , const bool detail = false ); - - //@} - /*------------------------------------------------------------------------*/ - /*------------------------------------------------------------------------*/ - //! \name Space-specific functions - //@{ - - /** \brief Initialize the device in the "ready to work" state. - * - * The device is initialized in a "ready to work" or "awake" state. - * This state reduces latency and thus improves performance when - * dispatching work. However, the "awake" state consumes resources - * even when no work is being done. You may call sleep() to put - * the device in a "sleeping" state that does not consume as many - * resources, but it will take time (latency) to awaken the device - * again (via the wake()) method so that it is ready for work. - * - * Teams of threads are distributed as evenly as possible across - * the requested number of numa regions and cores per numa region. - * A team will not be split across a numa region. - * - * If the 'use_' arguments are not supplied the hwloc is queried - * to use all available cores. - */ - static void initialize( unsigned threads_count = 0 , - unsigned use_numa_count = 0 , - unsigned use_cores_per_numa = 0 , - bool allow_asynchronous_threadpool = false ); - - static int is_initialized(); - - static Threads & instance( int = 0 ); - - //---------------------------------------- - - static int thread_pool_size( int depth = 0 ); -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - static int thread_pool_rank(); -#else - KOKKOS_INLINE_FUNCTION static int thread_pool_rank() { return 0 ; } -#endif - - inline static unsigned max_hardware_threads() { return thread_pool_size(0); } - KOKKOS_INLINE_FUNCTION static unsigned hardware_thread_id() { return thread_pool_rank(); } - - //@} - //---------------------------------------- -}; - -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -template<> -struct VerifyExecutionCanAccessMemorySpace - < Kokkos::Threads::memory_space - , Kokkos::Threads::scratch_memory_space - > -{ - enum { value = true }; - inline static void verify( void ) { } - inline static void verify( const void * ) { } -}; - -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ - -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #if defined( KOKKOS_HAVE_PTHREAD ) */ -#endif /* #define KOKKOS_THREADS_HPP */ - - diff --git a/lib/kokkos/core/src/Kokkos_Vectorization.hpp b/lib/kokkos/core/src/Kokkos_Vectorization.hpp deleted file mode 100644 index a60c0ecaa7..0000000000 --- a/lib/kokkos/core/src/Kokkos_Vectorization.hpp +++ /dev/null @@ -1,53 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -/// \file Kokkos_Vectorization.hpp -/// \brief Declaration and definition of Kokkos::Vectorization interface. -#ifndef KOKKOS_VECTORIZATION_HPP -#define KOKKOS_VECTORIZATION_HPP - -#if defined( KOKKOS_HAVE_CUDA ) -#include -#endif - -#endif diff --git a/lib/kokkos/core/src/Kokkos_View.hpp b/lib/kokkos/core/src/Kokkos_View.hpp deleted file mode 100644 index 531218b5d0..0000000000 --- a/lib/kokkos/core/src/Kokkos_View.hpp +++ /dev/null @@ -1,2120 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_VIEW_HPP -#define KOKKOS_VIEW_HPP - -#include -#include -#include -#include -#include - -#if ! defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - -#include -#include -#include -#include -#include - -// Must define before includng -namespace Kokkos { struct ALL ; } - -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -/** \brief View specialization mapping of view traits to a specialization tag */ -template< class ValueType , - class ArraySpecialize , - class ArrayLayout , - class MemorySpace , - class MemoryTraits > -struct ViewSpecialize ; - -/** \brief Defines the type of a subview given a source view type - * and subview argument types. - */ -template< class SrcViewType - , class Arg0Type - , class Arg1Type - , class Arg2Type - , class Arg3Type - , class Arg4Type - , class Arg5Type - , class Arg6Type - , class Arg7Type - > -struct ViewSubview /* { typedef ... type ; } */ ; - -template< class DstViewSpecialize , - class SrcViewSpecialize = void , - class Enable = void > -struct ViewAssignment ; - -template< class DstMemorySpace , class SrcMemorySpace , class ExecutionSpace> -struct DeepCopy ; - -} /* namespace Impl */ -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -/** \class ViewTraits - * \brief Traits class for accessing attributes of a View. - * - * This is an implementation detail of View. It is only of interest - * to developers implementing a new specialization of View. - * - * Template argument permutations: - * - View< DataType , void , void , void > - * - View< DataType , Space , void , void > - * - View< DataType , Space , MemoryTraits , void > - * - View< DataType , Space , void , MemoryTraits > - * - View< DataType , ArrayLayout , void , void > - * - View< DataType , ArrayLayout , Space , void > - * - View< DataType , ArrayLayout , MemoryTraits , void > - * - View< DataType , ArrayLayout , Space , MemoryTraits > - * - View< DataType , MemoryTraits , void , void > - */ - -template< class DataType , - class Arg1 = void , - class Arg2 = void , - class Arg3 = void > -class ViewTraits { -private: - - // Layout, Space, and MemoryTraits are optional - // but need to appear in that order. That means Layout - // can only be Arg1, Space can be Arg1 or Arg2, and - // MemoryTraits can be Arg1, Arg2 or Arg3 - - enum { Arg1IsLayout = Impl::is_array_layout::value }; - - enum { Arg1IsSpace = Impl::is_space::value }; - enum { Arg2IsSpace = Impl::is_space::value }; - - enum { Arg1IsMemoryTraits = Impl::is_memory_traits::value }; - enum { Arg2IsMemoryTraits = Impl::is_memory_traits::value }; - enum { Arg3IsMemoryTraits = Impl::is_memory_traits::value }; - - enum { Arg1IsVoid = Impl::is_same< Arg1 , void >::value }; - enum { Arg2IsVoid = Impl::is_same< Arg2 , void >::value }; - enum { Arg3IsVoid = Impl::is_same< Arg3 , void >::value }; - - // Arg1 is Layout, Space, MemoryTraits, or void - typedef typename - Impl::StaticAssert< - ( 1 == Arg1IsLayout + Arg1IsSpace + Arg1IsMemoryTraits + Arg1IsVoid ) - , Arg1 >::type Arg1Verified ; - - // If Arg1 is Layout then Arg2 is Space, MemoryTraits, or void - // If Arg1 is Space then Arg2 is MemoryTraits or void - // If Arg1 is MemoryTraits then Arg2 is void - // If Arg1 is Void then Arg2 is void - typedef typename - Impl::StaticAssert< - ( Arg1IsLayout && ( 1 == Arg2IsSpace + Arg2IsMemoryTraits + Arg2IsVoid ) ) || - ( Arg1IsSpace && ( 0 == Arg2IsSpace ) && ( 1 == Arg2IsMemoryTraits + Arg2IsVoid ) ) || - ( Arg1IsMemoryTraits && Arg2IsVoid ) || - ( Arg1IsVoid && Arg2IsVoid ) - , Arg2 >::type Arg2Verified ; - - // Arg3 is MemoryTraits or void and at most one argument is MemoryTraits - typedef typename - Impl::StaticAssert< - ( 1 == Arg3IsMemoryTraits + Arg3IsVoid ) && - ( Arg1IsMemoryTraits + Arg2IsMemoryTraits + Arg3IsMemoryTraits <= 1 ) - , Arg3 >::type Arg3Verified ; - - // Arg1 or Arg2 may have execution and memory spaces - typedef typename Impl::if_c<( Arg1IsSpace ), Arg1Verified , - typename Impl::if_c<( Arg2IsSpace ), Arg2Verified , - Kokkos::DefaultExecutionSpace - >::type >::type::execution_space ExecutionSpace ; - - typedef typename Impl::if_c<( Arg1IsSpace ), Arg1Verified , - typename Impl::if_c<( Arg2IsSpace ), Arg2Verified , - Kokkos::DefaultExecutionSpace - >::type >::type::memory_space MemorySpace ; - - typedef typename Impl::is_space< - typename Impl::if_c<( Arg1IsSpace ), Arg1Verified , - typename Impl::if_c<( Arg2IsSpace ), Arg2Verified , - Kokkos::DefaultExecutionSpace - >::type >::type >::host_mirror_space HostMirrorSpace ; - - // Arg1 may be array layout - typedef typename Impl::if_c< Arg1IsLayout , Arg1Verified , - typename ExecutionSpace::array_layout - >::type ArrayLayout ; - - // Arg1, Arg2, or Arg3 may be memory traits - typedef typename Impl::if_c< Arg1IsMemoryTraits , Arg1Verified , - typename Impl::if_c< Arg2IsMemoryTraits , Arg2Verified , - typename Impl::if_c< Arg3IsMemoryTraits , Arg3Verified , - MemoryManaged - >::type >::type >::type MemoryTraits ; - - typedef Impl::AnalyzeShape analysis ; - -public: - - //------------------------------------ - // Data type traits: - - typedef DataType data_type ; - typedef typename analysis::const_type const_data_type ; - typedef typename analysis::non_const_type non_const_data_type ; - - //------------------------------------ - // Array of intrinsic scalar type traits: - - typedef typename analysis::array_intrinsic_type array_intrinsic_type ; - typedef typename analysis::const_array_intrinsic_type const_array_intrinsic_type ; - typedef typename analysis::non_const_array_intrinsic_type non_const_array_intrinsic_type ; - - //------------------------------------ - // Value type traits: - - typedef typename analysis::value_type value_type ; - typedef typename analysis::const_value_type const_value_type ; - typedef typename analysis::non_const_value_type non_const_value_type ; - - //------------------------------------ - // Layout and shape traits: - - typedef ArrayLayout array_layout ; - typedef typename analysis::shape shape_type ; - - enum { rank = shape_type::rank }; - enum { rank_dynamic = shape_type::rank_dynamic }; - - //------------------------------------ - // Execution space, memory space, memory access traits, and host mirror space. - - typedef ExecutionSpace execution_space ; - typedef MemorySpace memory_space ; - typedef Device device_type ; - typedef MemoryTraits memory_traits ; - typedef HostMirrorSpace host_mirror_space ; - - typedef typename memory_space::size_type size_type ; - - enum { is_hostspace = Impl::is_same< memory_space , HostSpace >::value }; - enum { is_managed = memory_traits::Unmanaged == 0 }; - enum { is_random_access = memory_traits::RandomAccess == 1 }; - - //------------------------------------ - - - //------------------------------------ - // Specialization tag: - - typedef typename - Impl::ViewSpecialize< value_type - , typename analysis::specialize - , array_layout - , memory_space - , memory_traits - >::type specialize ; -}; - -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -class ViewDefault {}; - -/** \brief Default view specialization has LayoutLeft, LayoutRight, or LayoutStride. - */ -template< class ValueType , class MemorySpace , class MemoryTraits > -struct ViewSpecialize< ValueType , void , LayoutLeft , MemorySpace , MemoryTraits > -{ typedef ViewDefault type ; }; - -template< class ValueType , class MemorySpace , class MemoryTraits > -struct ViewSpecialize< ValueType , void , LayoutRight , MemorySpace , MemoryTraits > -{ typedef ViewDefault type ; }; - -template< class ValueType , class MemorySpace , class MemoryTraits > -struct ViewSpecialize< ValueType , void , LayoutStride , MemorySpace , MemoryTraits > -{ typedef ViewDefault type ; }; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -/** \brief Types for compile-time detection of View usage errors */ -namespace ViewError { - -struct allocation_constructor_requires_managed {}; -struct allocation_constructor_requires_nonconst {}; -struct user_pointer_constructor_requires_unmanaged {}; -struct device_shmem_constructor_requires_unmanaged {}; - -struct scalar_operator_called_from_non_scalar_view {}; - -} /* namespace ViewError */ - -//---------------------------------------------------------------------------- -/** \brief Enable view parentheses operator for - * match of layout and integral arguments. - * If correct rank define type from traits, - * otherwise define type as an error message. - */ -template< class ReturnType , class Traits , class Layout , unsigned Rank , - typename iType0 = int , typename iType1 = int , - typename iType2 = int , typename iType3 = int , - typename iType4 = int , typename iType5 = int , - typename iType6 = int , typename iType7 = int , - class Enable = void > -struct ViewEnableArrayOper ; - -template< class ReturnType , class Traits , class Layout , unsigned Rank , - typename iType0 , typename iType1 , - typename iType2 , typename iType3 , - typename iType4 , typename iType5 , - typename iType6 , typename iType7 > -struct ViewEnableArrayOper< - ReturnType , Traits , Layout , Rank , - iType0 , iType1 , iType2 , iType3 , - iType4 , iType5 , iType6 , iType7 , - typename enable_if< - iType0(0) == 0 && iType1(0) == 0 && iType2(0) == 0 && iType3(0) == 0 && - iType4(0) == 0 && iType5(0) == 0 && iType6(0) == 0 && iType7(0) == 0 && - is_same< typename Traits::array_layout , Layout >::value && - ( unsigned(Traits::rank) == Rank ) - >::type > -{ - typedef ReturnType type ; -}; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -/** \class View - * \brief View to an array of data. - * - * A View represents an array of one or more dimensions. - * For details, please refer to Kokkos' tutorial materials. - * - * \section Kokkos_View_TemplateParameters Template parameters - * - * This class has both required and optional template parameters. The - * \c DataType parameter must always be provided, and must always be - * first. The parameters \c Arg1Type, \c Arg2Type, and \c Arg3Type are - * placeholders for different template parameters. The default value - * of the fifth template parameter \c Specialize suffices for most use - * cases. When explaining the template parameters, we won't refer to - * \c Arg1Type, \c Arg2Type, and \c Arg3Type; instead, we will refer - * to the valid categories of template parameters, in whatever order - * they may occur. - * - * Valid ways in which template arguments may be specified: - * - View< DataType , Space > - * - View< DataType , Space , MemoryTraits > - * - View< DataType , Space , void , MemoryTraits > - * - View< DataType , Layout , Space > - * - View< DataType , Layout , Space , MemoryTraits > - * - * \tparam DataType (required) This indicates both the type of each - * entry of the array, and the combination of compile-time and - * run-time array dimension(s). For example, double* - * indicates a one-dimensional array of \c double with run-time - * dimension, and int*[3] a two-dimensional array of \c int - * with run-time first dimension and compile-time second dimension - * (of 3). In general, the run-time dimensions (if any) must go - * first, followed by zero or more compile-time dimensions. For - * more examples, please refer to the tutorial materials. - * - * \tparam Space (required) The memory space. - * - * \tparam Layout (optional) The array's layout in memory. For - * example, LayoutLeft indicates a column-major (Fortran style) - * layout, and LayoutRight a row-major (C style) layout. If not - * specified, this defaults to the preferred layout for the - * Space. - * - * \tparam MemoryTraits (optional) Assertion of the user's intended - * access behavior. For example, RandomAccess indicates read-only - * access with limited spatial locality, and Unmanaged lets users - * wrap externally allocated memory in a View without automatic - * deallocation. - * - * \section Kokkos_View_MT MemoryTraits discussion - * - * \subsection Kokkos_View_MT_Interp MemoryTraits interpretation depends on Space - * - * Some \c MemoryTraits options may have different interpretations for - * different \c Space types. For example, with the Cuda device, - * \c RandomAccess tells Kokkos to fetch the data through the texture - * cache, whereas the non-GPU devices have no such hardware construct. - * - * \subsection Kokkos_View_MT_PrefUse Preferred use of MemoryTraits - * - * Users should defer applying the optional \c MemoryTraits parameter - * until the point at which they actually plan to rely on it in a - * computational kernel. This minimizes the number of template - * parameters exposed in their code, which reduces the cost of - * compilation. Users may always assign a View without specified - * \c MemoryTraits to a compatible View with that specification. - * For example: - * \code - * // Pass in the simplest types of View possible. - * void - * doSomething (View out, - * View in) - * { - * // Assign the "generic" View in to a RandomAccess View in_rr. - * // Note that RandomAccess View objects must have const data. - * View in_rr = in; - * // ... do something with in_rr and out ... - * } - * \endcode - */ -template< class DataType , - class Arg1Type = void , /* ArrayLayout, SpaceType, or MemoryTraits */ - class Arg2Type = void , /* SpaceType or MemoryTraits */ - class Arg3Type = void , /* MemoryTraits */ - class Specialize = - typename ViewTraits::specialize > -class View ; - -namespace Impl { - -template< class C > -struct is_view : public bool_< false > {}; - -template< class D , class A1 , class A2 , class A3 , class S > -struct is_view< View< D , A1 , A2 , A3 , S > > : public bool_< true > {}; - -} - -//---------------------------------------------------------------------------- - -template< class DataType , - class Arg1Type , - class Arg2Type , - class Arg3Type > -class View< DataType , Arg1Type , Arg2Type , Arg3Type , Impl::ViewDefault > - : public ViewTraits< DataType , Arg1Type , Arg2Type, Arg3Type > -{ -public: - - typedef ViewTraits< DataType , Arg1Type , Arg2Type, Arg3Type > traits ; - -private: - - // Assignment of compatible views requirement: - template< class , class , class , class , class > friend class View ; - - // Assignment of compatible subview requirement: - template< class , class , class > friend struct Impl::ViewAssignment ; - - // Dimensions, cardinality, capacity, and offset computation for - // multidimensional array view of contiguous memory. - // Inherits from Impl::Shape - typedef Impl::ViewOffset< typename traits::shape_type - , typename traits::array_layout - > offset_map_type ; - - // Intermediary class for data management and access - typedef Impl::ViewDataManagement< traits > view_data_management ; - - //---------------------------------------- - // Data members: - - typename view_data_management::handle_type m_ptr_on_device ; - offset_map_type m_offset_map ; - view_data_management m_management ; - Impl::AllocationTracker m_tracker ; - - //---------------------------------------- - -public: - - /** return type for all indexing operators */ - typedef typename view_data_management::return_type reference_type ; - - enum { reference_type_is_lvalue = view_data_management::ReturnTypeIsReference }; - - typedef View< typename traits::array_intrinsic_type , - typename traits::array_layout , - typename traits::device_type , - typename traits::memory_traits > array_type ; - - typedef View< typename traits::const_data_type , - typename traits::array_layout , - typename traits::device_type , - typename traits::memory_traits > const_type ; - - typedef View< typename traits::non_const_data_type , - typename traits::array_layout , - typename traits::device_type , - typename traits::memory_traits > non_const_type ; - - typedef View< typename traits::non_const_data_type , - typename traits::array_layout , - typename traits::host_mirror_space , - void > HostMirror ; - - //------------------------------------ - // Shape - - enum { Rank = traits::rank }; - - KOKKOS_INLINE_FUNCTION offset_map_type shape() const { return m_offset_map ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_0() const { return m_offset_map.N0 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_1() const { return m_offset_map.N1 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_2() const { return m_offset_map.N2 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_3() const { return m_offset_map.N3 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_4() const { return m_offset_map.N4 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_5() const { return m_offset_map.N5 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_6() const { return m_offset_map.N6 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_7() const { return m_offset_map.N7 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type size() const { return m_offset_map.cardinality(); } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - typename traits::size_type dimension( const iType & i ) const - { return Impl::dimension( m_offset_map , i ); } - - //------------------------------------ - // Destructor, constructors, assignment operators: - - KOKKOS_INLINE_FUNCTION - ~View() {} - - KOKKOS_INLINE_FUNCTION - View() - : m_ptr_on_device() - , m_offset_map() - , m_management() - , m_tracker() - { m_offset_map.assign(0, 0,0,0,0,0,0,0,0); } - - KOKKOS_INLINE_FUNCTION - View( const View & rhs ) - : m_ptr_on_device() - , m_offset_map() - , m_management() - , m_tracker() - { - (void) Impl::ViewAssignment< - typename traits::specialize , - typename traits::specialize >( *this , rhs ); - } - - KOKKOS_INLINE_FUNCTION - View & operator = ( const View & rhs ) - { - (void) Impl::ViewAssignment< - typename traits::specialize , - typename traits::specialize >( *this , rhs ); - return *this ; - } - - //------------------------------------ - // Construct or assign compatible view: - - template< class RT , class RL , class RD , class RM , class RS > - KOKKOS_INLINE_FUNCTION - View( const View & rhs ) - : m_ptr_on_device() - , m_offset_map() - , m_management() - , m_tracker() - { - (void) Impl::ViewAssignment< - typename traits::specialize , RS >( *this , rhs ); - } - - template< class RT , class RL , class RD , class RM , class RS > - KOKKOS_INLINE_FUNCTION - View & operator = ( const View & rhs ) - { - (void) Impl::ViewAssignment< - typename traits::specialize , RS >( *this , rhs ); - return *this ; - } - - //------------------------------------ - /**\brief Allocation of a managed view with possible alignment padding. - * - * Allocation properties for allocating and initializing to the default value_type: - * Kokkos::ViewAllocate() - * Kokkos::ViewAllocate("label") OR "label" - * Kokkos::ViewAllocate(std::string("label")) OR std::string("label") - * - * Allocation properties for allocating and bypassing initialization: - * Kokkos::ViewAllocateWithoutInitializing() - * Kokkos::ViewAllocateWithoutInitializing("label") - */ - - template< class AllocationProperties > - explicit inline - View( const AllocationProperties & prop , - // Impl::ViewAllocProp::size_type exists when the traits and allocation properties - // are valid for allocating viewed memory. - const typename Impl::ViewAllocProp< traits , AllocationProperties >::size_type n0 = 0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 , - const size_t n8 = 0 ) - : m_ptr_on_device() - , m_offset_map() - , m_management() - , m_tracker() - { - typedef Impl::ViewAllocProp< traits , AllocationProperties > Alloc ; - - static_assert(!std::is_same::value, - "LayoutStride does not support View constructor which takes dimensions directly!"); - - m_offset_map.assign( n0, n1, n2, n3, n4, n5, n6, n7, n8 ); - if(Alloc::AllowPadding) - m_offset_map.set_padding(); - - m_ptr_on_device = view_data_management::template allocate< Alloc::Initialize >( Alloc::label(prop) , m_offset_map, m_tracker ); - - } - - template< class AllocationProperties > - explicit inline - View( const AllocationProperties & prop , - const typename traits::array_layout & layout , - // Impl::ViewAllocProp::size_type exists when the traits and allocation properties - // are valid for allocating viewed memory. - const typename Impl::ViewAllocProp< traits , AllocationProperties >::size_type = 0 ) - : m_ptr_on_device() - , m_offset_map() - , m_management() - , m_tracker() - { - typedef Impl::ViewAllocProp< traits , AllocationProperties > Alloc ; - - m_offset_map.assign( layout ); - if(Alloc::AllowPadding) - m_offset_map.set_padding(); - - m_ptr_on_device = view_data_management::template allocate< Alloc::Initialize >( Alloc::label(prop) , m_offset_map, m_tracker ); - - m_management.set_noncontiguous(); - } - - //------------------------------------ - // Assign an unmanaged View from pointer, can be called in functors. - // No alignment padding is performed. - - template< class Type > - explicit KOKKOS_INLINE_FUNCTION - View( Type * ptr , - typename Impl::ViewRawPointerProp< traits , Type >::size_type n0 = 0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 , - const size_t n8 = 0 ) - : m_ptr_on_device(ptr) - , m_offset_map() - , m_management() - , m_tracker() - { - m_offset_map.assign( n0, n1, n2, n3, n4, n5, n6, n7, n8 ); - m_management.set_unmanaged(); - } - - template< class Type > - explicit KOKKOS_INLINE_FUNCTION - View( Type * ptr , - typename traits::array_layout const & layout , - typename Impl::ViewRawPointerProp< traits , Type >::size_type = 0 ) - : m_ptr_on_device(ptr) - , m_offset_map() - , m_management() - , m_tracker() - { - m_offset_map.assign( layout ); - m_management.set_unmanaged(); - m_management.set_noncontiguous(); - } - - - - //------------------------------------ - // Assign a View from an AllocationTracker, - // The allocator used must be compatiable with the memory space of the view - // No alignment padding is performed. - // TODO: Should these allow padding??? DJS 01/15/15 - explicit - View( Impl::AllocationTracker const &arg_tracker , - const size_t n0 = 0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 , - const size_t n8 = 0 ) - : m_ptr_on_device(reinterpret_cast(arg_tracker.alloc_ptr())) - , m_offset_map() - , m_management() - , m_tracker(arg_tracker) - { - m_offset_map.assign( n0, n1, n2, n3, n4, n5, n6, n7, n8 ); - - const size_t req_size = m_offset_map.capacity() * sizeof(typename traits::value_type); - if ( m_tracker.alloc_size() < req_size ) { - Impl::throw_runtime_exception("Error: tracker.alloc_size() < req_size"); - } - } - - explicit - View( Impl::AllocationTracker const & arg_tracker - , typename traits::array_layout const & layout ) - : m_ptr_on_device(reinterpret_cast(arg_tracker.alloc_ptr())) - , m_offset_map() - , m_management() - , m_tracker(arg_tracker) - { - m_offset_map.assign( layout ); - - const size_t req_size = m_offset_map.capacity() * sizeof(typename traits::value_type); - if ( m_tracker.alloc_size() < req_size ) { - Impl::throw_runtime_exception("Error: tracker.alloc_size() < req_size"); - } - - m_management.set_noncontiguous(); - } - - //------------------------------------ - /** \brief Constructors for subviews requires following - * type-compatibility condition, enforce via StaticAssert. - * - * Impl::is_same< View , - * typename Impl::ViewSubview< View - * , ArgType0 , ArgType1 , ArgType2 , ArgType3 - * , ArgType4 , ArgType5 , ArgType6 , ArgType7 - * >::type >::value - */ - template< class D , class A1 , class A2 , class A3 - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - , class SubArg4_type , class SubArg5_type , class SubArg6_type , class SubArg7_type - > - KOKKOS_INLINE_FUNCTION - View( const View & src - , const SubArg0_type & arg0 , const SubArg1_type & arg1 - , const SubArg2_type & arg2 , const SubArg3_type & arg3 - , const SubArg4_type & arg4 , const SubArg5_type & arg5 - , const SubArg6_type & arg6 , const SubArg7_type & arg7 - ); - - template< class D , class A1 , class A2 , class A3 - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - , class SubArg4_type , class SubArg5_type , class SubArg6_type - > - KOKKOS_INLINE_FUNCTION - View( const View & src - , const SubArg0_type & arg0 , const SubArg1_type & arg1 - , const SubArg2_type & arg2 , const SubArg3_type & arg3 - , const SubArg4_type & arg4 , const SubArg5_type & arg5 - , const SubArg6_type & arg6 - ); - - template< class D , class A1 , class A2 , class A3 - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - , class SubArg4_type , class SubArg5_type - > - KOKKOS_INLINE_FUNCTION - View( const View & src - , const SubArg0_type & arg0 , const SubArg1_type & arg1 - , const SubArg2_type & arg2 , const SubArg3_type & arg3 - , const SubArg4_type & arg4 , const SubArg5_type & arg5 - ); - - template< class D , class A1 , class A2 , class A3 - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - , class SubArg4_type - > - KOKKOS_INLINE_FUNCTION - View( const View & src - , const SubArg0_type & arg0 , const SubArg1_type & arg1 - , const SubArg2_type & arg2 , const SubArg3_type & arg3 - , const SubArg4_type & arg4 - ); - - template< class D , class A1 , class A2 , class A3 - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - > - KOKKOS_INLINE_FUNCTION - View( const View & src - , const SubArg0_type & arg0 , const SubArg1_type & arg1 - , const SubArg2_type & arg2 , const SubArg3_type & arg3 - ); - - template< class D , class A1 , class A2 , class A3 - , class SubArg0_type , class SubArg1_type , class SubArg2_type - > - KOKKOS_INLINE_FUNCTION - View( const View & src - , const SubArg0_type & arg0 , const SubArg1_type & arg1 - , const SubArg2_type & arg2 - ); - - template< class D , class A1 , class A2 , class A3 - , class SubArg0_type , class SubArg1_type - > - KOKKOS_INLINE_FUNCTION - View( const View & src - , const SubArg0_type & arg0 , const SubArg1_type & arg1 - ); - - template< class D , class A1 , class A2 , class A3 - , class SubArg0_type - > - KOKKOS_INLINE_FUNCTION - View( const View & src - , const SubArg0_type & arg0 - ); - - //------------------------------------ - // Assign unmanaged View to portion of execution space's shared memory - - typedef Impl::if_c< ! traits::is_managed , - const typename traits::execution_space::scratch_memory_space & , - Impl::ViewError::device_shmem_constructor_requires_unmanaged > - if_scratch_memory_constructor ; - - explicit KOKKOS_INLINE_FUNCTION - View( typename if_scratch_memory_constructor::type space , - const unsigned n0 = 0 , - const unsigned n1 = 0 , - const unsigned n2 = 0 , - const unsigned n3 = 0 , - const unsigned n4 = 0 , - const unsigned n5 = 0 , - const unsigned n6 = 0 , - const unsigned n7 = 0 ) - : m_ptr_on_device() - , m_offset_map() - , m_management() - , m_tracker() - { - typedef typename traits::value_type value_type_ ; - - enum { align = 8 }; - enum { mask = align - 1 }; - - m_offset_map.assign( n0, n1, n2, n3, n4, n5, n6, n7 ); - - typedef Impl::if_c< ! traits::is_managed , - value_type_ * , - Impl::ViewError::device_shmem_constructor_requires_unmanaged > - if_device_shmem_pointer ; - - // Select the first argument: - m_ptr_on_device = if_device_shmem_pointer::select( - (value_type_*) space.get_shmem( unsigned( sizeof(value_type_) * m_offset_map.capacity() + unsigned(mask) ) & ~unsigned(mask) ) ); - } - - explicit KOKKOS_INLINE_FUNCTION - View( typename if_scratch_memory_constructor::type space , - typename traits::array_layout const & layout) - : m_ptr_on_device() - , m_offset_map() - , m_management() - , m_tracker() - { - typedef typename traits::value_type value_type_ ; - - typedef Impl::if_c< ! traits::is_managed , - value_type_ * , - Impl::ViewError::device_shmem_constructor_requires_unmanaged > - if_device_shmem_pointer ; - - m_offset_map.assign( layout ); - m_management.set_unmanaged(); - m_management.set_noncontiguous(); - - enum { align = 8 }; - enum { mask = align - 1 }; - - // Select the first argument: - m_ptr_on_device = if_device_shmem_pointer::select( - (value_type_*) space.get_shmem( unsigned( sizeof(value_type_) * m_offset_map.capacity() + unsigned(mask) ) & ~unsigned(mask) ) ); - } - - static inline - unsigned shmem_size( const unsigned n0 = 0 , - const unsigned n1 = 0 , - const unsigned n2 = 0 , - const unsigned n3 = 0 , - const unsigned n4 = 0 , - const unsigned n5 = 0 , - const unsigned n6 = 0 , - const unsigned n7 = 0 ) - { - enum { align = 8 }; - enum { mask = align - 1 }; - - typedef typename traits::value_type value_type_ ; - - offset_map_type offset_map ; - - offset_map.assign( n0, n1, n2, n3, n4, n5, n6, n7 ); - - return unsigned( sizeof(value_type_) * offset_map.capacity() + unsigned(mask) ) & ~unsigned(mask) ; - } - - //------------------------------------ - // Is not allocated - - KOKKOS_FORCEINLINE_FUNCTION - bool is_null() const { return 0 == ptr_on_device() ; } - - //------------------------------------ - // Operators for scalar (rank zero) views. - - typedef Impl::if_c< traits::rank == 0 , - typename traits::value_type , - Impl::ViewError::scalar_operator_called_from_non_scalar_view > - if_scalar_operator ; - - KOKKOS_INLINE_FUNCTION - const View & operator = ( const typename if_scalar_operator::type & rhs ) const - { - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - *m_ptr_on_device = if_scalar_operator::select( rhs ); - return *this ; - } - - KOKKOS_FORCEINLINE_FUNCTION - operator typename if_scalar_operator::type & () const - { - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - return if_scalar_operator::select( *m_ptr_on_device ); - } - - KOKKOS_FORCEINLINE_FUNCTION - typename if_scalar_operator::type & operator()() const - { - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - return if_scalar_operator::select( *m_ptr_on_device ); - } - - KOKKOS_FORCEINLINE_FUNCTION - typename if_scalar_operator::type & operator*() const - { - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - return if_scalar_operator::select( *m_ptr_on_device ); - } - - //------------------------------------ - // Array member access operators enabled if - // (1) a zero value of all argument types are compile-time comparable to zero - // (2) the rank matches the number of arguments - // (3) the memory space is valid for the access - //------------------------------------ - // rank 1: - // Specialisation for LayoutLeft and LayoutRight since we know its stride 1 - - template< typename iType0 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , traits, LayoutLeft, 1, iType0 >::type - operator[] ( const iType0 & i0 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_1( m_offset_map, i0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ i0 ]; - } - - template< typename iType0 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , traits, LayoutLeft, 1, iType0 >::type - operator() ( const iType0 & i0 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_1( m_offset_map, i0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ i0 ]; - } - - template< typename iType0 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , traits, LayoutLeft, 1, iType0 >::type - at( const iType0 & i0 , const int , const int , const int , - const int , const int , const int , const int ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_1( m_offset_map, i0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ i0 ]; - } - - template< typename iType0 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , traits, LayoutRight, 1, iType0 >::type - operator[] ( const iType0 & i0 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_1( m_offset_map, i0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ i0 ]; - } - - template< typename iType0 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , traits, LayoutRight, 1, iType0 >::type - operator() ( const iType0 & i0 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_1( m_offset_map, i0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ i0 ]; - } - - template< typename iType0 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , traits, LayoutRight, 1, iType0 >::type - at( const iType0 & i0 , const int , const int , const int , - const int , const int , const int , const int ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_1( m_offset_map, i0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ i0 ]; - } - - template< typename iType0 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , traits, - typename Impl::if_c< - Impl::is_same::value || - Impl::is_same::value , - void, typename traits::array_layout>::type, - 1, iType0 >::type - operator[] ( const iType0 & i0 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_1( m_offset_map, i0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0) ]; - } - - template< typename iType0 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , traits, - typename Impl::if_c< - Impl::is_same::value || - Impl::is_same::value , - void, typename traits::array_layout>::type, - 1, iType0 >::type - operator() ( const iType0 & i0 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_1( m_offset_map, i0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0) ]; - } - - template< typename iType0 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , traits, - typename Impl::if_c< - Impl::is_same::value || - Impl::is_same::value , - void, typename traits::array_layout>::type, - 1, iType0 >::type - at( const iType0 & i0 , const int , const int , const int , - const int , const int , const int , const int ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_1( m_offset_map, i0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0) ]; - } - - // rank 2: - - template< typename iType0 , typename iType1 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 2, iType0, iType1 >::type - operator() ( const iType0 & i0 , const iType1 & i1 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_2( m_offset_map, i0,i1 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1) ]; - } - - template< typename iType0 , typename iType1 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 2, iType0, iType1 >::type - at( const iType0 & i0 , const iType1 & i1 , const int , const int , - const int , const int , const int , const int ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_2( m_offset_map, i0,i1 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1) ]; - } - - // rank 3: - - template< typename iType0 , typename iType1 , typename iType2 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 3, iType0, iType1, iType2 >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_3( m_offset_map, i0,i1,i2 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2) ]; - } - - template< typename iType0 , typename iType1 , typename iType2 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 3, iType0, iType1, iType2 >::type - at( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const int , - const int , const int , const int , const int ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_3( m_offset_map, i0,i1,i2 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2) ]; - } - - // rank 4: - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 4, iType0, iType1, iType2, iType3 >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_4( m_offset_map, i0,i1,i2,i3 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2,i3) ]; - } - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 4, iType0, iType1, iType2, iType3 >::type - at( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const int , const int , const int , const int ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_4( m_offset_map, i0,i1,i2,i3 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2,i3) ]; - } - - // rank 5: - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 5, iType0, iType1, iType2, iType3 , iType4 >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_5( m_offset_map, i0,i1,i2,i3,i4 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2,i3,i4) ]; - } - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 5, iType0, iType1, iType2, iType3 , iType4 >::type - at( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 , const int , const int , const int ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_5( m_offset_map, i0,i1,i2,i3,i4 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2,i3,i4) ]; - } - - // rank 6: - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 , typename iType5 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 6, - iType0, iType1, iType2, iType3 , iType4, iType5 >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 , const iType5 & i5 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_6( m_offset_map, i0,i1,i2,i3,i4,i5 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2,i3,i4,i5) ]; - } - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 , typename iType5 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 6, - iType0, iType1, iType2, iType3 , iType4, iType5 >::type - at( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 , const iType5 & i5 , const int , const int ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_6( m_offset_map, i0,i1,i2,i3,i4,i5 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2,i3,i4,i5) ]; - } - - // rank 7: - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 , typename iType5 , typename iType6 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 7, - iType0, iType1, iType2, iType3 , iType4, iType5, iType6 >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 , const iType5 & i5 , const iType6 & i6 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_7( m_offset_map, i0,i1,i2,i3,i4,i5,i6 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2,i3,i4,i5,i6) ]; - } - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 , typename iType5 , typename iType6 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 7, - iType0, iType1, iType2, iType3 , iType4, iType5, iType6 >::type - at( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 , const iType5 & i5 , const iType6 & i6 , const int ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_7( m_offset_map, i0,i1,i2,i3,i4,i5,i6 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2,i3,i4,i5,i6) ]; - } - - // rank 8: - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 , typename iType5 , typename iType6 , typename iType7 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 8, - iType0, iType1, iType2, iType3 , iType4, iType5, iType6, iType7 >::type - operator() ( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 , const iType5 & i5 , const iType6 & i6 , const iType7 & i7 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_8( m_offset_map, i0,i1,i2,i3,i4,i5,i6,i7 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2,i3,i4,i5,i6,i7) ]; - } - - template< typename iType0 , typename iType1 , typename iType2 , typename iType3 , - typename iType4 , typename iType5 , typename iType6 , typename iType7 > - KOKKOS_FORCEINLINE_FUNCTION - typename Impl::ViewEnableArrayOper< reference_type , - traits, typename traits::array_layout, 8, - iType0, iType1, iType2, iType3 , iType4, iType5, iType6, iType7 >::type - at( const iType0 & i0 , const iType1 & i1 , const iType2 & i2 , const iType3 & i3 , - const iType4 & i4 , const iType5 & i5 , const iType6 & i6 , const iType7 & i7 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_8( m_offset_map, i0,i1,i2,i3,i4,i5,i6,i7 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , ptr_on_device() ); - - return m_ptr_on_device[ m_offset_map(i0,i1,i2,i3,i4,i5,i6,i7) ]; - } - - //------------------------------------ - // Access to the underlying contiguous storage of this view specialization. - // These methods are specific to specialization of a view. - - KOKKOS_FORCEINLINE_FUNCTION - typename traits::value_type * ptr_on_device() const - { return (typename traits::value_type *) m_ptr_on_device ; } - - // Stride of physical storage, dimensioned to at least Rank - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { m_offset_map.stride(s); } - - // Count of contiguously allocated data members including padding. - KOKKOS_INLINE_FUNCTION - typename traits::size_type capacity() const - { return m_offset_map.capacity(); } - - // If the view data can be treated (deep copied) - // as a contiguous block of memory. - KOKKOS_INLINE_FUNCTION - bool is_contiguous() const - { return m_management.is_contiguous(); } - - const Impl::AllocationTracker & tracker() const { return m_tracker; } -}; - -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -template< class LT , class LL , class LD , class LM , class LS , - class RT , class RL , class RD , class RM , class RS > -KOKKOS_INLINE_FUNCTION -typename Impl::enable_if<( Impl::is_same< LS , RS >::value ), bool >::type -operator == ( const View & lhs , - const View & rhs ) -{ - // Same data, layout, dimensions - typedef ViewTraits lhs_traits ; - typedef ViewTraits rhs_traits ; - - return - Impl::is_same< typename lhs_traits::const_data_type , - typename rhs_traits::const_data_type >::value && - Impl::is_same< typename lhs_traits::array_layout , - typename rhs_traits::array_layout >::value && - Impl::is_same< typename lhs_traits::memory_space , - typename rhs_traits::memory_space >::value && - Impl::is_same< typename lhs_traits::specialize , - typename rhs_traits::specialize >::value && - lhs.ptr_on_device() == rhs.ptr_on_device() && - lhs.shape() == rhs.shape() ; -} - -template< class LT , class LL , class LD , class LM , class LS , - class RT , class RL , class RD , class RM , class RS > -KOKKOS_INLINE_FUNCTION -bool operator != ( const View & lhs , - const View & rhs ) -{ - return ! operator==( lhs , rhs ); -} - -//---------------------------------------------------------------------------- - - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -//---------------------------------------------------------------------------- -/** \brief Deep copy a value into a view. - */ -template< class DT , class DL , class DD , class DM , class DS > -inline -void deep_copy( const View & dst , - typename Impl::enable_if<( - Impl::is_same< typename ViewTraits::non_const_value_type , - typename ViewTraits::value_type >::value - ), typename ViewTraits::const_value_type >::type & value ) -{ - Impl::ViewFill< View >( dst , value ); -} - -template< class ST , class SL , class SD , class SM , class SS > -inline -typename Impl::enable_if<( ViewTraits::rank == 0 )>::type -deep_copy( ST & dst , const View & src ) -{ - typedef ViewTraits src_traits ; - typedef typename src_traits::memory_space src_memory_space ; - Impl::DeepCopy< HostSpace , src_memory_space >( & dst , src.ptr_on_device() , sizeof(ST) ); -} - -//---------------------------------------------------------------------------- -/** \brief A deep copy between views of compatible type, and rank zero. - */ -template< class DT , class DL , class DD , class DM , class DS , - class ST , class SL , class SD , class SM , class SS > -inline -void deep_copy( const View & dst , - const View & src , - typename Impl::enable_if<( - // Same type and destination is not constant: - Impl::is_same< typename View::value_type , - typename View::non_const_value_type >::value - && - // Rank zero: - ( unsigned(View::rank) == unsigned(0) ) && - ( unsigned(View::rank) == unsigned(0) ) - )>::type * = 0 ) -{ - typedef View dst_type ; - typedef View src_type ; - - typedef typename dst_type::memory_space dst_memory_space ; - typedef typename src_type::memory_space src_memory_space ; - typedef typename src_type::value_type value_type ; - - if ( dst.ptr_on_device() != src.ptr_on_device() ) { - Impl::DeepCopy< dst_memory_space , src_memory_space >( dst.ptr_on_device() , src.ptr_on_device() , sizeof(value_type) ); - } -} - -//---------------------------------------------------------------------------- -/** \brief A deep copy between views of the default specialization, compatible type, - * same non-zero rank, same contiguous layout. - */ -template< class DT , class DL , class DD , class DM , - class ST , class SL , class SD , class SM > -inline -void deep_copy( const View & dst , - const View & src , - typename Impl::enable_if<( - // Same type and destination is not constant: - Impl::is_same< typename View::value_type , - typename View::non_const_value_type >::value - && - // Same non-zero rank: - ( unsigned(View::rank) == - unsigned(View::rank) ) - && - ( 0 < unsigned(View::rank) ) - && - // Same layout: - Impl::is_same< typename View::array_layout , - typename View::array_layout >::value - )>::type * = 0 ) -{ - typedef View dst_type ; - typedef View src_type ; - - typedef typename dst_type::memory_space dst_memory_space ; - typedef typename src_type::memory_space src_memory_space ; - - enum { is_contiguous = // Contiguous (e.g., non-strided, non-tiled) layout - Impl::is_same< typename View::array_layout , LayoutLeft >::value || - Impl::is_same< typename View::array_layout , LayoutRight >::value }; - - if ( dst.ptr_on_device() != src.ptr_on_device() ) { - - // Same shape (dimensions) - - const bool shapes_are_equal = dst.shape() == src.shape(); - - if ( shapes_are_equal && is_contiguous && dst.capacity() == src.capacity() ) { - - // Views span equal length contiguous range. - // Assuming can perform a straight memory copy over this range. - - const size_t nbytes = sizeof(typename dst_type::value_type) * dst.capacity(); - - Impl::DeepCopy< dst_memory_space , src_memory_space >( dst.ptr_on_device() , src.ptr_on_device() , nbytes ); - } - else { - // Destination view's execution space must be able to directly access source memory space - // in order for the ViewRemap functor run in the destination memory space's execution space. - size_t stride[8]; - src.stride(stride); - size_t size_stride = stride[0]*src.dimension_0(); - size_t size_dim = src.dimension_0(); - for(int i = 1; isize_stride) - size_stride = stride[i]*src.dimension(i); - size_dim*=src.dimension(i); - } - - if( shapes_are_equal && size_stride == size_dim) { - const size_t nbytes = sizeof(typename dst_type::value_type) * dst.capacity(); - - Impl::DeepCopy< dst_memory_space , src_memory_space >( dst.ptr_on_device() , src.ptr_on_device() , nbytes ); - } else { - Impl::ViewRemap< dst_type , src_type >( dst , src ); - } - } - } -} - - -/** \brief Deep copy equal dimension arrays in the same space which - * have different layouts or specializations. - */ -template< class DT , class DL , class DD , class DM , class DS , - class ST , class SL , class SD , class SM , class SS > -inline -void deep_copy( const View< DT, DL, DD, DM, DS > & dst , - const View< ST, SL, SD, SM, SS > & src , - const typename Impl::enable_if<( - // Same type and destination is not constant: - Impl::is_same< typename View::value_type , - typename View::non_const_value_type >::value - && - // Source memory space is accessible to destination memory space - Impl::VerifyExecutionCanAccessMemorySpace< typename View::memory_space - , typename View::memory_space >::value - && - // Same non-zero rank - ( unsigned( View::rank ) == - unsigned( View::rank ) ) - && - ( 0 < unsigned( View::rank ) ) - && - // Different layout or different specialization: - ( ( ! Impl::is_same< typename View::array_layout , - typename View::array_layout >::value ) - || - ( ! Impl::is_same< DS , SS >::value ) - ) - )>::type * = 0 ) -{ - typedef View< DT, DL, DD, DM, DS > dst_type ; - typedef View< ST, SL, SD, SM, SS > src_type ; - - assert_shapes_equal_dimension( dst.shape() , src.shape() ); - - Impl::ViewRemap< dst_type , src_type >( dst , src ); -} - -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -//---------------------------------------------------------------------------- -/** \brief Deep copy a value into a view. - */ -template< class ExecSpace, class DT , class DL , class DD , class DM , class DS > -inline -void deep_copy( const ExecSpace&, const View & dst , - typename Impl::enable_if<( - Impl::is_same< typename ViewTraits::non_const_value_type , - typename ViewTraits::value_type >::value - ), typename ViewTraits::const_value_type >::type & value ) -{ - Impl::ViewFill< View >( dst , value ); -} - -template< class ExecSpace, class ST , class SL , class SD , class SM , class SS > -inline -typename Impl::enable_if<( ViewTraits::rank == 0 )>::type -deep_copy( const ExecSpace& exec, ST & dst , const View & src ) -{ - typedef ViewTraits src_traits ; - typedef typename src_traits::memory_space src_memory_space ; - Impl::DeepCopy< HostSpace , src_memory_space , ExecSpace >( exec , & dst , src.ptr_on_device() , sizeof(ST) ); -} - -//---------------------------------------------------------------------------- -/** \brief A deep copy between views of compatible type, and rank zero. - */ -template< class ExecSpace , - class DT , class DL , class DD , class DM , class DS , - class ST , class SL , class SD , class SM , class SS > -inline -void deep_copy( const ExecSpace& exec, - const View & dst , - const View & src , - typename Impl::enable_if<( - // Same type and destination is not constant: - Impl::is_same< typename View::value_type , - typename View::non_const_value_type >::value - && - // Rank zero: - ( unsigned(View::rank) == unsigned(0) ) && - ( unsigned(View::rank) == unsigned(0) ) - )>::type * = 0 ) -{ - typedef View dst_type ; - typedef View src_type ; - - typedef typename dst_type::memory_space dst_memory_space ; - typedef typename src_type::memory_space src_memory_space ; - typedef typename src_type::value_type value_type ; - - if ( dst.ptr_on_device() != src.ptr_on_device() ) { - Impl::DeepCopy< dst_memory_space , src_memory_space , ExecSpace >( exec , dst.ptr_on_device() , src.ptr_on_device() , sizeof(value_type) ); - } -} - -//---------------------------------------------------------------------------- -/** \brief A deep copy between views of the default specialization, compatible type, - * same non-zero rank, same contiguous layout. - */ -template< class ExecSpace , - class DT , class DL , class DD , class DM , - class ST , class SL , class SD , class SM > -inline -void deep_copy( const ExecSpace & exec, - const View & dst , - const View & src , - typename Impl::enable_if<( - // Same type and destination is not constant: - Impl::is_same< typename View::value_type , - typename View::non_const_value_type >::value - && - // Same non-zero rank: - ( unsigned(View::rank) == - unsigned(View::rank) ) - && - ( 0 < unsigned(View::rank) ) - && - // Same layout: - Impl::is_same< typename View::array_layout , - typename View::array_layout >::value - )>::type * = 0 ) -{ - typedef View dst_type ; - typedef View src_type ; - - typedef typename dst_type::memory_space dst_memory_space ; - typedef typename src_type::memory_space src_memory_space ; - - enum { is_contiguous = // Contiguous (e.g., non-strided, non-tiled) layout - Impl::is_same< typename View::array_layout , LayoutLeft >::value || - Impl::is_same< typename View::array_layout , LayoutRight >::value }; - - if ( dst.ptr_on_device() != src.ptr_on_device() ) { - - // Same shape (dimensions) - - const bool shapes_are_equal = dst.shape() == src.shape(); - - if ( shapes_are_equal && is_contiguous && dst.capacity() == src.capacity() ) { - - // Views span equal length contiguous range. - // Assuming can perform a straight memory copy over this range. - - const size_t nbytes = sizeof(typename dst_type::value_type) * dst.capacity(); - - Impl::DeepCopy< dst_memory_space , src_memory_space , ExecSpace >( exec , dst.ptr_on_device() , src.ptr_on_device() , nbytes ); - } - else { - // Destination view's execution space must be able to directly access source memory space - // in order for the ViewRemap functor run in the destination memory space's execution space. - size_t stride[8]; - src.stride(stride); - size_t size_stride = stride[0]*src.dimension_0(); - size_t size_dim = src.dimension_0(); - for(int i = 1; isize_stride) - size_stride = stride[i]*src.dimension(i); - size_dim*=src.dimension(i); - } - - if( shapes_are_equal && size_stride == size_dim) { - const size_t nbytes = sizeof(typename dst_type::value_type) * dst.capacity(); - - Impl::DeepCopy< dst_memory_space , src_memory_space , ExecSpace >( exec , dst.ptr_on_device() , src.ptr_on_device() , nbytes ); - } else { - Impl::ViewRemap< dst_type , src_type >( dst , src ); - } - } - } -} - - -/** \brief Deep copy equal dimension arrays in the same space which - * have different layouts or specializations. - */ -template< class ExecSpace , - class DT , class DL , class DD , class DM , class DS , - class ST , class SL , class SD , class SM , class SS > -inline -void deep_copy( const ExecSpace& , - const View< DT, DL, DD, DM, DS > & dst , - const View< ST, SL, SD, SM, SS > & src , - const typename Impl::enable_if<( - // Same type and destination is not constant: - Impl::is_same< typename View::value_type , - typename View::non_const_value_type >::value - && - // Source memory space is accessible to destination memory space - Impl::VerifyExecutionCanAccessMemorySpace< typename View::memory_space - , typename View::memory_space >::value - && - // Same non-zero rank - ( unsigned( View::rank ) == - unsigned( View::rank ) ) - && - ( 0 < unsigned( View::rank ) ) - && - // Different layout or different specialization: - ( ( ! Impl::is_same< typename View::array_layout , - typename View::array_layout >::value ) - || - ( ! Impl::is_same< DS , SS >::value ) - ) - )>::type * = 0 ) -{ - typedef View< DT, DL, DD, DM, DS > dst_type ; - typedef View< ST, SL, SD, SM, SS > src_type ; - - assert_shapes_equal_dimension( dst.shape() , src.shape() ); - - Impl::ViewRemap< dst_type , src_type >( dst , src ); -} - -} -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -template< class T , class L , class D , class M , class S > -typename Impl::enable_if<( - View::is_managed && - !Impl::is_same::value - ), typename View::HostMirror >::type -inline -create_mirror( const View & src ) -{ - typedef View view_type ; - typedef typename view_type::HostMirror host_view_type ; - - // 'view' is managed therefore we can allocate a - // compatible host_view through the ordinary constructor. - - std::string label = src.tracker().label(); - label.append("_mirror"); - - return host_view_type( label , - src.dimension_0() , - src.dimension_1() , - src.dimension_2() , - src.dimension_3() , - src.dimension_4() , - src.dimension_5() , - src.dimension_6() , - src.dimension_7() ); -} - -template< class T , class L , class D , class M , class S > -typename Impl::enable_if<( - View::is_managed && - Impl::is_same::value - ), typename View::HostMirror >::type -inline -create_mirror( const View & src ) -{ - typedef View view_type ; - typedef typename view_type::HostMirror host_view_type ; - - // 'view' is managed therefore we can allocate a - // compatible host_view through the ordinary constructor. - - std::string label = src.tracker().label(); - label.append("_mirror"); - LayoutStride layout; - src.stride(layout.stride); - layout.dimension[0] = src.dimension_0(); - layout.dimension[1] = src.dimension_1(); - layout.dimension[2] = src.dimension_2(); - layout.dimension[3] = src.dimension_3(); - layout.dimension[4] = src.dimension_4(); - layout.dimension[5] = src.dimension_5(); - layout.dimension[6] = src.dimension_6(); - layout.dimension[7] = src.dimension_7(); - - return host_view_type( label , layout ); -} -template< class T , class L , class D , class M , class S > -typename Impl::enable_if<( - View::is_managed && - Impl::ViewAssignable< typename View::HostMirror , View >::value - ), typename View::HostMirror >::type -inline -create_mirror_view( const View & src ) -{ - return src ; -} - -template< class T , class L , class D , class M , class S > -typename Impl::enable_if<( - View::is_managed && - ! Impl::ViewAssignable< typename View::HostMirror , View >::value - ), typename View::HostMirror >::type -inline -create_mirror_view( const View & src ) -{ - return create_mirror( src ); -} - -//---------------------------------------------------------------------------- - -/** \brief Resize a view with copying old data to new data at the corresponding indices. */ -template< class T , class L , class D , class M , class S > -inline -void resize( View & v , - const typename Impl::enable_if< ViewTraits::is_managed , size_t >::type n0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 ) -{ - typedef View view_type ; - - const std::string label = v.tracker().label(); - - view_type v_resized( label, n0, n1, n2, n3, n4, n5, n6, n7 ); - - Impl::ViewRemap< view_type , view_type >( v_resized , v ); - - v = v_resized ; -} - -/** \brief Reallocate a view without copying old data to new data */ -template< class T , class L , class D , class M , class S > -inline -void realloc( View & v , - const typename Impl::enable_if< ViewTraits::is_managed , size_t >::type n0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 ) -{ - typedef View view_type ; - - // Query the current label and reuse it. - const std::string label = v.tracker().label(); - - v = view_type(); // deallocate first, if the only view to memory. - v = view_type( label, n0, n1, n2, n3, n4, n5, n6, n7 ); -} - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -template< class D , class A1 , class A2 , class A3 , class S , - class ArgType0 , class ArgType1 , class ArgType2 , class ArgType3 , - class ArgType4 , class ArgType5 , class ArgType6 , class ArgType7 > -KOKKOS_INLINE_FUNCTION -typename Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , ArgType6 , ArgType7 - >::type -subview( const View & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 , - const ArgType3 & arg3 , - const ArgType4 & arg4 , - const ArgType5 & arg5 , - const ArgType6 & arg6 , - const ArgType7 & arg7 ) -{ - typedef typename - Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , ArgType6 , ArgType7 - >::type - DstViewType ; - - return DstViewType( src, arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7 ); -} - -template< class D , class A1 , class A2 , class A3 , class S , - class ArgType0 , class ArgType1 , class ArgType2 , class ArgType3 , - class ArgType4 , class ArgType5 , class ArgType6 > -KOKKOS_INLINE_FUNCTION -typename Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , ArgType6 , void - >::type -subview( const View & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 , - const ArgType3 & arg3 , - const ArgType4 & arg4 , - const ArgType5 & arg5 , - const ArgType6 & arg6 ) -{ - typedef typename - Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , ArgType6 , void - >::type - DstViewType ; - - return DstViewType( src, arg0, arg1, arg2, arg3, arg4, arg5, arg6 ); -} - -template< class D , class A1 , class A2 , class A3 , class S , - class ArgType0 , class ArgType1 , class ArgType2 , class ArgType3 , - class ArgType4 , class ArgType5 > -KOKKOS_INLINE_FUNCTION -typename Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , void , void - >::type -subview( const View & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 , - const ArgType3 & arg3 , - const ArgType4 & arg4 , - const ArgType5 & arg5 ) -{ - typedef typename - Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , ArgType5 , void , void - >::type - DstViewType ; - - return DstViewType( src, arg0, arg1, arg2, arg3, arg4, arg5 ); -} - -template< class D , class A1 , class A2 , class A3 , class S , - class ArgType0 , class ArgType1 , class ArgType2 , class ArgType3 , - class ArgType4 > -KOKKOS_INLINE_FUNCTION -typename Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , void , void , void - >::type -subview( const View & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 , - const ArgType3 & arg3 , - const ArgType4 & arg4 ) -{ - typedef typename - Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , ArgType4 , void , void , void - >::type - DstViewType ; - - return DstViewType( src, arg0, arg1, arg2, arg3, arg4 ); -} - -template< class D , class A1 , class A2 , class A3 , class S , - class ArgType0 , class ArgType1 , class ArgType2 , class ArgType3 > -KOKKOS_INLINE_FUNCTION -typename Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , void , void , void , void - >::type -subview( const View & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 , - const ArgType3 & arg3 ) -{ - typedef typename - Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , ArgType3 - , void , void , void , void - >::type - DstViewType ; - - return DstViewType( src, arg0, arg1, arg2, arg3 ); -} - -template< class D , class A1 , class A2 , class A3 , class S , - class ArgType0 , class ArgType1 , class ArgType2 > -KOKKOS_INLINE_FUNCTION -typename Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , void - , void , void , void , void - >::type -subview( const View & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 , - const ArgType2 & arg2 ) -{ - typedef typename - Impl::ViewSubview< View - , ArgType0 , ArgType1 , ArgType2 , void - , void , void , void , void - >::type - DstViewType ; - - return DstViewType( src, arg0, arg1, arg2 ); -} - -template< class D , class A1 , class A2 , class A3 , class S , - class ArgType0 , class ArgType1 > -KOKKOS_INLINE_FUNCTION -typename Impl::ViewSubview< View - , ArgType0 , ArgType1 , void , void - , void , void , void , void - >::type -subview( const View & src , - const ArgType0 & arg0 , - const ArgType1 & arg1 ) -{ - typedef typename - Impl::ViewSubview< View - , ArgType0 , ArgType1 , void , void - , void , void , void , void - >::type - DstViewType ; - - return DstViewType( src, arg0, arg1 ); -} - -template< class D , class A1 , class A2 , class A3 , class S , - class ArgType0 > -KOKKOS_INLINE_FUNCTION -typename Impl::ViewSubview< View - , ArgType0 , void , void , void - , void , void , void , void - >::type -subview( const View & src , - const ArgType0 & arg0 ) -{ - typedef typename - Impl::ViewSubview< View - , ArgType0 , void , void , void - , void , void , void , void - >::type - DstViewType ; - - return DstViewType( src, arg0 ); -} - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#include -#include - -#include -#include - -namespace Kokkos { -/** \brief Tag denoting that a subview should capture all of a dimension */ -struct ALL { KOKKOS_INLINE_FUNCTION ALL(){} }; -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#include - -#else - -// Must define before includng -namespace Kokkos { -namespace Experimental { -namespace Impl { -struct ALL_t ; -} -} -using ALL = Experimental::Impl::ALL_t ; -} - -#include -#include - -#include - -#endif /* #if defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif - diff --git a/lib/kokkos/core/src/Kokkos_hwloc.hpp b/lib/kokkos/core/src/Kokkos_hwloc.hpp deleted file mode 100644 index a0b007f642..0000000000 --- a/lib/kokkos/core/src/Kokkos_hwloc.hpp +++ /dev/null @@ -1,140 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_HWLOC_HPP -#define KOKKOS_HWLOC_HPP - -#include - -namespace Kokkos { - -/** \brief Minimal subset of logical 'hwloc' functionality available - * from http://www.open-mpi.org/projects/hwloc/. - * - * The calls are NOT thread safe in order to avoid mutexes, - * memory allocations, or other actions which could give the - * runtime system an opportunity to migrate the threads or - * touch allocated memory during the function calls. - * - * All calls to these functions should be performed by a thread - * when it has guaranteed exclusive access; e.g., for OpenMP - * within a 'critical' region. - */ -namespace hwloc { - -/** \brief Query if hwloc is available */ -bool available(); - -/** \brief Query number of available NUMA regions. - * This will be less than the hardware capacity - * if the MPI process is pinned to a NUMA region. - */ -unsigned get_available_numa_count(); - -/** \brief Query number of available cores per NUMA regions. - * This will be less than the hardware capacity - * if the MPI process is pinned to a set of cores. - */ -unsigned get_available_cores_per_numa(); - -/** \brief Query number of available "hard" threads per core; i.e., hyperthreads */ -unsigned get_available_threads_per_core(); - -} /* namespace hwloc */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- -// Internal functions for binding persistent spawned threads. - -namespace Kokkos { -namespace hwloc { - -/** \brief Recommend mapping of threads onto cores. - * - * If thread_count == 0 then choose and set a value. - * If use_numa_count == 0 then choose and set a value. - * If use_cores_per_numa == 0 then choose and set a value. - * - * Return 0 if asynchronous, - * Return 1 if synchronous and threads_coord[0] is process core - */ -unsigned thread_mapping( const char * const label , - const bool allow_async , - unsigned & thread_count , - unsigned & use_numa_count , - unsigned & use_cores_per_numa , - std::pair threads_coord[] ); - -/** \brief Query core-coordinate of the current thread - * with respect to the core_topology. - * - * As long as the thread is running within the - * process binding the following condition holds. - * - * core_coordinate.first < core_topology.first - * core_coordinate.second < core_topology.second - */ -std::pair get_this_thread_coordinate(); - -/** \brief Bind the current thread to a core. */ -bool bind_this_thread( const std::pair ); - -/** \brief Bind the current thread to one of the cores in the list. - * Set that entry to (~0,~0) and return the index. - * If binding fails return ~0. - */ -unsigned bind_this_thread( const unsigned coordinate_count , - std::pair coordinate[] ); - -/** \brief Unbind the current thread back to the original process binding */ -bool unbind_this_thread(); - -} /* namespace hwloc */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #define KOKKOS_HWLOC_HPP */ - diff --git a/lib/kokkos/core/src/Makefile b/lib/kokkos/core/src/Makefile deleted file mode 100644 index 8bb3508592..0000000000 --- a/lib/kokkos/core/src/Makefile +++ /dev/null @@ -1,127 +0,0 @@ -KOKKOS_PATH = ../.. - -PREFIX ?= /usr/local/lib/kokkos - -default: messages build-lib - echo "End Build" - - -include $(KOKKOS_PATH)/Makefile.kokkos - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - CXX = nvcc_wrapper - CXXFLAGS ?= -O3 - LINK = nvcc_wrapper - LINKFLAGS ?= -else - CXX ?= g++ - CXXFLAGS ?= -O3 - LINK ?= g++ - LINKFLAGS ?= -endif - -PWD = $(shell pwd) - -KOKKOS_HEADERS_INCLUDE = $(wildcard $(KOKKOS_PATH)/core/src/*.hpp) -KOKKOS_HEADERS_INCLUDE_IMPL = $(wildcard $(KOKKOS_PATH)/core/src/impl/*.hpp) -KOKKOS_HEADERS_INCLUDE += $(wildcard $(KOKKOS_PATH)/containers/src/*.hpp) -KOKKOS_HEADERS_INCLUDE_IMPL += $(wildcard $(KOKKOS_PATH)/containers/src/impl/*.hpp) -KOKKOS_HEADERS_INCLUDE += $(wildcard $(KOKKOS_PATH)/algorithms/src/*.hpp) - -CONDITIONAL_COPIES = - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - KOKKOS_HEADERS_CUDA += $(wildcard $(KOKKOS_PATH)/core/src/Cuda/*.hpp) - CONDITIONAL_COPIES += copy-cuda -endif - -ifeq ($(KOKKOS_INTERNAL_USE_PTHREADS), 1) - KOKKOS_HEADERS_THREADS += $(wildcard $(KOKKOS_PATH)/core/src/Threads/*.hpp) - CONDITIONAL_COPIES += copy-threads -endif - -ifeq ($(KOKKOS_INTERNAL_USE_QTHREAD), 1) - KOKKOS_HEADERS_QTHREAD += $(wildcard $(KOKKOS_PATH)/core/src/Qthread/*.hpp) - CONDITIONAL_COPIES += copy-qthread -endif - -ifeq ($(KOKKOS_INTERNAL_USE_OPENMP), 1) - KOKKOS_HEADERS_OPENMP += $(wildcard $(KOKKOS_PATH)/core/src/OpenMP/*.hpp) - CONDITIONAL_COPIES += copy-openmp -endif - -messages: - echo "Start Build" - -build-makefile-kokkos: - rm -f Makefile.kokkos - echo "#Global Settings used to generate this library" >> Makefile.kokkos - echo "KOKKOS_PATH = $(PREFIX)" >> Makefile.kokkos - echo "KOKKOS_DEVICES = $(KOKKOS_DEVICES)" >> Makefile.kokkos - echo "KOKKOS_ARCH = $(KOKKOS_ARCH)" >> Makefile.kokkos - echo "KOKKOS_DEBUG = $(KOKKOS_DEBUG)" >> Makefile.kokkos - echo "KOKKOS_USE_TPLS = $(KOKKOS_USE_TPLS)" >> Makefile.kokkos - echo "KOKKOS_CXX_STANDARD = $(KOKKOS_CXX_STANDARD)" >> Makefile.kokkos - echo "KOKKOS_CUDA_OPTIONS = $(KOKKOS_CUDA_OPTIONS)" >> Makefile.kokkos - echo "CXX ?= $(CXX)" >> Makefile.kokkos - echo "" >> Makefile.kokkos - echo "#Source and Header files of Kokkos relative to KOKKOS_PATH" >> Makefile.kokkos - echo "KOKKOS_HEADERS = $(KOKKOS_HEADERS)" >> Makefile.kokkos - echo "KOKKOS_SRC = $(KOKKOS_SRC)" >> Makefile.kokkos - echo "" >> Makefile.kokkos - echo "#Variables used in application Makefiles" >> Makefile.kokkos - echo "KOKKOS_CPP_DEPENDS = $(KOKKOS_CPP_DEPENDS)" >> Makefile.kokkos - echo "KOKKOS_CXXFLAGS = $(KOKKOS_CXXFLAGS)" >> Makefile.kokkos - echo "KOKKOS_CPPFLAGS = $(KOKKOS_CPPFLAGS)" >> Makefile.kokkos - echo "KOKKOS_LINK_DEPENDS = $(KOKKOS_LINK_DEPENDS)" >> Makefile.kokkos - echo "KOKKOS_LIBS = $(KOKKOS_LIBS)" >> Makefile.kokkos - echo "KOKKOS_LDFLAGS = $(KOKKOS_LDFLAGS)" >> Makefile.kokkos - sed \ - -e 's|$(KOKKOS_PATH)/core/src|$(PREFIX)/include|g' \ - -e 's|$(KOKKOS_PATH)/containers/src|$(PREFIX)/include|g' \ - -e 's|$(KOKKOS_PATH)/algorithms/src|$(PREFIX)/include|g' \ - -e 's|-L$(PWD)|-L$(PREFIX)/lib|g' \ - -e 's|= libkokkos.a|= $(PREFIX)/lib/libkokkos.a|g' \ - -e 's|= KokkosCore_config.h|= $(PREFIX)/include/KokkosCore_config.h|g' Makefile.kokkos \ - > Makefile.kokkos.tmp - mv -f Makefile.kokkos.tmp Makefile.kokkos - -build-lib: build-makefile-kokkos $(KOKKOS_LINK_DEPENDS) - -mkdir: - mkdir -p $(PREFIX) - mkdir -p $(PREFIX)/include - mkdir -p $(PREFIX)/lib - mkdir -p $(PREFIX)/include/impl - -copy-cuda: mkdir - mkdir -p $(PREFIX)/include/Cuda - cp $(KOKKOS_HEADERS_CUDA) $(PREFIX)/include/Cuda - -copy-threads: mkdir - mkdir -p $(PREFIX)/include/Threads - cp $(KOKKOS_HEADERS_THREADS) $(PREFIX)/include/Threads - -copy-qthread: mkdir - mkdir -p $(PREFIX)/include/Qthread - cp $(KOKKOS_HEADERS_QTHREAD) $(PREFIX)/include/Qthread - -copy-openmp: mkdir - mkdir -p $(PREFIX)/include/OpenMP - cp $(KOKKOS_HEADERS_OPENMP) $(PREFIX)/include/OpenMP - -install: mkdir $(CONDITIONAL_COPIES) build-lib - cp $(KOKKOS_HEADERS_INCLUDE) $(PREFIX)/include - cp $(KOKKOS_HEADERS_INCLUDE_IMPL) $(PREFIX)/include/impl - cp Makefile.kokkos $(PREFIX) - cp libkokkos.a $(PREFIX)/lib - cp KokkosCore_config.h $(PREFIX)/include - - - -clean: kokkos-clean - rm Makefile.kokkos - - - - diff --git a/lib/kokkos/core/src/OpenMP/Kokkos_OpenMP_Parallel.hpp b/lib/kokkos/core/src/OpenMP/Kokkos_OpenMP_Parallel.hpp deleted file mode 100644 index f8393611e4..0000000000 --- a/lib/kokkos/core/src/OpenMP/Kokkos_OpenMP_Parallel.hpp +++ /dev/null @@ -1,496 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_OPENMP_PARALLEL_HPP -#define KOKKOS_OPENMP_PARALLEL_HPP - -#include - -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelFor< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::OpenMP > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::OpenMP > Policy ; - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< Impl::is_same< typename PType::work_tag , void >::value , - const FunctorType & >::type functor - , const PType & range ) - { - const typename PType::member_type work_end = range.end(); - for ( typename PType::member_type iwork = range.begin() ; iwork < work_end ; ++iwork ) { - functor( iwork ); - } - } - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< ! Impl::is_same< typename PType::work_tag , void >::value , - const FunctorType & >::type functor - , const PType & range ) - { - const typename PType::member_type work_end = range.end(); - for ( typename PType::member_type iwork = range.begin() ; iwork < work_end ; ++iwork ) { - functor( typename PType::work_tag() , iwork ); - } - } - -public: - - inline - ParallelFor( const FunctorType & functor - , const Policy & policy ) - { - OpenMPexec::verify_is_process("Kokkos::OpenMP parallel_for"); - OpenMPexec::verify_initialized("Kokkos::OpenMP parallel_for"); - -#pragma omp parallel - { - OpenMPexec & exec = * OpenMPexec::get_thread_omp(); - driver( functor , typename Policy::WorkRange( policy , exec.pool_rank() , exec.pool_size() ) ); - } -/* END #pragma omp parallel */ - } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelReduce< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::OpenMP > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::OpenMP > Policy ; - typedef typename Policy::work_tag WorkTag ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , WorkTag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , WorkTag > ValueInit ; - typedef Kokkos::Impl::FunctorValueJoin< FunctorType , WorkTag > ValueJoin ; - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< Impl::is_same< typename PType::work_tag , void >::value , - const FunctorType & >::type functor - , reference_type update - , const PType & range ) - { - const typename PType::member_type work_end = range.end(); - for ( typename PType::member_type iwork = range.begin() ; iwork < work_end ; ++iwork ) { - functor( iwork , update ); - } - } - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< ! Impl::is_same< typename PType::work_tag , void >::value , - const FunctorType & >::type functor - , reference_type update - , const PType & range ) - { - const typename PType::member_type work_end = range.end(); - for ( typename PType::member_type iwork = range.begin() ; iwork < work_end ; ++iwork ) { - functor( typename PType::work_tag() , iwork , update ); - } - } - -public: - - //---------------------------------------- - - template< class ViewType > - inline - ParallelReduce( typename Impl::enable_if< - ( Impl::is_view< ViewType >::value && - Impl::is_same< typename ViewType::memory_space , HostSpace >::value - ), const FunctorType & >::type functor - , const Policy & policy - , const ViewType & result_view ) - { - OpenMPexec::verify_is_process("Kokkos::OpenMP parallel_reduce"); - OpenMPexec::verify_initialized("Kokkos::OpenMP parallel_reduce"); - - OpenMPexec::resize_scratch( ValueTraits::value_size( functor ) , 0 ); - -#pragma omp parallel - { - OpenMPexec & exec = * OpenMPexec::get_thread_omp(); - - driver( functor - , ValueInit::init( functor , exec.scratch_reduce() ) - , typename Policy::WorkRange( policy , exec.pool_rank() , exec.pool_size() ) - ); - } -/* END #pragma omp parallel */ - - { - const pointer_type ptr = pointer_type( OpenMPexec::pool_rev(0)->scratch_reduce() ); - - for ( int i = 1 ; i < OpenMPexec::pool_size() ; ++i ) { - ValueJoin::join( functor , ptr , OpenMPexec::pool_rev(i)->scratch_reduce() ); - } - - Kokkos::Impl::FunctorFinal< FunctorType , WorkTag >::final( functor , ptr ); - - if ( result_view.ptr_on_device() ) { - const int n = ValueTraits::value_count( functor ); - - for ( int j = 0 ; j < n ; ++j ) { result_view.ptr_on_device()[j] = ptr[j] ; } - } - } - } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelScan< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::OpenMP > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::OpenMP > Policy ; - typedef typename Policy::work_tag WorkTag ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , WorkTag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , WorkTag > ValueInit ; - typedef Kokkos::Impl::FunctorValueJoin< FunctorType , WorkTag > ValueJoin ; - typedef Kokkos::Impl::FunctorValueOps< FunctorType , WorkTag > ValueOps ; - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< Impl::is_same< typename PType::work_tag , void >::value , - const FunctorType & >::type functor - , reference_type update - , const PType & range - , const bool final ) - { - const typename PType::member_type work_end = range.end(); - for ( typename PType::member_type iwork = range.begin() ; iwork < work_end ; ++iwork ) { - functor( iwork , update , final ); - } - } - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< ! Impl::is_same< typename PType::work_tag , void >::value , - const FunctorType & >::type functor - , reference_type update - , const PType & range - , const bool final ) - { - const typename PType::member_type work_end = range.end(); - for ( typename PType::member_type iwork = range.begin() ; iwork < work_end ; ++iwork ) { - functor( typename PType::work_tag() , iwork , update , final ); - } - } - -public: - - //---------------------------------------- - - inline - ParallelScan( const FunctorType & functor - , const Policy & policy ) - { - OpenMPexec::verify_is_process("Kokkos::OpenMP parallel_scan"); - OpenMPexec::verify_initialized("Kokkos::OpenMP parallel_scan"); - - OpenMPexec::resize_scratch( 2 * ValueTraits::value_size( functor ) , 0 ); - -#pragma omp parallel - { - OpenMPexec & exec = * OpenMPexec::get_thread_omp(); - - driver( functor - , ValueInit::init( functor , pointer_type( exec.scratch_reduce() ) + ValueTraits::value_count( functor ) ) - , typename Policy::WorkRange( policy , exec.pool_rank() , exec.pool_size() ) - , false ); - } -/* END #pragma omp parallel */ - - { - const unsigned thread_count = OpenMPexec::pool_size(); - const unsigned value_count = ValueTraits::value_count( functor ); - - pointer_type ptr_prev = 0 ; - - for ( unsigned rank_rev = thread_count ; rank_rev-- ; ) { - - pointer_type ptr = pointer_type( OpenMPexec::pool_rev(rank_rev)->scratch_reduce() ); - - if ( ptr_prev ) { - for ( unsigned i = 0 ; i < value_count ; ++i ) { ptr[i] = ptr_prev[ i + value_count ] ; } - ValueJoin::join( functor , ptr + value_count , ptr ); - } - else { - ValueInit::init( functor , ptr ); - } - - ptr_prev = ptr ; - } - } - -#pragma omp parallel - { - OpenMPexec & exec = * OpenMPexec::get_thread_omp(); - - driver( functor - , ValueOps::reference( pointer_type( exec.scratch_reduce() ) ) - , typename Policy::WorkRange( policy , exec.pool_rank() , exec.pool_size() ) - , true ); - } -/* END #pragma omp parallel */ - - } - - //---------------------------------------- -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class Arg0 , class Arg1 > -class ParallelFor< FunctorType , Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::OpenMP > > -{ -private: - - typedef Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::OpenMP > Policy ; - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< Impl::is_same< TagType , void >::value , - const FunctorType & >::type functor - , const typename Policy::member_type & member ) - { functor( member ); } - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< ! Impl::is_same< TagType , void >::value , - const FunctorType & >::type functor - , const typename Policy::member_type & member ) - { functor( TagType() , member ); } - -public: - - inline - ParallelFor( const FunctorType & functor , - const Policy & policy ) - { - OpenMPexec::verify_is_process("Kokkos::OpenMP parallel_for"); - OpenMPexec::verify_initialized("Kokkos::OpenMP parallel_for"); - - const size_t team_reduce_size = Policy::member_type::team_reduce_size(); - const size_t team_shmem_size = FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ); - - OpenMPexec::resize_scratch( 0 , team_reduce_size + team_shmem_size ); - -#pragma omp parallel - { - typename Policy::member_type member( * OpenMPexec::get_thread_omp() , policy , team_shmem_size ); - - for ( ; member.valid() ; member.next() ) { - ParallelFor::template driver< typename Policy::work_tag >( functor , member ); - } - } -/* END #pragma omp parallel */ - } - - void wait() {} -}; - - -template< class FunctorType , class Arg0 , class Arg1 > -class ParallelReduce< FunctorType , Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::OpenMP > > -{ -private: - - typedef Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::OpenMP > Policy ; - typedef typename Policy::work_tag WorkTag ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , WorkTag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , WorkTag > ValueInit ; - typedef Kokkos::Impl::FunctorValueJoin< FunctorType , WorkTag > ValueJoin ; - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< Impl::is_same< typename PType::work_tag , void >::value , - const FunctorType & >::type functor - , const typename PType::member_type & member - , reference_type update ) - { functor( member , update ); } - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< ! Impl::is_same< typename PType::work_tag , void >::value , - const FunctorType & >::type functor - , const typename PType::member_type & member - , reference_type update ) - { functor( typename PType::work_tag() , member , update ); } - -public: - - inline - ParallelReduce( const FunctorType & functor , - const Policy & policy ) - { - OpenMPexec::verify_is_process("Kokkos::OpenMP parallel_reduce"); - - const size_t team_reduce_size = Policy::member_type::team_reduce_size(); - const size_t team_shmem_size = FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ); - - OpenMPexec::resize_scratch( ValueTraits::value_size( functor ) , team_reduce_size + team_shmem_size ); - -#pragma omp parallel - { - OpenMPexec & exec = * OpenMPexec::get_thread_omp(); - - reference_type update = ValueInit::init( functor , exec.scratch_reduce() ); - - for ( typename Policy::member_type member( exec , policy , team_shmem_size ); member.valid() ; member.next() ) { - ParallelReduce::template driver< Policy >( functor , member , update ); - } - } -/* END #pragma omp parallel */ - - { - typedef Kokkos::Impl::FunctorValueJoin< FunctorType , WorkTag , reference_type > Join ; - - const pointer_type ptr = pointer_type( OpenMPexec::pool_rev(0)->scratch_reduce() ); - - for ( int i = 1 ; i < OpenMPexec::pool_size() ; ++i ) { - Join::join( functor , ptr , OpenMPexec::pool_rev(i)->scratch_reduce() ); - } - - Kokkos::Impl::FunctorFinal< FunctorType , WorkTag >::final( functor , ptr ); - } - } - - template< class ViewType > - inline - ParallelReduce( const FunctorType & functor , - const Policy & policy , - const ViewType & result ) - { - OpenMPexec::verify_is_process("Kokkos::OpenMP parallel_reduce"); - - const size_t team_reduce_size = Policy::member_type::team_reduce_size(); - const size_t team_shmem_size = FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ); - - OpenMPexec::resize_scratch( ValueTraits::value_size( functor ) , team_reduce_size + team_shmem_size ); - -#pragma omp parallel - { - OpenMPexec & exec = * OpenMPexec::get_thread_omp(); - - reference_type update = ValueInit::init( functor , exec.scratch_reduce() ); - - for ( typename Policy::member_type member( exec , policy , team_shmem_size ); member.valid() ; member.next() ) { - ParallelReduce::template driver< Policy >( functor , member , update ); - } - } -/* END #pragma omp parallel */ - - { - const pointer_type ptr = pointer_type( OpenMPexec::pool_rev(0)->scratch_reduce() ); - - for ( int i = 1 ; i < OpenMPexec::pool_size() ; ++i ) { - ValueJoin::join( functor , ptr , OpenMPexec::pool_rev(i)->scratch_reduce() ); - } - - Kokkos::Impl::FunctorFinal< FunctorType , WorkTag >::final( functor , ptr ); - - const int n = ValueTraits::value_count( functor ); - - for ( int j = 0 ; j < n ; ++j ) { result.ptr_on_device()[j] = ptr[j] ; } - } - } - - void wait() {} -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* KOKKOS_OPENMP_PARALLEL_HPP */ - diff --git a/lib/kokkos/core/src/OpenMP/Kokkos_OpenMPexec.cpp b/lib/kokkos/core/src/OpenMP/Kokkos_OpenMPexec.cpp deleted file mode 100644 index ed98fd2f97..0000000000 --- a/lib/kokkos/core/src/OpenMP/Kokkos_OpenMPexec.cpp +++ /dev/null @@ -1,364 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include -#include -#include - -#ifdef KOKKOS_HAVE_OPENMP - -namespace Kokkos { -namespace Impl { -namespace { - -KOKKOS_INLINE_FUNCTION -int kokkos_omp_in_parallel(); - -int kokkos_omp_in_critical_region = ( Kokkos::HostSpace::register_in_parallel( kokkos_omp_in_parallel ) , 0 ); - -KOKKOS_INLINE_FUNCTION -int kokkos_omp_in_parallel() -{ -#ifndef __CUDA_ARCH__ - return omp_in_parallel() && ! kokkos_omp_in_critical_region ; -#else - return 0; -#endif -} - -bool s_using_hwloc = false; - -} // namespace -} // namespace Impl -} // namespace Kokkos - - -namespace Kokkos { -namespace Impl { - -int OpenMPexec::m_map_rank[ OpenMPexec::MAX_THREAD_COUNT ] = { 0 }; - -int OpenMPexec::m_pool_topo[ 4 ] = { 0 }; - -OpenMPexec::Pool OpenMPexec::m_pool; - -void OpenMPexec::verify_is_process( const char * const label ) -{ - if ( omp_in_parallel() ) { - std::string msg( label ); - msg.append( " ERROR: in parallel" ); - Kokkos::Impl::throw_runtime_exception( msg ); - } -} - -void OpenMPexec::verify_initialized( const char * const label ) -{ - if ( 0 == m_pool[0] ) { - std::string msg( label ); - msg.append( " ERROR: not initialized" ); - Kokkos::Impl::throw_runtime_exception( msg ); - } -} - -void OpenMPexec::clear_scratch() -{ -#pragma omp parallel - { - const int rank_rev = m_map_rank[ omp_get_thread_num() ]; - m_pool.at(rank_rev).clear(); - } -/* END #pragma omp parallel */ -} - -void OpenMPexec::resize_scratch( size_t reduce_size , size_t thread_size ) -{ - enum { ALIGN_MASK = Kokkos::Impl::MEMORY_ALIGNMENT - 1 }; - enum { ALLOC_EXEC = ( sizeof(OpenMPexec) + ALIGN_MASK ) & ~ALIGN_MASK }; - - const size_t old_reduce_size = m_pool[0] ? m_pool[0]->m_scratch_reduce_end : 0 ; - const size_t old_thread_size = m_pool[0] ? m_pool[0]->m_scratch_thread_end - m_pool[0]->m_scratch_reduce_end : 0 ; - - reduce_size = ( reduce_size + ALIGN_MASK ) & ~ALIGN_MASK ; - thread_size = ( thread_size + ALIGN_MASK ) & ~ALIGN_MASK ; - - // Requesting allocation and old allocation is too small: - - const bool allocate = ( old_reduce_size < reduce_size ) || - ( old_thread_size < thread_size ); - - if ( allocate ) { - if ( reduce_size < old_reduce_size ) { reduce_size = old_reduce_size ; } - if ( thread_size < old_thread_size ) { thread_size = old_thread_size ; } - } - - const size_t alloc_size = allocate ? ALLOC_EXEC + reduce_size + thread_size : 0 ; - const int pool_size = m_pool_topo[0] ; - - if ( allocate ) { - - clear_scratch(); - -#pragma omp parallel - { - const int rank_rev = m_map_rank[ omp_get_thread_num() ]; - const int rank = pool_size - ( rank_rev + 1 ); - - m_pool.at(rank_rev) = HostSpace::allocate_and_track( "openmp_scratch", alloc_size ); - new ( m_pool[ rank_rev ] ) OpenMPexec( rank , ALLOC_EXEC , reduce_size , thread_size ); - } -/* END #pragma omp parallel */ - } -} - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -//---------------------------------------------------------------------------- - -int OpenMP::is_initialized() -{ return 0 != Impl::OpenMPexec::m_pool[0]; } - -void OpenMP::initialize( unsigned thread_count , - unsigned use_numa_count , - unsigned use_cores_per_numa ) -{ - // Before any other call to OMP query the maximum number of threads - // and save the value for re-initialization unit testing. - - //Using omp_get_max_threads(); is problematic in conjunction with - //Hwloc on Intel (essentially an initial call to the OpenMP runtime - //without a parallel region before will set a process mask for a single core - //The runtime will than bind threads for a parallel region to other cores on the - //entering the first parallel region and make the process mask the aggregate of - //the thread masks. The intend seems to be to make serial code run fast, if you - //compile with OpenMP enabled but don't actually use parallel regions or so - //static int omp_max_threads = omp_get_max_threads(); - int nthreads = 0; - #pragma omp parallel - { - #pragma omp atomic - nthreads++; - } - - static int omp_max_threads = nthreads; - - const bool is_initialized = 0 != Impl::OpenMPexec::m_pool[0] ; - - bool thread_spawn_failed = false ; - - if ( ! is_initialized ) { - - // Use hwloc thread pinning if concerned with locality. - // If spreading threads across multiple NUMA regions. - // If hyperthreading is enabled. - Impl::s_using_hwloc = hwloc::available() && ( - ( 1 < Kokkos::hwloc::get_available_numa_count() ) || - ( 1 < Kokkos::hwloc::get_available_threads_per_core() ) ); - - std::pair threads_coord[ Impl::OpenMPexec::MAX_THREAD_COUNT ]; - - // If hwloc available then use it's maximum value. - - if ( thread_count == 0 ) { - thread_count = Impl::s_using_hwloc - ? Kokkos::hwloc::get_available_numa_count() * - Kokkos::hwloc::get_available_cores_per_numa() * - Kokkos::hwloc::get_available_threads_per_core() - : omp_max_threads ; - } - - if(Impl::s_using_hwloc) - hwloc::thread_mapping( "Kokkos::OpenMP::initialize" , - false /* do not allow asynchronous */ , - thread_count , - use_numa_count , - use_cores_per_numa , - threads_coord ); - - // Spawn threads: - - omp_set_num_threads( thread_count ); - - // Verify OMP interaction: - if ( int(thread_count) != omp_get_max_threads() ) { - thread_spawn_failed = true ; - } - - // Verify spawning and bind threads: -#pragma omp parallel - { -#pragma omp critical - { - if ( int(thread_count) != omp_get_num_threads() ) { - thread_spawn_failed = true ; - } - - // Call to 'bind_this_thread' is not thread safe so place this whole block in a critical region. - // Call to 'new' may not be thread safe as well. - - // Reverse the rank for threads so that the scan operation reduces to the highest rank thread. - - const unsigned omp_rank = omp_get_thread_num(); - const unsigned thread_r = Impl::s_using_hwloc ? Kokkos::hwloc::bind_this_thread( thread_count , threads_coord ) : omp_rank ; - - Impl::OpenMPexec::m_map_rank[ omp_rank ] = thread_r ; - } -/* END #pragma omp critical */ - } -/* END #pragma omp parallel */ - - if ( ! thread_spawn_failed ) { - Impl::OpenMPexec::m_pool_topo[0] = thread_count ; - Impl::OpenMPexec::m_pool_topo[1] = Impl::s_using_hwloc ? thread_count / use_numa_count : thread_count; - Impl::OpenMPexec::m_pool_topo[2] = Impl::s_using_hwloc ? thread_count / ( use_numa_count * use_cores_per_numa ) : 1; - - Impl::OpenMPexec::resize_scratch( 1024 , 1024 ); - } - } - - if ( is_initialized || thread_spawn_failed ) { - std::string msg("Kokkos::OpenMP::initialize ERROR"); - - if ( is_initialized ) { msg.append(" : already initialized"); } - if ( thread_spawn_failed ) { msg.append(" : failed spawning threads"); } - - Kokkos::Impl::throw_runtime_exception(msg); - } - - // Init the array for used for arbitrarily sized atomics - Impl::init_lock_array_host_space(); -} - -//---------------------------------------------------------------------------- - -void OpenMP::finalize() -{ - Impl::OpenMPexec::verify_initialized( "OpenMP::finalize" ); - Impl::OpenMPexec::verify_is_process( "OpenMP::finalize" ); - - Impl::OpenMPexec::clear_scratch(); - - Impl::OpenMPexec::m_pool_topo[0] = 0 ; - Impl::OpenMPexec::m_pool_topo[1] = 0 ; - Impl::OpenMPexec::m_pool_topo[2] = 0 ; - - omp_set_num_threads(1); - - if ( Impl::s_using_hwloc ) { - hwloc::unbind_this_thread(); - } -} - -//---------------------------------------------------------------------------- - -void OpenMP::print_configuration( std::ostream & s , const bool detail ) -{ - Impl::OpenMPexec::verify_is_process( "OpenMP::print_configuration" ); - - s << "Kokkos::OpenMP" ; - -#if defined( KOKKOS_HAVE_OPENMP ) - s << " KOKKOS_HAVE_OPENMP" ; -#endif -#if defined( KOKKOS_HAVE_HWLOC ) - - const unsigned numa_count_ = Kokkos::hwloc::get_available_numa_count(); - const unsigned cores_per_numa = Kokkos::hwloc::get_available_cores_per_numa(); - const unsigned threads_per_core = Kokkos::hwloc::get_available_threads_per_core(); - - s << " hwloc[" << numa_count_ << "x" << cores_per_numa << "x" << threads_per_core << "]" - << " hwloc_binding_" << ( Impl::s_using_hwloc ? "enabled" : "disabled" ) - ; -#endif - - const bool is_initialized = 0 != Impl::OpenMPexec::m_pool[0] ; - - if ( is_initialized ) { - const int numa_count = Kokkos::Impl::OpenMPexec::m_pool_topo[0] / Kokkos::Impl::OpenMPexec::m_pool_topo[1] ; - const int core_per_numa = Kokkos::Impl::OpenMPexec::m_pool_topo[1] / Kokkos::Impl::OpenMPexec::m_pool_topo[2] ; - const int thread_per_core = Kokkos::Impl::OpenMPexec::m_pool_topo[2] ; - - s << " thread_pool_topology[ " << numa_count - << " x " << core_per_numa - << " x " << thread_per_core - << " ]" - << std::endl ; - - if ( detail ) { - std::vector< std::pair > coord( Kokkos::Impl::OpenMPexec::m_pool_topo[0] ); - -#pragma omp parallel - { -#pragma omp critical - { - coord[ omp_get_thread_num() ] = hwloc::get_this_thread_coordinate(); - } -/* END #pragma omp critical */ - } -/* END #pragma omp parallel */ - - for ( unsigned i = 0 ; i < coord.size() ; ++i ) { - s << " thread omp_rank[" << i << "]" - << " kokkos_rank[" << Impl::OpenMPexec::m_map_rank[ i ] << "]" - << " hwloc_coord[" << coord[i].first << "." << coord[i].second << "]" - << std::endl ; - } - } - } - else { - s << " not initialized" << std::endl ; - } -} - -} // namespace Kokkos - -#endif //KOKKOS_HAVE_OPENMP diff --git a/lib/kokkos/core/src/OpenMP/Kokkos_OpenMPexec.hpp b/lib/kokkos/core/src/OpenMP/Kokkos_OpenMPexec.hpp deleted file mode 100644 index 1ab08f648d..0000000000 --- a/lib/kokkos/core/src/OpenMP/Kokkos_OpenMPexec.hpp +++ /dev/null @@ -1,767 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_OPENMPEXEC_HPP -#define KOKKOS_OPENMPEXEC_HPP - -#include -#include -#include - -#include - -namespace Kokkos { -namespace Impl { - -//---------------------------------------------------------------------------- -/** \brief Data for OpenMP thread execution */ - -class OpenMPexec { -public: - - enum { MAX_THREAD_COUNT = 4096 }; - - struct Pool - { - Pool() : m_trackers() {} - - AllocationTracker m_trackers[ MAX_THREAD_COUNT ]; - - OpenMPexec * operator[](int i) - { - return reinterpret_cast(m_trackers[i].alloc_ptr()); - } - - AllocationTracker & at(int i) - { - return m_trackers[i]; - } - }; - -private: - - static int m_pool_topo[ 4 ]; - static int m_map_rank[ MAX_THREAD_COUNT ]; - static Pool m_pool; // Indexed by: m_pool_rank_rev - - friend class Kokkos::OpenMP ; - - int const m_pool_rank ; - int const m_pool_rank_rev ; - int const m_scratch_exec_end ; - int const m_scratch_reduce_end ; - int const m_scratch_thread_end ; - - int volatile m_barrier_state ; - - OpenMPexec(); - OpenMPexec( const OpenMPexec & ); - OpenMPexec & operator = ( const OpenMPexec & ); - - static void clear_scratch(); - -public: - - // Topology of a cache coherent thread pool: - // TOTAL = NUMA x GRAIN - // pool_size( depth = 0 ) - // pool_size(0) = total number of threads - // pool_size(1) = number of threads per NUMA - // pool_size(2) = number of threads sharing finest grain memory hierarchy - - inline static - int pool_size( int depth = 0 ) { return m_pool_topo[ depth ]; } - - inline static - OpenMPexec * pool_rev( int pool_rank_rev ) { return m_pool[ pool_rank_rev ]; } - - inline int pool_rank() const { return m_pool_rank ; } - inline int pool_rank_rev() const { return m_pool_rank_rev ; } - - inline void * scratch_reduce() const { return ((char *) this) + m_scratch_exec_end ; } - inline void * scratch_thread() const { return ((char *) this) + m_scratch_reduce_end ; } - - inline - void state_wait( int state ) - { Impl::spinwait( m_barrier_state , state ); } - - inline - void state_set( int state ) { m_barrier_state = state ; } - - ~OpenMPexec() {} - - OpenMPexec( const int poolRank - , const int scratch_exec_size - , const int scratch_reduce_size - , const int scratch_thread_size ) - : m_pool_rank( poolRank ) - , m_pool_rank_rev( pool_size() - ( poolRank + 1 ) ) - , m_scratch_exec_end( scratch_exec_size ) - , m_scratch_reduce_end( m_scratch_exec_end + scratch_reduce_size ) - , m_scratch_thread_end( m_scratch_reduce_end + scratch_thread_size ) - , m_barrier_state(0) - {} - - static void finalize(); - - static void initialize( const unsigned team_count , - const unsigned threads_per_team , - const unsigned numa_count , - const unsigned cores_per_numa ); - - static void verify_is_process( const char * const ); - static void verify_initialized( const char * const ); - - static void resize_scratch( size_t reduce_size , size_t thread_size ); - - inline static - OpenMPexec * get_thread_omp() { return m_pool[ m_map_rank[ omp_get_thread_num() ] ]; } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -class OpenMPexecTeamMember { -private: - - enum { TEAM_REDUCE_SIZE = 512 }; - - /** \brief Thread states for team synchronization */ - enum { Active = 0 , Rendezvous = 1 }; - - typedef Kokkos::OpenMP execution_space ; - typedef execution_space::scratch_memory_space scratch_memory_space ; - - Impl::OpenMPexec & m_exec ; - scratch_memory_space m_team_shared ; - int m_team_shmem ; - int m_team_base_rev ; - int m_team_rank_rev ; - int m_team_rank ; - int m_team_size ; - int m_league_rank ; - int m_league_end ; - int m_league_size ; - - // Fan-in team threads, root of the fan-in which does not block returns true - inline - bool team_fan_in() const - { - for ( int n = 1 , j ; ( ( j = m_team_rank_rev + n ) < m_team_size ) && ! ( m_team_rank_rev & n ) ; n <<= 1 ) { - m_exec.pool_rev( m_team_base_rev + j )->state_wait( Active ); - } - - if ( m_team_rank_rev ) { - m_exec.state_set( Rendezvous ); - m_exec.state_wait( Rendezvous ); - } - - return 0 == m_team_rank_rev ; - } - - inline - void team_fan_out() const - { - for ( int n = 1 , j ; ( ( j = m_team_rank_rev + n ) < m_team_size ) && ! ( m_team_rank_rev & n ) ; n <<= 1 ) { - m_exec.pool_rev( m_team_base_rev + j )->state_set( Active ); - } - } - -public: - - KOKKOS_INLINE_FUNCTION - const execution_space::scratch_memory_space & team_shmem() const - { return m_team_shared ; } - - KOKKOS_INLINE_FUNCTION int league_rank() const { return m_league_rank ; } - KOKKOS_INLINE_FUNCTION int league_size() const { return m_league_size ; } - KOKKOS_INLINE_FUNCTION int team_rank() const { return m_team_rank ; } - KOKKOS_INLINE_FUNCTION int team_size() const { return m_team_size ; } - - KOKKOS_INLINE_FUNCTION void team_barrier() const -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - {} -#else - { - if ( 1 < m_team_size ) { - team_fan_in(); - team_fan_out(); - } - } -#endif - - template - KOKKOS_INLINE_FUNCTION - void team_broadcast(ValueType& value, const int& thread_id) const - { -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { } -#else - // Make sure there is enough scratch space: - typedef typename if_c< sizeof(ValueType) < TEAM_REDUCE_SIZE - , ValueType , void >::type type ; - - type * const local_value = ((type*) m_exec.scratch_thread()); - if(team_rank() == thread_id) - *local_value = value; - memory_fence(); - team_barrier(); - value = *local_value; -#endif - } - -#ifdef KOKKOS_HAVE_CXX11 - template< class ValueType, class JoinOp > - KOKKOS_INLINE_FUNCTION ValueType - team_reduce( const ValueType & value - , const JoinOp & op_in ) const - #if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return ValueType(); } - #else - { - typedef ValueType value_type; - const JoinLambdaAdapter op(op_in); - #endif -#else // KOKKOS_HAVE_CXX11 - template< class JoinOp > - KOKKOS_INLINE_FUNCTION typename JoinOp::value_type - team_reduce( const typename JoinOp::value_type & value - , const JoinOp & op ) const - #if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return typename JoinOp::value_type(); } - #else - { - typedef typename JoinOp::value_type value_type; - #endif -#endif // KOKKOS_HAVE_CXX11 -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - // Make sure there is enough scratch space: - typedef typename if_c< sizeof(value_type) < TEAM_REDUCE_SIZE - , value_type , void >::type type ; - - type * const local_value = ((type*) m_exec.scratch_thread()); - - // Set this thread's contribution - *local_value = value ; - - // Fence to make sure the base team member has access: - memory_fence(); - - if ( team_fan_in() ) { - // The last thread to synchronize returns true, all other threads wait for team_fan_out() - type * const team_value = ((type*) m_exec.pool_rev( m_team_base_rev )->scratch_thread()); - - // Join to the team value: - for ( int i = 1 ; i < m_team_size ; ++i ) { - op.join( *team_value , *((type*) m_exec.pool_rev( m_team_base_rev + i )->scratch_thread()) ); - } - - // The base team member may "lap" the other team members, - // copy to their local value before proceeding. - for ( int i = 1 ; i < m_team_size ; ++i ) { - *((type*) m_exec.pool_rev( m_team_base_rev + i )->scratch_thread()) = *team_value ; - } - - // Fence to make sure all team members have access - memory_fence(); - } - - team_fan_out(); - - return *((type volatile const *)local_value); - } -#endif - /** \brief Intra-team exclusive prefix sum with team_rank() ordering - * with intra-team non-deterministic ordering accumulation. - * - * The global inter-team accumulation value will, at the end of the - * league's parallel execution, be the scan's total. - * Parallel execution ordering of the league's teams is non-deterministic. - * As such the base value for each team's scan operation is similarly - * non-deterministic. - */ - template< typename ArgType > - KOKKOS_INLINE_FUNCTION ArgType team_scan( const ArgType & value , ArgType * const global_accum ) const -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return ArgType(); } -#else - { - // Make sure there is enough scratch space: - typedef typename if_c< sizeof(ArgType) < TEAM_REDUCE_SIZE , ArgType , void >::type type ; - - volatile type * const work_value = ((type*) m_exec.scratch_thread()); - - *work_value = value ; - - memory_fence(); - - if ( team_fan_in() ) { - // The last thread to synchronize returns true, all other threads wait for team_fan_out() - // m_team_base[0] == highest ranking team member - // m_team_base[ m_team_size - 1 ] == lowest ranking team member - // - // 1) copy from lower to higher rank, initialize lowest rank to zero - // 2) prefix sum from lowest to highest rank, skipping lowest rank - - type accum = 0 ; - - if ( global_accum ) { - for ( int i = m_team_size ; i-- ; ) { - type & val = *((type*) m_exec.pool_rev( m_team_base_rev + i )->scratch_thread()); - accum += val ; - } - accum = atomic_fetch_add( global_accum , accum ); - } - - for ( int i = m_team_size ; i-- ; ) { - type & val = *((type*) m_exec.pool_rev( m_team_base_rev + i )->scratch_thread()); - const type offset = accum ; - accum += val ; - val = offset ; - } - - memory_fence(); - } - - team_fan_out(); - - return *work_value ; - } -#endif - - /** \brief Intra-team exclusive prefix sum with team_rank() ordering. - * - * The highest rank thread can compute the reduction total as - * reduction_total = dev.team_scan( value ) + value ; - */ - template< typename Type > - KOKKOS_INLINE_FUNCTION Type team_scan( const Type & value ) const - { return this-> template team_scan( value , 0 ); } - - //---------------------------------------- - // Private for the driver - -private: - - typedef execution_space::scratch_memory_space space ; - -public: - - template< class Arg0 , class Arg1 > - inline - OpenMPexecTeamMember( Impl::OpenMPexec & exec - , const TeamPolicy< Arg0 , Arg1 , Kokkos::OpenMP > & team - , const int shmem_size - ) - : m_exec( exec ) - , m_team_shared(0,0) - , m_team_shmem( shmem_size ) - , m_team_base_rev(0) - , m_team_rank_rev(0) - , m_team_rank(0) - , m_team_size( team.team_size() ) - , m_league_rank(0) - , m_league_end(0) - , m_league_size( team.league_size() ) - { - const int pool_rank_rev = m_exec.pool_rank_rev(); - const int pool_team_rank_rev = pool_rank_rev % team.team_alloc(); - const int pool_league_rank_rev = pool_rank_rev / team.team_alloc(); - const int league_iter_end = team.league_size() - pool_league_rank_rev * team.team_iter(); - - if ( pool_team_rank_rev < m_team_size && 0 < league_iter_end ) { - m_team_base_rev = team.team_alloc() * pool_league_rank_rev ; - m_team_rank_rev = pool_team_rank_rev ; - m_team_rank = m_team_size - ( m_team_rank_rev + 1 ); - m_league_end = league_iter_end ; - m_league_rank = league_iter_end > team.team_iter() ? league_iter_end - team.team_iter() : 0 ; - new( (void*) &m_team_shared ) space( ( (char*) m_exec.pool_rev(m_team_base_rev)->scratch_thread() ) + TEAM_REDUCE_SIZE , m_team_shmem ); - } - } - - bool valid() const - { return m_league_rank < m_league_end ; } - - void next() - { - if ( ++m_league_rank < m_league_end ) { - team_barrier(); - new( (void*) &m_team_shared ) space( ( (char*) m_exec.pool_rev(m_team_base_rev)->scratch_thread() ) + TEAM_REDUCE_SIZE , m_team_shmem ); - } - } - - static inline int team_reduce_size() { return TEAM_REDUCE_SIZE ; } -}; - - - -} // namespace Impl - -template< class Arg0 , class Arg1 > -class TeamPolicy< Arg0 , Arg1 , Kokkos::OpenMP > -{ -public: - - //! Tag this class as a kokkos execution policy - typedef TeamPolicy execution_policy ; - - //! Execution space of this execution policy. - typedef Kokkos::OpenMP execution_space ; - - typedef typename - Impl::if_c< ! Impl::is_same< Kokkos::OpenMP , Arg0 >::value , Arg0 , Arg1 >::type - work_tag ; - - //---------------------------------------- - - template< class FunctorType > - inline static - int team_size_max( const FunctorType & ) - { return execution_space::thread_pool_size(1); } - - template< class FunctorType > - inline static - int team_size_recommended( const FunctorType & ) - { return execution_space::thread_pool_size(2); } - - template< class FunctorType > - inline static - int team_size_recommended( const FunctorType &, const int& ) - { return execution_space::thread_pool_size(2); } - - //---------------------------------------- - -private: - - int m_league_size ; - int m_team_size ; - int m_team_alloc ; - int m_team_iter ; - - inline void init( const int league_size_request - , const int team_size_request ) - { - const int pool_size = execution_space::thread_pool_size(0); - const int team_max = execution_space::thread_pool_size(1); - const int team_grain = execution_space::thread_pool_size(2); - - m_league_size = league_size_request ; - - m_team_size = team_size_request < team_max ? - team_size_request : team_max ; - - // Round team size up to a multiple of 'team_gain' - const int team_size_grain = team_grain * ( ( m_team_size + team_grain - 1 ) / team_grain ); - const int team_count = pool_size / team_size_grain ; - - // Constraint : pool_size = m_team_alloc * team_count - m_team_alloc = pool_size / team_count ; - - // Maxumum number of iterations each team will take: - m_team_iter = ( m_league_size + team_count - 1 ) / team_count ; - } - -public: - - inline int team_size() const { return m_team_size ; } - inline int league_size() const { return m_league_size ; } - - /** \brief Specify league size, request team size */ - TeamPolicy( execution_space & , int league_size_request , int team_size_request , int vector_length_request = 1) - { init( league_size_request , team_size_request ); (void) vector_length_request; } - - TeamPolicy( int league_size_request , int team_size_request , int vector_length_request = 1 ) - { init( league_size_request , team_size_request ); (void) vector_length_request; } - - inline int team_alloc() const { return m_team_alloc ; } - inline int team_iter() const { return m_team_iter ; } - - typedef Impl::OpenMPexecTeamMember member_type ; -}; - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -inline -int OpenMP::thread_pool_size( int depth ) -{ - return Impl::OpenMPexec::pool_size(depth); -} - -KOKKOS_INLINE_FUNCTION -int OpenMP::thread_pool_rank() -{ -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - return Impl::OpenMPexec::m_map_rank[ omp_get_thread_num() ]; -#else - return -1 ; -#endif -} - -} // namespace Kokkos - - -namespace Kokkos { - -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct - TeamThreadRange(const Impl::OpenMPexecTeamMember& thread, const iType& count) { - return Impl::TeamThreadRangeBoundariesStruct(thread,count); -} - -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct - TeamThreadRange(const Impl::OpenMPexecTeamMember& thread, const iType& begin, const iType& end) { - return Impl::TeamThreadRangeBoundariesStruct(thread,begin,end); -} - -template -KOKKOS_INLINE_FUNCTION -Impl::ThreadVectorRangeBoundariesStruct - ThreadVectorRange(const Impl::OpenMPexecTeamMember& thread, const iType& count) { - return Impl::ThreadVectorRangeBoundariesStruct(thread,count); -} - -KOKKOS_INLINE_FUNCTION -Impl::ThreadSingleStruct PerTeam(const Impl::OpenMPexecTeamMember& thread) { - return Impl::ThreadSingleStruct(thread); -} - -KOKKOS_INLINE_FUNCTION -Impl::VectorSingleStruct PerThread(const Impl::OpenMPexecTeamMember& thread) { - return Impl::VectorSingleStruct(thread); -} -} // namespace Kokkos - -namespace Kokkos { - - /** \brief Inter-thread parallel_for. Executes lambda(iType i) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all threads of the the calling thread team. - * This functionality requires C++11 support.*/ -template -KOKKOS_INLINE_FUNCTION -void parallel_for(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, const Lambda& lambda) { - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) - lambda(i); -} - -/** \brief Inter-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all threads of the the calling thread team and a summation of - * val is performed and put into result. This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, - const Lambda & lambda, ValueType& result) { - - result = ValueType(); - - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - result+=tmp; - } - - result = loop_boundaries.thread.team_reduce(result,Impl::JoinAdd()); -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a reduction of - * val is performed using JoinType(ValueType& val, const ValueType& update) and put into init_result. - * The input value of init_result is used as initializer for temporary variables of ValueType. Therefore - * the input value should be the neutral element with respect to the join operation (e.g. '0 for +-' or - * '1 for *'). This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType, class JoinType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, - const Lambda & lambda, const JoinType& join, ValueType& init_result) { - - ValueType result = init_result; - - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - join(result,tmp); - } - - init_result = loop_boundaries.thread.team_reduce(result,join); -} - -} //namespace Kokkos - - -namespace Kokkos { -/** \brief Intra-thread vector parallel_for. Executes lambda(iType i) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread. - * This functionality requires C++11 support.*/ -template -KOKKOS_INLINE_FUNCTION -void parallel_for(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda& lambda) { - #ifdef KOKKOS_HAVE_PRAGMA_IVDEP - #pragma ivdep - #endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) - lambda(i); -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a summation of - * val is performed and put into result. This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda & lambda, ValueType& result) { - result = ValueType(); -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - result+=tmp; - } -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a reduction of - * val is performed using JoinType(ValueType& val, const ValueType& update) and put into init_result. - * The input value of init_result is used as initializer for temporary variables of ValueType. Therefore - * the input value should be the neutral element with respect to the join operation (e.g. '0 for +-' or - * '1 for *'). This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType, class JoinType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda & lambda, const JoinType& join, ValueType& init_result) { - - ValueType result = init_result; -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - join(result,tmp); - } - init_result = result; -} - -/** \brief Intra-thread vector parallel exclusive prefix sum. Executes lambda(iType i, ValueType & val, bool final) - * for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes in the thread and a scan operation is performed. - * Depending on the target execution space the operator might be called twice: once with final=false - * and once with final=true. When final==true val contains the prefix sum value. The contribution of this - * "i" needs to be added to val no matter whether final==true or not. In a serial execution - * (i.e. team_size==1) the operator is only called once with final==true. Scan_val will be set - * to the final sum value over all vector lanes. - * This functionality requires C++11 support.*/ -template< typename iType, class FunctorType > -KOKKOS_INLINE_FUNCTION -void parallel_scan(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const FunctorType & lambda) { - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , void > ValueTraits ; - typedef typename ValueTraits::value_type value_type ; - - value_type scan_val = value_type(); - -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - lambda(i,scan_val,true); - } -} - -} // namespace Kokkos - -namespace Kokkos { - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::VectorSingleStruct& single_struct, const FunctorType& lambda) { - lambda(); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::ThreadSingleStruct& single_struct, const FunctorType& lambda) { - if(single_struct.team_member.team_rank()==0) lambda(); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::VectorSingleStruct& single_struct, const FunctorType& lambda, ValueType& val) { - lambda(val); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::ThreadSingleStruct& single_struct, const FunctorType& lambda, ValueType& val) { - if(single_struct.team_member.team_rank()==0) { - lambda(val); - } - single_struct.team_member.team_broadcast(val,0); -} -} - -#endif /* #ifndef KOKKOS_OPENMPEXEC_HPP */ - diff --git a/lib/kokkos/core/src/Qthread/Kokkos_QthreadExec.cpp b/lib/kokkos/core/src/Qthread/Kokkos_QthreadExec.cpp deleted file mode 100644 index 33ffb6314f..0000000000 --- a/lib/kokkos/core/src/Qthread/Kokkos_QthreadExec.cpp +++ /dev/null @@ -1,496 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#if defined( KOKKOS_HAVE_QTHREAD ) - -#include -#include -#include -#include -#include -#include -#include -#include - -// Defines to enable experimental Qthread functionality - -#define QTHREAD_LOCAL_PRIORITY -#define CLONED_TASKS - -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { -namespace { - -enum { MAXIMUM_QTHREAD_WORKERS = 1024 }; - -/** s_exec is indexed by the reverse rank of the workers - * for faster fan-in / fan-out lookups - * [ n - 1 , n - 2 , ... , 0 ] - */ -QthreadExec * s_exec[ MAXIMUM_QTHREAD_WORKERS ]; - -int s_number_shepherds = 0 ; -int s_number_workers_per_shepherd = 0 ; -int s_number_workers = 0 ; - -inline -QthreadExec ** worker_exec() -{ - return s_exec + s_number_workers - ( qthread_shep() * s_number_workers_per_shepherd + qthread_worker_local(NULL) + 1 ); -} - -const int s_base_size = QthreadExec::align_alloc( sizeof(QthreadExec) ); - -int s_worker_reduce_end = 0 ; /* End of worker reduction memory */ -int s_worker_shared_end = 0 ; /* Total of worker scratch memory */ -int s_worker_shared_begin = 0 ; /* Beginning of worker shared memory */ - -QthreadExecFunctionPointer volatile s_active_function = 0 ; -const void * volatile s_active_function_arg = 0 ; - -} /* namespace */ -} /* namespace Impl */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - -namespace Kokkos { - -void Qthread::initialize( int thread_count ) -{ - // Environment variable: QTHREAD_NUM_SHEPHERDS - // Environment variable: QTHREAD_NUM_WORKERS_PER_SHEP - // Environment variable: QTHREAD_HWPAR - - { - char buffer[256]; - snprintf(buffer,sizeof(buffer),"QTHREAD_HWPAR=%d",thread_count); - putenv(buffer); - } - - const bool ok_init = ( QTHREAD_SUCCESS == qthread_initialize() ) && - ( thread_count == qthread_num_shepherds() * qthread_num_workers_local(NO_SHEPHERD) ) && - ( thread_count == qthread_num_workers() ); - - bool ok_symmetry = true ; - - if ( ok_init ) { - Impl::s_number_shepherds = qthread_num_shepherds(); - Impl::s_number_workers_per_shepherd = qthread_num_workers_local(NO_SHEPHERD); - Impl::s_number_workers = Impl::s_number_shepherds * Impl::s_number_workers_per_shepherd ; - - for ( int i = 0 ; ok_symmetry && i < Impl::s_number_shepherds ; ++i ) { - ok_symmetry = ( Impl::s_number_workers_per_shepherd == qthread_num_workers_local(i) ); - } - } - - if ( ! ok_init || ! ok_symmetry ) { - std::ostringstream msg ; - - msg << "Kokkos::Qthread::initialize(" << thread_count << ") FAILED" ; - msg << " : qthread_num_shepherds = " << qthread_num_shepherds(); - msg << " : qthread_num_workers_per_shepherd = " << qthread_num_workers_local(NO_SHEPHERD); - msg << " : qthread_num_workers = " << qthread_num_workers(); - - if ( ! ok_symmetry ) { - msg << " : qthread_num_workers_local = {" ; - for ( int i = 0 ; i < Impl::s_number_shepherds ; ++i ) { - msg << " " << qthread_num_workers_local(i) ; - } - msg << " }" ; - } - - Impl::s_number_workers = 0 ; - Impl::s_number_shepherds = 0 ; - Impl::s_number_workers_per_shepherd = 0 ; - - if ( ok_init ) { qthread_finalize(); } - - Kokkos::Impl::throw_runtime_exception( msg.str() ); - } - - Impl::QthreadExec::resize_worker_scratch( 256 , 256 ); - - // Init the array for used for arbitrarily sized atomics - Impl::init_lock_array_host_space(); - -} - -void Qthread::finalize() -{ - Impl::QthreadExec::clear_workers(); - - if ( Impl::s_number_workers ) { - qthread_finalize(); - } - - Impl::s_number_workers = 0 ; - Impl::s_number_shepherds = 0 ; - Impl::s_number_workers_per_shepherd = 0 ; -} - -void Qthread::print_configuration( std::ostream & s , const bool detail ) -{ - s << "Kokkos::Qthread {" - << " num_shepherds(" << Impl::s_number_shepherds << ")" - << " num_workers_per_shepherd(" << Impl::s_number_workers_per_shepherd << ")" - << " }" << std::endl ; -} - -Qthread & Qthread::instance( int ) -{ - static Qthread q ; - return q ; -} - -void Qthread::fence() -{ -} - -int Qthread::shepherd_size() const { return Impl::s_number_shepherds ; } -int Qthread::shepherd_worker_size() const { return Impl::s_number_workers_per_shepherd ; } - -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { -namespace { - -aligned_t driver_exec_all( void * arg ) -{ - QthreadExec & exec = **worker_exec(); - - (*s_active_function)( exec , s_active_function_arg ); - -/* - fprintf( stdout - , "QthreadExec driver worker(%d:%d) shepherd(%d:%d) shepherd_worker(%d:%d) done\n" - , exec.worker_rank() - , exec.worker_size() - , exec.shepherd_rank() - , exec.shepherd_size() - , exec.shepherd_worker_rank() - , exec.shepherd_worker_size() - ); - fflush(stdout); -*/ - - return 0 ; -} - -aligned_t driver_resize_worker_scratch( void * arg ) -{ - static volatile int lock_begin = 0 ; - static volatile int lock_end = 0 ; - - QthreadExec ** const exec = worker_exec(); - - //---------------------------------------- - // Serialize allocation for thread safety - - while ( ! atomic_compare_exchange_strong( & lock_begin , 0 , 1 ) ); // Spin wait to claim lock - - const bool ok = 0 == *exec ; - - if ( ok ) { *exec = (QthreadExec *) malloc( s_base_size + s_worker_shared_end ); } - - lock_begin = 0 ; // release lock - - if ( ok ) { new( *exec ) QthreadExec(); } - - //---------------------------------------- - // Wait for all calls to complete to insure that each worker has executed. - - if ( s_number_workers == 1 + atomic_fetch_add( & lock_end , 1 ) ) { lock_end = 0 ; } - - while ( lock_end ); - -/* - fprintf( stdout - , "QthreadExec resize worker(%d:%d) shepherd(%d:%d) shepherd_worker(%d:%d) done\n" - , (**exec).worker_rank() - , (**exec).worker_size() - , (**exec).shepherd_rank() - , (**exec).shepherd_size() - , (**exec).shepherd_worker_rank() - , (**exec).shepherd_worker_size() - ); - fflush(stdout); -*/ - - //---------------------------------------- - - if ( ! ok ) { - fprintf( stderr , "Kokkos::QthreadExec resize failed\n" ); - fflush( stderr ); - } - - return 0 ; -} - -void verify_is_process( const char * const label , bool not_active = false ) -{ - const bool not_process = 0 != qthread_shep() || 0 != qthread_worker_local(NULL); - const bool is_active = not_active && ( s_active_function || s_active_function_arg ); - - if ( not_process || is_active ) { - std::string msg( label ); - msg.append( " : FAILED" ); - if ( not_process ) msg.append(" : not called by main process"); - if ( is_active ) msg.append(" : parallel execution in progress"); - Kokkos::Impl::throw_runtime_exception( msg ); - } -} - -} - -int QthreadExec::worker_per_shepherd() -{ - return s_number_workers_per_shepherd ; -} - -QthreadExec::QthreadExec() -{ - const int shepherd_rank = qthread_shep(); - const int shepherd_worker_rank = qthread_worker_local(NULL); - const int worker_rank = shepherd_rank * s_number_workers_per_shepherd + shepherd_worker_rank ; - - m_worker_base = s_exec ; - m_shepherd_base = s_exec + s_number_workers_per_shepherd * ( ( s_number_shepherds - ( shepherd_rank + 1 ) ) ); - m_scratch_alloc = ( (unsigned char *) this ) + s_base_size ; - m_reduce_end = s_worker_reduce_end ; - m_shepherd_rank = shepherd_rank ; - m_shepherd_size = s_number_shepherds ; - m_shepherd_worker_rank = shepherd_worker_rank ; - m_shepherd_worker_size = s_number_workers_per_shepherd ; - m_worker_rank = worker_rank ; - m_worker_size = s_number_workers ; - m_worker_state = QthreadExec::Active ; -} - -void QthreadExec::clear_workers() -{ - for ( int iwork = 0 ; iwork < s_number_workers ; ++iwork ) { - QthreadExec * const exec = s_exec[iwork] ; - s_exec[iwork] = 0 ; - free( exec ); - } -} - -void QthreadExec::shared_reset( Qthread::scratch_memory_space & space ) -{ - new( & space ) - Qthread::scratch_memory_space( - ((unsigned char *) (**m_shepherd_base).m_scratch_alloc ) + s_worker_shared_begin , - s_worker_shared_end - s_worker_shared_begin - ); -} - -void QthreadExec::resize_worker_scratch( const int reduce_size , const int shared_size ) -{ - const int exec_all_reduce_alloc = align_alloc( reduce_size ); - const int shepherd_scan_alloc = align_alloc( 8 ); - const int shepherd_shared_end = exec_all_reduce_alloc + shepherd_scan_alloc + align_alloc( shared_size ); - - if ( s_worker_reduce_end < exec_all_reduce_alloc || - s_worker_shared_end < shepherd_shared_end ) { - -/* - fprintf( stdout , "QthreadExec::resize\n"); - fflush(stdout); -*/ - - // Clear current worker memory before allocating new worker memory - clear_workers(); - - // Increase the buffers to an aligned allocation - s_worker_reduce_end = exec_all_reduce_alloc ; - s_worker_shared_begin = exec_all_reduce_alloc + shepherd_scan_alloc ; - s_worker_shared_end = shepherd_shared_end ; - - // Need to query which shepherd this main 'process' is running... - - const int main_shep = qthread_shep(); - - // Have each worker resize its memory for proper first-touch -#if 0 - for ( int jshep = 0 ; jshep < s_number_shepherds ; ++jshep ) { - for ( int i = jshep != main_shep ? 0 : 1 ; i < s_number_workers_per_shepherd ; ++i ) { - qthread_fork_to( driver_resize_worker_scratch , NULL , NULL , jshep ); - }} -#else - // If this function is used before the 'qthread.task_policy' unit test - // the 'qthread.task_policy' unit test fails with a seg-fault within libqthread.so. - for ( int jshep = 0 ; jshep < s_number_shepherds ; ++jshep ) { - const int num_clone = jshep != main_shep ? s_number_workers_per_shepherd : s_number_workers_per_shepherd - 1 ; - - if ( num_clone ) { - const int ret = qthread_fork_clones_to_local_priority - ( driver_resize_worker_scratch /* function */ - , NULL /* function data block */ - , NULL /* pointer to return value feb */ - , jshep /* shepherd number */ - , num_clone - 1 /* number of instances - 1 */ - ); - - assert(ret == QTHREAD_SUCCESS); - } - } -#endif - - driver_resize_worker_scratch( NULL ); - - // Verify all workers allocated - - bool ok = true ; - for ( int iwork = 0 ; ok && iwork < s_number_workers ; ++iwork ) { ok = 0 != s_exec[iwork] ; } - - if ( ! ok ) { - std::ostringstream msg ; - msg << "Kokkos::Impl::QthreadExec::resize : FAILED for workers {" ; - for ( int iwork = 0 ; iwork < s_number_workers ; ++iwork ) { - if ( 0 == s_exec[iwork] ) { msg << " " << ( s_number_workers - ( iwork + 1 ) ); } - } - msg << " }" ; - Kokkos::Impl::throw_runtime_exception( msg.str() ); - } - } -} - -void QthreadExec::exec_all( Qthread & , QthreadExecFunctionPointer func , const void * arg ) -{ - verify_is_process("QthreadExec::exec_all(...)",true); - -/* - fprintf( stdout , "QthreadExec::exec_all\n"); - fflush(stdout); -*/ - - s_active_function = func ; - s_active_function_arg = arg ; - - // Need to query which shepherd this main 'process' is running... - - const int main_shep = qthread_shep(); - -#if 0 - for ( int jshep = 0 , iwork = 0 ; jshep < s_number_shepherds ; ++jshep ) { - for ( int i = jshep != main_shep ? 0 : 1 ; i < s_number_workers_per_shepherd ; ++i , ++iwork ) { - qthread_fork_to( driver_exec_all , NULL , NULL , jshep ); - }} -#else - // If this function is used before the 'qthread.task_policy' unit test - // the 'qthread.task_policy' unit test fails with a seg-fault within libqthread.so. - for ( int jshep = 0 ; jshep < s_number_shepherds ; ++jshep ) { - const int num_clone = jshep != main_shep ? s_number_workers_per_shepherd : s_number_workers_per_shepherd - 1 ; - - if ( num_clone ) { - const int ret = qthread_fork_clones_to_local_priority - ( driver_exec_all /* function */ - , NULL /* function data block */ - , NULL /* pointer to return value feb */ - , jshep /* shepherd number */ - , num_clone - 1 /* number of instances - 1 */ - ); - - assert(ret == QTHREAD_SUCCESS); - } - } -#endif - - driver_exec_all( NULL ); - - s_active_function = 0 ; - s_active_function_arg = 0 ; -} - -void * QthreadExec::exec_all_reduce_result() -{ - return s_exec[0]->m_scratch_alloc ; -} - -} /* namespace Impl */ -} /* namespace Kokkos */ - -namespace Kokkos { -namespace Impl { - -QthreadTeamPolicyMember::QthreadTeamPolicyMember() - : m_exec( **worker_exec() ) - , m_team_shared(0,0) - , m_team_size( 1 ) - , m_team_rank( 0 ) - , m_league_size(1) - , m_league_end(1) - , m_league_rank(0) -{ - m_exec.shared_reset( m_team_shared ); -} - -QthreadTeamPolicyMember::QthreadTeamPolicyMember( const QthreadTeamPolicyMember::TaskTeam & ) - : m_exec( **worker_exec() ) - , m_team_shared(0,0) - , m_team_size( s_number_workers_per_shepherd ) - , m_team_rank( m_exec.shepherd_worker_rank() ) - , m_league_size(1) - , m_league_end(1) - , m_league_rank(0) -{ - m_exec.shared_reset( m_team_shared ); -} - -} /* namespace Impl */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - -#endif /* #if defined( KOKKOS_HAVE_QTHREAD ) */ - diff --git a/lib/kokkos/core/src/Qthread/Kokkos_QthreadExec.hpp b/lib/kokkos/core/src/Qthread/Kokkos_QthreadExec.hpp deleted file mode 100644 index d772aee2bf..0000000000 --- a/lib/kokkos/core/src/Qthread/Kokkos_QthreadExec.hpp +++ /dev/null @@ -1,617 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_QTHREADEXEC_HPP -#define KOKKOS_QTHREADEXEC_HPP - -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -//---------------------------------------------------------------------------- - -class QthreadExec ; - -typedef void (*QthreadExecFunctionPointer)( QthreadExec & , const void * ); - -class QthreadExec { -private: - - enum { Inactive = 0 , Active = 1 }; - - const QthreadExec * const * m_worker_base ; - const QthreadExec * const * m_shepherd_base ; - - void * m_scratch_alloc ; ///< Scratch memory [ reduce , team , shared ] - int m_reduce_end ; ///< End of scratch reduction memory - - int m_shepherd_rank ; - int m_shepherd_size ; - - int m_shepherd_worker_rank ; - int m_shepherd_worker_size ; - - /* - * m_worker_rank = m_shepherd_rank * m_shepherd_worker_size + m_shepherd_worker_rank - * m_worker_size = m_shepherd_size * m_shepherd_worker_size - */ - int m_worker_rank ; - int m_worker_size ; - - int mutable volatile m_worker_state ; - - - friend class Kokkos::Qthread ; - - ~QthreadExec(); - QthreadExec( const QthreadExec & ); - QthreadExec & operator = ( const QthreadExec & ); - -public: - - QthreadExec(); - - /** Execute the input function on all available Qthread workers */ - static void exec_all( Qthread & , QthreadExecFunctionPointer , const void * ); - - //---------------------------------------- - /** Barrier across all workers participating in the 'exec_all' */ - void exec_all_barrier() const - { - const int rev_rank = m_worker_size - ( m_worker_rank + 1 ); - - int n , j ; - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < m_worker_size ) ; n <<= 1 ) { - Impl::spinwait( m_worker_base[j]->m_worker_state , QthreadExec::Active ); - } - - if ( rev_rank ) { - m_worker_state = QthreadExec::Inactive ; - Impl::spinwait( m_worker_state , QthreadExec::Inactive ); - } - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < m_worker_size ) ; n <<= 1 ) { - m_worker_base[j]->m_worker_state = QthreadExec::Active ; - } - } - - /** Barrier across workers within the shepherd with rank < team_rank */ - void shepherd_barrier( const int team_size ) const - { - if ( m_shepherd_worker_rank < team_size ) { - - const int rev_rank = team_size - ( m_shepherd_worker_rank + 1 ); - - int n , j ; - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < team_size ) ; n <<= 1 ) { - Impl::spinwait( m_shepherd_base[j]->m_worker_state , QthreadExec::Active ); - } - - if ( rev_rank ) { - m_worker_state = QthreadExec::Inactive ; - Impl::spinwait( m_worker_state , QthreadExec::Inactive ); - } - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < team_size ) ; n <<= 1 ) { - m_shepherd_base[j]->m_worker_state = QthreadExec::Active ; - } - } - } - - //---------------------------------------- - /** Reduce across all workers participating in the 'exec_all' */ - template< class FunctorType , class ArgTag > - inline - void exec_all_reduce( const FunctorType & func ) const - { - typedef Kokkos::Impl::FunctorValueJoin< FunctorType , ArgTag > ValueJoin ; - - const int rev_rank = m_worker_size - ( m_worker_rank + 1 ); - - int n , j ; - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < m_worker_size ) ; n <<= 1 ) { - const QthreadExec & fan = *m_worker_base[j]; - - Impl::spinwait( fan.m_worker_state , QthreadExec::Active ); - - ValueJoin::join( func , m_scratch_alloc , fan.m_scratch_alloc ); - } - - if ( rev_rank ) { - m_worker_state = QthreadExec::Inactive ; - Impl::spinwait( m_worker_state , QthreadExec::Inactive ); - } - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < m_worker_size ) ; n <<= 1 ) { - m_worker_base[j]->m_worker_state = QthreadExec::Active ; - } - } - - //---------------------------------------- - /** Scall across all workers participating in the 'exec_all' */ - template< class FunctorType , class ArgTag > - inline - void exec_all_scan( const FunctorType & func ) const - { - typedef Kokkos::Impl::FunctorValueInit< FunctorType , ArgTag > ValueInit ; - typedef Kokkos::Impl::FunctorValueJoin< FunctorType , ArgTag > ValueJoin ; - typedef Kokkos::Impl::FunctorValueOps< FunctorType , ArgTag > ValueOps ; - - const int rev_rank = m_worker_size - ( m_worker_rank + 1 ); - - int n , j ; - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < m_worker_size ) ; n <<= 1 ) { - Impl::spinwait( m_worker_base[j]->m_worker_state , QthreadExec::Active ); - } - - if ( rev_rank ) { - m_worker_state = QthreadExec::Inactive ; - Impl::spinwait( m_worker_state , QthreadExec::Inactive ); - } - else { - // Root thread scans across values before releasing threads - // Worker data is in reverse order, so m_worker_base[0] is the - // highest ranking thread. - - // Copy from lower ranking to higher ranking worker. - for ( int i = 1 ; i < m_worker_size ; ++i ) { - ValueOps::copy( func - , m_worker_base[i-1]->m_scratch_alloc - , m_worker_base[i]->m_scratch_alloc - ); - } - - ValueInit::init( func , m_worker_base[m_worker_size-1]->m_scratch_alloc ); - - // Join from lower ranking to higher ranking worker. - // Value at m_worker_base[n-1] is zero so skip adding it to m_worker_base[n-2]. - for ( int i = m_worker_size - 1 ; --i ; ) { - ValueJoin::join( func , m_worker_base[i-1]->m_scratch_alloc , m_worker_base[i]->m_scratch_alloc ); - } - } - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < m_worker_size ) ; n <<= 1 ) { - m_worker_base[j]->m_worker_state = QthreadExec::Active ; - } - } - - //---------------------------------------- - - template< class Type> - inline - volatile Type * shepherd_team_scratch_value() const - { return (volatile Type*)(((unsigned char *) m_scratch_alloc) + m_reduce_end); } - - template< class Type > - inline - void shepherd_broadcast( Type & value , const int team_size , const int team_rank ) const - { - if ( m_shepherd_base ) { - Type * const shared_value = m_shepherd_base[0]->shepherd_team_scratch_value(); - if ( m_shepherd_worker_rank == team_rank ) { *shared_value = value ; } - memory_fence(); - shepherd_barrier( team_size ); - value = *shared_value ; - } - } - - template< class Type > - inline - Type shepherd_reduce( const int team_size , const Type & value ) const - { - *shepherd_team_scratch_value() = value ; - - memory_fence(); - - const int rev_rank = team_size - ( m_shepherd_worker_rank + 1 ); - - int n , j ; - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < team_size ) ; n <<= 1 ) { - Impl::spinwait( m_shepherd_base[j]->m_worker_state , QthreadExec::Active ); - } - - if ( rev_rank ) { - m_worker_state = QthreadExec::Inactive ; - Impl::spinwait( m_worker_state , QthreadExec::Inactive ); - } - else { - Type & accum = * m_shepherd_base[0]->shepherd_team_scratch_value(); - for ( int i = 1 ; i < n ; ++i ) { - accum += * m_shepherd_base[i]->shepherd_team_scratch_value(); - } - for ( int i = 1 ; i < n ; ++i ) { - * m_shepherd_base[i]->shepherd_team_scratch_value() = accum ; - } - - memory_fence(); - } - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < team_size ) ; n <<= 1 ) { - m_shepherd_base[j]->m_worker_state = QthreadExec::Active ; - } - - return *shepherd_team_scratch_value(); - } - - template< class JoinOp > - inline - typename JoinOp::value_type - shepherd_reduce( const int team_size - , const typename JoinOp::value_type & value - , const JoinOp & op ) const - { - typedef typename JoinOp::value_type Type ; - - *shepherd_team_scratch_value() = value ; - - memory_fence(); - - const int rev_rank = team_size - ( m_shepherd_worker_rank + 1 ); - - int n , j ; - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < team_size ) ; n <<= 1 ) { - Impl::spinwait( m_shepherd_base[j]->m_worker_state , QthreadExec::Active ); - } - - if ( rev_rank ) { - m_worker_state = QthreadExec::Inactive ; - Impl::spinwait( m_worker_state , QthreadExec::Inactive ); - } - else { - volatile Type & accum = * m_shepherd_base[0]->shepherd_team_scratch_value(); - for ( int i = 1 ; i < team_size ; ++i ) { - op.join( accum , * m_shepherd_base[i]->shepherd_team_scratch_value() ); - } - for ( int i = 1 ; i < team_size ; ++i ) { - * m_shepherd_base[i]->shepherd_team_scratch_value() = accum ; - } - - memory_fence(); - } - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < team_size ) ; n <<= 1 ) { - m_shepherd_base[j]->m_worker_state = QthreadExec::Active ; - } - - return *shepherd_team_scratch_value(); - } - - template< class Type > - inline - Type shepherd_scan( const int team_size - , const Type & value - , Type * const global_value = 0 ) const - { - *shepherd_team_scratch_value() = value ; - - memory_fence(); - - const int rev_rank = team_size - ( m_shepherd_worker_rank + 1 ); - - int n , j ; - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < team_size ) ; n <<= 1 ) { - Impl::spinwait( m_shepherd_base[j]->m_worker_state , QthreadExec::Active ); - } - - if ( rev_rank ) { - m_worker_state = QthreadExec::Inactive ; - Impl::spinwait( m_worker_state , QthreadExec::Inactive ); - } - else { - // Root thread scans across values before releasing threads - // Worker data is in reverse order, so m_shepherd_base[0] is the - // highest ranking thread. - - // Copy from lower ranking to higher ranking worker. - - Type accum = * m_shepherd_base[0]->shepherd_team_scratch_value(); - for ( int i = 1 ; i < team_size ; ++i ) { - const Type tmp = * m_shepherd_base[i]->shepherd_team_scratch_value(); - accum += tmp ; - * m_shepherd_base[i-1]->shepherd_team_scratch_value() = tmp ; - } - - * m_shepherd_base[team_size-1]->shepherd_team_scratch_value() = - global_value ? atomic_fetch_add( global_value , accum ) : 0 ; - - // Join from lower ranking to higher ranking worker. - for ( int i = team_size ; --i ; ) { - * m_shepherd_base[i-1]->shepherd_team_scratch_value() += * m_shepherd_base[i]->shepherd_team_scratch_value(); - } - - memory_fence(); - } - - for ( n = 1 ; ( ! ( rev_rank & n ) ) && ( ( j = rev_rank + n ) < team_size ) ; n <<= 1 ) { - m_shepherd_base[j]->m_worker_state = QthreadExec::Active ; - } - - return *shepherd_team_scratch_value(); - } - - //---------------------------------------- - - static inline - int align_alloc( int size ) - { - enum { ALLOC_GRAIN = 1 << 6 /* power of two, 64bytes */}; - enum { ALLOC_GRAIN_MASK = ALLOC_GRAIN - 1 }; - return ( size + ALLOC_GRAIN_MASK ) & ~ALLOC_GRAIN_MASK ; - } - - void shared_reset( Qthread::scratch_memory_space & ); - - void * exec_all_reduce_value() const { return m_scratch_alloc ; } - - static void * exec_all_reduce_result(); - - static void resize_worker_scratch( const int reduce_size , const int shared_size ); - static void clear_workers(); - - //---------------------------------------- - - inline int worker_rank() const { return m_worker_rank ; } - inline int worker_size() const { return m_worker_size ; } - inline int shepherd_worker_rank() const { return m_shepherd_worker_rank ; } - inline int shepherd_worker_size() const { return m_shepherd_worker_size ; } - inline int shepherd_rank() const { return m_shepherd_rank ; } - inline int shepherd_size() const { return m_shepherd_size ; } - - static int worker_per_shepherd(); -}; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -class QthreadTeamPolicyMember { -private: - - typedef Kokkos::Qthread execution_space ; - typedef execution_space::scratch_memory_space scratch_memory_space ; - - - Impl::QthreadExec & m_exec ; - scratch_memory_space m_team_shared ; - const int m_team_size ; - const int m_team_rank ; - const int m_league_size ; - const int m_league_end ; - int m_league_rank ; - -public: - - KOKKOS_INLINE_FUNCTION - const scratch_memory_space & team_shmem() const { return m_team_shared ; } - - KOKKOS_INLINE_FUNCTION int league_rank() const { return m_league_rank ; } - KOKKOS_INLINE_FUNCTION int league_size() const { return m_league_size ; } - KOKKOS_INLINE_FUNCTION int team_rank() const { return m_team_rank ; } - KOKKOS_INLINE_FUNCTION int team_size() const { return m_team_size ; } - - KOKKOS_INLINE_FUNCTION void team_barrier() const -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - {} -#else - { m_exec.shepherd_barrier( m_team_size ); } -#endif - - template< typename Type > - KOKKOS_INLINE_FUNCTION Type team_broadcast( const Type & value , int rank ) const -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return Type(); } -#else - { return m_exec.template shepherd_broadcast( value , m_team_size , rank ); } -#endif - - template< typename Type > - KOKKOS_INLINE_FUNCTION Type team_reduce( const Type & value ) const -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return Type(); } -#else - { return m_exec.template shepherd_reduce( m_team_size , value ); } -#endif - - template< typename JoinOp > - KOKKOS_INLINE_FUNCTION typename JoinOp::value_type - team_reduce( const typename JoinOp::value_type & value - , const JoinOp & op ) const -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return typename JoinOp::value_type(); } -#else - { return m_exec.template shepherd_reduce( m_team_size , value , op ); } -#endif - - /** \brief Intra-team exclusive prefix sum with team_rank() ordering. - * - * The highest rank thread can compute the reduction total as - * reduction_total = dev.team_scan( value ) + value ; - */ - template< typename Type > - KOKKOS_INLINE_FUNCTION Type team_scan( const Type & value ) const -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return Type(); } -#else - { return m_exec.template shepherd_scan( m_team_size , value ); } -#endif - - /** \brief Intra-team exclusive prefix sum with team_rank() ordering - * with intra-team non-deterministic ordering accumulation. - * - * The global inter-team accumulation value will, at the end of the - * league's parallel execution, be the scan's total. - * Parallel execution ordering of the league's teams is non-deterministic. - * As such the base value for each team's scan operation is similarly - * non-deterministic. - */ - template< typename Type > - KOKKOS_INLINE_FUNCTION Type team_scan( const Type & value , Type * const global_accum ) const -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return Type(); } -#else - { return m_exec.template shepherd_scan( m_team_size , value , global_accum ); } -#endif - - //---------------------------------------- - // Private driver for task-team parallel - - struct TaskTeam {}; - - QthreadTeamPolicyMember(); - explicit QthreadTeamPolicyMember( const TaskTeam & ); - - //---------------------------------------- - // Private for the driver ( for ( member_type i(exec,team); i ; i.next_team() ) { ... } - - // Initialize - template< class Arg0 , class Arg1 > - QthreadTeamPolicyMember( Impl::QthreadExec & exec , const TeamPolicy & team ) - : m_exec( exec ) - , m_team_shared(0,0) - , m_team_size( team.m_team_size ) - , m_team_rank( exec.shepherd_worker_rank() ) - , m_league_size( team.m_league_size ) - , m_league_end( team.m_league_size - team.m_shepherd_iter * ( exec.shepherd_size() - ( exec.shepherd_rank() + 1 ) ) ) - , m_league_rank( m_league_end > team.m_shepherd_iter ? m_league_end - team.m_shepherd_iter : 0 ) - { - m_exec.shared_reset( m_team_shared ); - } - - // Continue - operator bool () const { return m_league_rank < m_league_end ; } - - // iterate - void next_team() { ++m_league_rank ; m_exec.shared_reset( m_team_shared ); } -}; - -} // namespace Impl - -template< class Arg0 , class Arg1 > -class TeamPolicy< Arg0 , Arg1 , Kokkos::Qthread > -{ -private: - - const int m_league_size ; - const int m_team_size ; - const int m_shepherd_iter ; - -public: - - //! Tag this class as a kokkos execution policy - typedef TeamPolicy execution_policy ; - typedef Qthread execution_space ; - - typedef typename - Impl::if_c< ! Impl::is_same< Kokkos::Qthread , Arg0 >::value , Arg0 , Arg1 >::type - work_tag ; - - //---------------------------------------- - - template< class FunctorType > - inline static - int team_size_max( const FunctorType & ) - { return Qthread::instance().shepherd_worker_size(); } - - template< class FunctorType > - static int team_size_recommended( const FunctorType & f ) - { return team_size_max( f ); } - - template< class FunctorType > - inline static - int team_size_recommended( const FunctorType & f , const int& ) - { return team_size_max( f ); } - - //---------------------------------------- - - inline int team_size() const { return m_team_size ; } - inline int league_size() const { return m_league_size ; } - - // One active team per shepherd - TeamPolicy( Kokkos::Qthread & q - , const int league_size - , const int team_size - ) - : m_league_size( league_size ) - , m_team_size( team_size < q.shepherd_worker_size() - ? team_size : q.shepherd_worker_size() ) - , m_shepherd_iter( ( league_size + q.shepherd_size() - 1 ) / q.shepherd_size() ) - { - } - - // One active team per shepherd - TeamPolicy( const int league_size - , const int team_size - ) - : m_league_size( league_size ) - , m_team_size( team_size < Qthread::instance().shepherd_worker_size() - ? team_size : Qthread::instance().shepherd_worker_size() ) - , m_shepherd_iter( ( league_size + Qthread::instance().shepherd_size() - 1 ) / Qthread::instance().shepherd_size() ) - { - } - - typedef Impl::QthreadTeamPolicyMember member_type ; - - friend class Impl::QthreadTeamPolicyMember ; -}; - -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #define KOKKOS_QTHREADEXEC_HPP */ - diff --git a/lib/kokkos/core/src/Qthread/Kokkos_Qthread_Parallel.hpp b/lib/kokkos/core/src/Qthread/Kokkos_Qthread_Parallel.hpp deleted file mode 100644 index dc76a0c426..0000000000 --- a/lib/kokkos/core/src/Qthread/Kokkos_Qthread_Parallel.hpp +++ /dev/null @@ -1,643 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_QTHREAD_PARALLEL_HPP -#define KOKKOS_QTHREAD_PARALLEL_HPP - -#include - -#include - -#include -#include - -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -//---------------------------------------------------------------------------- - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelFor< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Qthread > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Qthread > Policy ; - - const FunctorType m_func ; - const Policy m_policy ; - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( i ); - } - } - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( ! Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( typename PType::work_tag() , i ); - } - } - - // Function is called once by every concurrent thread. - static void execute( QthreadExec & exec , const void * arg ) - { - const ParallelFor & self = * ((const ParallelFor *) arg ); - - driver( self.m_func , typename Policy::WorkRange( self.m_policy , exec.worker_rank() , exec.worker_size() ) ); - - // All threads wait for completion. - exec.exec_all_barrier(); - } - -public: - - ParallelFor( const FunctorType & functor - , const Policy & policy - ) - : m_func( functor ) - , m_policy( policy ) - { - Impl::QthreadExec::exec_all( Qthread::instance() , & ParallelFor::execute , this ); - } -}; - -//---------------------------------------------------------------------------- - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelReduce< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Qthread > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Qthread > Policy ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , typename Policy::work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , typename Policy::work_tag > ValueInit ; - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - const FunctorType m_func ; - const Policy m_policy ; - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , reference_type update - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( i , update ); - } - } - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( ! Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , reference_type update - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( typename PType::work_tag() , i , update ); - } - } - - static void execute( QthreadExec & exec , const void * arg ) - { - const ParallelReduce & self = * ((const ParallelReduce *) arg ); - - driver( self.m_func - , ValueInit::init( self.m_func , exec.exec_all_reduce_value() ) - , typename Policy::WorkRange( self.m_policy , exec.worker_rank() , exec.worker_size() ) - ); - - exec.template exec_all_reduce( self.m_func ); - } - -public: - - template< class HostViewType > - ParallelReduce( const FunctorType & functor - , const Policy & policy - , const HostViewType & result_view ) - : m_func( functor ) - , m_policy( policy ) - { - QthreadExec::resize_worker_scratch( ValueTraits::value_size( m_func ) , 0 ); - - Impl::QthreadExec::exec_all( Qthread::instance() , & ParallelReduce::execute , this ); - - const pointer_type data = (pointer_type) QthreadExec::exec_all_reduce_result(); - - Kokkos::Impl::FunctorFinal< FunctorType , typename Policy::work_tag >::final( m_func , data ); - - if ( result_view.ptr_on_device() ) { - const unsigned n = ValueTraits::value_count( m_func ); - for ( unsigned i = 0 ; i < n ; ++i ) { result_view.ptr_on_device()[i] = data[i]; } - } - } -}; - -//---------------------------------------------------------------------------- - -template< class FunctorType , class Arg0 , class Arg1 > -class ParallelFor< FunctorType , TeamPolicy< Arg0 , Arg1 , Kokkos::Qthread > > -{ -private: - - typedef TeamPolicy< Arg0 , Arg1 , Kokkos::Qthread > Policy ; - - const FunctorType m_func ; - const Policy m_team ; - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION - void driver( typename Impl::enable_if< Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member ) const - { m_func( member ); } - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION - void driver( typename Impl::enable_if< ! Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member ) const - { m_func( TagType() , member ); } - - static void execute( QthreadExec & exec , const void * arg ) - { - const ParallelFor & self = * ((const ParallelFor *) arg ); - - typename Policy::member_type member( exec , self.m_team ); - - while ( member ) { - self.ParallelFor::template driver< typename Policy::work_tag >( member ); - member.team_barrier(); - member.next_team(); - } - - exec.exec_all_barrier(); - } - -public: - - ParallelFor( const FunctorType & functor , - const Policy & policy ) - : m_func( functor ) - , m_team( policy ) - { - QthreadExec::resize_worker_scratch - ( /* reduction memory */ 0 - , /* team shared memory */ FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ) ); - - Impl::QthreadExec::exec_all( Qthread::instance() , & ParallelFor::execute , this ); - } -}; - -//---------------------------------------------------------------------------- - -template< class FunctorType , class Arg0 , class Arg1 > -class ParallelReduce< FunctorType , TeamPolicy< Arg0 , Arg1 , Kokkos::Qthread > > -{ -private: - - typedef TeamPolicy< Arg0 , Arg1 , Kokkos::Qthread > Policy ; - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , typename Policy::work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , typename Policy::work_tag > ValueInit ; - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - const FunctorType m_func ; - const Policy m_team ; - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION - void driver( typename Impl::enable_if< Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member - , reference_type update ) const - { m_func( member , update ); } - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION - void driver( typename Impl::enable_if< ! Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member - , reference_type update ) const - { m_func( TagType() , member , update ); } - - static void execute( QthreadExec & exec , const void * arg ) - { - const ParallelReduce & self = * ((const ParallelReduce *) arg ); - - // Initialize thread-local value - reference_type update = ValueInit::init( self.m_func , exec.exec_all_reduce_value() ); - - typename Policy::member_type member( exec , self.m_team ); - - while ( member ) { - self.ParallelReduce::template driver< typename Policy::work_tag >( member , update ); - member.team_barrier(); - member.next_team(); - } - - exec.template exec_all_reduce< FunctorType , typename Policy::work_tag >( self.m_func ); - } - -public: - - template< class ViewType > - ParallelReduce( const FunctorType & functor , - const Policy & policy , - const ViewType & result ) - : m_func( functor ) - , m_team( policy ) - { - QthreadExec::resize_worker_scratch - ( /* reduction memory */ ValueTraits::value_size( functor ) - , /* team shared memory */ FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ) ); - - Impl::QthreadExec::exec_all( Qthread::instance() , & ParallelReduce::execute , this ); - - const pointer_type data = (pointer_type) QthreadExec::exec_all_reduce_result(); - - Kokkos::Impl::FunctorFinal< FunctorType , typename Policy::work_tag >::final( m_func , data ); - - const unsigned n = ValueTraits::value_count( m_func ); - for ( unsigned i = 0 ; i < n ; ++i ) { result.ptr_on_device()[i] = data[i]; } - } -}; - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelScan< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Qthread > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Qthread > Policy ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , typename Policy::work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , typename Policy::work_tag > ValueInit ; - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - const FunctorType m_func ; - const Policy m_policy ; - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , reference_type update - , const bool final - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( i , update , final ); - } - } - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( ! Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , reference_type update - , const bool final - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( typename PType::work_tag() , i , update , final ); - } - } - - static void execute( QthreadExec & exec , const void * arg ) - { - const ParallelScan & self = * ((const ParallelScan *) arg ); - - const typename Policy::WorkRange range( self.m_policy , exec.worker_rank() , exec.worker_size() ); - - // Initialize thread-local value - reference_type update = ValueInit::init( self.m_func , exec.exec_all_reduce_value() ); - - driver( self.m_func , update , false , range ); - - exec.template exec_all_scan< FunctorType , typename Policy::work_tag >( self.m_func ); - - driver( self.m_func , update , true , range ); - - exec.exec_all_barrier(); - } - -public: - - ParallelScan( const FunctorType & functor - , const Policy & policy - ) - : m_func( functor ) - , m_policy( policy ) - { - QthreadExec::resize_worker_scratch( ValueTraits::value_size( m_func ) , 0 ); - - Impl::QthreadExec::exec_all( Qthread::instance() , & ParallelScan::execute , this ); - } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct -TeamThreadRange(const Impl::QthreadTeamPolicyMember& thread, const iType& count) -{ - return Impl::TeamThreadRangeBoundariesStruct(thread,count); -} - -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct -TeamThreadRange( const Impl::QthreadTeamPolicyMember& thread - , const iType & begin - , const iType & end - ) -{ - return Impl::TeamThreadRangeBoundariesStruct(thread,begin,end); -} - - -template -KOKKOS_INLINE_FUNCTION -Impl::ThreadVectorRangeBoundariesStruct - ThreadVectorRange(const Impl::QthreadTeamPolicyMember& thread, const iType& count) { - return Impl::ThreadVectorRangeBoundariesStruct(thread,count); -} - - -KOKKOS_INLINE_FUNCTION -Impl::ThreadSingleStruct PerTeam(const Impl::QthreadTeamPolicyMember& thread) { - return Impl::ThreadSingleStruct(thread); -} - -KOKKOS_INLINE_FUNCTION -Impl::VectorSingleStruct PerThread(const Impl::QthreadTeamPolicyMember& thread) { - return Impl::VectorSingleStruct(thread); -} - -} // namespace Kokkos - -namespace Kokkos { - - /** \brief Inter-thread parallel_for. Executes lambda(iType i) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all threads of the the calling thread team. - * This functionality requires C++11 support.*/ -template -KOKKOS_INLINE_FUNCTION -void parallel_for(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, const Lambda& lambda) { - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) - lambda(i); -} - -/** \brief Inter-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all threads of the the calling thread team and a summation of - * val is performed and put into result. This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, - const Lambda & lambda, ValueType& result) { - - result = ValueType(); - - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - result+=tmp; - } - - result = loop_boundaries.thread.team_reduce(result,Impl::JoinAdd()); -} - -#if defined( KOKKOS_HAVE_CXX11 ) - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a reduction of - * val is performed using JoinType(ValueType& val, const ValueType& update) and put into init_result. - * The input value of init_result is used as initializer for temporary variables of ValueType. Therefore - * the input value should be the neutral element with respect to the join operation (e.g. '0 for +-' or - * '1 for *'). This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType, class JoinType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, - const Lambda & lambda, const JoinType& join, ValueType& init_result) { - - ValueType result = init_result; - - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - join(result,tmp); - } - - init_result = loop_boundaries.thread.team_reduce(result,Impl::JoinLambdaAdapter(join)); -} - -#endif /* #if defined( KOKKOS_HAVE_CXX11 ) */ - -} // namespace Kokkos - -namespace Kokkos { -/** \brief Intra-thread vector parallel_for. Executes lambda(iType i) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread. - * This functionality requires C++11 support.*/ -template -KOKKOS_INLINE_FUNCTION -void parallel_for(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda& lambda) { - #ifdef KOKKOS_HAVE_PRAGMA_IVDEP - #pragma ivdep - #endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) - lambda(i); -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a summation of - * val is performed and put into result. This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda & lambda, ValueType& result) { - result = ValueType(); -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - result+=tmp; - } -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a reduction of - * val is performed using JoinType(ValueType& val, const ValueType& update) and put into init_result. - * The input value of init_result is used as initializer for temporary variables of ValueType. Therefore - * the input value should be the neutral element with respect to the join operation (e.g. '0 for +-' or - * '1 for *'). This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType, class JoinType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda & lambda, const JoinType& join, ValueType& init_result) { - - ValueType result = init_result; -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - join(result,tmp); - } - init_result = result; -} - -/** \brief Intra-thread vector parallel exclusive prefix sum. Executes lambda(iType i, ValueType & val, bool final) - * for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes in the thread and a scan operation is performed. - * Depending on the target execution space the operator might be called twice: once with final=false - * and once with final=true. When final==true val contains the prefix sum value. The contribution of this - * "i" needs to be added to val no matter whether final==true or not. In a serial execution - * (i.e. team_size==1) the operator is only called once with final==true. Scan_val will be set - * to the final sum value over all vector lanes. - * This functionality requires C++11 support.*/ -template< typename iType, class FunctorType > -KOKKOS_INLINE_FUNCTION -void parallel_scan(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const FunctorType & lambda) { - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , void > ValueTraits ; - typedef typename ValueTraits::value_type value_type ; - - value_type scan_val = value_type(); - -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - lambda(i,scan_val,true); - } -} - -} // namespace Kokkos - -namespace Kokkos { - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::VectorSingleStruct& single_struct, const FunctorType& lambda) { - lambda(); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::ThreadSingleStruct& single_struct, const FunctorType& lambda) { - if(single_struct.team_member.team_rank()==0) lambda(); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::VectorSingleStruct& single_struct, const FunctorType& lambda, ValueType& val) { - lambda(val); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::ThreadSingleStruct& single_struct, const FunctorType& lambda, ValueType& val) { - if(single_struct.team_member.team_rank()==0) { - lambda(val); - } - single_struct.team_member.team_broadcast(val,0); -} - -} // namespace Kokkos - - -#endif /* #define KOKKOS_QTHREAD_PARALLEL_HPP */ - diff --git a/lib/kokkos/core/src/Qthread/Kokkos_Qthread_TaskPolicy.cpp b/lib/kokkos/core/src/Qthread/Kokkos_Qthread_TaskPolicy.cpp deleted file mode 100644 index 9de9748de9..0000000000 --- a/lib/kokkos/core/src/Qthread/Kokkos_Qthread_TaskPolicy.cpp +++ /dev/null @@ -1,483 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -// Experimental unified task-data parallel manycore LDRD - -#include - -#if defined( KOKKOS_HAVE_QTHREAD ) - -#include - -#include -#include -#include -#include -#include - -#include -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -typedef TaskMember< Kokkos::Qthread , void , void > Task ; - -namespace { - -inline -unsigned padded_sizeof_derived( unsigned sizeof_derived ) -{ - return sizeof_derived + - ( sizeof_derived % sizeof(Task*) ? sizeof(Task*) - sizeof_derived % sizeof(Task*) : 0 ); -} - -// int lock_alloc_dealloc = 0 ; - -} // namespace - -void Task::deallocate( void * ptr ) -{ - // Counting on 'free' thread safety so lock/unlock not required. - // However, isolate calls here to mitigate future need to introduce lock/unlock. - - // lock - - // while ( ! Kokkos::atomic_compare_exchange_strong( & lock_alloc_dealloc , 0 , 1 ) ); - - free( ptr ); - - // unlock - - // Kokkos::atomic_compare_exchange_strong( & lock_alloc_dealloc , 1 , 0 ); -} - -void * Task::allocate( const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity ) -{ - // Counting on 'malloc' thread safety so lock/unlock not required. - // However, isolate calls here to mitigate future need to introduce lock/unlock. - - // lock - - // while ( ! Kokkos::atomic_compare_exchange_strong( & lock_alloc_dealloc , 0 , 1 ) ); - - void * const ptr = malloc( padded_sizeof_derived( arg_sizeof_derived ) + arg_dependence_capacity * sizeof(Task*) ); - - // unlock - - // Kokkos::atomic_compare_exchange_strong( & lock_alloc_dealloc , 1 , 0 ); - - return ptr ; -} - -Task::~TaskMember() -{ - -} - - -Task::TaskMember( const function_verify_type arg_verify - , const function_dealloc_type arg_dealloc - , const function_apply_single_type arg_apply_single - , const function_apply_team_type arg_apply_team - , volatile int & arg_active_count - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - ) - : m_dealloc( arg_dealloc ) - , m_verify( arg_verify ) - , m_apply_single( arg_apply_single ) - , m_apply_team( arg_apply_team ) - , m_active_count( & arg_active_count ) - , m_qfeb(0) - , m_dep( (Task **)( ((unsigned char *) this) + padded_sizeof_derived( arg_sizeof_derived ) ) ) - , m_dep_capacity( arg_dependence_capacity ) - , m_dep_size( 0 ) - , m_ref_count( 0 ) - , m_state( Kokkos::Experimental::TASK_STATE_CONSTRUCTING ) -{ - qthread_empty( & m_qfeb ); // Set to full when complete - for ( unsigned i = 0 ; i < arg_dependence_capacity ; ++i ) m_dep[i] = 0 ; -} - -Task::TaskMember( const function_dealloc_type arg_dealloc - , const function_apply_single_type arg_apply_single - , const function_apply_team_type arg_apply_team - , volatile int & arg_active_count - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - ) - : m_dealloc( arg_dealloc ) - , m_verify( & Task::verify_type ) - , m_apply_single( arg_apply_single ) - , m_apply_team( arg_apply_team ) - , m_active_count( & arg_active_count ) - , m_qfeb(0) - , m_dep( (Task **)( ((unsigned char *) this) + padded_sizeof_derived( arg_sizeof_derived ) ) ) - , m_dep_capacity( arg_dependence_capacity ) - , m_dep_size( 0 ) - , m_ref_count( 0 ) - , m_state( Kokkos::Experimental::TASK_STATE_CONSTRUCTING ) -{ - qthread_empty( & m_qfeb ); // Set to full when complete - for ( unsigned i = 0 ; i < arg_dependence_capacity ; ++i ) m_dep[i] = 0 ; -} - -//---------------------------------------------------------------------------- - -void Task::throw_error_add_dependence() const -{ - std::cerr << "TaskMember< Qthread >::add_dependence ERROR" - << " state(" << m_state << ")" - << " dep_size(" << m_dep_size << ")" - << std::endl ; - throw std::runtime_error("TaskMember< Qthread >::add_dependence ERROR"); -} - -void Task::throw_error_verify_type() -{ - throw std::runtime_error("TaskMember< Qthread >::verify_type ERROR"); -} - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) -void Task::assign( Task ** const lhs , Task * rhs , const bool no_throw ) -{ - static const char msg_error_header[] = "Kokkos::Impl::TaskManager::assign ERROR" ; - static const char msg_error_count[] = ": negative reference count" ; - static const char msg_error_complete[] = ": destroy task that is not complete" ; - static const char msg_error_dependences[] = ": destroy task that has dependences" ; - static const char msg_error_exception[] = ": caught internal exception" ; - - if ( rhs ) { Kokkos::atomic_fetch_add( & (*rhs).m_ref_count , 1 ); } - - Task * const lhs_val = Kokkos::atomic_exchange( lhs , rhs ); - - if ( lhs_val ) { - - const int count = Kokkos::atomic_fetch_add( & (*lhs_val).m_ref_count , -1 ); - - const char * msg_error = 0 ; - - try { - - if ( 1 == count ) { - - // Reference count at zero, delete it - - // Should only be deallocating a completed task - if ( (*lhs_val).m_state == Kokkos::Experimental::TASK_STATE_COMPLETE ) { - - // A completed task should not have dependences... - for ( int i = 0 ; i < (*lhs_val).m_dep_size && 0 == msg_error ; ++i ) { - if ( (*lhs_val).m_dep[i] ) msg_error = msg_error_dependences ; - } - } - else { - msg_error = msg_error_complete ; - } - - if ( 0 == msg_error ) { - // Get deletion function and apply it - const Task::function_dealloc_type d = (*lhs_val).m_dealloc ; - - (*d)( lhs_val ); - } - } - else if ( count <= 0 ) { - msg_error = msg_error_count ; - } - } - catch( ... ) { - if ( 0 == msg_error ) msg_error = msg_error_exception ; - } - - if ( 0 != msg_error ) { - if ( no_throw ) { - std::cerr << msg_error_header << msg_error << std::endl ; - std::cerr.flush(); - } - else { - std::string msg(msg_error_header); - msg.append(msg_error); - throw std::runtime_error( msg ); - } - } - } -} -#endif - - -//---------------------------------------------------------------------------- - -aligned_t Task::qthread_func( void * arg ) -{ - Task * const task = reinterpret_cast< Task * >(arg); - - // First member of the team change state to executing. - // Use compare-exchange to avoid race condition with a respawn. - Kokkos::atomic_compare_exchange_strong( & task->m_state - , int(Kokkos::Experimental::TASK_STATE_WAITING) - , int(Kokkos::Experimental::TASK_STATE_EXECUTING) - ); - - // It is a single thread's responsibility to close out - // this task's execution. - bool close_out = false ; - - if ( task->m_apply_team && ! task->m_apply_single ) { - const Kokkos::Impl::QthreadTeamPolicyMember::TaskTeam task_team_tag ; - - // Initialize team size and rank with shephered info - Kokkos::Impl::QthreadTeamPolicyMember member( task_team_tag ); - - (*task->m_apply_team)( task , member ); - -#if 0 -fprintf( stdout - , "worker(%d.%d) task 0x%.12lx executed by member(%d:%d)\n" - , qthread_shep() - , qthread_worker_local(NULL) - , reinterpret_cast(task) - , member.team_rank() - , member.team_size() - ); -fflush(stdout); -#endif - - member.team_barrier(); - - close_out = member.team_rank() == 0 ; - } - else if ( task->m_apply_team && task->m_apply_single == reinterpret_cast(1) ) { - // Team hard-wired to one, no cloning - Kokkos::Impl::QthreadTeamPolicyMember member ; - (*task->m_apply_team)( task , member ); - close_out = true ; - } - else { - (*task->m_apply_single)( task ); - - close_out = true ; - } - - if ( close_out ) { - - // When dependent tasks run there would be a race - // condition between destroying this task and - // querying the active count pointer from this task. - int volatile * active_count = task->m_active_count ; - - if ( task->m_state == ( Kokkos::Experimental::TASK_STATE_WAITING | Kokkos::Experimental::TASK_STATE_EXECUTING ) ) { - -#if 0 -fprintf( stdout - , "worker(%d.%d) task 0x%.12lx respawn\n" - , qthread_shep() - , qthread_worker_local(NULL) - , reinterpret_cast(task) - ); -fflush(stdout); -#endif - - // Task respawned, set state to waiting and reschedule the task - task->m_state = Kokkos::Experimental::TASK_STATE_WAITING ; - task->schedule(); - } - else { - - // Task did not respawn, is complete - task->m_state = Kokkos::Experimental::TASK_STATE_COMPLETE ; - - // Release dependences before allowing dependent tasks to run. - // Otherwise there is a thread race condition for removing dependences. - for ( int i = 0 ; i < task->m_dep_size ; ++i ) { - assign( & task->m_dep[i] , 0 ); - } - - // Set qthread FEB to full so that dependent tasks are allowed to execute. - // This 'task' may be deleted immediately following this function call. - qthread_fill( & task->m_qfeb ); - } - - // Decrement active task count before returning. - Kokkos::atomic_decrement( active_count ); - } - -#if 0 -fprintf( stdout - , "worker(%d.%d) task 0x%.12lx return\n" - , qthread_shep() - , qthread_worker_local(NULL) - , reinterpret_cast(task) - ); -fflush(stdout); -#endif - - return 0 ; -} - -void Task::respawn() -{ - // Change state from pure executing to ( waiting | executing ) - // to avoid confusion with simply waiting. - Kokkos::atomic_compare_exchange_strong( & m_state - , int(Kokkos::Experimental::TASK_STATE_EXECUTING) - , int(Kokkos::Experimental::TASK_STATE_WAITING | - Kokkos::Experimental::TASK_STATE_EXECUTING) - ); -} - -void Task::schedule() -{ - // Is waiting for execution - - // Increment active task count before spawning. - Kokkos::atomic_increment( m_active_count ); - - // spawn in qthread. must malloc the precondition array and give to qthread. - // qthread will eventually free this allocation so memory will not be leaked. - - // concern with thread safety of malloc, does this need to be guarded? - aligned_t ** qprecon = (aligned_t **) malloc( ( m_dep_size + 1 ) * sizeof(aligned_t *) ); - - qprecon[0] = reinterpret_cast( uintptr_t(m_dep_size) ); - - for ( int i = 0 ; i < m_dep_size ; ++i ) { - qprecon[i+1] = & m_dep[i]->m_qfeb ; // Qthread precondition flag - } - - if ( m_apply_team && ! m_apply_single ) { - // If more than one shepherd spawn on a shepherd other than this shepherd - const int num_shepherd = qthread_num_shepherds(); - const int num_worker_per_shepherd = qthread_num_workers_local(NO_SHEPHERD); - const int this_shepherd = qthread_shep(); - - int spawn_shepherd = ( this_shepherd + 1 ) % num_shepherd ; - -#if 0 -fprintf( stdout - , "worker(%d.%d) task 0x%.12lx spawning on shepherd(%d) clone(%d)\n" - , qthread_shep() - , qthread_worker_local(NULL) - , reinterpret_cast(this) - , spawn_shepherd - , num_worker_per_shepherd - 1 - ); -fflush(stdout); -#endif - - qthread_spawn_cloneable - ( & Task::qthread_func - , this - , 0 - , NULL - , m_dep_size , qprecon /* dependences */ - , spawn_shepherd - // , unsigned( QTHREAD_SPAWN_SIMPLE | QTHREAD_SPAWN_LOCAL_PRIORITY ) - , unsigned( QTHREAD_SPAWN_LOCAL_PRIORITY ) - , num_worker_per_shepherd - 1 - ); - } - else { - qthread_spawn( & Task::qthread_func /* function */ - , this /* function argument */ - , 0 - , NULL - , m_dep_size , qprecon /* dependences */ - , NO_SHEPHERD - , QTHREAD_SPAWN_SIMPLE /* allows optimization for non-blocking task */ - ); - } -} - -} // namespace Impl -} // namespace Experimental -} // namespace Kokkos - -namespace Kokkos { -namespace Experimental { - -TaskPolicy< Kokkos::Qthread >:: - TaskPolicy( const unsigned arg_default_dependence_capacity - , const unsigned arg_team_size ) - : m_default_dependence_capacity( arg_default_dependence_capacity ) - , m_team_size( arg_team_size != 0 ? arg_team_size : unsigned(qthread_num_workers_local(NO_SHEPHERD)) ) - , m_active_count_root(0) - , m_active_count( m_active_count_root ) -{ - const unsigned num_worker_per_shepherd = unsigned( qthread_num_workers_local(NO_SHEPHERD) ); - - if ( m_team_size != 1 && m_team_size != num_worker_per_shepherd ) { - std::ostringstream msg ; - msg << "Kokkos::Experimental::TaskPolicy< Kokkos::Qthread >( " - << "default_depedence = " << arg_default_dependence_capacity - << " , team_size = " << arg_team_size - << " ) ERROR, valid team_size arguments are { (omitted) , 1 , " << num_worker_per_shepherd << " }" ; - Kokkos::Impl::throw_runtime_exception(msg.str()); - } -} - -TaskPolicy< Kokkos::Qthread >::member_type & -TaskPolicy< Kokkos::Qthread >::member_single() -{ - static member_type s ; - return s ; -} - -void wait( Kokkos::Experimental::TaskPolicy< Kokkos::Qthread > & policy ) -{ - volatile int * const active_task_count = & policy.m_active_count ; - while ( *active_task_count ) qthread_yield(); -} - -} // namespace Experimental -} // namespace Kokkos - -#endif /* #if defined( KOKKOS_HAVE_QTHREAD ) */ - diff --git a/lib/kokkos/core/src/Qthread/Kokkos_Qthread_TaskPolicy.hpp b/lib/kokkos/core/src/Qthread/Kokkos_Qthread_TaskPolicy.hpp deleted file mode 100644 index 1f4a622ebe..0000000000 --- a/lib/kokkos/core/src/Qthread/Kokkos_Qthread_TaskPolicy.hpp +++ /dev/null @@ -1,642 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -// Experimental unified task-data parallel manycore LDRD - -#ifndef KOKKOS_QTHREAD_TASKPOLICY_HPP -#define KOKKOS_QTHREAD_TASKPOLICY_HPP - -#include -#include -#include - -//---------------------------------------------------------------------------- -// Defines to enable experimental Qthread functionality - -#define QTHREAD_LOCAL_PRIORITY -#define CLONED_TASKS - -#include - -#undef QTHREAD_LOCAL_PRIORITY -#undef CLONED_TASKS - -//---------------------------------------------------------------------------- - -#include -#include -#include - -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -template<> -class TaskMember< Kokkos::Qthread , void , void > -{ -public: - - typedef void (* function_apply_single_type) ( TaskMember * ); - typedef void (* function_apply_team_type) ( TaskMember * , Kokkos::Impl::QthreadTeamPolicyMember & ); - typedef void (* function_dealloc_type)( TaskMember * ); - typedef TaskMember * (* function_verify_type) ( TaskMember * ); - -private: - - const function_dealloc_type m_dealloc ; ///< Deallocation - const function_verify_type m_verify ; ///< Result type verification - const function_apply_single_type m_apply_single ; ///< Apply function - const function_apply_team_type m_apply_team ; ///< Apply function - int volatile * const m_active_count ; ///< Count of active tasks on this policy - aligned_t m_qfeb ; ///< Qthread full/empty bit - TaskMember ** const m_dep ; ///< Dependences - const int m_dep_capacity ; ///< Capacity of dependences - int m_dep_size ; ///< Actual count of dependences - int m_ref_count ; ///< Reference count - int m_state ; ///< State of the task - - TaskMember() /* = delete */ ; - TaskMember( const TaskMember & ) /* = delete */ ; - TaskMember & operator = ( const TaskMember & ) /* = delete */ ; - - static aligned_t qthread_func( void * arg ); - - static void * allocate( const unsigned arg_sizeof_derived , const unsigned arg_dependence_capacity ); - static void deallocate( void * ); - - void throw_error_add_dependence() const ; - static void throw_error_verify_type(); - - template < class DerivedTaskType > - static - void deallocate( TaskMember * t ) - { - DerivedTaskType * ptr = static_cast< DerivedTaskType * >(t); - ptr->~DerivedTaskType(); - deallocate( (void *) ptr ); - } - - void schedule(); - -protected : - - ~TaskMember(); - - // Used by TaskMember< Qthread , ResultType , void > - TaskMember( const function_verify_type arg_verify - , const function_dealloc_type arg_dealloc - , const function_apply_single_type arg_apply_single - , const function_apply_team_type arg_apply_team - , volatile int & arg_active_count - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - ); - - // Used for TaskMember< Qthread , void , void > - TaskMember( const function_dealloc_type arg_dealloc - , const function_apply_single_type arg_apply_single - , const function_apply_team_type arg_apply_team - , volatile int & arg_active_count - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - ); - -public: - - template< typename ResultType > - KOKKOS_FUNCTION static - TaskMember * verify_type( TaskMember * t ) - { - enum { check_type = ! Kokkos::Impl::is_same< ResultType , void >::value }; - - if ( check_type && t != 0 ) { - - // Verify that t->m_verify is this function - const function_verify_type self = & TaskMember::template verify_type< ResultType > ; - - if ( t->m_verify != self ) { - t = 0 ; -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - throw_error_verify_type(); -#endif - } - } - return t ; - } - - //---------------------------------------- - /* Inheritence Requirements on task types: - * typedef FunctorType::value_type value_type ; - * class DerivedTaskType - * : public TaskMember< Qthread , value_type , FunctorType > - * { ... }; - * class TaskMember< Qthread , value_type , FunctorType > - * : public TaskMember< Qthread , value_type , void > - * , public Functor - * { ... }; - * If value_type != void - * class TaskMember< Qthread , value_type , void > - * : public TaskMember< Qthread , void , void > - * - * Allocate space for DerivedTaskType followed by TaskMember*[ dependence_capacity ] - * - */ - - /** \brief Allocate and construct a single-thread task */ - template< class DerivedTaskType > - static - TaskMember * create_single( const typename DerivedTaskType::functor_type & arg_functor - , volatile int & arg_active_count - , const unsigned arg_dependence_capacity ) - { - typedef typename DerivedTaskType::functor_type functor_type ; - typedef typename functor_type::value_type value_type ; - - DerivedTaskType * const task = - new( allocate( sizeof(DerivedTaskType) , arg_dependence_capacity ) ) - DerivedTaskType( & TaskMember::template deallocate< DerivedTaskType > - , & TaskMember::template apply_single< functor_type , value_type > - , 0 - , arg_active_count - , sizeof(DerivedTaskType) - , arg_dependence_capacity - , arg_functor ); - - return static_cast< TaskMember * >( task ); - } - - /** \brief Allocate and construct a team-thread task */ - template< class DerivedTaskType > - static - TaskMember * create_team( const typename DerivedTaskType::functor_type & arg_functor - , volatile int & arg_active_count - , const unsigned arg_dependence_capacity - , const bool arg_is_team ) - { - typedef typename DerivedTaskType::functor_type functor_type ; - typedef typename functor_type::value_type value_type ; - - const function_apply_single_type flag = reinterpret_cast( arg_is_team ? 0 : 1 ); - - DerivedTaskType * const task = - new( allocate( sizeof(DerivedTaskType) , arg_dependence_capacity ) ) - DerivedTaskType( & TaskMember::template deallocate< DerivedTaskType > - , flag - , & TaskMember::template apply_team< functor_type , value_type > - , arg_active_count - , sizeof(DerivedTaskType) - , arg_dependence_capacity - , arg_functor ); - - return static_cast< TaskMember * >( task ); - } - - void respawn(); - void spawn() - { - m_state = Kokkos::Experimental::TASK_STATE_WAITING ; - schedule(); - } - - //---------------------------------------- - - typedef FutureValueTypeIsVoidError get_result_type ; - - KOKKOS_INLINE_FUNCTION - get_result_type get() const { return get_result_type() ; } - - KOKKOS_INLINE_FUNCTION - Kokkos::Experimental::TaskState get_state() const { return Kokkos::Experimental::TaskState( m_state ); } - - //---------------------------------------- - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - static - void assign( TaskMember ** const lhs , TaskMember * const rhs , const bool no_throw = false ); -#else - KOKKOS_INLINE_FUNCTION static - void assign( TaskMember ** const lhs , TaskMember * const rhs , const bool no_throw = false ) {} -#endif - - KOKKOS_INLINE_FUNCTION - TaskMember * get_dependence( int i ) const - { return ( Kokkos::Experimental::TASK_STATE_EXECUTING == m_state && 0 <= i && i < m_dep_size ) ? m_dep[i] : (TaskMember*) 0 ; } - - KOKKOS_INLINE_FUNCTION - int get_dependence() const - { return m_dep_size ; } - - KOKKOS_INLINE_FUNCTION - void clear_dependence() - { - for ( int i = 0 ; i < m_dep_size ; ++i ) assign( m_dep + i , 0 ); - m_dep_size = 0 ; - } - - KOKKOS_INLINE_FUNCTION - void add_dependence( TaskMember * before ) - { - if ( ( Kokkos::Experimental::TASK_STATE_CONSTRUCTING == m_state || - Kokkos::Experimental::TASK_STATE_EXECUTING == m_state ) && - m_dep_size < m_dep_capacity ) { - assign( m_dep + m_dep_size , before ); - ++m_dep_size ; - } - else { - throw_error_add_dependence(); - } - } - - //---------------------------------------- - - template< class FunctorType , class ResultType > - KOKKOS_INLINE_FUNCTION static - void apply_single( typename Kokkos::Impl::enable_if< ! Kokkos::Impl::is_same< ResultType , void >::value , TaskMember * >::type t ) - { - typedef TaskMember< Kokkos::Qthread , ResultType , FunctorType > derived_type ; - - // TaskMember< Kokkos::Qthread , ResultType , FunctorType > - // : public TaskMember< Kokkos::Qthread , ResultType , void > - // , public FunctorType - // { ... }; - - derived_type & m = * static_cast< derived_type * >( t ); - - Kokkos::Impl::FunctorApply< FunctorType , void , ResultType & >::apply( (FunctorType &) m , & m.m_result ); - } - - template< class FunctorType , class ResultType > - KOKKOS_INLINE_FUNCTION static - void apply_single( typename Kokkos::Impl::enable_if< Kokkos::Impl::is_same< ResultType , void >::value , TaskMember * >::type t ) - { - typedef TaskMember< Kokkos::Qthread , ResultType , FunctorType > derived_type ; - - // TaskMember< Kokkos::Qthread , ResultType , FunctorType > - // : public TaskMember< Kokkos::Qthread , ResultType , void > - // , public FunctorType - // { ... }; - - derived_type & m = * static_cast< derived_type * >( t ); - - Kokkos::Impl::FunctorApply< FunctorType , void , void >::apply( (FunctorType &) m ); - } - - //---------------------------------------- - - template< class FunctorType , class ResultType > - KOKKOS_INLINE_FUNCTION static - void apply_team( typename Kokkos::Impl::enable_if< ! Kokkos::Impl::is_same< ResultType , void >::value , TaskMember * >::type t - , Kokkos::Impl::QthreadTeamPolicyMember & member ) - { - typedef TaskMember< Kokkos::Qthread , ResultType , FunctorType > derived_type ; - - derived_type & m = * static_cast< derived_type * >( t ); - - m.FunctorType::apply( member , m.m_result ); - } - - template< class FunctorType , class ResultType > - KOKKOS_INLINE_FUNCTION static - void apply_team( typename Kokkos::Impl::enable_if< Kokkos::Impl::is_same< ResultType , void >::value , TaskMember * >::type t - , Kokkos::Impl::QthreadTeamPolicyMember & member ) - { - typedef TaskMember< Kokkos::Qthread , ResultType , FunctorType > derived_type ; - - derived_type & m = * static_cast< derived_type * >( t ); - - m.FunctorType::apply( member ); - } -}; - -//---------------------------------------------------------------------------- -/** \brief Base class for tasks with a result value in the Qthread execution space. - * - * The FunctorType must be void because this class is accessed by the - * Future class for the task and result value. - * - * Must be derived from TaskMember 'root class' so the Future class - * can correctly static_cast from the 'root class' to this class. - */ -template < class ResultType > -class TaskMember< Kokkos::Qthread , ResultType , void > - : public TaskMember< Kokkos::Qthread , void , void > -{ -public: - - ResultType m_result ; - - typedef const ResultType & get_result_type ; - - KOKKOS_INLINE_FUNCTION - get_result_type get() const { return m_result ; } - -protected: - - typedef TaskMember< Kokkos::Qthread , void , void > task_root_type ; - typedef task_root_type::function_dealloc_type function_dealloc_type ; - typedef task_root_type::function_apply_single_type function_apply_single_type ; - typedef task_root_type::function_apply_team_type function_apply_team_type ; - - inline - TaskMember( const function_dealloc_type arg_dealloc - , const function_apply_single_type arg_apply_single - , const function_apply_team_type arg_apply_team - , volatile int & arg_active_count - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - ) - : task_root_type( & task_root_type::template verify_type< ResultType > - , arg_dealloc - , arg_apply_single - , arg_apply_team - , arg_active_count - , arg_sizeof_derived - , arg_dependence_capacity ) - , m_result() - {} -}; - -template< class ResultType , class FunctorType > -class TaskMember< Kokkos::Qthread , ResultType , FunctorType > - : public TaskMember< Kokkos::Qthread , ResultType , void > - , public FunctorType -{ -public: - - typedef FunctorType functor_type ; - - typedef TaskMember< Kokkos::Qthread , void , void > task_root_type ; - typedef TaskMember< Kokkos::Qthread , ResultType , void > task_base_type ; - typedef task_root_type::function_dealloc_type function_dealloc_type ; - typedef task_root_type::function_apply_single_type function_apply_single_type ; - typedef task_root_type::function_apply_team_type function_apply_team_type ; - - inline - TaskMember( const function_dealloc_type arg_dealloc - , const function_apply_single_type arg_apply_single - , const function_apply_team_type arg_apply_team - , volatile int & arg_active_count - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - , const functor_type & arg_functor - ) - : task_base_type( arg_dealloc - , arg_apply_single - , arg_apply_team - , arg_active_count - , arg_sizeof_derived - , arg_dependence_capacity ) - , functor_type( arg_functor ) - {} -}; - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -void wait( TaskPolicy< Kokkos::Qthread > & ); - -template<> -class TaskPolicy< Kokkos::Qthread > -{ -public: - - typedef Kokkos::Qthread execution_space ; - typedef Kokkos::Impl::QthreadTeamPolicyMember member_type ; - -private: - - typedef Impl::TaskMember< execution_space , void , void > task_root_type ; - - TaskPolicy & operator = ( const TaskPolicy & ) /* = delete */ ; - - template< class FunctorType > - static inline - const task_root_type * get_task_root( const FunctorType * f ) - { - typedef Impl::TaskMember< execution_space , typename FunctorType::value_type , FunctorType > task_type ; - return static_cast< const task_root_type * >( static_cast< const task_type * >(f) ); - } - - template< class FunctorType > - static inline - task_root_type * get_task_root( FunctorType * f ) - { - typedef Impl::TaskMember< execution_space , typename FunctorType::value_type , FunctorType > task_type ; - return static_cast< task_root_type * >( static_cast< task_type * >(f) ); - } - - const unsigned m_default_dependence_capacity ; - const unsigned m_team_size ; - volatile int m_active_count_root ; - volatile int & m_active_count ; - -public: - - explicit - TaskPolicy( const unsigned arg_default_dependence_capacity = 4 - , const unsigned arg_team_size = 0 /* assign default */ ); - - KOKKOS_INLINE_FUNCTION - TaskPolicy( const TaskPolicy & rhs ) - : m_default_dependence_capacity( rhs.m_default_dependence_capacity ) - , m_team_size( m_team_size ) - , m_active_count_root(0) - , m_active_count( rhs.m_active_count ) - {} - - KOKKOS_INLINE_FUNCTION - TaskPolicy( const TaskPolicy & rhs - , const unsigned arg_default_dependence_capacity ) - : m_default_dependence_capacity( arg_default_dependence_capacity ) - , m_team_size( m_team_size ) - , m_active_count_root(0) - , m_active_count( rhs.m_active_count ) - {} - - //---------------------------------------- - - template< class ValueType > - const Future< ValueType , execution_space > & - spawn( const Future< ValueType , execution_space > & f ) const - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - f.m_task->spawn(); -#endif - return f ; - } - - // Create single-thread task - - template< class FunctorType > - Future< typename FunctorType::value_type , execution_space > - create( const FunctorType & functor - , const unsigned dependence_capacity = ~0u ) const - { - typedef typename FunctorType::value_type value_type ; - typedef Impl::TaskMember< execution_space , value_type , FunctorType > task_type ; - return Future< value_type , execution_space >( -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - task_root_type::create_single< task_type > - ( functor - , m_active_count - , ( ~0u == dependence_capacity ? m_default_dependence_capacity : dependence_capacity ) - ) -#endif - ); - } - - // Create thread-team task - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - Future< typename FunctorType::value_type , execution_space > - create_team( const FunctorType & functor - , const unsigned dependence_capacity = ~0u ) const - { - typedef typename FunctorType::value_type value_type ; - typedef Impl::TaskMember< execution_space , value_type , FunctorType > task_type ; - - return Future< value_type , execution_space >( -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - task_root_type::create_team< task_type > - ( functor - , m_active_count - , ( ~0u == dependence_capacity ? m_default_dependence_capacity : dependence_capacity ) - , 1 < m_team_size - ) -#endif - ); - } - - // Add dependence - template< class A1 , class A2 , class A3 , class A4 > - void add_dependence( const Future & after - , const Future & before - , typename Kokkos::Impl::enable_if - < Kokkos::Impl::is_same< typename Future::execution_space , execution_space >::value - && - Kokkos::Impl::is_same< typename Future::execution_space , execution_space >::value - >::type * = 0 - ) - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - after.m_task->add_dependence( before.m_task ); -#endif - } - - //---------------------------------------- - // Functions for an executing task functor to query dependences, - // set new dependences, and respawn itself. - - template< class FunctorType > - Future< void , execution_space > - get_dependence( const FunctorType * task_functor , int i ) const - { - return Future( -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - get_task_root(task_functor)->get_dependence(i) -#endif - ); - } - - template< class FunctorType > - int get_dependence( const FunctorType * task_functor ) const -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return get_task_root(task_functor)->get_dependence(); } -#else - { return 0 ; } -#endif - - template< class FunctorType > - void clear_dependence( FunctorType * task_functor ) const - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - get_task_root(task_functor)->clear_dependence(); -#endif - } - - template< class FunctorType , class A3 , class A4 > - void add_dependence( FunctorType * task_functor - , const Future & before - , typename Kokkos::Impl::enable_if - < Kokkos::Impl::is_same< typename Future::execution_space , execution_space >::value - >::type * = 0 - ) - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - get_task_root(task_functor)->add_dependence( before.m_task ); -#endif - } - - template< class FunctorType > - void respawn( FunctorType * task_functor ) const -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { get_task_root(task_functor)->respawn(); } -#else - {} -#endif - - static member_type & member_single(); - - friend void wait( TaskPolicy< Kokkos::Qthread > & ); -}; - -} /* namespace Experimental */ -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #define KOKKOS_QTHREAD_TASK_HPP */ - diff --git a/lib/kokkos/core/src/Qthread/README b/lib/kokkos/core/src/Qthread/README deleted file mode 100644 index 5d8f29a4ee..0000000000 --- a/lib/kokkos/core/src/Qthread/README +++ /dev/null @@ -1,28 +0,0 @@ - -# This Qthreads back-end uses an experimental branch of the Qthreads repository with special #define options. - -# Cloning repository and branch: - -git clone https://github.com/stelleg/qthreads qthreads-with-clone - -cd qthreads-with-clone - -# Added to ./git/config -# -# [branch "cloned_tasks"] -# remote = origin -# merge = refs/heads/cloned_tasks -# - -git branch cloned_tasks -git checkout cloned_tasks -git pull - -sh autogen.sh - -# configurure with 'hwloc' installation: - -./configure CFLAGS="-DCLONED_TASKS -DQTHREAD_LOCAL_PRIORITY" --with-hwloc=${HWLOCDIR} --prefix=${INSTALLDIR} - - - diff --git a/lib/kokkos/core/src/Threads/Kokkos_ThreadsExec.cpp b/lib/kokkos/core/src/Threads/Kokkos_ThreadsExec.cpp deleted file mode 100644 index 99553fccb1..0000000000 --- a/lib/kokkos/core/src/Threads/Kokkos_ThreadsExec.cpp +++ /dev/null @@ -1,758 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#if defined( KOKKOS_HAVE_PTHREAD ) || defined( KOKKOS_HAVE_WINTHREAD ) - -#include -#include -#include -#include -#include -#include -#include -#include -#include - - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { -namespace { - -ThreadsExec s_threads_process ; -ThreadsExec * s_threads_exec[ ThreadsExec::MAX_THREAD_COUNT ] = { 0 }; -pthread_t s_threads_pid[ ThreadsExec::MAX_THREAD_COUNT ] = { 0 }; -std::pair s_threads_coord[ ThreadsExec::MAX_THREAD_COUNT ]; - -int s_thread_pool_size[3] = { 0 , 0 , 0 }; - -unsigned s_current_reduce_size = 0 ; -unsigned s_current_shared_size = 0 ; - -void (* volatile s_current_function)( ThreadsExec & , const void * ); -const void * volatile s_current_function_arg = 0 ; - -struct Sentinel { - Sentinel() - { - HostSpace::register_in_parallel( ThreadsExec::in_parallel ); - } - - ~Sentinel() - { - if ( s_thread_pool_size[0] || - s_thread_pool_size[1] || - s_thread_pool_size[2] || - s_current_reduce_size || - s_current_shared_size || - s_current_function || - s_current_function_arg || - s_threads_exec[0] ) { - std::cerr << "ERROR : Process exiting without calling Kokkos::Threads::terminate()" << std::endl ; - } - } -}; - -inline -unsigned fan_size( const unsigned rank , const unsigned size ) -{ - const unsigned rank_rev = size - ( rank + 1 ); - unsigned count = 0 ; - for ( unsigned n = 1 ; ( rank_rev + n < size ) && ! ( rank_rev & n ) ; n <<= 1 ) { ++count ; } - return count ; -} - -} // namespace -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -void execute_function_noop( ThreadsExec & , const void * ) {} - -void ThreadsExec::driver(void) -{ - ThreadsExec this_thread ; - - while ( ThreadsExec::Active == this_thread.m_pool_state ) { - - (*s_current_function)( this_thread , s_current_function_arg ); - - // Deactivate thread and wait for reactivation - this_thread.m_pool_state = ThreadsExec::Inactive ; - - wait_yield( this_thread.m_pool_state , ThreadsExec::Inactive ); - } -} - -ThreadsExec::ThreadsExec() - : m_pool_base(0) - , m_scratch() - , m_scratch_reduce_end(0) - , m_scratch_thread_end(0) - , m_numa_rank(0) - , m_numa_core_rank(0) - , m_pool_rank(0) - , m_pool_size(0) - , m_pool_fan_size(0) - , m_pool_state( ThreadsExec::Terminating ) -{ - if ( & s_threads_process != this ) { - - // A spawned thread - - ThreadsExec * const nil = 0 ; - - // Which entry in 's_threads_exec', possibly determined from hwloc binding - const int entry = ((size_t)s_current_function_arg) < size_t(s_thread_pool_size[0]) - ? ((size_t)s_current_function_arg) - : size_t(Kokkos::hwloc::bind_this_thread( s_thread_pool_size[0] , s_threads_coord )); - - // Given a good entry set this thread in the 's_threads_exec' array - if ( entry < s_thread_pool_size[0] && - nil == atomic_compare_exchange( s_threads_exec + entry , nil , this ) ) { - - const std::pair coord = Kokkos::hwloc::get_this_thread_coordinate(); - - m_numa_rank = coord.first ; - m_numa_core_rank = coord.second ; - m_pool_base = s_threads_exec ; - m_pool_rank = s_thread_pool_size[0] - ( entry + 1 ); - m_pool_size = s_thread_pool_size[0] ; - m_pool_fan_size = fan_size( m_pool_rank , m_pool_size ); - m_pool_state = ThreadsExec::Active ; - - s_threads_pid[ m_pool_rank ] = pthread_self(); - - // Inform spawning process that the threads_exec entry has been set. - s_threads_process.m_pool_state = ThreadsExec::Active ; - } - else { - // Inform spawning process that the threads_exec entry could not be set. - s_threads_process.m_pool_state = ThreadsExec::Terminating ; - } - } - else { - // Enables 'parallel_for' to execute on unitialized Threads device - m_pool_rank = 0 ; - m_pool_size = 1 ; - m_pool_state = ThreadsExec::Inactive ; - - s_threads_pid[ m_pool_rank ] = pthread_self(); - } -} - -ThreadsExec::~ThreadsExec() -{ - const unsigned entry = m_pool_size - ( m_pool_rank + 1 ); - - m_pool_base = 0 ; - m_scratch.clear(); - m_scratch_reduce_end = 0 ; - m_scratch_thread_end = 0 ; - m_numa_rank = 0 ; - m_numa_core_rank = 0 ; - m_pool_rank = 0 ; - m_pool_size = 0 ; - m_pool_fan_size = 0 ; - - m_pool_state = ThreadsExec::Terminating ; - - if ( & s_threads_process != this && entry < MAX_THREAD_COUNT ) { - ThreadsExec * const nil = 0 ; - - atomic_compare_exchange( s_threads_exec + entry , this , nil ); - - s_threads_process.m_pool_state = ThreadsExec::Terminating ; - } -} - - -int ThreadsExec::get_thread_count() -{ - return s_thread_pool_size[0] ; -} - -ThreadsExec * ThreadsExec::get_thread( const int init_thread_rank ) -{ - ThreadsExec * const th = - init_thread_rank < s_thread_pool_size[0] - ? s_threads_exec[ s_thread_pool_size[0] - ( init_thread_rank + 1 ) ] : 0 ; - - if ( 0 == th || th->m_pool_rank != init_thread_rank ) { - std::ostringstream msg ; - msg << "Kokkos::Impl::ThreadsExec::get_thread ERROR : " - << "thread " << init_thread_rank << " of " << s_thread_pool_size[0] ; - if ( 0 == th ) { - msg << " does not exist" ; - } - else { - msg << " has wrong thread_rank " << th->m_pool_rank ; - } - Kokkos::Impl::throw_runtime_exception( msg.str() ); - } - - return th ; -} - -//---------------------------------------------------------------------------- - -void ThreadsExec::execute_sleep( ThreadsExec & exec , const void * ) -{ - ThreadsExec::global_lock(); - ThreadsExec::global_unlock(); - - const int n = exec.m_pool_fan_size ; - const int rank_rev = exec.m_pool_size - ( exec.m_pool_rank + 1 ); - - for ( int i = 0 ; i < n ; ++i ) { - Impl::spinwait( exec.m_pool_base[ rank_rev + (1<m_pool_state , ThreadsExec::Active ); - } - - exec.m_pool_state = ThreadsExec::Inactive ; -} - -} -} - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -void ThreadsExec::verify_is_process( const std::string & name , const bool initialized ) -{ - if ( ! is_process() ) { - std::string msg( name ); - msg.append( " FAILED : Called by a worker thread, can only be called by the master process." ); - Kokkos::Impl::throw_runtime_exception( msg ); - } - - if ( initialized && 0 == s_thread_pool_size[0] ) { - std::string msg( name ); - msg.append( " FAILED : Threads not initialized." ); - Kokkos::Impl::throw_runtime_exception( msg ); - } -} - -int ThreadsExec::in_parallel() -{ - // A thread function is in execution and - // the function argument is not the special threads process argument and - // the master process is a worker or is not the master process. - return s_current_function && - ( & s_threads_process != s_current_function_arg ) && - ( s_threads_process.m_pool_base || ! is_process() ); -} - -// Wait for root thread to become inactive -void ThreadsExec::fence() -{ - if ( s_thread_pool_size[0] ) { - // Wait for the root thread to complete: - Impl::spinwait( s_threads_exec[0]->m_pool_state , ThreadsExec::Active ); - } - - s_current_function = 0 ; - s_current_function_arg = 0 ; -} - -/** \brief Begin execution of the asynchronous functor */ -void ThreadsExec::start( void (*func)( ThreadsExec & , const void * ) , const void * arg ) -{ - verify_is_process("ThreadsExec::start" , true ); - - if ( s_current_function || s_current_function_arg ) { - Kokkos::Impl::throw_runtime_exception( std::string( "ThreadsExec::start() FAILED : already executing" ) ); - } - - s_current_function = func ; - s_current_function_arg = arg ; - - // Activate threads: - for ( int i = s_thread_pool_size[0] ; 0 < i-- ; ) { - s_threads_exec[i]->m_pool_state = ThreadsExec::Active ; - } - - if ( s_threads_process.m_pool_size ) { - // Master process is the root thread, run it: - (*func)( s_threads_process , arg ); - s_threads_process.m_pool_state = ThreadsExec::Inactive ; - } -} - -//---------------------------------------------------------------------------- - -bool ThreadsExec::sleep() -{ - verify_is_process("ThreadsExec::sleep", true ); - - if ( & execute_sleep == s_current_function ) return false ; - - fence(); - - ThreadsExec::global_lock(); - - s_current_function = & execute_sleep ; - - // Activate threads: - for ( unsigned i = s_thread_pool_size[0] ; 0 < i ; ) { - s_threads_exec[--i]->m_pool_state = ThreadsExec::Active ; - } - - return true ; -} - -bool ThreadsExec::wake() -{ - verify_is_process("ThreadsExec::wake", true ); - - if ( & execute_sleep != s_current_function ) return false ; - - ThreadsExec::global_unlock(); - - if ( s_threads_process.m_pool_base ) { - execute_sleep( s_threads_process , 0 ); - s_threads_process.m_pool_state = ThreadsExec::Inactive ; - } - - fence(); - - return true ; -} - -//---------------------------------------------------------------------------- - -void ThreadsExec::execute_serial( void (*func)( ThreadsExec & , const void * ) ) -{ - s_current_function = func ; - s_current_function_arg = & s_threads_process ; - - const unsigned begin = s_threads_process.m_pool_base ? 1 : 0 ; - - for ( unsigned i = s_thread_pool_size[0] ; begin < i ; ) { - ThreadsExec & th = * s_threads_exec[ --i ]; - - th.m_pool_state = ThreadsExec::Active ; - - wait_yield( th.m_pool_state , ThreadsExec::Active ); - } - - if ( s_threads_process.m_pool_base ) { - s_threads_process.m_pool_state = ThreadsExec::Active ; - (*func)( s_threads_process , 0 ); - s_threads_process.m_pool_state = ThreadsExec::Inactive ; - } - - s_current_function_arg = 0 ; - s_current_function = 0 ; -} - -//---------------------------------------------------------------------------- - -void * ThreadsExec::root_reduce_scratch() -{ - return s_threads_process.reduce_memory(); -} - -void ThreadsExec::execute_resize_scratch( ThreadsExec & exec , const void * ) -{ - exec.m_scratch.clear(); - - exec.m_scratch_reduce_end = s_threads_process.m_scratch_reduce_end ; - exec.m_scratch_thread_end = s_threads_process.m_scratch_thread_end ; - - if ( s_threads_process.m_scratch_thread_end ) { - - exec.m_scratch = - HostSpace::allocate_and_track( "thread_scratch" , s_threads_process.m_scratch_thread_end ); - - unsigned * ptr = reinterpret_cast( exec.m_scratch.alloc_ptr() ); - unsigned * const end = ptr + s_threads_process.m_scratch_thread_end / sizeof(unsigned); - - // touch on this thread - while ( ptr < end ) *ptr++ = 0 ; - } -} - -void * ThreadsExec::resize_scratch( size_t reduce_size , size_t thread_size ) -{ - enum { ALIGN_MASK = Kokkos::Impl::MEMORY_ALIGNMENT - 1 }; - - fence(); - - const size_t old_reduce_size = s_threads_process.m_scratch_reduce_end ; - const size_t old_thread_size = s_threads_process.m_scratch_thread_end - s_threads_process.m_scratch_reduce_end ; - - reduce_size = ( reduce_size + ALIGN_MASK ) & ~ALIGN_MASK ; - thread_size = ( thread_size + ALIGN_MASK ) & ~ALIGN_MASK ; - - // Increase size or deallocate completely. - - if ( ( old_reduce_size < reduce_size ) || - ( old_thread_size < thread_size ) || - ( ( reduce_size == 0 && thread_size == 0 ) && - ( old_reduce_size != 0 || old_thread_size != 0 ) ) ) { - - verify_is_process( "ThreadsExec::resize_scratch" , true ); - - s_threads_process.m_scratch_reduce_end = reduce_size ; - s_threads_process.m_scratch_thread_end = reduce_size + thread_size ; - - execute_serial( & execute_resize_scratch ); - - s_threads_process.m_scratch = s_threads_exec[0]->m_scratch ; - } - - return s_threads_process.m_scratch.alloc_ptr() ; -} - -//---------------------------------------------------------------------------- - -void ThreadsExec::print_configuration( std::ostream & s , const bool detail ) -{ - verify_is_process("ThreadsExec::print_configuration",false); - - fence(); - - const unsigned numa_count = Kokkos::hwloc::get_available_numa_count(); - const unsigned cores_per_numa = Kokkos::hwloc::get_available_cores_per_numa(); - const unsigned threads_per_core = Kokkos::hwloc::get_available_threads_per_core(); - - // Forestall compiler warnings for unused variables. - (void) numa_count; - (void) cores_per_numa; - (void) threads_per_core; - - s << "Kokkos::Threads" ; - -#if defined( KOKKOS_HAVE_PTHREAD ) - s << " KOKKOS_HAVE_PTHREAD" ; -#endif -#if defined( KOKKOS_HAVE_HWLOC ) - s << " hwloc[" << numa_count << "x" << cores_per_numa << "x" << threads_per_core << "]" ; -#endif - - if ( s_thread_pool_size[0] ) { - s << " threads[" << s_thread_pool_size[0] << "]" - << " threads_per_numa[" << s_thread_pool_size[1] << "]" - << " threads_per_core[" << s_thread_pool_size[2] << "]" - ; - if ( 0 == s_threads_process.m_pool_base ) { s << " Asynchronous" ; } - s << " ReduceScratch[" << s_current_reduce_size << "]" - << " SharedScratch[" << s_current_shared_size << "]" ; - s << std::endl ; - - if ( detail ) { - - for ( int i = 0 ; i < s_thread_pool_size[0] ; ++i ) { - - ThreadsExec * const th = s_threads_exec[i] ; - - if ( th ) { - - const int rank_rev = th->m_pool_size - ( th->m_pool_rank + 1 ); - - s << " Thread[ " << th->m_pool_rank << " : " - << th->m_numa_rank << "." << th->m_numa_core_rank << " ]" ; - - s << " Fan{" ; - for ( int j = 0 ; j < th->m_pool_fan_size ; ++j ) { - ThreadsExec * const thfan = th->m_pool_base[rank_rev+(1<m_pool_rank << " : " - << thfan->m_numa_rank << "." << thfan->m_numa_core_rank << " ]" ; - } - s << " }" ; - - if ( th == & s_threads_process ) { - s << " is_process" ; - } - } - s << std::endl ; - } - } - } - else { - s << " not initialized" << std::endl ; - } -} - -//---------------------------------------------------------------------------- - -int ThreadsExec::is_initialized() -{ return 0 != s_threads_exec[0] ; } - -void ThreadsExec::initialize( unsigned thread_count , - unsigned use_numa_count , - unsigned use_cores_per_numa , - bool allow_asynchronous_threadpool ) -{ - static const Sentinel sentinel ; - - const bool is_initialized = 0 != s_thread_pool_size[0] ; - - unsigned thread_spawn_failed = 0 ; - - for ( int i = 0; i < ThreadsExec::MAX_THREAD_COUNT ; i++) - s_threads_exec[i] = NULL; - - if ( ! is_initialized ) { - - // If thread_count, use_numa_count, or use_cores_per_numa are zero - // then they will be given default values based upon hwloc detection - // and allowed asynchronous execution. - - const bool hwloc_avail = hwloc::available(); - - if ( thread_count == 0 ) { - thread_count = hwloc_avail - ? Kokkos::hwloc::get_available_numa_count() * - Kokkos::hwloc::get_available_cores_per_numa() * - Kokkos::hwloc::get_available_threads_per_core() - : 1 ; - } - - const unsigned thread_spawn_begin = - hwloc::thread_mapping( "Kokkos::Threads::initialize" , - allow_asynchronous_threadpool , - thread_count , - use_numa_count , - use_cores_per_numa , - s_threads_coord ); - - const std::pair proc_coord = s_threads_coord[0] ; - - if ( thread_spawn_begin ) { - // Synchronous with s_threads_coord[0] as the process core - // Claim entry #0 for binding the process core. - s_threads_coord[0] = std::pair(~0u,~0u); - } - - s_thread_pool_size[0] = thread_count ; - s_thread_pool_size[1] = s_thread_pool_size[0] / use_numa_count ; - s_thread_pool_size[2] = s_thread_pool_size[1] / use_cores_per_numa ; - s_current_function = & execute_function_noop ; // Initialization work function - - for ( unsigned ith = thread_spawn_begin ; ith < thread_count ; ++ith ) { - - s_threads_process.m_pool_state = ThreadsExec::Inactive ; - - // If hwloc available then spawned thread will - // choose its own entry in 's_threads_coord' - // otherwise specify the entry. - s_current_function_arg = (void*)static_cast( hwloc_avail ? ~0u : ith ); - - // Spawn thread executing the 'driver()' function. - // Wait until spawned thread has attempted to initialize. - // If spawning and initialization is successfull then - // an entry in 's_threads_exec' will be assigned. - if ( ThreadsExec::spawn() ) { - wait_yield( s_threads_process.m_pool_state , ThreadsExec::Inactive ); - } - if ( s_threads_process.m_pool_state == ThreadsExec::Terminating ) break ; - } - - // Wait for all spawned threads to deactivate before zeroing the function. - - for ( unsigned ith = thread_spawn_begin ; ith < thread_count ; ++ith ) { - // Try to protect against cache coherency failure by casting to volatile. - ThreadsExec * const th = ((ThreadsExec * volatile *)s_threads_exec)[ith] ; - if ( th ) { - wait_yield( th->m_pool_state , ThreadsExec::Active ); - } - else { - ++thread_spawn_failed ; - } - } - - s_current_function = 0 ; - s_current_function_arg = 0 ; - s_threads_process.m_pool_state = ThreadsExec::Inactive ; - - if ( ! thread_spawn_failed ) { - // Bind process to the core on which it was located before spawning occured - Kokkos::hwloc::bind_this_thread( proc_coord ); - - if ( thread_spawn_begin ) { // Include process in pool. - const std::pair coord = Kokkos::hwloc::get_this_thread_coordinate(); - - s_threads_exec[0] = & s_threads_process ; - s_threads_process.m_numa_rank = coord.first ; - s_threads_process.m_numa_core_rank = coord.second ; - s_threads_process.m_pool_base = s_threads_exec ; - s_threads_process.m_pool_rank = thread_count - 1 ; // Reversed for scan-compatible reductions - s_threads_process.m_pool_size = thread_count ; - s_threads_process.m_pool_fan_size = fan_size( s_threads_process.m_pool_rank , s_threads_process.m_pool_size ); - s_threads_pid[ s_threads_process.m_pool_rank ] = pthread_self(); - } - else { - s_threads_process.m_pool_base = 0 ; - s_threads_process.m_pool_rank = 0 ; - s_threads_process.m_pool_size = 0 ; - s_threads_process.m_pool_fan_size = 0 ; - } - - // Initial allocations: - ThreadsExec::resize_scratch( 1024 , 1024 ); - } - else { - s_thread_pool_size[0] = 0 ; - s_thread_pool_size[1] = 0 ; - s_thread_pool_size[2] = 0 ; - } - } - - if ( is_initialized || thread_spawn_failed ) { - - std::ostringstream msg ; - - msg << "Kokkos::Threads::initialize ERROR" ; - - if ( is_initialized ) { - msg << " : already initialized" ; - } - if ( thread_spawn_failed ) { - msg << " : failed to spawn " << thread_spawn_failed << " threads" ; - } - - Kokkos::Impl::throw_runtime_exception( msg.str() ); - } - - // Init the array for used for arbitrarily sized atomics - Impl::init_lock_array_host_space(); - -} - -//---------------------------------------------------------------------------- - -void ThreadsExec::finalize() -{ - verify_is_process("ThreadsExec::finalize",false); - - fence(); - - resize_scratch(0,0); - - const unsigned begin = s_threads_process.m_pool_base ? 1 : 0 ; - - for ( unsigned i = s_thread_pool_size[0] ; begin < i-- ; ) { - - if ( s_threads_exec[i] ) { - - s_threads_exec[i]->m_pool_state = ThreadsExec::Terminating ; - - wait_yield( s_threads_process.m_pool_state , ThreadsExec::Inactive ); - - s_threads_process.m_pool_state = ThreadsExec::Inactive ; - } - - s_threads_pid[i] = 0 ; - } - - if ( s_threads_process.m_pool_base ) { - ( & s_threads_process )->~ThreadsExec(); - s_threads_exec[0] = 0 ; - } - - Kokkos::hwloc::unbind_this_thread(); - - s_thread_pool_size[0] = 0 ; - s_thread_pool_size[1] = 0 ; - s_thread_pool_size[2] = 0 ; - - // Reset master thread to run solo. - s_threads_process.m_numa_rank = 0 ; - s_threads_process.m_numa_core_rank = 0 ; - s_threads_process.m_pool_base = 0 ; - s_threads_process.m_pool_rank = 0 ; - s_threads_process.m_pool_size = 1 ; - s_threads_process.m_pool_fan_size = 0 ; - s_threads_process.m_pool_state = ThreadsExec::Inactive ; -} - -//---------------------------------------------------------------------------- - -} /* namespace Impl */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -Threads & Threads::instance(int) -{ - static Threads t ; - return t ; -} - -int Threads::thread_pool_size( int depth ) -{ - return Impl::s_thread_pool_size[depth]; -} - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) -int Threads::thread_pool_rank() -{ - const pthread_t pid = pthread_self(); - int i = 0; - while ( ( i < Impl::s_thread_pool_size[0] ) && ( pid != Impl::s_threads_pid[i] ) ) { ++i ; } - return i ; -} -#endif - -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #if defined( KOKKOS_HAVE_PTHREAD ) || defined( KOKKOS_HAVE_WINTHREAD ) */ - diff --git a/lib/kokkos/core/src/Threads/Kokkos_ThreadsExec.hpp b/lib/kokkos/core/src/Threads/Kokkos_ThreadsExec.hpp deleted file mode 100644 index 3820697977..0000000000 --- a/lib/kokkos/core/src/Threads/Kokkos_ThreadsExec.hpp +++ /dev/null @@ -1,465 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_THREADSEXEC_HPP -#define KOKKOS_THREADSEXEC_HPP - -#include - -#include -#include -#include -#include - -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -class ThreadsExec { -public: - - // Fan array has log_2(NT) reduction threads plus 2 scan threads - // Currently limited to 16k threads. - enum { MAX_FAN_COUNT = 16 }; - enum { MAX_THREAD_COUNT = 1 << ( MAX_FAN_COUNT - 2 ) }; - enum { VECTOR_LENGTH = 8 }; - - /** \brief States of a worker thread */ - enum { Terminating ///< Termination in progress - , Inactive ///< Exists, waiting for work - , Active ///< Exists, performing work - , Rendezvous ///< Exists, waiting in a barrier or reduce - - , ScanCompleted - , ScanAvailable - , ReductionAvailable - }; - -private: - - friend class Kokkos::Threads ; - - // Fan-in operations' root is the highest ranking thread - // to place the 'scan' reduction intermediate values on - // the threads that need them. - // For a simple reduction the thread location is arbitrary. - - ThreadsExec * const * m_pool_base ; ///< Base for pool fan-in - - Impl::AllocationTracker m_scratch ; - int m_scratch_reduce_end ; - int m_scratch_thread_end ; - int m_numa_rank ; - int m_numa_core_rank ; - int m_pool_rank ; - int m_pool_size ; - int m_pool_fan_size ; - int volatile m_pool_state ; ///< State for global synchronizations - - - static void global_lock(); - static void global_unlock(); - static bool spawn(); - - static void execute_resize_scratch( ThreadsExec & , const void * ); - static void execute_sleep( ThreadsExec & , const void * ); - - ThreadsExec( const ThreadsExec & ); - ThreadsExec & operator = ( const ThreadsExec & ); - - static void execute_serial( void (*)( ThreadsExec & , const void * ) ); - -public: - - KOKKOS_INLINE_FUNCTION int pool_size() const { return m_pool_size ; } - KOKKOS_INLINE_FUNCTION int pool_rank() const { return m_pool_rank ; } - KOKKOS_INLINE_FUNCTION int numa_rank() const { return m_numa_rank ; } - KOKKOS_INLINE_FUNCTION int numa_core_rank() const { return m_numa_core_rank ; } - - static int get_thread_count(); - static ThreadsExec * get_thread( const int init_thread_rank ); - - inline void * reduce_memory() const { return reinterpret_cast(m_scratch.alloc_ptr()); } - KOKKOS_INLINE_FUNCTION void * scratch_memory() const { return reinterpret_cast(m_scratch.alloc_ptr()) + m_scratch_reduce_end ; } - - KOKKOS_INLINE_FUNCTION int volatile & state() { return m_pool_state ; } - KOKKOS_INLINE_FUNCTION ThreadsExec * const * pool_base() const { return m_pool_base ; } - - static void driver(void); - - ~ThreadsExec(); - ThreadsExec(); - - static void * resize_scratch( size_t reduce_size , size_t thread_size ); - - static void * root_reduce_scratch(); - - static bool is_process(); - - static void verify_is_process( const std::string & , const bool initialized ); - - static int is_initialized(); - - static void initialize( unsigned thread_count , - unsigned use_numa_count , - unsigned use_cores_per_numa , - bool allow_asynchronous_threadpool ); - - static void finalize(); - - /* Given a requested team size, return valid team size */ - static unsigned team_size_valid( unsigned ); - - static void print_configuration( std::ostream & , const bool detail = false ); - - //------------------------------------ - - static void wait_yield( volatile int & , const int ); - - //------------------------------------ - // All-thread functions: - - inline - int all_reduce( const int value ) - { - // Make sure there is enough scratch space: - const int rev_rank = m_pool_size - ( m_pool_rank + 1 ); - - *((volatile int*) reduce_memory()) = value ; - - memory_fence(); - - // Fan-in reduction with highest ranking thread as the root - for ( int i = 0 ; i < m_pool_fan_size ; ++i ) { - // Wait: Active -> Rendezvous - Impl::spinwait( m_pool_base[ rev_rank + (1<m_pool_state , ThreadsExec::Active ); - } - - if ( rev_rank ) { - m_pool_state = ThreadsExec::Rendezvous ; - // Wait: Rendezvous -> Active - Impl::spinwait( m_pool_state , ThreadsExec::Rendezvous ); - } - else { - // Root thread does the reduction and broadcast - - int accum = 0 ; - - for ( int rank = 0 ; rank < m_pool_size ; ++rank ) { - accum += *((volatile int *) get_thread( rank )->reduce_memory()); - } - - for ( int rank = 0 ; rank < m_pool_size ; ++rank ) { - *((volatile int *) get_thread( rank )->reduce_memory()) = accum ; - } - - memory_fence(); - - for ( int rank = 0 ; rank < m_pool_size ; ++rank ) { - get_thread( rank )->m_pool_state = ThreadsExec::Active ; - } - } - - return *((volatile int*) reduce_memory()); - } - - //------------------------------------ - // All-thread functions: - - template< class FunctorType , class ArgTag > - inline - void fan_in_reduce( const FunctorType & f ) const - { - typedef Kokkos::Impl::FunctorValueJoin< FunctorType , ArgTag > Join ; - typedef Kokkos::Impl::FunctorFinal< FunctorType , ArgTag > Final ; - - const int rev_rank = m_pool_size - ( m_pool_rank + 1 ); - - for ( int i = 0 ; i < m_pool_fan_size ; ++i ) { - - ThreadsExec & fan = *m_pool_base[ rev_rank + ( 1 << i ) ] ; - - Impl::spinwait( fan.m_pool_state , ThreadsExec::Active ); - - Join::join( f , reduce_memory() , fan.reduce_memory() ); - } - - if ( ! rev_rank ) { - Final::final( f , reduce_memory() ); - } - } - - inline - void fan_in() const - { - const int rev_rank = m_pool_size - ( m_pool_rank + 1 ); - - for ( int i = 0 ; i < m_pool_fan_size ; ++i ) { - Impl::spinwait( m_pool_base[rev_rank+(1<m_pool_state , ThreadsExec::Active ); - } - } - - template< class FunctorType , class ArgTag > - inline - void scan_large( const FunctorType & f ) - { - // Sequence of states: - // 0) Active : entry and exit state - // 1) ReductionAvailable : reduction value available - // 2) ScanAvailable : inclusive scan value available - // 3) Rendezvous : All threads inclusive scan value are available - // 4) ScanCompleted : exclusive scan value copied - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , ArgTag > Traits ; - typedef Kokkos::Impl::FunctorValueJoin< FunctorType , ArgTag > Join ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , ArgTag > Init ; - - typedef typename Traits::value_type scalar_type ; - - const int rev_rank = m_pool_size - ( m_pool_rank + 1 ); - const unsigned count = Traits::value_count( f ); - - scalar_type * const work_value = (scalar_type *) reduce_memory(); - - //-------------------------------- - // Fan-in reduction with highest ranking thread as the root - for ( int i = 0 ; i < m_pool_fan_size ; ++i ) { - ThreadsExec & fan = *m_pool_base[ rev_rank + (1< ReductionAvailable (or ScanAvailable) - Impl::spinwait( fan.m_pool_state , ThreadsExec::Active ); - Join::join( f , work_value , fan.reduce_memory() ); - } - - // Copy reduction value to scan value before releasing from this phase. - for ( unsigned i = 0 ; i < count ; ++i ) { work_value[i+count] = work_value[i] ; } - - if ( rev_rank ) { - - // Set: Active -> ReductionAvailable - m_pool_state = ThreadsExec::ReductionAvailable ; - - // Wait for contributing threads' scan value to be available. - if ( ( 1 << m_pool_fan_size ) < ( m_pool_rank + 1 ) ) { - ThreadsExec & th = *m_pool_base[ rev_rank + ( 1 << m_pool_fan_size ) ] ; - - // Wait: Active -> ReductionAvailable - // Wait: ReductionAvailable -> ScanAvailable - Impl::spinwait( th.m_pool_state , ThreadsExec::Active ); - Impl::spinwait( th.m_pool_state , ThreadsExec::ReductionAvailable ); - - Join::join( f , work_value + count , ((scalar_type *)th.reduce_memory()) + count ); - } - - // This thread has completed inclusive scan - // Set: ReductionAvailable -> ScanAvailable - m_pool_state = ThreadsExec::ScanAvailable ; - - // Wait for all threads to complete inclusive scan - // Wait: ScanAvailable -> Rendezvous - Impl::spinwait( m_pool_state , ThreadsExec::ScanAvailable ); - } - - //-------------------------------- - - for ( int i = 0 ; i < m_pool_fan_size ; ++i ) { - ThreadsExec & fan = *m_pool_base[ rev_rank + (1< ScanAvailable - Impl::spinwait( fan.m_pool_state , ThreadsExec::ReductionAvailable ); - // Set: ScanAvailable -> Rendezvous - fan.m_pool_state = ThreadsExec::Rendezvous ; - } - - // All threads have completed the inclusive scan. - // All non-root threads are in the Rendezvous state. - // Threads are free to overwrite their reduction value. - //-------------------------------- - - if ( ( rev_rank + 1 ) < m_pool_size ) { - // Exclusive scan: copy the previous thread's inclusive scan value - - ThreadsExec & th = *m_pool_base[ rev_rank + 1 ] ; // Not the root thread - - const scalar_type * const src_value = ((scalar_type *)th.reduce_memory()) + count ; - - for ( unsigned j = 0 ; j < count ; ++j ) { work_value[j] = src_value[j]; } - } - else { - (void) Init::init( f , work_value ); - } - - //-------------------------------- - // Wait for all threads to copy previous thread's inclusive scan value - // Wait for all threads: Rendezvous -> ScanCompleted - for ( int i = 0 ; i < m_pool_fan_size ; ++i ) { - Impl::spinwait( m_pool_base[ rev_rank + (1<m_pool_state , ThreadsExec::Rendezvous ); - } - if ( rev_rank ) { - // Set: ScanAvailable -> ScanCompleted - m_pool_state = ThreadsExec::ScanCompleted ; - // Wait: ScanCompleted -> Active - Impl::spinwait( m_pool_state , ThreadsExec::ScanCompleted ); - } - // Set: ScanCompleted -> Active - for ( int i = 0 ; i < m_pool_fan_size ; ++i ) { - m_pool_base[ rev_rank + (1<m_pool_state = ThreadsExec::Active ; - } - } - - template< class FunctorType , class ArgTag > - inline - void scan_small( const FunctorType & f ) - { - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , ArgTag > Traits ; - typedef Kokkos::Impl::FunctorValueJoin< FunctorType , ArgTag > Join ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , ArgTag > Init ; - - typedef typename Traits::value_type scalar_type ; - - const int rev_rank = m_pool_size - ( m_pool_rank + 1 ); - const unsigned count = Traits::value_count( f ); - - scalar_type * const work_value = (scalar_type *) reduce_memory(); - - //-------------------------------- - // Fan-in reduction with highest ranking thread as the root - for ( int i = 0 ; i < m_pool_fan_size ; ++i ) { - // Wait: Active -> Rendezvous - Impl::spinwait( m_pool_base[ rev_rank + (1<m_pool_state , ThreadsExec::Active ); - } - - for ( unsigned i = 0 ; i < count ; ++i ) { work_value[i+count] = work_value[i]; } - - if ( rev_rank ) { - m_pool_state = ThreadsExec::Rendezvous ; - // Wait: Rendezvous -> Active - Impl::spinwait( m_pool_state , ThreadsExec::Rendezvous ); - } - else { - // Root thread does the thread-scan before releasing threads - - scalar_type * ptr_prev = 0 ; - - for ( int rank = 0 ; rank < m_pool_size ; ++rank ) { - scalar_type * const ptr = (scalar_type *) get_thread( rank )->reduce_memory(); - if ( rank ) { - for ( unsigned i = 0 ; i < count ; ++i ) { ptr[i] = ptr_prev[ i + count ]; } - Join::join( f , ptr + count , ptr ); - } - else { - (void) Init::init( f , ptr ); - } - ptr_prev = ptr ; - } - } - - for ( int i = 0 ; i < m_pool_fan_size ; ++i ) { - m_pool_base[ rev_rank + (1<m_pool_state = ThreadsExec::Active ; - } - } - - //------------------------------------ - /** \brief Wait for previous asynchronous functor to - * complete and release the Threads device. - * Acquire the Threads device and start this functor. - */ - static void start( void (*)( ThreadsExec & , const void * ) , const void * ); - - static int in_parallel(); - static void fence(); - static bool sleep(); - static bool wake(); -}; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -inline int Threads::in_parallel() -{ return Impl::ThreadsExec::in_parallel(); } - -inline int Threads::is_initialized() -{ return Impl::ThreadsExec::is_initialized(); } - -inline void Threads::initialize( - unsigned threads_count , - unsigned use_numa_count , - unsigned use_cores_per_numa , - bool allow_asynchronous_threadpool ) -{ - Impl::ThreadsExec::initialize( threads_count , use_numa_count , use_cores_per_numa , allow_asynchronous_threadpool ); -} - -inline void Threads::finalize() -{ - Impl::ThreadsExec::finalize(); -} - -inline void Threads::print_configuration( std::ostream & s , const bool detail ) -{ - Impl::ThreadsExec::print_configuration( s , detail ); -} - -inline bool Threads::sleep() -{ return Impl::ThreadsExec::sleep() ; } - -inline bool Threads::wake() -{ return Impl::ThreadsExec::wake() ; } - -inline void Threads::fence() -{ Impl::ThreadsExec::fence() ; } - -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #define KOKKOS_THREADSEXEC_HPP */ - diff --git a/lib/kokkos/core/src/Threads/Kokkos_ThreadsExec_base.cpp b/lib/kokkos/core/src/Threads/Kokkos_ThreadsExec_base.cpp deleted file mode 100644 index 40d5efd0fe..0000000000 --- a/lib/kokkos/core/src/Threads/Kokkos_ThreadsExec_base.cpp +++ /dev/null @@ -1,254 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_HAVE_PTHREAD ) - -/* Standard 'C' Linux libraries */ - -#include -#include -#include - -/* Standard C++ libaries */ - -#include -#include -#include -#include - -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { -namespace { - -pthread_mutex_t host_internal_pthread_mutex = PTHREAD_MUTEX_INITIALIZER ; - -// Pthreads compatible driver. -// Recovery from an exception would require constant intra-thread health -// verification; which would negatively impact runtime. As such simply -// abort the process. - -void * internal_pthread_driver( void * ) -{ - try { - ThreadsExec::driver(); - } - catch( const std::exception & x ) { - std::cerr << "Exception thrown from worker thread: " << x.what() << std::endl ; - std::cerr.flush(); - std::abort(); - } - catch( ... ) { - std::cerr << "Exception thrown from worker thread" << std::endl ; - std::cerr.flush(); - std::abort(); - } - return NULL ; -} - -} // namespace - -//---------------------------------------------------------------------------- -// Spawn a thread - -bool ThreadsExec::spawn() -{ - bool result = false ; - - pthread_attr_t attr ; - - if ( 0 == pthread_attr_init( & attr ) || - 0 == pthread_attr_setscope( & attr, PTHREAD_SCOPE_SYSTEM ) || - 0 == pthread_attr_setdetachstate( & attr, PTHREAD_CREATE_DETACHED ) ) { - - pthread_t pt ; - - result = 0 == pthread_create( & pt, & attr, internal_pthread_driver, 0 ); - } - - pthread_attr_destroy( & attr ); - - return result ; -} - -//---------------------------------------------------------------------------- - -bool ThreadsExec::is_process() -{ - static const pthread_t master_pid = pthread_self(); - - return pthread_equal( master_pid , pthread_self() ); -} - -void ThreadsExec::global_lock() -{ - pthread_mutex_lock( & host_internal_pthread_mutex ); -} - -void ThreadsExec::global_unlock() -{ - pthread_mutex_unlock( & host_internal_pthread_mutex ); -} - -//---------------------------------------------------------------------------- - -void ThreadsExec::wait_yield( volatile int & flag , const int value ) -{ - while ( value == flag ) { sched_yield(); } -} - -} // namespace Impl -} // namespace Kokkos - -/* end #if defined( KOKKOS_HAVE_PTHREAD ) */ -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#elif defined( KOKKOS_HAVE_WINTHREAD ) - -/* Windows libraries */ -#include -#include - -/* Standard C++ libaries */ - -#include -#include -#include -#include - -#include - -//---------------------------------------------------------------------------- -// Driver for each created pthread - -namespace Kokkos { -namespace Impl { -namespace { - -unsigned WINAPI internal_winthread_driver( void * arg ) -{ - ThreadsExec::driver(); - - return 0 ; -} - -class ThreadLockWindows { -private: - CRITICAL_SECTION m_handle ; - - ~ThreadLockWindows() - { DeleteCriticalSection( & m_handle ); } - - ThreadLockWindows(); - { InitializeCriticalSection( & m_handle ); } - - ThreadLockWindows( const ThreadLockWindows & ); - ThreadLockWindows & operator = ( const ThreadLockWindows & ); - -public: - - static ThreadLockWindows & singleton(); - - void lock() - { EnterCriticalSection( & m_handle ); } - - void unlock() - { LeaveCriticalSection( & m_handle ); } -}; - -ThreadLockWindows & ThreadLockWindows::singleton() -{ static ThreadLockWindows self ; return self ; } - -} // namespace <> -} // namespace Kokkos -} // namespace Impl - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -// Spawn this thread - -bool ThreadsExec::spawn() -{ - unsigned Win32ThreadID = 0 ; - - HANDLE handle = - _beginthreadex(0,0,internal_winthread_driver,0,0, & Win32ThreadID ); - - return ! handle ; -} - -bool ThreadsExec::is_process() { return true ; } - -void ThreadsExec::global_lock() -{ ThreadLockWindows::singleton().lock(); } - -void ThreadsExec::global_unlock() -{ ThreadLockWindows::singleton().unlock(); } - -void ThreadsExec::wait_yield( volatile int & flag , const int value ) {} -{ - while ( value == flag ) { Sleep(0); } -} - -} // namespace Impl -} // namespace Kokkos - -#endif /* end #elif defined( KOKKOS_HAVE_WINTHREAD ) */ -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - - - diff --git a/lib/kokkos/core/src/Threads/Kokkos_ThreadsTeam.hpp b/lib/kokkos/core/src/Threads/Kokkos_ThreadsTeam.hpp deleted file mode 100644 index 53b5eb01df..0000000000 --- a/lib/kokkos/core/src/Threads/Kokkos_ThreadsTeam.hpp +++ /dev/null @@ -1,730 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_THREADSTEAM_HPP -#define KOKKOS_THREADSTEAM_HPP - -#include - -#include -#include -#include - -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -//---------------------------------------------------------------------------- - -template< class > struct ThreadsExecAdapter ; - -//---------------------------------------------------------------------------- - -class ThreadsExecTeamMember { -private: - - enum { TEAM_REDUCE_SIZE = 512 }; - - typedef Kokkos::Threads execution_space ; - typedef execution_space::scratch_memory_space space ; - - ThreadsExec * const m_exec ; - ThreadsExec * const * m_team_base ; ///< Base for team fan-in - space m_team_shared ; - int m_team_shared_size ; - int m_team_size ; - int m_team_rank ; - int m_team_rank_rev ; - int m_league_size ; - int m_league_end ; - int m_league_rank ; - - inline - void set_team_shared() - { new( & m_team_shared ) space( ((char *) (*m_team_base)->scratch_memory()) + TEAM_REDUCE_SIZE , m_team_shared_size ); } - -public: - - // Fan-in and wait until the matching fan-out is called. - // The root thread which does not wait will return true. - // All other threads will return false during the fan-out. - KOKKOS_INLINE_FUNCTION bool team_fan_in() const - { - int n , j ; - - // Wait for fan-in threads - for ( n = 1 ; ( ! ( m_team_rank_rev & n ) ) && ( ( j = m_team_rank_rev + n ) < m_team_size ) ; n <<= 1 ) { - Impl::spinwait( m_team_base[j]->state() , ThreadsExec::Active ); - } - - // If not root then wait for release - if ( m_team_rank_rev ) { - m_exec->state() = ThreadsExec::Rendezvous ; - Impl::spinwait( m_exec->state() , ThreadsExec::Rendezvous ); - } - - return ! m_team_rank_rev ; - } - - KOKKOS_INLINE_FUNCTION void team_fan_out() const - { - int n , j ; - for ( n = 1 ; ( ! ( m_team_rank_rev & n ) ) && ( ( j = m_team_rank_rev + n ) < m_team_size ) ; n <<= 1 ) { - m_team_base[j]->state() = ThreadsExec::Active ; - } - } - -public: - - KOKKOS_INLINE_FUNCTION static int team_reduce_size() { return TEAM_REDUCE_SIZE ; } - - KOKKOS_INLINE_FUNCTION - const execution_space::scratch_memory_space & team_shmem() const - { return m_team_shared ; } - - KOKKOS_INLINE_FUNCTION int league_rank() const { return m_league_rank ; } - KOKKOS_INLINE_FUNCTION int league_size() const { return m_league_size ; } - KOKKOS_INLINE_FUNCTION int team_rank() const { return m_team_rank ; } - KOKKOS_INLINE_FUNCTION int team_size() const { return m_team_size ; } - - KOKKOS_INLINE_FUNCTION void team_barrier() const - { - team_fan_in(); - team_fan_out(); - } - - template - KOKKOS_INLINE_FUNCTION - void team_broadcast(ValueType& value, const int& thread_id) const - { -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { } -#else - // Make sure there is enough scratch space: - typedef typename if_c< sizeof(ValueType) < TEAM_REDUCE_SIZE - , ValueType , void >::type type ; - - if ( m_team_base ) { - type * const local_value = ((type*) m_team_base[0]->scratch_memory()); - if(team_rank() == thread_id) *local_value = value; - memory_fence(); - team_barrier(); - value = *local_value; - } -#endif - } - - template< typename Type > - KOKKOS_INLINE_FUNCTION Type team_reduce( const Type & value ) const -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return Type(); } -#else - { - // Make sure there is enough scratch space: - typedef typename if_c< sizeof(Type) < TEAM_REDUCE_SIZE , Type , void >::type type ; - - if ( 0 == m_exec ) return value ; - - *((volatile type*) m_exec->scratch_memory() ) = value ; - - memory_fence(); - - type & accum = *((type *) m_team_base[0]->scratch_memory() ); - - if ( team_fan_in() ) { - for ( int i = 1 ; i < m_team_size ; ++i ) { - accum += *((type *) m_team_base[i]->scratch_memory() ); - } - memory_fence(); - } - - team_fan_out(); - - return accum ; - } -#endif - -#ifdef KOKKOS_HAVE_CXX11 - template< class ValueType, class JoinOp > - KOKKOS_INLINE_FUNCTION ValueType - team_reduce( const ValueType & value - , const JoinOp & op_in ) const - #if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return ValueType(); } - #else - { - typedef ValueType value_type; - const JoinLambdaAdapter op(op_in); - #endif -#else // KOKKOS_HAVE_CXX11 - template< class JoinOp > - KOKKOS_INLINE_FUNCTION typename JoinOp::value_type - team_reduce( const typename JoinOp::value_type & value - , const JoinOp & op ) const - #if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return typename JoinOp::value_type(); } - #else - { - typedef typename JoinOp::value_type value_type; - #endif -#endif // KOKKOS_HAVE_CXX11 -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - // Make sure there is enough scratch space: - typedef typename if_c< sizeof(value_type) < TEAM_REDUCE_SIZE - , value_type , void >::type type ; - - if ( 0 == m_exec ) return value ; - - type * const local_value = ((type*) m_exec->scratch_memory()); - - // Set this thread's contribution - *local_value = value ; - - // Fence to make sure the base team member has access: - memory_fence(); - - if ( team_fan_in() ) { - // The last thread to synchronize returns true, all other threads wait for team_fan_out() - type * const team_value = ((type*) m_team_base[0]->scratch_memory()); - - // Join to the team value: - for ( int i = 1 ; i < m_team_size ; ++i ) { - op.join( *team_value , *((type*) m_team_base[i]->scratch_memory()) ); - } - - // Team base thread may "lap" member threads so copy out to their local value. - for ( int i = 1 ; i < m_team_size ; ++i ) { - *((type*) m_team_base[i]->scratch_memory()) = *team_value ; - } - - // Fence to make sure all team members have access - memory_fence(); - } - - team_fan_out(); - - // Value was changed by the team base - return *((type volatile const *) local_value); - } -#endif - - /** \brief Intra-team exclusive prefix sum with team_rank() ordering - * with intra-team non-deterministic ordering accumulation. - * - * The global inter-team accumulation value will, at the end of the - * league's parallel execution, be the scan's total. - * Parallel execution ordering of the league's teams is non-deterministic. - * As such the base value for each team's scan operation is similarly - * non-deterministic. - */ - template< typename ArgType > - KOKKOS_INLINE_FUNCTION ArgType team_scan( const ArgType & value , ArgType * const global_accum ) const -#if ! defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return ArgType(); } -#else - { - // Make sure there is enough scratch space: - typedef typename if_c< sizeof(ArgType) < TEAM_REDUCE_SIZE , ArgType , void >::type type ; - - if ( 0 == m_exec ) return type(0); - - volatile type * const work_value = ((type*) m_exec->scratch_memory()); - - *work_value = value ; - - memory_fence(); - - if ( team_fan_in() ) { - // The last thread to synchronize returns true, all other threads wait for team_fan_out() - // m_team_base[0] == highest ranking team member - // m_team_base[ m_team_size - 1 ] == lowest ranking team member - // - // 1) copy from lower to higher rank, initialize lowest rank to zero - // 2) prefix sum from lowest to highest rank, skipping lowest rank - - type accum = 0 ; - - if ( global_accum ) { - for ( int i = m_team_size ; i-- ; ) { - type & val = *((type*) m_team_base[i]->scratch_memory()); - accum += val ; - } - accum = atomic_fetch_add( global_accum , accum ); - } - - for ( int i = m_team_size ; i-- ; ) { - type & val = *((type*) m_team_base[i]->scratch_memory()); - const type offset = accum ; - accum += val ; - val = offset ; - } - - memory_fence(); - } - - team_fan_out(); - - return *work_value ; - } -#endif - - /** \brief Intra-team exclusive prefix sum with team_rank() ordering. - * - * The highest rank thread can compute the reduction total as - * reduction_total = dev.team_scan( value ) + value ; - */ - template< typename ArgType > - KOKKOS_INLINE_FUNCTION ArgType team_scan( const ArgType & value ) const - { return this-> template team_scan( value , 0 ); } - - - //---------------------------------------- - // Private for the driver - - template< class Arg0 , class Arg1 > - ThreadsExecTeamMember( Impl::ThreadsExec * exec - , const TeamPolicy< Arg0 , Arg1 , Kokkos::Threads > & team - , const int shared_size ) - : m_exec( exec ) - , m_team_base(0) - , m_team_shared(0,0) - , m_team_shared_size( shared_size ) - , m_team_size(0) - , m_team_rank(0) - , m_team_rank_rev(0) - , m_league_size(0) - , m_league_end(0) - , m_league_rank(0) - { - if ( team.league_size() ) { - // Execution is using device-team interface: - - const int pool_rank_rev = m_exec->pool_size() - ( m_exec->pool_rank() + 1 ); - const int team_rank_rev = pool_rank_rev % team.team_alloc(); - - // May be using fewer threads per team than a multiple of threads per core, - // some threads will idle. - - if ( team_rank_rev < team.team_size() ) { - const size_t pool_league_size = m_exec->pool_size() / team.team_alloc() ; - const size_t pool_league_rank_rev = pool_rank_rev / team.team_alloc() ; - const size_t pool_league_rank = pool_league_size - ( pool_league_rank_rev + 1 ); - - m_team_base = m_exec->pool_base() + team.team_alloc() * pool_league_rank_rev ; - m_team_size = team.team_size() ; - m_team_rank = team.team_size() - ( team_rank_rev + 1 ); - m_team_rank_rev = team_rank_rev ; - m_league_size = team.league_size(); - - m_league_rank = ( team.league_size() * pool_league_rank ) / pool_league_size ; - m_league_end = ( team.league_size() * (pool_league_rank+1) ) / pool_league_size ; - - set_team_shared(); - } - } - } - - ThreadsExecTeamMember() - : m_exec(0) - , m_team_base(0) - , m_team_shared(0,0) - , m_team_shared_size(0) - , m_team_size(1) - , m_team_rank(0) - , m_team_rank_rev(0) - , m_league_size(1) - , m_league_end(0) - , m_league_rank(0) - {} - - inline - ThreadsExec & threads_exec_team_base() const { return m_team_base ? **m_team_base : *m_exec ; } - - bool valid() const - { return m_league_rank < m_league_end ; } - - void next() - { - if ( ++m_league_rank < m_league_end ) { - team_barrier(); - set_team_shared(); - } - } - - void set_league_shmem( const int arg_league_rank - , const int arg_league_size - , const int arg_shmem_size - ) - { - m_league_rank = arg_league_rank ; - m_league_size = arg_league_size ; - m_team_shared_size = arg_shmem_size ; - set_team_shared(); - } -}; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -template< class Arg0 , class Arg1 > -class TeamPolicy< Arg0 , Arg1 , Kokkos::Threads > -{ -private: - - int m_league_size ; - int m_team_size ; - int m_team_alloc ; - - inline - void init( const int league_size_request - , const int team_size_request ) - { - const int pool_size = execution_space::thread_pool_size(0); - const int team_max = execution_space::thread_pool_size(1); - const int team_grain = execution_space::thread_pool_size(2); - - m_league_size = league_size_request ; - - m_team_size = team_size_request < team_max ? - team_size_request : team_max ; - - // Round team size up to a multiple of 'team_gain' - const int team_size_grain = team_grain * ( ( m_team_size + team_grain - 1 ) / team_grain ); - const int team_count = pool_size / team_size_grain ; - - // Constraint : pool_size = m_team_alloc * team_count - m_team_alloc = pool_size / team_count ; - } - - -public: - - //! Tag this class as a kokkos execution policy - typedef TeamPolicy execution_policy ; - typedef Kokkos::Threads execution_space ; - - typedef typename - Impl::if_c< ! Impl::is_same< Kokkos::Threads , Arg0 >::value , Arg0 , Arg1 >::type - work_tag ; - - //---------------------------------------- - - template< class FunctorType > - inline static - int team_size_max( const FunctorType & ) - { return execution_space::thread_pool_size(1); } - - template< class FunctorType > - static int team_size_recommended( const FunctorType & ) - { return execution_space::thread_pool_size(2); } - - - template< class FunctorType > - inline static - int team_size_recommended( const FunctorType &, const int& ) - { return execution_space::thread_pool_size(2); } - - //---------------------------------------- - - inline int team_size() const { return m_team_size ; } - inline int team_alloc() const { return m_team_alloc ; } - inline int league_size() const { return m_league_size ; } - - /** \brief Specify league size, request team size */ - TeamPolicy( execution_space & , int league_size_request , int team_size_request , int vector_length_request = 1 ) - : m_league_size(0) - , m_team_size(0) - , m_team_alloc(0) - { init(league_size_request,team_size_request); (void) vector_length_request; } - - TeamPolicy( int league_size_request , int team_size_request , int vector_length_request = 1 ) - : m_league_size(0) - , m_team_size(0) - , m_team_alloc(0) - { init(league_size_request,team_size_request); (void) vector_length_request; } - - typedef Impl::ThreadsExecTeamMember member_type ; - - friend class Impl::ThreadsExecTeamMember ; -}; - - -} /* namespace Kokkos */ - - -namespace Kokkos { - -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct -TeamThreadRange(const Impl::ThreadsExecTeamMember& thread, const iType& count) -{ - return Impl::TeamThreadRangeBoundariesStruct(thread,count); -} - -template -KOKKOS_INLINE_FUNCTION -Impl::TeamThreadRangeBoundariesStruct -TeamThreadRange( const Impl::ThreadsExecTeamMember& thread - , const iType & begin - , const iType & end - ) -{ - return Impl::TeamThreadRangeBoundariesStruct(thread,begin,end); -} - - -template -KOKKOS_INLINE_FUNCTION -Impl::ThreadVectorRangeBoundariesStruct - ThreadVectorRange(const Impl::ThreadsExecTeamMember& thread, const iType& count) { - return Impl::ThreadVectorRangeBoundariesStruct(thread,count); -} - - -KOKKOS_INLINE_FUNCTION -Impl::ThreadSingleStruct PerTeam(const Impl::ThreadsExecTeamMember& thread) { - return Impl::ThreadSingleStruct(thread); -} - -KOKKOS_INLINE_FUNCTION -Impl::VectorSingleStruct PerThread(const Impl::ThreadsExecTeamMember& thread) { - return Impl::VectorSingleStruct(thread); -} -} // namespace Kokkos - -namespace Kokkos { - - /** \brief Inter-thread parallel_for. Executes lambda(iType i) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all threads of the the calling thread team. - * This functionality requires C++11 support.*/ -template -KOKKOS_INLINE_FUNCTION -void parallel_for(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, const Lambda& lambda) { - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) - lambda(i); -} - -/** \brief Inter-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all threads of the the calling thread team and a summation of - * val is performed and put into result. This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, - const Lambda & lambda, ValueType& result) { - - result = ValueType(); - - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - result+=tmp; - } - - result = loop_boundaries.thread.team_reduce(result,Impl::JoinAdd()); -} - -#if defined( KOKKOS_HAVE_CXX11 ) - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a reduction of - * val is performed using JoinType(ValueType& val, const ValueType& update) and put into init_result. - * The input value of init_result is used as initializer for temporary variables of ValueType. Therefore - * the input value should be the neutral element with respect to the join operation (e.g. '0 for +-' or - * '1 for *'). This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType, class JoinType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::TeamThreadRangeBoundariesStruct& loop_boundaries, - const Lambda & lambda, const JoinType& join, ValueType& init_result) { - - ValueType result = init_result; - - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - join(result,tmp); - } - - init_result = loop_boundaries.thread.team_reduce(result,Impl::JoinLambdaAdapter(join)); -} - -#endif /* #if defined( KOKKOS_HAVE_CXX11 ) */ - -} //namespace Kokkos - - -namespace Kokkos { -/** \brief Intra-thread vector parallel_for. Executes lambda(iType i) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread. - * This functionality requires C++11 support.*/ -template -KOKKOS_INLINE_FUNCTION -void parallel_for(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda& lambda) { - #ifdef KOKKOS_HAVE_PRAGMA_IVDEP - #pragma ivdep - #endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) - lambda(i); -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a summation of - * val is performed and put into result. This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda & lambda, ValueType& result) { - result = ValueType(); -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - result+=tmp; - } -} - -/** \brief Intra-thread vector parallel_reduce. Executes lambda(iType i, ValueType & val) for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes of the the calling thread and a reduction of - * val is performed using JoinType(ValueType& val, const ValueType& update) and put into init_result. - * The input value of init_result is used as initializer for temporary variables of ValueType. Therefore - * the input value should be the neutral element with respect to the join operation (e.g. '0 for +-' or - * '1 for *'). This functionality requires C++11 support.*/ -template< typename iType, class Lambda, typename ValueType, class JoinType > -KOKKOS_INLINE_FUNCTION -void parallel_reduce(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const Lambda & lambda, const JoinType& join, ValueType& init_result) { - - ValueType result = init_result; -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - ValueType tmp = ValueType(); - lambda(i,tmp); - join(result,tmp); - } - init_result = result; -} - -/** \brief Intra-thread vector parallel exclusive prefix sum. Executes lambda(iType i, ValueType & val, bool final) - * for each i=0..N-1. - * - * The range i=0..N-1 is mapped to all vector lanes in the thread and a scan operation is performed. - * Depending on the target execution space the operator might be called twice: once with final=false - * and once with final=true. When final==true val contains the prefix sum value. The contribution of this - * "i" needs to be added to val no matter whether final==true or not. In a serial execution - * (i.e. team_size==1) the operator is only called once with final==true. Scan_val will be set - * to the final sum value over all vector lanes. - * This functionality requires C++11 support.*/ -template< typename iType, class FunctorType > -KOKKOS_INLINE_FUNCTION -void parallel_scan(const Impl::ThreadVectorRangeBoundariesStruct& - loop_boundaries, const FunctorType & lambda) { - - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , void > ValueTraits ; - typedef typename ValueTraits::value_type value_type ; - - value_type scan_val = value_type(); - -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP -#pragma ivdep -#endif - for( iType i = loop_boundaries.start; i < loop_boundaries.end; i+=loop_boundaries.increment) { - lambda(i,scan_val,true); - } -} - -} // namespace Kokkos - -namespace Kokkos { - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::VectorSingleStruct& single_struct, const FunctorType& lambda) { - lambda(); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::ThreadSingleStruct& single_struct, const FunctorType& lambda) { - if(single_struct.team_member.team_rank()==0) lambda(); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::VectorSingleStruct& single_struct, const FunctorType& lambda, ValueType& val) { - lambda(val); -} - -template -KOKKOS_INLINE_FUNCTION -void single(const Impl::ThreadSingleStruct& single_struct, const FunctorType& lambda, ValueType& val) { - if(single_struct.team_member.team_rank()==0) { - lambda(val); - } - single_struct.team_member.team_broadcast(val,0); -} -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #define KOKKOS_THREADSTEAM_HPP */ - diff --git a/lib/kokkos/core/src/Threads/Kokkos_Threads_Parallel.hpp b/lib/kokkos/core/src/Threads/Kokkos_Threads_Parallel.hpp deleted file mode 100644 index 4b2a169126..0000000000 --- a/lib/kokkos/core/src/Threads/Kokkos_Threads_Parallel.hpp +++ /dev/null @@ -1,427 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_THREADS_PARALLEL_HPP -#define KOKKOS_THREADS_PARALLEL_HPP - -#include - -#include - -#include -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelFor< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Threads > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Threads > Policy ; - - const FunctorType m_func ; - const Policy m_policy ; - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( i ); - } - } - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( ! Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( typename PType::work_tag() , i ); - } - } - - static void execute( ThreadsExec & exec , const void * arg ) - { - const ParallelFor & self = * ((const ParallelFor *) arg ); - - driver( self.m_func , typename Policy::WorkRange( self.m_policy , exec.pool_rank() , exec.pool_size() ) ); - - exec.fan_in(); - } - -public: - - ParallelFor( const FunctorType & functor - , const Policy & policy ) - : m_func( functor ) - , m_policy( policy ) - { - ThreadsExec::start( & ParallelFor::execute , this ); - - ThreadsExec::fence(); - } -}; - -template< class FunctorType , class Arg0 , class Arg1 > -class ParallelFor< FunctorType , Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::Threads > > -{ -private: - - typedef TeamPolicy< Arg0 , Arg1 , Kokkos::Threads > Policy ; - - const FunctorType m_func ; - const Policy m_policy ; - const int m_shared ; - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION - void driver( typename Impl::enable_if< Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member ) const - { m_func( member ); } - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION - void driver( typename Impl::enable_if< ! Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member ) const - { m_func( TagType() , member ); } - - static void execute( ThreadsExec & exec , const void * arg ) - { - const ParallelFor & self = * ((const ParallelFor *) arg ); - - typename Policy::member_type member( & exec , self.m_policy , self.m_shared ); - - for ( ; member.valid() ; member.next() ) { - self.ParallelFor::template driver< typename Policy::work_tag >( member ); - } - - exec.fan_in(); - } - -public: - - ParallelFor( const FunctorType & functor - , const Policy & policy ) - : m_func( functor ) - , m_policy( policy ) - , m_shared( FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ) ) - { - ThreadsExec::resize_scratch( 0 , Policy::member_type::team_reduce_size() + m_shared ); - - ThreadsExec::start( & ParallelFor::execute , this ); - - ThreadsExec::fence(); - } -}; - - - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelReduce< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Threads > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Threads > Policy ; - typedef typename Policy::work_tag work_tag ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , work_tag > ValueInit ; - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - const FunctorType m_func ; - const Policy m_policy ; - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , reference_type update - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( i , update ); - } - } - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( ! Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , reference_type update - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( typename PType::work_tag() , i , update ); - } - } - - static void execute( ThreadsExec & exec , const void * arg ) - { - const ParallelReduce & self = * ((const ParallelReduce *) arg ); - - driver( self.m_func - , ValueInit::init( self.m_func , exec.reduce_memory() ) - , typename Policy::WorkRange( self.m_policy , exec.pool_rank() , exec.pool_size() ) - ); - - exec.template fan_in_reduce< FunctorType , work_tag >( self.m_func ); - } - -public: - - template< class HostViewType > - ParallelReduce( const FunctorType & functor , - const Policy & policy , - const HostViewType & result_view ) - : m_func( functor ) - , m_policy( policy ) - { - ThreadsExec::resize_scratch( ValueTraits::value_size( m_func ) , 0 ); - - ThreadsExec::start( & ParallelReduce::execute , this ); - - const pointer_type data = (pointer_type) ThreadsExec::root_reduce_scratch(); - - ThreadsExec::fence(); - - if ( result_view.ptr_on_device() ) { - const unsigned n = ValueTraits::value_count( m_func ); - for ( unsigned i = 0 ; i < n ; ++i ) { result_view.ptr_on_device()[i] = data[i]; } - } - } -}; - -//---------------------------------------------------------------------------- - -template< class FunctorType , class Arg0 , class Arg1 > -class ParallelReduce< FunctorType , Kokkos::TeamPolicy< Arg0 , Arg1 , Kokkos::Threads > > -{ -private: - - typedef TeamPolicy< Arg0 , Arg1 , Kokkos::Threads > Policy ; - typedef typename Policy::work_tag work_tag ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , work_tag > ValueInit ; - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - const FunctorType m_func ; - const Policy m_policy ; - const int m_shared ; - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION - void driver( typename Impl::enable_if< Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member - , reference_type update ) const - { m_func( member , update ); } - - template< class TagType > - KOKKOS_FORCEINLINE_FUNCTION - void driver( typename Impl::enable_if< ! Impl::is_same< TagType , void >::value , - const typename Policy::member_type & >::type member - , reference_type update ) const - { m_func( TagType() , member , update ); } - - static void execute( ThreadsExec & exec , const void * arg ) - { - const ParallelReduce & self = * ((const ParallelReduce *) arg ); - - // Initialize thread-local value - reference_type update = ValueInit::init( self.m_func , exec.reduce_memory() ); - - typename Policy::member_type member( & exec , self.m_policy , self.m_shared ); - for ( ; member.valid() ; member.next() ) { - self.ParallelReduce::template driver< work_tag >( member , update ); - } - - exec.template fan_in_reduce< FunctorType , work_tag >( self.m_func ); - } - -public: - - ParallelReduce( const FunctorType & functor - , const Policy & policy ) - : m_func( functor ) - , m_policy( policy ) - , m_shared( FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ) ) - { - ThreadsExec::resize_scratch( ValueTraits::value_size( m_func ) , Policy::member_type::team_reduce_size() + m_shared ); - - ThreadsExec::start( & ParallelReduce::execute , this ); - - ThreadsExec::fence(); - } - - template< class ViewType > - ParallelReduce( const FunctorType & functor - , const Policy & policy - , const ViewType & result ) - : m_func( functor ) - , m_policy( policy ) - , m_shared( FunctorTeamShmemSize< FunctorType >::value( functor , policy.team_size() ) ) - { - ThreadsExec::resize_scratch( ValueTraits::value_size( m_func ) , Policy::member_type::team_reduce_size() + m_shared ); - - ThreadsExec::start( & ParallelReduce::execute , this ); - - const pointer_type data = (pointer_type) ThreadsExec::root_reduce_scratch(); - - ThreadsExec::fence(); - - const unsigned n = ValueTraits::value_count( m_func ); - for ( unsigned i = 0 ; i < n ; ++i ) { result.ptr_on_device()[i] = data[i]; } - } -}; - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -template< class FunctorType , class Arg0 , class Arg1 , class Arg2 > -class ParallelScan< FunctorType , Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Threads > > -{ -private: - - typedef Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Threads > Policy ; - typedef typename Policy::work_tag work_tag ; - typedef Kokkos::Impl::FunctorValueTraits< FunctorType , work_tag > ValueTraits ; - typedef Kokkos::Impl::FunctorValueInit< FunctorType , work_tag > ValueInit ; - - typedef typename ValueTraits::pointer_type pointer_type ; - typedef typename ValueTraits::reference_type reference_type ; - - const FunctorType m_func ; - const Policy m_policy ; - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , reference_type update - , const bool final - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( i , update , final ); - } - } - - template< class PType > - KOKKOS_FORCEINLINE_FUNCTION static - void driver( typename Impl::enable_if< - ( ! Impl::is_same< typename PType::work_tag , void >::value ) - , const FunctorType & >::type functor - , reference_type update - , const bool final - , const PType & range ) - { - const typename PType::member_type e = range.end(); - for ( typename PType::member_type i = range.begin() ; i < e ; ++i ) { - functor( typename PType::work_tag() , i , update , final ); - } - } - - static void execute( ThreadsExec & exec , const void * arg ) - { - const ParallelScan & self = * ((const ParallelScan *) arg ); - - const typename Policy::WorkRange range( self.m_policy , exec.pool_rank() , exec.pool_size() ); - - reference_type update = ValueInit::init( self.m_func , exec.reduce_memory() ); - - driver( self.m_func , update , false , range ); - - // exec.scan_large( self.m_func ); - exec.template scan_small( self.m_func ); - - driver( self.m_func , update , true , range ); - - exec.fan_in(); - } - -public: - - ParallelScan( const FunctorType & functor , const Policy & policy ) - : m_func( functor ) - , m_policy( policy ) - { - ThreadsExec::resize_scratch( 2 * ValueTraits::value_size( m_func ) , 0 ); - ThreadsExec::start( & ParallelScan::execute , this ); - ThreadsExec::fence(); - } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #define KOKKOS_THREADS_PARALLEL_HPP */ - diff --git a/lib/kokkos/core/src/Threads/Kokkos_Threads_TaskPolicy.cpp b/lib/kokkos/core/src/Threads/Kokkos_Threads_TaskPolicy.cpp deleted file mode 100644 index 8ad7f15ecc..0000000000 --- a/lib/kokkos/core/src/Threads/Kokkos_Threads_TaskPolicy.cpp +++ /dev/null @@ -1,599 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -// Experimental unified task-data parallel manycore LDRD - -#include -#include -#include -#include - -#if defined( KOKKOS_HAVE_PTHREAD ) - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -typedef TaskMember< Kokkos::Threads , void , void > Task ; - -namespace { - -int volatile s_count_serial = 0 ; -int volatile s_count_team = 0 ; -Task * volatile s_ready_team = 0 ; -Task * volatile s_ready_serial = 0 ; -Task * const s_lock = reinterpret_cast( ~((unsigned long)0) ); -Task * const s_denied = reinterpret_cast( ~((unsigned long)0) - 1 ); - -} /* namespace */ -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -namespace Kokkos { -namespace Experimental { - -TaskPolicy< Kokkos::Threads >::TaskPolicy - ( const unsigned arg_default_dependence_capacity - , const unsigned arg_team_size - ) - : m_default_dependence_capacity( arg_default_dependence_capacity ) - , m_team_size( arg_team_size ) -{ - const int threads_total = Threads::thread_pool_size(0); - const int threads_per_numa = Threads::thread_pool_size(1); - const int threads_per_core = Threads::thread_pool_size(2); - - if ( 0 == arg_team_size ) { - // If a team task then claim for execution until count is zero - // Issue: team collectives cannot assume which pool members are in the team. - // Issue: team must only span a single NUMA region. - - // If more than one thread per core then map cores to work team, - // else map numa to work team. - - if ( 1 < threads_per_core ) m_team_size = threads_per_core ; - else if ( 1 < threads_per_numa ) m_team_size = threads_per_numa ; - else m_team_size = 1 ; - } - - // Verify a valid team size - const bool valid_team_size = - ( 0 < m_team_size && m_team_size <= threads_total ) && - ( - ( 1 == m_team_size ) || - ( threads_per_core == m_team_size ) || - ( threads_per_numa == m_team_size ) - ); - - if ( ! valid_team_size ) { - std::ostringstream msg ; - - msg << "Kokkos::Experimental::TaskPolicy< Kokkos::Threads > ERROR" - << " invalid team_size(" << m_team_size << ")" - << " threads_per_core(" << threads_per_core << ")" - << " threads_per_numa(" << threads_per_numa << ")" - << " threads_total(" << threads_total << ")" - ; - - Kokkos::Impl::throw_runtime_exception( msg.str() ); - - } -} - -TaskPolicy< Kokkos::Threads >::member_type & -TaskPolicy< Kokkos::Threads >::member_single() -{ - static member_type s ; - return s ; -} - -void wait( Kokkos::Experimental::TaskPolicy< Kokkos::Threads > & policy ) -{ - typedef Kokkos::Impl::ThreadsExecTeamMember member_type ; - - enum { BASE_SHMEM = 1024 }; - - void * const arg = reinterpret_cast( long( policy.m_team_size ) ); - - Kokkos::Impl::ThreadsExec::resize_scratch( 0 , member_type::team_reduce_size() + BASE_SHMEM ); - Kokkos::Impl::ThreadsExec::start( & Impl::Task::execute_ready_tasks_driver , arg ); - Kokkos::Impl::ThreadsExec::fence(); -} - -} /* namespace Experimental */ -} /* namespace Kokkos */ - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -//---------------------------------------------------------------------------- - -void Task::throw_error_verify_type() -{ - Kokkos::Impl::throw_runtime_exception("TaskMember< Threads >::verify_type ERROR"); -} - -void Task::deallocate( void * ptr ) -{ - free( ptr ); -} - -void * Task::allocate( const unsigned n ) -{ - void * const ptr = malloc(n); - - return ptr ; -} - -Task::~TaskMember() -{ -} - -//---------------------------------------------------------------------------- - -void Task::reschedule() -{ - // Reschedule transitions from executing back to waiting. - const int old_state = atomic_compare_exchange( & m_state , int(TASK_STATE_EXECUTING) , int(TASK_STATE_WAITING) ); - - if ( old_state != int(TASK_STATE_EXECUTING) ) { - -fprintf( stderr - , "reschedule ERROR task[%lx] state(%d)\n" - , (unsigned long) this - , old_state - ); -fflush(stderr); - - } -} - -void Task::schedule() -{ - //---------------------------------------- - // State is either constructing or already waiting. - // If constructing then transition to waiting. - - { - const int old_state = atomic_compare_exchange( & m_state , int(TASK_STATE_CONSTRUCTING) , int(TASK_STATE_WAITING) ); - Task * const waitTask = *((Task * volatile const *) & m_wait ); - Task * const next = *((Task * volatile const *) & m_next ); - - if ( s_denied == waitTask || 0 != next || - ( old_state != int(TASK_STATE_CONSTRUCTING) && - old_state != int(TASK_STATE_WAITING) ) ) { - fprintf(stderr,"Task::schedule task(0x%lx) STATE ERROR: state(%d) wait(0x%lx) next(0x%lx)\n" - , (unsigned long) this - , old_state - , (unsigned long) waitTask - , (unsigned long) next ); - fflush(stderr); - Kokkos::Impl::throw_runtime_exception("Kokkos::Impl::Task spawn or respawn state error"); - } - } - - //---------------------------------------- - // Insert this task into another dependence that is not complete - // Push on to the wait queue, fails if ( s_denied == m_dep[i]->m_wait ) - - bool insert_in_ready_queue = true ; - - for ( int i = 0 ; i < m_dep_size && insert_in_ready_queue ; ) { - - Task * const task_dep = m_dep[i] ; - Task * const head_value_old = *((Task * volatile *) & task_dep->m_wait ); - - if ( s_denied == head_value_old ) { - // Wait queue is closed, try again with the next queue - ++i ; - } - else { - - // Wait queue is open and not locked. - // If CAS succeeds then have acquired the lock. - - // Have exclusive access to this task. - // Assign m_next assuming a successfull insertion into the queue. - // Fence the memory assignment before attempting the CAS. - - *((Task * volatile *) & m_next ) = head_value_old ; - - memory_fence(); - - // Attempt to insert this task into the queue - - Task * const wait_queue_head = atomic_compare_exchange( & task_dep->m_wait , head_value_old , this ); - - if ( head_value_old == wait_queue_head ) { - insert_in_ready_queue = false ; - } - } - } - - //---------------------------------------- - // All dependences are complete, insert into the ready list - - if ( insert_in_ready_queue ) { - - // Increment the count of ready tasks. - // Count is decremented when task is complete. - - Task * volatile * queue = 0 ; - - if ( m_serial ) { - atomic_increment( & s_count_serial ); - queue = & s_ready_serial ; - } - else { - atomic_increment( & s_count_team ); - queue = & s_ready_team ; - } - - while ( insert_in_ready_queue ) { - - Task * const head_value_old = *queue ; - - if ( s_lock != head_value_old ) { - // Read the head of ready queue, if same as previous value then CAS locks the ready queue - // Only access via CAS - - // Have exclusive access to this task, assign to head of queue, assuming successful insert - // Fence assignment before attempting insert. - *((Task * volatile *) & m_next ) = head_value_old ; - - memory_fence(); - - Task * const ready_queue_head = atomic_compare_exchange( queue , head_value_old , this ); - - if ( head_value_old == ready_queue_head ) { - // Successful insert - insert_in_ready_queue = false ; // done - } - } - } - } -} - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - -void Task::assign( Task ** const lhs_ptr , Task * rhs ) -{ - // Increment rhs reference count. - if ( rhs ) { atomic_increment( & rhs->m_ref_count ); } - - // Assign the pointer and retrieve the previous value. - - Task * const old_lhs = atomic_exchange( lhs_ptr , rhs ); - - if ( old_lhs ) { - - // Decrement former lhs reference count. - // If reference count is zero task must be complete, then delete task. - // Task is ready for deletion when wait == s_denied - - int const count = atomic_fetch_add( & (old_lhs->m_ref_count) , -1 ) - 1 ; - - // if 'count != 0' then 'old_lhs' may be deallocated before dereferencing - Task * const wait = count == 0 ? *((Task * const volatile *) & old_lhs->m_wait ) : (Task*) 0 ; - - if ( count < 0 || ( count == 0 && wait != s_denied ) ) { - - static const char msg_error_header[] = "Kokkos::Impl::TaskManager::assign ERROR deleting" ; - - fprintf( stderr , "%s task(0x%lx) m_ref_count(%d) , m_wait(0x%ld)\n" - , msg_error_header - , (unsigned long) old_lhs - , count - , (unsigned long) wait ); - fflush(stderr); - - Kokkos::Impl::throw_runtime_exception( msg_error_header ); - } - - if ( count == 0 ) { - // When 'count == 0' this thread has exclusive access to 'old_lhs' - const Task::function_dealloc_type d = old_lhs->m_dealloc ; - (*d)( old_lhs ); - } - } -} - -#endif - -//---------------------------------------------------------------------------- - -Task * Task::get_dependence( int i ) const -{ - Task * const t = m_dep[i] ; - - if ( Kokkos::Experimental::TASK_STATE_EXECUTING != m_state || i < 0 || m_dep_size <= i || 0 == t ) { - -fprintf( stderr - , "TaskMember< Threads >::get_dependence ERROR : task[%lx]{ state(%d) dep_size(%d) dep[%d] = %lx }\n" - , (unsigned long) this - , m_state - , m_dep_size - , i - , (unsigned long) t - ); -fflush( stderr ); - - Kokkos::Impl::throw_runtime_exception("TaskMember< Threads >::get_dependence ERROR"); - } - - return t ; -} - -//---------------------------------------------------------------------------- - -void Task::add_dependence( Task * before ) -{ - if ( before != 0 ) { - - int const state = *((volatile const int *) & m_state ); - - // Can add dependence during construction or during execution - - if ( ( Kokkos::Experimental::TASK_STATE_CONSTRUCTING == state || - Kokkos::Experimental::TASK_STATE_EXECUTING == state ) && - m_dep_size < m_dep_capacity ) { - - ++m_dep_size ; - - assign( m_dep + (m_dep_size-1) , before ); - - memory_fence(); - } - else { - -fprintf( stderr - , "TaskMember< Threads >::add_dependence ERROR : task[%lx]{ state(%d) dep_size(%d) m_dep_capacity(%d) }\n" - , (unsigned long) this - , m_state - , m_dep_size - , m_dep_capacity - ); -fflush( stderr ); - - Kokkos::Impl::throw_runtime_exception("TaskMember< Threads >::add_dependence ERROR"); - } - } -} - -//---------------------------------------------------------------------------- - -void Task::clear_dependence() -{ - for ( int i = m_dep_size - 1 ; 0 <= i ; --i ) { - assign( m_dep + i , 0 ); - } - - *((volatile int *) & m_dep_size ) = 0 ; - - memory_fence(); -} - -//---------------------------------------------------------------------------- - -Task * Task::pop_ready_task( Task * volatile * const queue ) -{ - Task * const task_old = *queue ; - - if ( s_lock != task_old && 0 != task_old ) { - - Task * const task = atomic_compare_exchange( queue , task_old , s_lock ); - - if ( task_old == task ) { - - // May have acquired the lock and task. - // One or more other threads may have acquired this same task and lock - // due to respawning ABA race condition. - // Can only be sure of acquire with a successful state transition from waiting to executing - - const int old_state = atomic_compare_exchange( & task->m_state, int(TASK_STATE_WAITING), int(TASK_STATE_EXECUTING) ); - - if ( old_state == int(TASK_STATE_WAITING) ) { - - // Transitioned this task from waiting to executing - // Update the queue to the next entry and release the lock - - Task * const next_old = *((Task * volatile *) & task->m_next ); - - Task * const s = atomic_compare_exchange( queue , s_lock , next_old ); - - if ( s != s_lock ) { - fprintf(stderr,"Task::pop_ready_task( 0x%lx ) UNLOCK ERROR\n", (unsigned long) queue ); - fflush(stderr); - } - - *((Task * volatile *) & task->m_next ) = 0 ; - - return task ; - } - else { - fprintf(stderr,"Task::pop_ready_task( 0x%lx ) task(0x%lx) state(%d) ERROR\n" - , (unsigned long) queue - , (unsigned long) task - , old_state ); - fflush(stderr); - } - } - } - - return (Task *) 0 ; -} - - -void Task::complete_executed_task( Task * task , volatile int * const queue_count ) -{ - // State is either executing or if respawned then waiting, - // try to transition from executing to complete. - // Reads the current value. - - const int state_old = - atomic_compare_exchange( & task->m_state - , int(Kokkos::Experimental::TASK_STATE_EXECUTING) - , int(Kokkos::Experimental::TASK_STATE_COMPLETE) ); - - if ( Kokkos::Experimental::TASK_STATE_WAITING == state_old ) { - task->schedule(); /* Task requested a respawn so reschedule it */ - } - else if ( Kokkos::Experimental::TASK_STATE_EXECUTING != state_old ) { - fprintf( stderr - , "TaskMember< Threads >::execute_serial completion ERROR : task[%lx]{ state_old(%d) dep_size(%d) }\n" - , (unsigned long) & task - , state_old - , task->m_dep_size - ); - fflush( stderr ); - } - else { - - // Clear dependences of this task before locking wait queue - - task->clear_dependence(); - - // Stop other tasks from adding themselves to this task's wait queue. - // The wait queue is updated concurrently so guard with an atomic. - // Setting the wait queue to denied denotes delete-ability of the task by any thread. - // Therefore, once 'denied' the task pointer must be treated as invalid. - - Task * wait_queue = *((Task * volatile *) & task->m_wait ); - Task * wait_queue_old = 0 ; - - do { - wait_queue_old = wait_queue ; - wait_queue = atomic_compare_exchange( & task->m_wait , wait_queue_old , s_denied ); - } while ( wait_queue_old != wait_queue ); - - task = 0 ; - - // Pop waiting tasks and schedule them - while ( wait_queue ) { - Task * const x = wait_queue ; wait_queue = x->m_next ; x->m_next = 0 ; - x->schedule(); - } - } - - atomic_decrement( queue_count ); -} - -//---------------------------------------------------------------------------- - -void Task::execute_ready_tasks_driver( Kokkos::Impl::ThreadsExec & exec , const void * arg ) -{ - typedef Kokkos::Impl::ThreadsExecTeamMember member_type ; - - // Whole pool is calling this function - - // Create the thread team member with shared memory for the given task. - const int team_size = reinterpret_cast( arg ); - - member_type member( & exec , TeamPolicy< Kokkos::Threads >( 1 , team_size ) , 0 ); - - Kokkos::Impl::ThreadsExec & exec_team_base = member.threads_exec_team_base(); - - Task * volatile * const task_team_ptr = reinterpret_cast( exec_team_base.reduce_memory() ); - - if ( member.team_fan_in() ) { - *task_team_ptr = 0 ; - Kokkos::memory_fence(); - } - member.team_fan_out(); - - long int iteration_count = 0 ; - - // Each team must iterate this loop synchronously to insure team-execution of team-task - - while ( 0 < s_count_serial || 0 < s_count_team ) { - - if ( member.team_rank() == 0 ) { - // Only one team member attempts to pop a team task - *task_team_ptr = pop_ready_task( & s_ready_team ); - } - - // Query if team acquired a team task - Task * const task_team = *task_team_ptr ; - - if ( task_team ) { - // Set shared memory - member.set_league_shmem( 0 , 1 , task_team->m_shmem_size ); - - (*task_team->m_team)( task_team , member ); - - // Do not proceed until all members have completed the task, - // the task has been completed or rescheduled, and - // the team task pointer has been cleared. - if ( member.team_fan_in() ) { - complete_executed_task( task_team , & s_count_team ); - *task_team_ptr = 0 ; - Kokkos::memory_fence(); - } - member.team_fan_out(); - } - else { - Task * const task_serial = pop_ready_task( & s_ready_serial ); - - if ( task_serial ) { - if ( task_serial->m_serial ) (*task_serial->m_serial)( task_serial ); - - complete_executed_task( task_serial , & s_count_serial ); - } - } - - ++iteration_count ; - } - - exec.fan_in(); -} - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -#endif /* #if defined( KOKKOS_HAVE_PTHREAD ) */ - diff --git a/lib/kokkos/core/src/Threads/Kokkos_Threads_TaskPolicy.hpp b/lib/kokkos/core/src/Threads/Kokkos_Threads_TaskPolicy.hpp deleted file mode 100644 index 0246713240..0000000000 --- a/lib/kokkos/core/src/Threads/Kokkos_Threads_TaskPolicy.hpp +++ /dev/null @@ -1,584 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -// Experimental unified task-data parallel manycore LDRD - -#ifndef KOKKOS_THREADS_TASKPOLICY_HPP -#define KOKKOS_THREADS_TASKPOLICY_HPP - - -#include -#include - -#if defined( KOKKOS_HAVE_PTHREAD ) - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -/** \brief Base class for all Kokkos::Threads tasks */ -template<> -class TaskMember< Kokkos::Threads , void , void > { -public: - - typedef void (* function_dealloc_type)( TaskMember * ); - typedef TaskMember * (* function_verify_type) ( TaskMember * ); - typedef void (* function_single_type) ( TaskMember * ); - typedef void (* function_team_type) ( TaskMember * , Kokkos::Impl::ThreadsExecTeamMember & ); - -private: - - // Needed to disambiguate references to base class variables - // without triggering a false-positive on Intel compiler warning #955. - typedef TaskMember< Kokkos::Threads , void , void > SelfType ; - - function_dealloc_type m_dealloc ; ///< Deallocation - function_verify_type m_verify ; ///< Result type verification - function_team_type m_team ; ///< Apply function - function_single_type m_serial ; ///< Apply function - TaskMember ** m_dep ; ///< Dependences - TaskMember * m_wait ; ///< Linked list of tasks waiting on this task - TaskMember * m_next ; ///< Linked list of tasks waiting on a different task - int m_dep_capacity ; ///< Capacity of dependences - int m_dep_size ; ///< Actual count of dependences - int m_shmem_size ; - int m_ref_count ; ///< Reference count - int m_state ; ///< State of the task - - // 7 pointers + 5 integers - -#if defined( KOKKOS_HAVE_CXX11 ) - TaskMember( const TaskMember & ) = delete ; - TaskMember & operator = ( const TaskMember & ) = delete ; -#else - TaskMember( const TaskMember & ); - TaskMember & operator = ( const TaskMember & ); -#endif - - static void * allocate( const unsigned arg_size ); - static void deallocate( void * ); - - template< class DerivedTaskType > - static - void deallocate( TaskMember * t ) - { - DerivedTaskType * ptr = static_cast< DerivedTaskType * >(t); - ptr->~DerivedTaskType(); - deallocate( (void*) ptr ); - } - - static TaskMember * pop_ready_task( TaskMember * volatile * const queue ); - static void complete_executed_task( TaskMember * , volatile int * const ); - - static void throw_error_verify_type(); - -protected: - - TaskMember() - : m_dealloc(0) - , m_verify(0) - , m_team(0) - , m_serial(0) - , m_dep(0) - , m_wait(0) - , m_next(0) - , m_dep_capacity(0) - , m_dep_size(0) - , m_shmem_size(0) - , m_ref_count(0) - , m_state(0) - {} - -public: - - static void execute_ready_tasks_driver( Kokkos::Impl::ThreadsExec & , const void * ); - - ~TaskMember(); - - template< typename ResultType > - KOKKOS_FUNCTION static - TaskMember * verify_type( TaskMember * t ) - { - enum { check_type = ! Kokkos::Impl::is_same< ResultType , void >::value }; - - if ( check_type && t != 0 ) { - - // Verify that t->m_verify is this function - const function_verify_type self = & TaskMember::template verify_type< ResultType > ; - - if ( t->m_verify != self ) { - t = 0 ; -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - throw_error_verify_type(); -#endif - } - } - return t ; - } - - //---------------------------------------- - /* Inheritence Requirements on task types: - * - * class DerivedTaskType - * : public TaskMember< Threads , DerivedType::value_type , FunctorType > - * { ... }; - * - * class TaskMember< Threads , DerivedType::value_type , FunctorType > - * : public TaskMember< Threads , DerivedType::value_type , void > - * , public Functor - * { ... }; - * - * If value_type != void - * class TaskMember< Threads , value_type , void > - * : public TaskMember< Threads , void , void > - * - * Allocate space for DerivedTaskType followed by TaskMember*[ dependence_capacity ] - * - */ - //---------------------------------------- - - template< class DerivedTaskType , class Tag > - KOKKOS_FUNCTION static - void apply_single( typename Kokkos::Impl::enable_if< ! Kokkos::Impl::is_same< typename DerivedTaskType::result_type , void >::value - , TaskMember * >::type t ) - { - typedef typename DerivedTaskType::functor_type functor_type ; - typedef typename DerivedTaskType::result_type result_type ; - - DerivedTaskType & self = * static_cast< DerivedTaskType * >(t); - - Kokkos::Impl::FunctorApply< functor_type , Tag , result_type & > - ::apply( (functor_type &) self , & self.m_result ); - } - - template< class DerivedTaskType , class Tag > - KOKKOS_FUNCTION static - void apply_single( typename Kokkos::Impl::enable_if< Kokkos::Impl::is_same< typename DerivedTaskType::result_type , void >::value - , TaskMember * >::type t ) - { - typedef typename DerivedTaskType::functor_type functor_type ; - - DerivedTaskType & self = * static_cast< DerivedTaskType * >(t); - - Kokkos::Impl::FunctorApply< functor_type , Tag , void >::apply( (functor_type &) self ); - } - - //---------------------------------------- - - template< class DerivedTaskType , class Tag > - KOKKOS_FUNCTION static - void apply_team( typename Kokkos::Impl::enable_if<( - Kokkos::Impl::is_same::value - && - Kokkos::Impl::is_same::value - ), TaskMember * >::type t - , Kokkos::Impl::ThreadsExecTeamMember & member - ) - { - DerivedTaskType & self = * static_cast< DerivedTaskType * >(t); - - self.DerivedTaskType::functor_type::apply( member ); - } - - /** \brief Allocate and construct a task */ - template< class DerivedTaskType , class Tag > - KOKKOS_FUNCTION static - void apply_team( typename Kokkos::Impl::enable_if<( - Kokkos::Impl::is_same::value - && - ! Kokkos::Impl::is_same::value - ), TaskMember * >::type t - , Kokkos::Impl::ThreadsExecTeamMember & member - ) - { - DerivedTaskType & self = * static_cast< DerivedTaskType * >(t); - - self.DerivedTaskType::functor_type::apply( member , self.m_result ); - } - - //---------------------------------------- - - /** \brief Allocate and construct a task */ - template< class DerivedTaskType , class Tag > - static - TaskMember * create( const typename DerivedTaskType::functor_type & arg_functor - , const function_team_type arg_apply_team - , const function_single_type arg_apply_single - , const unsigned arg_team_shmem - , const unsigned arg_dependence_capacity - ) - { - enum { padding_size = sizeof(DerivedTaskType) % sizeof(TaskMember*) - ? sizeof(TaskMember*) - sizeof(DerivedTaskType) % sizeof(TaskMember*) : 0 }; - enum { derived_size = sizeof(DerivedTaskType) + padding_size }; - - DerivedTaskType * const task = - new( allocate( derived_size + sizeof(TaskMember*) * arg_dependence_capacity ) ) - DerivedTaskType( arg_functor ); - - task->SelfType::m_dealloc = & TaskMember::template deallocate< DerivedTaskType > ; - task->SelfType::m_verify = & TaskMember::template verify_type< typename DerivedTaskType::value_type > ; - task->SelfType::m_team = arg_apply_team ; - task->SelfType::m_serial = arg_apply_single ; - task->SelfType::m_dep = (TaskMember**)( ((unsigned char *)task) + derived_size ); - task->SelfType::m_dep_capacity = arg_dependence_capacity ; - task->SelfType::m_shmem_size = arg_team_shmem ; - task->SelfType::m_state = TASK_STATE_CONSTRUCTING ; - - for ( unsigned i = 0 ; i < arg_dependence_capacity ; ++i ) task->SelfType::m_dep[i] = 0 ; - - return static_cast< TaskMember * >( task ); - } - - void reschedule(); - void schedule(); - - //---------------------------------------- - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - static - void assign( TaskMember ** const lhs , TaskMember * const rhs ); -#else - KOKKOS_INLINE_FUNCTION static - void assign( TaskMember ** const lhs , TaskMember * const rhs ) {} -#endif - - TaskMember * get_dependence( int i ) const ; - - KOKKOS_INLINE_FUNCTION - int get_dependence() const - { return m_dep_size ; } - - void clear_dependence(); - void add_dependence( TaskMember * before ); - - //---------------------------------------- - - typedef FutureValueTypeIsVoidError get_result_type ; - - KOKKOS_INLINE_FUNCTION - get_result_type get() const { return get_result_type() ; } - - KOKKOS_INLINE_FUNCTION - Kokkos::Experimental::TaskState get_state() const { return Kokkos::Experimental::TaskState( m_state ); } - -}; - -/** \brief A Future< Kokkos::Threads , ResultType > will cast - * from TaskMember< Kokkos::Threads , void , void > - * to TaskMember< Kokkos::Threads , ResultType , void > - * to query the result. - */ -template< class ResultType > -class TaskMember< Kokkos::Threads , ResultType , void > - : public TaskMember< Kokkos::Threads , void , void > -{ -public: - - typedef ResultType result_type ; - - result_type m_result ; - - typedef const result_type & get_result_type ; - - KOKKOS_INLINE_FUNCTION - get_result_type get() const { return m_result ; } - - inline - TaskMember() : TaskMember< Kokkos::Threads , void , void >(), m_result() {} - -#if defined( KOKKOS_HAVE_CXX11 ) - TaskMember( const TaskMember & ) = delete ; - TaskMember & operator = ( const TaskMember & ) = delete ; -#else -private: - TaskMember( const TaskMember & ); - TaskMember & operator = ( const TaskMember & ); -#endif -}; - -/** \brief Callback functions will cast - * from TaskMember< Kokkos::Threads , void , void > - * to TaskMember< Kokkos::Threads , ResultType , FunctorType > - * to execute work functions. - */ -template< class ResultType , class FunctorType > -class TaskMember< Kokkos::Threads , ResultType , FunctorType > - : public TaskMember< Kokkos::Threads , ResultType , void > - , public FunctorType -{ -public: - typedef ResultType result_type ; - typedef FunctorType functor_type ; - - inline - TaskMember( const functor_type & arg_functor ) - : TaskMember< Kokkos::Threads , ResultType , void >() - , functor_type( arg_functor ) - {} -}; - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -void wait( TaskPolicy< Kokkos::Threads > & ); - -template<> -class TaskPolicy< Kokkos::Threads > -{ -public: - - typedef Kokkos::Threads execution_space ; - typedef TaskPolicy execution_policy ; - typedef Kokkos::Impl::ThreadsExecTeamMember member_type ; - -private: - - typedef Impl::TaskMember< Kokkos::Threads , void , void > task_root_type ; - - int m_default_dependence_capacity ; - int m_team_size ; ///< Fixed size of a task-team - - template< class FunctorType > - static inline - const task_root_type * get_task_root( const FunctorType * f ) - { - typedef Impl::TaskMember< execution_space , typename FunctorType::value_type , FunctorType > task_type ; - return static_cast< const task_root_type * >( static_cast< const task_type * >(f) ); - } - - template< class FunctorType > - static inline - task_root_type * get_task_root( FunctorType * f ) - { - typedef Impl::TaskMember< execution_space , typename FunctorType::value_type , FunctorType > task_type ; - return static_cast< task_root_type * >( static_cast< task_type * >(f) ); - } - -public: - - // Valid team sizes are 1, - // Threads::pool_size(1) == threads per numa, or - // Threads::pool_size(2) == threads per core - - TaskPolicy( const unsigned arg_default_dependence_capacity = 4 - , const unsigned arg_team_size = 0 /* default from thread pool topology */ - ); - - KOKKOS_INLINE_FUNCTION - TaskPolicy( const TaskPolicy & rhs ) - : m_default_dependence_capacity( rhs.m_default_dependence_capacity ) - , m_team_size( rhs.m_team_size ) - {} - - KOKKOS_INLINE_FUNCTION - TaskPolicy( const TaskPolicy & rhs - , const unsigned arg_default_dependence_capacity ) - : m_default_dependence_capacity( arg_default_dependence_capacity ) - , m_team_size( rhs.m_team_size ) - {} - - TaskPolicy & operator = ( const TaskPolicy &rhs ) { - m_default_dependence_capacity = rhs.m_default_dependence_capacity; - m_team_size = rhs.m_team_size; - return *this; - } - - // Create serial-thread task - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - Future< typename FunctorType::value_type , execution_space > - create( const FunctorType & functor - , const unsigned dependence_capacity = ~0u ) const - { - typedef typename FunctorType::value_type value_type ; - typedef Impl::TaskMember< execution_space , value_type , FunctorType > task_type ; - - return Future< value_type , execution_space >( -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - task_root_type::create< task_type , void > - ( functor - , task_root_type::function_team_type(0) - , & task_root_type::template apply_single< task_type , void > - , 0 - , ( ~0u == dependence_capacity ? m_default_dependence_capacity : dependence_capacity ) - ) -#endif - ); - } - - // Create thread-team task - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - Future< typename FunctorType::value_type , execution_space > - create_team( const FunctorType & functor - , const unsigned dependence_capacity = ~0u ) const - { - typedef typename FunctorType::value_type value_type ; - typedef Impl::TaskMember< execution_space , value_type , FunctorType > task_type ; - - return Future< value_type , execution_space >( -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - task_root_type::create< task_type , void > - ( functor - , & task_root_type::template apply_team< task_type , void > - , task_root_type::function_single_type(0) - , Kokkos::Impl::FunctorTeamShmemSize< FunctorType >::value( functor , m_team_size ) - , ( ~0u == dependence_capacity ? m_default_dependence_capacity : dependence_capacity ) - ) -#endif - ); - } - - template< class A1 , class A2 , class A3 , class A4 > - KOKKOS_INLINE_FUNCTION - void add_dependence( const Future & after - , const Future & before - , typename Kokkos::Impl::enable_if - < Kokkos::Impl::is_same< typename Future::execution_space , execution_space >::value - && - Kokkos::Impl::is_same< typename Future::execution_space , execution_space >::value - >::type * = 0 - ) const - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - after.m_task->add_dependence( before.m_task ); -#endif - } - - template< class FunctorType , class A3 , class A4 > - KOKKOS_INLINE_FUNCTION - void add_dependence( FunctorType * task_functor - , const Future & before - , typename Kokkos::Impl::enable_if - < Kokkos::Impl::is_same< typename Future::execution_space , execution_space >::value - >::type * = 0 - ) const -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { get_task_root(task_functor)->add_dependence( before.m_task ); } -#else - {} -#endif - - - template< class ValueType > - const Future< ValueType , execution_space > & - spawn( const Future< ValueType , execution_space > & f ) const - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - f.m_task->schedule(); -#endif - return f ; - } - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - void respawn( FunctorType * task_functor ) const -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { get_task_root(task_functor)->reschedule(); } -#else - {} -#endif - - //---------------------------------------- - // Functions for an executing task functor to query dependences, - // set new dependences, and respawn itself. - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - Future< void , execution_space > - get_dependence( const FunctorType * task_functor , int i ) const - { - return Future( -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - get_task_root(task_functor)->get_dependence(i) -#endif - ); - } - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - int get_dependence( const FunctorType * task_functor ) const -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return get_task_root(task_functor)->get_dependence(); } -#else - { return 0 ; } -#endif - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - void clear_dependence( FunctorType * task_functor ) const -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { get_task_root(task_functor)->clear_dependence(); } -#else - {} -#endif - - //---------------------------------------- - - static member_type & member_single(); - - friend void wait( TaskPolicy< Kokkos::Threads > & ); -}; - -} /* namespace Experimental */ -} /* namespace Kokkos */ - -#endif /* #if defined( KOKKOS_HAVE_PTHREAD ) */ - -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_THREADS_TASKPOLICY_HPP */ - - diff --git a/lib/kokkos/core/src/impl/KokkosExp_SharedAlloc.cpp b/lib/kokkos/core/src/impl/KokkosExp_SharedAlloc.cpp deleted file mode 100644 index 50168fe3cc..0000000000 --- a/lib/kokkos/core/src/impl/KokkosExp_SharedAlloc.cpp +++ /dev/null @@ -1,275 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -bool -SharedAllocationRecord< void , void >:: -is_sane( SharedAllocationRecord< void , void > * arg_record ) -{ - constexpr static SharedAllocationRecord * zero = 0 ; - - SharedAllocationRecord * const root = arg_record ? arg_record->m_root : 0 ; - - bool ok = root != 0 && root->m_count == 0 ; - - if ( ok ) { - SharedAllocationRecord * root_next = 0 ; - - // Lock the list: - while ( ( root_next = Kokkos::atomic_exchange( & root->m_next , zero ) ) == 0 ); - - for ( SharedAllocationRecord * rec = root_next ; ok && rec != root ; rec = rec->m_next ) { - const bool ok_non_null = rec && rec->m_prev && ( rec == root || rec->m_next ); - const bool ok_root = ok_non_null && rec->m_root == root ; - const bool ok_prev_next = ok_non_null && ( rec->m_prev != root ? rec->m_prev->m_next == rec : root_next == rec ); - const bool ok_next_prev = ok_non_null && rec->m_next->m_prev == rec ; - const bool ok_count = ok_non_null && 0 <= rec->m_count ; - - ok = ok_root && ok_prev_next && ok_next_prev && ok_count ; - -if ( ! ok ) { - fprintf(stderr,"Kokkos::Experimental::Impl::SharedAllocationRecord failed is_sane: rec(0x%.12lx){ m_count(%d) m_root(0x%.12lx) m_next(0x%.12lx) m_prev(0x%.12lx) m_next->m_prev(0x%.12lx) m_prev->m_next(0x%.12lx) }\n" - , reinterpret_cast< unsigned long >( rec ) - , rec->m_count - , reinterpret_cast< unsigned long >( rec->m_root ) - , reinterpret_cast< unsigned long >( rec->m_next ) - , reinterpret_cast< unsigned long >( rec->m_prev ) - , reinterpret_cast< unsigned long >( rec->m_next->m_prev ) - , reinterpret_cast< unsigned long >( rec->m_prev != rec->m_root ? rec->m_prev->m_next : root_next ) - ); -} - - } - - if ( zero != Kokkos::atomic_exchange( & root->m_next , root_next ) ) { - Kokkos::Impl::throw_runtime_exception("Kokkos::Experimental::Impl::SharedAllocationRecord failed is_sane unlocking"); - } - } - - return ok ; -} - -SharedAllocationRecord * -SharedAllocationRecord::find( SharedAllocationRecord * const arg_root , void * const arg_data_ptr ) -{ - constexpr static SharedAllocationRecord * zero = 0 ; - - SharedAllocationRecord * root_next = 0 ; - - // Lock the list: - while ( ( root_next = Kokkos::atomic_exchange( & arg_root->m_next , 0 ) ) == 0 ); - - // Iterate searching for the record with this data pointer - - SharedAllocationRecord * r = root_next ; - - while ( ( r != arg_root ) && ( r->data() != arg_data_ptr ) ) { r = r->m_next ; } - - if ( r == arg_root ) { r = 0 ; } - - if ( zero != Kokkos::atomic_exchange( & arg_root->m_next , root_next ) ) { - Kokkos::Impl::throw_runtime_exception("Kokkos::Experimental::Impl::SharedAllocationRecord failed locking/unlocking"); - } - - return r ; -} - - -/**\brief Construct and insert into 'arg_root' tracking set. - * use_count is zero. - */ -SharedAllocationRecord< void , void >:: -SharedAllocationRecord( SharedAllocationRecord * arg_root - , SharedAllocationHeader * arg_alloc_ptr - , size_t arg_alloc_size - , SharedAllocationRecord< void , void >::function_type arg_dealloc - ) - : m_alloc_ptr( arg_alloc_ptr ) - , m_alloc_size( arg_alloc_size ) - , m_dealloc( arg_dealloc ) - , m_root( arg_root ) - , m_prev( 0 ) - , m_next( 0 ) - , m_count( 0 ) -{ - constexpr static SharedAllocationRecord * zero = 0 ; - - // Insert into the root double-linked list for tracking - // - // before: arg_root->m_next == next ; next->m_prev == arg_root - // after: arg_root->m_next == this ; this->m_prev == arg_root ; - // this->m_next == next ; next->m_prev == this - - m_prev = m_root ; - - // Read root->m_next and lock by setting to zero - while ( ( m_next = Kokkos::atomic_exchange( & m_root->m_next , zero ) ) == 0 ); - - m_next->m_prev = this ; - - if ( zero != Kokkos::atomic_exchange( & m_root->m_next , this ) ) { - Kokkos::Impl::throw_runtime_exception("Kokkos::Experimental::Impl::SharedAllocationRecord failed locking/unlocking"); - } -} - -void -SharedAllocationRecord< void , void >:: -increment( SharedAllocationRecord< void , void > * arg_record ) -{ - const int old_count = Kokkos::atomic_fetch_add( & arg_record->m_count , 1 ); - - if ( old_count < 0 ) { // Error - Kokkos::Impl::throw_runtime_exception("Kokkos::Experimental::Impl::SharedAllocationRecord failed increment"); - } -} - -SharedAllocationRecord< void , void > * -SharedAllocationRecord< void , void >:: -decrement( SharedAllocationRecord< void , void > * arg_record ) -{ - constexpr static SharedAllocationRecord * zero = 0 ; - - const int old_count = Kokkos::atomic_fetch_add( & arg_record->m_count , -1 ); - - if ( old_count == 1 ) { - - // before: arg_record->m_prev->m_next == arg_record && - // arg_record->m_next->m_prev == arg_record - // - // after: arg_record->m_prev->m_next == arg_record->m_next && - // arg_record->m_next->m_prev == arg_record->m_prev - - SharedAllocationRecord * root_next = 0 ; - - // Lock the list: - while ( ( root_next = Kokkos::atomic_exchange( & arg_record->m_root->m_next , 0 ) ) == 0 ); - - arg_record->m_next->m_prev = arg_record->m_prev ; - - if ( root_next != arg_record ) { - arg_record->m_prev->m_next = arg_record->m_next ; - } - else { - // before: arg_record->m_root == arg_record->m_prev - // after: arg_record->m_root == arg_record->m_next - root_next = arg_record->m_next ; - } - - // Unlock the list: - if ( zero != Kokkos::atomic_exchange( & arg_record->m_root->m_next , root_next ) ) { - Kokkos::Impl::throw_runtime_exception("Kokkos::Experimental::Impl::SharedAllocationRecord failed decrement unlocking"); - } - - arg_record->m_next = 0 ; - arg_record->m_prev = 0 ; - - function_type d = arg_record->m_dealloc ; - (*d)( arg_record ); - arg_record = 0 ; - } - else if ( old_count < 1 ) { // Error - Kokkos::Impl::throw_runtime_exception("Kokkos::Experimental::Impl::SharedAllocationRecord failed decrement count"); - } - - return arg_record ; -} - -void -SharedAllocationRecord< void , void >:: -print_host_accessible_records( std::ostream & s - , const char * const space_name - , const SharedAllocationRecord * const root - , const bool detail ) -{ - const SharedAllocationRecord< void , void > * r = root ; - - char buffer[256] ; - - if ( detail ) { - do { - - snprintf( buffer , 256 , "%s addr( 0x%.12lx ) list( 0x%.12lx 0x%.12lx ) extent[ 0x%.12lx + %.8ld ] count(%d) dealloc(0x%.12lx) %s\n" - , space_name - , reinterpret_cast( r ) - , reinterpret_cast( r->m_prev ) - , reinterpret_cast( r->m_next ) - , reinterpret_cast( r->m_alloc_ptr ) - , r->m_alloc_size - , r->m_count - , reinterpret_cast( r->m_dealloc ) - , r->m_alloc_ptr->m_label - ); - std::cout << buffer ; - r = r->m_next ; - } while ( r != root ); - } - else { - do { - if ( r->m_alloc_ptr ) { - - snprintf( buffer , 256 , "%s [ 0x%.12lx + %ld ] %s\n" - , space_name - , reinterpret_cast< unsigned long >( r->data() ) - , r->size() - , r->m_alloc_ptr->m_label - ); - } - else { - snprintf( buffer , 256 , "%s [ 0 + 0 ]\n" , space_name ); - } - std::cout << buffer ; - r = r->m_next ; - } while ( r != root ); - } -} - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - - diff --git a/lib/kokkos/core/src/impl/KokkosExp_SharedAlloc.hpp b/lib/kokkos/core/src/impl/KokkosExp_SharedAlloc.hpp deleted file mode 100644 index c8c553731a..0000000000 --- a/lib/kokkos/core/src/impl/KokkosExp_SharedAlloc.hpp +++ /dev/null @@ -1,292 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -template< class MemorySpace = void , class DestroyFunctor = void > -class SharedAllocationRecord ; - -class SharedAllocationHeader { -private: - - typedef SharedAllocationRecord Record ; - - static constexpr unsigned maximum_label_length = ( 1u << 7 /* 128 */ ) - sizeof(Record*); - - template< class , class > friend class SharedAllocationRecord ; - - Record * m_record ; - char m_label[ maximum_label_length ]; - -public: - - /* Given user memory get pointer to the header */ - KOKKOS_INLINE_FUNCTION static - const SharedAllocationHeader * get_header( void * alloc_ptr ) - { return reinterpret_cast( reinterpret_cast(alloc_ptr) - sizeof(SharedAllocationHeader) ); } -}; - -template<> -class SharedAllocationRecord< void , void > { -protected: - - static_assert( sizeof(SharedAllocationHeader) == ( 1u << 7 /* 128 */ ) , "sizeof(SharedAllocationHeader) != 128" ); - - template< class , class > friend class SharedAllocationRecord ; - - typedef void (* function_type )( SharedAllocationRecord * ); - - SharedAllocationHeader * const m_alloc_ptr ; - size_t const m_alloc_size ; - function_type const m_dealloc ; - SharedAllocationRecord * const m_root ; - SharedAllocationRecord * m_prev ; - SharedAllocationRecord * m_next ; - int m_count ; - - SharedAllocationRecord( const SharedAllocationRecord & ) = delete ; - SharedAllocationRecord & operator = ( const SharedAllocationRecord & ) = delete ; - - /**\brief Construct and insert into 'arg_root' tracking set. - * use_count is zero. - */ - SharedAllocationRecord( SharedAllocationRecord * arg_root - , SharedAllocationHeader * arg_alloc_ptr - , size_t arg_alloc_size - , function_type arg_dealloc - ); - -public: - - ~SharedAllocationRecord() = default ; - - constexpr SharedAllocationRecord() - : m_alloc_ptr( 0 ) - , m_alloc_size( 0 ) - , m_dealloc( 0 ) - , m_root( this ) - , m_prev( this ) - , m_next( this ) - , m_count( 0 ) - {} - - static constexpr unsigned maximum_label_length = SharedAllocationHeader::maximum_label_length ; - - KOKKOS_INLINE_FUNCTION - const SharedAllocationHeader * head() const { return m_alloc_ptr ; } - - /* User's memory begins at the end of the header */ - KOKKOS_INLINE_FUNCTION - void * data() const { return reinterpret_cast( m_alloc_ptr + 1 ); } - - /* User's memory begins at the end of the header */ - constexpr size_t size() const { return m_alloc_size - sizeof(SharedAllocationHeader) ; } - - /* Cannot be 'constexpr' because 'm_count' is volatile */ - int use_count() const { return m_count ; } - - /* Increment use count */ - static void increment( SharedAllocationRecord * ); - - /* Decrement use count. If 1->0 then remove from the tracking list and invoke m_dealloc */ - static SharedAllocationRecord * decrement( SharedAllocationRecord * ); - - /* Given a root record and data pointer find the record */ - static SharedAllocationRecord * find( SharedAllocationRecord * const , void * const ); - - /* Sanity check for the whole set of records to which the input record belongs. - * Locks the set's insert/erase operations until the sanity check is complete. - */ - static bool is_sane( SharedAllocationRecord * ); - - /* Print host-accessible records */ - static void print_host_accessible_records( std::ostream & - , const char * const space_name - , const SharedAllocationRecord * const root - , const bool detail ); -}; - -/* - * Memory space specialization of SharedAllocationRecord< Space , void > requires : - * - * SharedAllocationRecord< Space , void > : public SharedAllocationRecord< void , void > - * { - * // delete allocated user memory via static_cast to this type. - * static void deallocate( const SharedAllocationRecord * ); - * Space m_space ; - * } - */ - -template< class MemorySpace , class DestroyFunctor > -class SharedAllocationRecord : public SharedAllocationRecord< MemorySpace , void > -{ -private: - - static void deallocate( SharedAllocationRecord * record_ptr ) - { delete static_cast*>(record_ptr); } - - SharedAllocationRecord( const MemorySpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc - ) - /* Allocate user memory as [ SharedAllocationHeader , user_memory ] */ - : SharedAllocationRecord< MemorySpace , void >( arg_space , arg_label , arg_alloc , & deallocate ) - , m_destroy() - {} - - ~SharedAllocationRecord() { m_destroy.destroy_shared_allocation(); } - -public: - - DestroyFunctor m_destroy ; - - // Allocate with a zero use count. Incrementing the use count from zero to one - // inserts the record into the tracking list. Decrementing the count from one to zero - // removes from the trakcing list and deallocates. - KOKKOS_INLINE_FUNCTION static - SharedAllocationRecord * allocate( const MemorySpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc - ) - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - return new SharedAllocationRecord( arg_space , arg_label , arg_alloc ); -#else - return (SharedAllocationRecord *) 0 ; -#endif - } -}; - -union SharedAllocationTracker { -private: - - typedef SharedAllocationRecord Record ; - - enum : unsigned long { - DO_NOT_DEREF_FLAG = 0x01ul - }; - - // The allocation record resides in Host memory space - Record * m_record ; - unsigned long m_record_bits; - - KOKKOS_INLINE_FUNCTION - static Record * disable( Record * rec ) - { return reinterpret_cast( reinterpret_cast( rec ) & DO_NOT_DEREF_FLAG ); } - - KOKKOS_INLINE_FUNCTION - void increment() const - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - if ( ! ( m_record_bits & DO_NOT_DEREF_FLAG ) ) Record::increment( m_record ); -#endif - } - - KOKKOS_INLINE_FUNCTION - void decrement() const - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - if ( ! ( m_record_bits & DO_NOT_DEREF_FLAG ) ) Record::decrement( m_record ); -#endif - } - -public: - - KOKKOS_INLINE_FUNCTION - constexpr SharedAllocationTracker() : m_record_bits( DO_NOT_DEREF_FLAG ) {} - - template< class MemorySpace > - constexpr - SharedAllocationRecord< MemorySpace , void > & get_record() const - { return * static_cast< SharedAllocationRecord< MemorySpace , void > * >( m_record ); } - - template< class MemorySpace > - std::string get_label() const - { - return ( m_record_bits & DO_NOT_DEREF_FLAG ) - ? std::string() - : static_cast< SharedAllocationRecord< MemorySpace , void > * >( m_record )->get_label() - ; - } - - KOKKOS_INLINE_FUNCTION - SharedAllocationTracker( Record * arg_record ) - : m_record( arg_record ) { increment(); } - - KOKKOS_INLINE_FUNCTION - ~SharedAllocationTracker() { decrement(); } - - KOKKOS_INLINE_FUNCTION - SharedAllocationTracker( const SharedAllocationTracker & rhs ) - : m_record( rhs.m_record ) { increment(); } - - KOKKOS_INLINE_FUNCTION - SharedAllocationTracker( SharedAllocationTracker && rhs ) - : m_record( rhs.m_record ) { rhs.m_record_bits = DO_NOT_DEREF_FLAG ; } - - KOKKOS_INLINE_FUNCTION - SharedAllocationTracker & operator = ( const SharedAllocationTracker & rhs ) - { - decrement(); - m_record = rhs.m_record ; - increment(); - return *this ; - } - - KOKKOS_INLINE_FUNCTION - SharedAllocationTracker & operator = ( SharedAllocationTracker && rhs ) - { - m_record = rhs.m_record ; - rhs.m_record_bits = DO_NOT_DEREF_FLAG ; - return *this ; - } -}; - - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - - diff --git a/lib/kokkos/core/src/impl/KokkosExp_ViewAllocProp.hpp b/lib/kokkos/core/src/impl/KokkosExp_ViewAllocProp.hpp deleted file mode 100644 index 348ccaf5ed..0000000000 --- a/lib/kokkos/core/src/impl/KokkosExp_ViewAllocProp.hpp +++ /dev/null @@ -1,416 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXPERIMENTAL_IMPL_VIEW_ALLOC_PROP_HPP -#define KOKKOS_EXPERIMENTAL_IMPL_VIEW_ALLOC_PROP_HPP - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -struct WithoutInitializing_t {}; -struct AllowPadding_t {}; - -template< class ... Parameters > -struct ViewAllocProp ; - -template<> -struct ViewAllocProp<> { - - struct NullSpace {}; - - typedef std::false_type allow_padding_t ; - typedef std::true_type initialize_t ; - typedef NullSpace memory_space ; - typedef NullSpace execution_space ; - - const std::string label ; - const memory_space memory ; - const execution_space execution ; - const allow_padding_t allow_padding ; - const initialize_t initialize ; - - ViewAllocProp() - : label() - , memory() - , execution() - , allow_padding() - , initialize() - {} - - ViewAllocProp( const std::string & arg_label ) - : label( arg_label ) - , memory() - , execution() - , allow_padding() - , initialize() - {} -}; - -template< class ... Parameters > -struct ViewAllocProp< const char * , Parameters ... > -{ - typedef ViewAllocProp< Parameters ... > base_prop_type ; - - typedef typename base_prop_type::allow_padding_t allow_padding_t ; - typedef typename base_prop_type::initialize_t initialize_t ; - typedef typename base_prop_type::memory_space memory_space ; - typedef typename base_prop_type::execution_space execution_space ; - - const std::string label ; - const memory_space memory ; - const execution_space execution ; - const allow_padding_t allow_padding ; - const initialize_t initialize ; - - ViewAllocProp( const char * const arg_label , Parameters ... arg_param ) - : label( arg_label ) - , memory( base_prop_type( arg_param ... ).memory ) - , execution( base_prop_type( arg_param ... ).execution ) - , allow_padding() - , initialize() - {} -}; - -template< class ... Parameters > -struct ViewAllocProp< std::string , Parameters ... > -{ - typedef ViewAllocProp< Parameters ... > base_prop_type ; - - typedef typename base_prop_type::allow_padding_t allow_padding_t ; - typedef typename base_prop_type::initialize_t initialize_t ; - typedef typename base_prop_type::memory_space memory_space ; - typedef typename base_prop_type::execution_space execution_space ; - - const std::string label ; - const memory_space memory ; - const execution_space execution ; - const allow_padding_t allow_padding ; - const initialize_t initialize ; - - ViewAllocProp( const std::string & arg_label , Parameters ... arg_param ) - : label( arg_label ) - , memory( base_prop_type( arg_param ... ).memory ) - , execution( base_prop_type( arg_param ... ).execution ) - , allow_padding() - , initialize() - {} -}; - -template< class ... Parameters > -struct ViewAllocProp< WithoutInitializing_t , Parameters ... > -{ - typedef ViewAllocProp< Parameters ... > base_prop_type ; - - typedef typename base_prop_type::allow_padding_t allow_padding_t ; - typedef std::false_type initialize_t ; - typedef typename base_prop_type::memory_space memory_space ; - typedef typename base_prop_type::execution_space execution_space ; - - const std::string label ; - const memory_space memory ; - const execution_space execution ; - const allow_padding_t allow_padding ; - const initialize_t initialize ; - - ViewAllocProp( const WithoutInitializing_t & , Parameters ... arg_param ) - : label( base_prop_type( arg_param ... ).label ) - , memory( base_prop_type( arg_param ... ).memory ) - , execution( base_prop_type( arg_param ... ).execution ) - , allow_padding() - , initialize() - {} -}; - -template< class ... Parameters > -struct ViewAllocProp< AllowPadding_t , Parameters ... > -{ - typedef ViewAllocProp< Parameters ... > base_prop_type ; - - typedef std::true_type allow_padding_t ; - typedef typename base_prop_type::initialize_t initialize_t ; - typedef typename base_prop_type::memory_space memory_space ; - typedef typename base_prop_type::execution_space execution_space ; - - const std::string label ; - const memory_space memory ; - const execution_space execution ; - const allow_padding_t allow_padding ; - const initialize_t initialize ; - - ViewAllocProp( const AllowPadding_t & , Parameters ... arg_param ) - : label( base_prop_type( arg_param ... ).label ) - , memory( base_prop_type( arg_param ... ).memory ) - , execution( base_prop_type( arg_param ... ).execution ) - , allow_padding() - , initialize() - {} -}; - -template< class Space , class ... Parameters > -struct ViewAllocProp< Space , Parameters ... > -{ - enum { is_exec = Kokkos::Impl::is_execution_space< Space >::value }; - enum { is_mem = Kokkos::Impl::is_memory_space< Space >::value }; - - static_assert( is_exec || is_mem , "View allocation given unknown parameter" ); - - typedef ViewAllocProp< Parameters ... > base_prop_type ; - - typedef typename base_prop_type::allow_padding_t allow_padding_t ; - typedef typename base_prop_type::initialize_t initialize_t ; - typedef typename std::conditional< is_mem , Space , typename base_prop_type::memory_space >::type memory_space ; - typedef typename std::conditional< is_exec , Space , typename base_prop_type::execution_space >::type execution_space ; - - const std::string label ; - const memory_space memory ; - const execution_space execution ; - const allow_padding_t allow_padding ; - const initialize_t initialize ; - - // Templated so that 'base_prop_type( args ... ).execution' - // is not used unless arg_space == memory_space. - template< class ... Args > - ViewAllocProp( const memory_space & arg_space , Args ... args ) - : label( base_prop_type( args ... ).label ) - , memory( arg_space ) - , execution( base_prop_type( args ... ).execution ) - , allow_padding() - , initialize() - {} - - // Templated so that 'base_prop_type( args ... ).memory' - // is not used unless arg_space == execution_space. - template< class ... Args > - ViewAllocProp( const execution_space & arg_space , Args ... args ) - : label( base_prop_type( args ... ).label ) - , memory( base_prop_type( args ... ).memory ) - , execution( arg_space ) - , allow_padding() - , initialize() - {} -}; - -template< class ExecSpace , class MemSpace > -struct ViewAllocProp< Kokkos::Device< ExecSpace , MemSpace > , std::string > -{ - typedef ViewAllocProp<> base_prop_type ; - - typedef typename base_prop_type::allow_padding_t allow_padding_t ; - typedef typename base_prop_type::initialize_t initialize_t ; - typedef MemSpace memory_space ; - typedef ExecSpace execution_space ; - - const std::string label ; - const memory_space memory ; - const execution_space execution ; - const allow_padding_t allow_padding ; - const initialize_t initialize ; - - ViewAllocProp( const std::string & arg_label ) - : label( arg_label ) - , memory() - , execution() - , allow_padding() - , initialize() - {} -}; - -template< class ExecSpace , class MemSpace , unsigned N > -struct ViewAllocProp< Kokkos::Device< ExecSpace , MemSpace > , char[N] > -{ - typedef ViewAllocProp<> base_prop_type ; - - typedef typename base_prop_type::allow_padding_t allow_padding_t ; - typedef typename base_prop_type::initialize_t initialize_t ; - typedef MemSpace memory_space ; - typedef ExecSpace execution_space ; - - const std::string label ; - const memory_space memory ; - const execution_space execution ; - const allow_padding_t allow_padding ; - const initialize_t initialize ; - - ViewAllocProp( const char * const arg_label ) - : label( arg_label ) - , memory() - , execution() - , allow_padding() - , initialize() - {} -}; - - -// Deprecate in favor of view_alloc( Kokkos::WithoutInitializing ) -template< class ExecSpace , class MemSpace > -struct ViewAllocProp< Kokkos::Device< ExecSpace , MemSpace > - , Kokkos::ViewAllocateWithoutInitializing - > -{ - typedef ViewAllocProp<> base_prop_type ; - - typedef typename base_prop_type::allow_padding_t allow_padding_t ; - typedef std::false_type initialize_t ; - typedef MemSpace memory_space ; - typedef ExecSpace execution_space ; - - const std::string label ; - const memory_space memory ; - const execution_space execution ; - const allow_padding_t allow_padding ; - const initialize_t initialize ; - - ViewAllocProp( const Kokkos::ViewAllocateWithoutInitializing & arg ) - : label( arg.label ) - , memory() - , execution() - , allow_padding() - , initialize() - {} -}; - -template< class ExecSpace , class MemSpace , class ... Parameters > -struct ViewAllocProp< Kokkos::Device< ExecSpace , MemSpace > - , ViewAllocProp< Parameters ... > - > -{ - typedef ViewAllocProp< Parameters ... > base_prop_type ; - - typedef typename base_prop_type::allow_padding_t allow_padding_t ; - typedef typename base_prop_type::initialize_t initialize_t ; - typedef MemSpace memory_space ; - - typedef - typename std::conditional - < Kokkos::Impl::is_execution_space< typename base_prop_type::execution_space >::value - , typename base_prop_type::execution_space - , ExecSpace - >::type execution_space ; - - static_assert( std::is_same< typename base_prop_type::memory_space , ViewAllocProp<>::NullSpace >::value || - std::is_same< typename base_prop_type::memory_space , memory_space >::value - , "View allocation given incompatible memory space" ); - - static_assert( Kokkos::Impl::VerifyExecutionCanAccessMemorySpace< typename execution_space::memory_space - , memory_space >::value - , "View allocation given incompatible execution space" ); - - const std::string label ; - const memory_space memory ; - const execution_space execution ; - const allow_padding_t allow_padding ; - const initialize_t initialize ; - - // If the input properties have a memory or execution space then copy construct those spaces - // otherwise default construct those spaces. - - template< class P > - ViewAllocProp( const P & arg_prop - , typename std::enable_if - < std::is_same< P , base_prop_type >::value && - Kokkos::Impl::is_memory_space< typename P::memory_space >::value && - Kokkos::Impl::is_execution_space< typename P::memory_space >::value - >::type * = 0 ) - : label( arg_prop.label ) - , memory( arg_prop.memory ) - , execution( arg_prop.execution ) - , allow_padding() - , initialize() - {} - - template< class P > - ViewAllocProp( const P & arg_prop - , typename std::enable_if - < std::is_same< P , base_prop_type >::value && - Kokkos::Impl::is_memory_space< typename P::memory_space >::value && - ! Kokkos::Impl::is_execution_space< typename P::execution_space >::value - >::type * = 0 ) - : label( arg_prop.label ) - , memory( arg_prop.memory ) - , execution() - , allow_padding() - , initialize() - {} - - template< class P > - ViewAllocProp( const P & arg_prop - , typename std::enable_if - < std::is_same< P , base_prop_type >::value && - ! Kokkos::Impl::is_memory_space< typename P::memory_space >::value && - Kokkos::Impl::is_execution_space< typename P::execution_space >::value - >::type * = 0 ) - : label( arg_prop.label ) - , memory() - , execution( arg_prop.execution ) - , allow_padding() - , initialize() - {} - - template< class P > - ViewAllocProp( const P & arg_prop - , typename std::enable_if - < std::is_same< P , base_prop_type >::value && - ! Kokkos::Impl::is_memory_space< typename P::memory_space >::value && - ! Kokkos::Impl::is_execution_space< typename P::execution_space >::value - >::type * = 0 ) - : label( arg_prop.label ) - , memory() - , execution() - , allow_padding() - , initialize() - {} -}; - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif - diff --git a/lib/kokkos/core/src/impl/KokkosExp_ViewArray.hpp b/lib/kokkos/core/src/impl/KokkosExp_ViewArray.hpp deleted file mode 100644 index 6f49c57b3c..0000000000 --- a/lib/kokkos/core/src/impl/KokkosExp_ViewArray.hpp +++ /dev/null @@ -1,616 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXPERIMENTAL_VIEW_ARRAY_MAPPING_HPP -#define KOKKOS_EXPERIMENTAL_VIEW_ARRAY_MAPPING_HPP - -#include - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -template< class DataType , class V , long N , class P , class ArrayLayout > -struct ViewDataAnalysis< DataType , Kokkos::Array , ArrayLayout > -{ -private: - - typedef ViewArrayAnalysis array_analysis ; - - static_assert( std::is_same::value , "" ); - static_assert( std::is_same >::value , "" ); - static_assert( std::is_scalar::value , "View of Array type must be of a scalar type" ); - -public: - - typedef Kokkos::Array<> specialize ; - - typedef typename array_analysis::dimension dimension ; - -private: - - enum { is_const = std::is_same< typename array_analysis::value_type - , typename array_analysis::const_value_type - >::value }; - - typedef ViewDimension< ( dimension::rank == 0 ? N : dimension::arg_N0 ) - , ( dimension::rank == 1 ? N : dimension::arg_N1 ) - , ( dimension::rank == 2 ? N : dimension::arg_N2 ) - , ( dimension::rank == 3 ? N : dimension::arg_N3 ) - , ( dimension::rank == 4 ? N : dimension::arg_N4 ) - , ( dimension::rank == 5 ? N : dimension::arg_N5 ) - , ( dimension::rank == 6 ? N : dimension::arg_N6 ) - , ( dimension::rank == 7 ? N : dimension::arg_N7 ) - > array_scalar_dimension ; - - typedef typename std::conditional< is_const , const V , V >::type scalar_type ; - typedef V non_const_scalar_type ; - typedef const V const_scalar_type ; - -public: - - typedef typename array_analysis::value_type value_type ; - typedef typename array_analysis::const_value_type const_value_type ; - typedef typename array_analysis::non_const_value_type non_const_value_type ; - - typedef typename ViewDataType< value_type , dimension >::type type ; - typedef typename ViewDataType< const_value_type , dimension >::type const_type ; - typedef typename ViewDataType< non_const_value_type , dimension >::type non_const_type ; - - typedef typename ViewDataType< scalar_type , array_scalar_dimension >::type array_scalar_type ; - typedef typename ViewDataType< const_scalar_type , array_scalar_dimension >::type const_array_scalar_type ; - typedef typename ViewDataType< non_const_scalar_type , array_scalar_dimension >::type non_const_array_scalar_type ; -}; - -}}} // namespace Kokkos::Experimental::Impl - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -/** \brief View mapping for non-specialized data type and standard layout */ -template< class Traits > -class ViewMapping< Traits , void , - typename std::enable_if<( std::is_same< typename Traits::specialize , Kokkos::Array<> >::value && - ( std::is_same< typename Traits::array_layout , Kokkos::LayoutLeft >::value || - std::is_same< typename Traits::array_layout , Kokkos::LayoutRight >::value || - std::is_same< typename Traits::array_layout , Kokkos::LayoutStride >::value ) - )>::type > -{ -private: - - template< class , class , typename > friend class ViewMapping ; - template< class , bool , bool , bool , bool , bool , bool , bool , bool , class > friend struct SubviewMapping ; - template< class , class , class , class > friend class Kokkos::Experimental::View ; - - typedef ViewOffset< typename Traits::dimension - , typename Traits::array_layout - , void - > offset_type ; - - typedef typename Traits::value_type::pointer handle_type ; - - handle_type m_handle ; - offset_type m_offset ; - size_t m_stride ; - - typedef typename Traits::value_type::value_type scalar_type ; - - typedef Kokkos::Array< scalar_type , ~size_t(0) , Kokkos::Array<>::contiguous > contiguous_reference ; - typedef Kokkos::Array< scalar_type , ~size_t(0) , Kokkos::Array<>::strided > strided_reference ; - - enum { is_contiguous_reference = - ( Traits::rank == 0 ) || ( std::is_same< typename Traits::array_layout , Kokkos::LayoutRight >::value ) }; - - enum { Array_N = Traits::value_type::size() }; - enum { Array_S = is_contiguous_reference ? Array_N : 1 }; - - KOKKOS_INLINE_FUNCTION - ViewMapping( const handle_type & arg_handle , const offset_type & arg_offset ) - : m_handle( arg_handle ) - , m_offset( arg_offset ) - , m_stride( is_contiguous_reference ? 0 : arg_offset.span() ) - {} - -public: - - //---------------------------------------- - // Domain dimensions - - enum { Rank = Traits::dimension::rank }; - - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_0() const { return m_offset.dimension_0(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_1() const { return m_offset.dimension_1(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_2() const { return m_offset.dimension_2(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_3() const { return m_offset.dimension_3(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_4() const { return m_offset.dimension_4(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_5() const { return m_offset.dimension_5(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_6() const { return m_offset.dimension_6(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_7() const { return m_offset.dimension_7(); } - - // Is a regular layout with uniform striding for each index. - using is_regular = typename offset_type::is_regular ; - - KOKKOS_INLINE_FUNCTION constexpr size_t stride_0() const { return m_offset.stride_0(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_1() const { return m_offset.stride_1(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_2() const { return m_offset.stride_2(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_3() const { return m_offset.stride_3(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_4() const { return m_offset.stride_4(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_5() const { return m_offset.stride_5(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_6() const { return m_offset.stride_6(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_7() const { return m_offset.stride_7(); } - - //---------------------------------------- - // Range span - - /** \brief Span of the mapped range */ - KOKKOS_INLINE_FUNCTION constexpr size_t span() const { return m_offset.span(); } - - /** \brief Is the mapped range span contiguous */ - KOKKOS_INLINE_FUNCTION constexpr bool span_is_contiguous() const { return m_offset.span_is_contiguous(); } - - typedef typename std::conditional< is_contiguous_reference , contiguous_reference , strided_reference >::type reference_type ; - - /** \brief If data references are lvalue_reference than can query pointer to memory */ - KOKKOS_INLINE_FUNCTION constexpr typename Traits::value_type * data() const - { return (typename Traits::value_type *) 0 ; } - - //---------------------------------------- - // The View class performs all rank and bounds checking before - // calling these element reference methods. - - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference() const { return reference_type( m_handle + 0 , Array_N , 0 ); } - - template< typename I0 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type - reference( const I0 & i0 ) const - { return reference_type( m_handle + m_offset(i0) * Array_S , Array_N , m_stride ); } - - template< typename I0 , typename I1 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 ) const - { return reference_type( m_handle + m_offset(i0,i1) * Array_S , Array_N , m_stride ); } - - template< typename I0 , typename I1 , typename I2 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 ) const - { return reference_type( m_handle + m_offset(i0,i1,i2) * Array_S , Array_N , m_stride ); } - - template< typename I0 , typename I1 , typename I2 , typename I3 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 ) const - { return reference_type( m_handle + m_offset(i0,i1,i2,i3) * Array_S , Array_N , m_stride ); } - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 ) const - { return reference_type( m_handle + m_offset(i0,i1,i2,i3,i4) * Array_S , Array_N , m_stride ); } - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 , typename I5 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 , const I5 & i5 ) const - { return reference_type( m_handle + m_offset(i0,i1,i2,i3,i4,i5) * Array_S , Array_N , m_stride ); } - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 , typename I5 , typename I6 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 , const I5 & i5 , const I6 & i6 ) const - { return reference_type( m_handle + m_offset(i0,i1,i2,i3,i4,i5,i6) * Array_S , Array_N , m_stride ); } - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 , typename I5 , typename I6 , typename I7 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 , const I5 & i5 , const I6 & i6 , const I7 & i7 ) const - { return reference_type( m_handle + m_offset(i0,i1,i2,i3,i4,i5,i6,i7) * Array_S , Array_N , m_stride ); } - - //---------------------------------------- - -private: - - enum { MemorySpanMask = 8 - 1 /* Force alignment on 8 byte boundary */ }; - enum { MemorySpanSize = sizeof(typename Traits::value_type) }; - -public: - - /** \brief Span, in bytes, of the referenced memory */ - KOKKOS_INLINE_FUNCTION constexpr size_t memory_span() const - { - return ( m_stride * sizeof(typename Traits::value_type) + MemorySpanMask ) & ~size_t(MemorySpanMask); - } - - /** \brief Span, in bytes, of the required memory */ - template< bool AllowPadding > - KOKKOS_INLINE_FUNCTION - static constexpr size_t memory_span( const std::integral_constant & - , const size_t N0 , const size_t N1 , const size_t N2 , const size_t N3 - , const size_t N4 , const size_t N5 , const size_t N6 , const size_t N7 ) - { - typedef std::integral_constant< unsigned , AllowPadding ? MemorySpanSize : 0 > padding ; - return ( offset_type( padding(), N0, N1, N2, N3, N4, N5, N6, N7 ).span() * MemorySpanSize + MemorySpanMask ) & ~size_t(MemorySpanMask); - } - - /** \brief Span, in bytes, of the required memory */ - template< bool AllowPadding > - KOKKOS_INLINE_FUNCTION - static constexpr size_t memory_span( const std::integral_constant & - , const typename Traits::array_layout & layout ) - { - return ( offset_type( layout ).span() * MemorySpanSize + MemorySpanMask ) & ~size_t(MemorySpanMask); - } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION ~ViewMapping() {} - KOKKOS_INLINE_FUNCTION ViewMapping() : m_handle(), m_offset(), m_stride(0) {} - KOKKOS_INLINE_FUNCTION ViewMapping( const ViewMapping & rhs ) - : m_handle( rhs.m_handle ), m_offset( rhs.m_offset ), m_stride( rhs.m_stride ) {} - KOKKOS_INLINE_FUNCTION ViewMapping & operator = ( const ViewMapping & rhs ) - { m_handle = rhs.m_handle ; m_offset = rhs.m_offset ; m_stride = rhs.m_stride ; ; return *this ; } - - KOKKOS_INLINE_FUNCTION ViewMapping( ViewMapping && rhs ) - : m_handle( rhs.m_handle ), m_offset( rhs.m_offset ), m_stride( rhs.m_stride ) {} - KOKKOS_INLINE_FUNCTION ViewMapping & operator = ( ViewMapping && rhs ) - { m_handle = rhs.m_handle ; m_offset = rhs.m_offset ; m_stride = rhs.m_stride ; return *this ; } - - template< bool AllowPadding > - KOKKOS_INLINE_FUNCTION - ViewMapping( void * ptr - , const std::integral_constant & - , const size_t N0 , const size_t N1 , const size_t N2 , const size_t N3 - , const size_t N4 , const size_t N5 , const size_t N6 , const size_t N7 ) - : m_handle( reinterpret_cast< handle_type >( ptr ) ) - , m_offset( std::integral_constant< unsigned , AllowPadding ? sizeof(typename Traits::value_type) : 0 >() - , N0, N1, N2, N3, N4, N5, N6, N7 ) - , m_stride( m_offset.span() ) - {} - - template< bool AllowPadding > - KOKKOS_INLINE_FUNCTION - ViewMapping( void * ptr - , const std::integral_constant & - , const typename Traits::array_layout & layout ) - : m_handle( reinterpret_cast< handle_type >( ptr ) ) - , m_offset( layout ) - , m_stride( m_offset.span() ) - {} - - //---------------------------------------- - // If the View is to construct or destroy the elements. - - KOKKOS_FORCEINLINE_FUNCTION - void operator()( const size_t i ) const - { - reference_type ref( m_handle + i * Array_S , Array_N , m_stride ); - for ( size_t j = 0 ; j < Array_N ; ++j ) ref[j] = 0 ; - } - - template< class ExecSpace > - void construct( const ExecSpace & space ) const - { - typedef Kokkos::RangePolicy< ExecSpace , size_t > Policy ; - - (void) Kokkos::Impl::ParallelFor< ViewMapping , Policy >( *this , Policy( 0 , m_stride ) ); - ExecSpace::fence(); - } - - template< class ExecSpace > - void destroy( const ExecSpace & ) const {} -}; - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- -/** \brief Assign compatible default mappings */ - -template< class DstTraits , class SrcTraits > -class ViewMapping< DstTraits , SrcTraits , - typename std::enable_if<( - std::is_same< typename DstTraits::memory_space , typename SrcTraits::memory_space >::value - && - std::is_same< typename DstTraits::specialize , Kokkos::Array<> >::value - && - ( - std::is_same< typename DstTraits::array_layout , Kokkos::LayoutLeft >::value || - std::is_same< typename DstTraits::array_layout , Kokkos::LayoutRight >::value || - std::is_same< typename DstTraits::array_layout , Kokkos::LayoutStride >::value - ) - && - std::is_same< typename SrcTraits::specialize , Kokkos::Array<> >::value - && - ( - std::is_same< typename SrcTraits::array_layout , Kokkos::LayoutLeft >::value || - std::is_same< typename SrcTraits::array_layout , Kokkos::LayoutRight >::value || - std::is_same< typename SrcTraits::array_layout , Kokkos::LayoutStride >::value - ) - )>::type > -{ -public: - - enum { is_assignable = true }; - - typedef Kokkos::Experimental::Impl::SharedAllocationTracker TrackType ; - typedef ViewMapping< DstTraits , void , void > DstType ; - typedef ViewMapping< SrcTraits , void , void > SrcType ; - - KOKKOS_INLINE_FUNCTION - static void assign( DstType & dst , const SrcType & src , const TrackType & src_track ) - { - static_assert( std::is_same< typename DstTraits::value_type , typename SrcTraits::value_type >::value || - std::is_same< typename DstTraits::value_type , typename SrcTraits::const_value_type >::value - , "View assignment must have same value type or const = non-const" ); - - static_assert( ViewDimensionAssignable< typename DstTraits::dimension , typename SrcTraits::dimension >::value - , "View assignment must have compatible dimensions" ); - - static_assert( std::is_same< typename DstTraits::array_layout , typename SrcTraits::array_layout >::value || - std::is_same< typename DstTraits::array_layout , Kokkos::LayoutStride >::value || - ( DstTraits::dimension::rank == 0 ) || - ( DstTraits::dimension::rank == 1 && DstTraits::dimension::rank_dynamic == 1 ) - , "View assignment must have compatible layout or have rank <= 1" ); - - typedef typename DstType::offset_type dst_offset_type ; - - dst.m_offset = dst_offset_type( src.m_offset ); - dst.m_handle = src.m_handle ; - dst.m_stride = src.m_stride ; - } -}; - -/** \brief Assign Array to non-Array */ - -template< class DstTraits , class SrcTraits > -class ViewMapping< DstTraits , SrcTraits , - typename std::enable_if<( - std::is_same< typename DstTraits::memory_space , typename SrcTraits::memory_space >::value - && - std::is_same< typename DstTraits::specialize , void >::value - && - ( - std::is_same< typename DstTraits::array_layout , Kokkos::LayoutLeft >::value || - std::is_same< typename DstTraits::array_layout , Kokkos::LayoutRight >::value || - std::is_same< typename DstTraits::array_layout , Kokkos::LayoutStride >::value - ) - && - std::is_same< typename SrcTraits::specialize , Kokkos::Array<> >::value - && - ( - std::is_same< typename SrcTraits::array_layout , Kokkos::LayoutLeft >::value || - std::is_same< typename SrcTraits::array_layout , Kokkos::LayoutRight >::value || - std::is_same< typename SrcTraits::array_layout , Kokkos::LayoutStride >::value - ) - )>::type > -{ -public: - - // Can only convert to View::array_type - - enum { is_assignable = std::is_same< typename DstTraits::data_type , typename SrcTraits::array_scalar_type >::value && - std::is_same< typename DstTraits::array_layout , typename SrcTraits::array_layout >::value }; - - typedef Kokkos::Experimental::Impl::SharedAllocationTracker TrackType ; - typedef ViewMapping< DstTraits , void , void > DstType ; - typedef ViewMapping< SrcTraits , void , void > SrcType ; - - KOKKOS_INLINE_FUNCTION - static void assign( DstType & dst , const SrcType & src , const TrackType & src_track ) - { - static_assert( is_assignable , "Can only convert to array_type" ); - - typedef typename DstType::offset_type dst_offset_type ; - - // Array dimension becomes the last dimension. - // Arguments beyond the destination rank are ignored. - if ( src.span_is_contiguous() ) { // not padded - dst.m_offset = dst_offset_type( std::integral_constant() - , ( 1 < SrcType::Rank ? src.dimension_1() : SrcTraits::value_type::size() ) - , ( 2 < SrcType::Rank ? src.dimension_2() : SrcTraits::value_type::size() ) - , ( 3 < SrcType::Rank ? src.dimension_3() : SrcTraits::value_type::size() ) - , ( 4 < SrcType::Rank ? src.dimension_4() : SrcTraits::value_type::size() ) - , ( 5 < SrcType::Rank ? src.dimension_5() : SrcTraits::value_type::size() ) - , ( 6 < SrcType::Rank ? src.dimension_6() : SrcTraits::value_type::size() ) - , ( 7 < SrcType::Rank ? src.dimension_7() : SrcTraits::value_type::size() ) - ); - } - else { // is padded - typedef std::integral_constant padded ; - - dst.m_offset = dst_offset_type( padded() - , ( 0 < SrcType::Rank ? src.dimension_0() : SrcTraits::value_type::size() ) - , ( 1 < SrcType::Rank ? src.dimension_1() : SrcTraits::value_type::size() ) - , ( 2 < SrcType::Rank ? src.dimension_2() : SrcTraits::value_type::size() ) - , ( 3 < SrcType::Rank ? src.dimension_3() : SrcTraits::value_type::size() ) - , ( 4 < SrcType::Rank ? src.dimension_4() : SrcTraits::value_type::size() ) - , ( 5 < SrcType::Rank ? src.dimension_5() : SrcTraits::value_type::size() ) - , ( 6 < SrcType::Rank ? src.dimension_6() : SrcTraits::value_type::size() ) - , ( 7 < SrcType::Rank ? src.dimension_7() : SrcTraits::value_type::size() ) - ); - } - - dst.m_handle = src.m_handle ; - } -}; - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -/** \brief View mapping for non-specialized data type and standard layout */ -template< class Traits , bool R0 , bool R1 , bool R2 , bool R3 , bool R4 , bool R5 , bool R6 , bool R7 > -struct SubviewMapping< Traits, R0, R1, R2, R3, R4, R5, R6, R7 , - typename std::enable_if<( - std::is_same< typename Traits::specialize , Kokkos::Array<> >::value - && - ( - std::is_same< typename Traits::array_layout , Kokkos::LayoutLeft >::value || - std::is_same< typename Traits::array_layout , Kokkos::LayoutRight >::value || - std::is_same< typename Traits::array_layout , Kokkos::LayoutStride >::value - ) - )>::type > -{ -private: - - // Subview's rank - enum { rank = unsigned(R0) + unsigned(R1) + unsigned(R2) + unsigned(R3) - + unsigned(R4) + unsigned(R5) + unsigned(R6) + unsigned(R7) }; - - // Whether right-most rank is a range. - enum { R0_rev = 0 == Traits::rank ? false : ( - 1 == Traits::rank ? R0 : ( - 2 == Traits::rank ? R1 : ( - 3 == Traits::rank ? R2 : ( - 4 == Traits::rank ? R3 : ( - 5 == Traits::rank ? R4 : ( - 6 == Traits::rank ? R5 : ( - 7 == Traits::rank ? R6 : R7 ))))))) }; - - // Subview's layout - typedef typename std::conditional< - ( /* Same array layout IF */ - ( rank == 0 ) /* output rank zero */ - || - // OutputRank 1 or 2, InputLayout Left, Interval 0 - // because single stride one or second index has a stride. - ( rank <= 2 && R0 && std::is_same< typename Traits::array_layout , Kokkos::LayoutLeft >::value ) - || - // OutputRank 1 or 2, InputLayout Right, Interval [InputRank-1] - // because single stride one or second index has a stride. - ( rank <= 2 && R0_rev && std::is_same< typename Traits::array_layout , Kokkos::LayoutRight >::value ) - ), typename Traits::array_layout , Kokkos::LayoutStride - >::type array_layout ; - - typedef typename Traits::value_type value_type ; - - typedef typename std::conditional< rank == 0 , value_type , - typename std::conditional< rank == 1 , value_type * , - typename std::conditional< rank == 2 , value_type ** , - typename std::conditional< rank == 3 , value_type *** , - typename std::conditional< rank == 4 , value_type **** , - typename std::conditional< rank == 5 , value_type ***** , - typename std::conditional< rank == 6 , value_type ****** , - typename std::conditional< rank == 7 , value_type ******* , - value_type ******** - >::type >::type >::type >::type >::type >::type >::type >::type - data_type ; - -public: - - typedef - Kokkos::Experimental::ViewTraits< data_type , array_layout - , typename Traits::device_type - , typename Traits::memory_traits > traits_type ; - - typedef Kokkos::Experimental::View< data_type - , array_layout - , typename Traits::device_type - , typename Traits::memory_traits > type ; - - template< class T0 , class T1 , class T2 , class T3 - , class T4 , class T5 , class T6 , class T7 > - KOKKOS_INLINE_FUNCTION - static void assign( ViewMapping< traits_type , void , void > & dst - , ViewMapping< Traits , void , void > const & src - , T0 const & arg0 - , T1 const & arg1 - , T2 const & arg2 - , T3 const & arg3 - , T4 const & arg4 - , T5 const & arg5 - , T6 const & arg6 - , T7 const & arg7 - ) - { - typedef ViewMapping< traits_type , void , void > DstType ; - - typedef typename DstType::offset_type dst_offset_type ; - typedef typename DstType::handle_type dst_handle_type ; - - typedef Kokkos::Experimental::Impl::ViewOffsetRange V0 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V1 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V2 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V3 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V4 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V5 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V6 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V7 ; - - dst.m_offset = dst_offset_type - ( src.m_offset - , V0::dimension( src.m_offset.dimension_0() , arg0 ) - , V1::dimension( src.m_offset.dimension_1() , arg1 ) - , V2::dimension( src.m_offset.dimension_2() , arg2 ) - , V3::dimension( src.m_offset.dimension_3() , arg3 ) - , V4::dimension( src.m_offset.dimension_4() , arg4 ) - , V5::dimension( src.m_offset.dimension_5() , arg5 ) - , V6::dimension( src.m_offset.dimension_6() , arg6 ) - , V7::dimension( src.m_offset.dimension_7() , arg7 ) - ); - - dst.m_handle = dst_handle_type( src.m_handle + - src.m_offset( V0::begin( arg0 ) - , V1::begin( arg1 ) - , V2::begin( arg2 ) - , V3::begin( arg3 ) - , V4::begin( arg4 ) - , V5::begin( arg5 ) - , V6::begin( arg6 ) - , V7::begin( arg7 ) - ) ); - } -}; - -}}} // namespace Kokkos::Experimental::Impl - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_EXPERIMENTAL_VIEW_ARRAY_MAPPING_HPP */ - diff --git a/lib/kokkos/core/src/impl/KokkosExp_ViewMapping.hpp b/lib/kokkos/core/src/impl/KokkosExp_ViewMapping.hpp deleted file mode 100644 index 5fa1bb7155..0000000000 --- a/lib/kokkos/core/src/impl/KokkosExp_ViewMapping.hpp +++ /dev/null @@ -1,2830 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXPERIMENTAL_VIEW_MAPPING_HPP -#define KOKKOS_EXPERIMENTAL_VIEW_MAPPING_HPP - -#include -#include - -#include -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class ExecPolicy > class ParallelFor ; - -}} /* namespace Kokkos::Impl */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -template< long sN0 = -1 - , long sN1 = -1 - , long sN2 = -1 - , long sN3 = -1 - , long sN4 = -1 - , long sN5 = -1 - , long sN6 = -1 - , long sN7 = -1 - > -struct ViewDimension { - - enum { arg_N0 = sN0 }; - enum { arg_N1 = sN1 }; - enum { arg_N2 = sN2 }; - enum { arg_N3 = sN3 }; - enum { arg_N4 = sN4 }; - enum { arg_N5 = sN5 }; - enum { arg_N6 = sN6 }; - enum { arg_N7 = sN7 }; - - enum { rank = ( sN0 < 0 ? 0 : - ( sN1 < 0 ? 1 : - ( sN2 < 0 ? 2 : - ( sN3 < 0 ? 3 : - ( sN4 < 0 ? 4 : - ( sN5 < 0 ? 5 : - ( sN6 < 0 ? 6 : - ( sN7 < 0 ? 7 : 8 )))))))) }; - enum { rank_dynamic = 0 }; - - enum { N0 = 0 < sN0 ? sN0 : 1 }; - enum { N1 = 0 < sN1 ? sN1 : 1 }; - enum { N2 = 0 < sN2 ? sN2 : 1 }; - enum { N3 = 0 < sN3 ? sN3 : 1 }; - enum { N4 = 0 < sN4 ? sN4 : 1 }; - enum { N5 = 0 < sN5 ? sN5 : 1 }; - enum { N6 = 0 < sN6 ? sN6 : 1 }; - enum { N7 = 0 < sN7 ? sN7 : 1 }; - - ViewDimension() = default ; - ViewDimension( const ViewDimension & ) = default ; - ViewDimension & operator = ( const ViewDimension & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewDimension( size_t , unsigned , unsigned , unsigned - , unsigned , unsigned , unsigned , unsigned ) {} -}; - -template< long sN1 - , long sN2 - , long sN3 - , long sN4 - , long sN5 - , long sN6 - , long sN7 - > -struct ViewDimension< 0, sN1, sN2, sN3, sN4, sN5, sN6, sN7 > { - - enum { arg_N0 = 0 }; - enum { arg_N1 = sN1 }; - enum { arg_N2 = sN2 }; - enum { arg_N3 = sN3 }; - enum { arg_N4 = sN4 }; - enum { arg_N5 = sN5 }; - enum { arg_N6 = sN6 }; - enum { arg_N7 = sN7 }; - - enum { rank = ( sN1 < 0 ? 1 : - ( sN2 < 0 ? 2 : - ( sN3 < 0 ? 3 : - ( sN4 < 0 ? 4 : - ( sN5 < 0 ? 5 : - ( sN6 < 0 ? 6 : - ( sN7 < 0 ? 7 : 8 ))))))) }; - enum { rank_dynamic = 1 }; - - size_t N0 ; /* When 1 == rank_dynamic allow N0 >= 2^32 */ - enum { N1 = 0 < sN1 ? sN1 : 1 }; - enum { N2 = 0 < sN2 ? sN2 : 1 }; - enum { N3 = 0 < sN3 ? sN3 : 1 }; - enum { N4 = 0 < sN4 ? sN4 : 1 }; - enum { N5 = 0 < sN5 ? sN5 : 1 }; - enum { N6 = 0 < sN6 ? sN6 : 1 }; - enum { N7 = 0 < sN7 ? sN7 : 1 }; - - ViewDimension() = default ; - ViewDimension( const ViewDimension & ) = default ; - ViewDimension & operator = ( const ViewDimension & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewDimension( size_t aN0 , unsigned , unsigned , unsigned - , unsigned , unsigned , unsigned , unsigned ) - : N0( aN0 ) {} -}; - -template< long sN2 - , long sN3 - , long sN4 - , long sN5 - , long sN6 - , long sN7 - > -struct ViewDimension< 0, 0, sN2, sN3, sN4, sN5, sN6, sN7 > { - - enum { arg_N0 = 0 }; - enum { arg_N1 = 0 }; - enum { arg_N2 = sN2 }; - enum { arg_N3 = sN3 }; - enum { arg_N4 = sN4 }; - enum { arg_N5 = sN5 }; - enum { arg_N6 = sN6 }; - enum { arg_N7 = sN7 }; - - enum { rank = ( sN2 < 0 ? 2 : - ( sN3 < 0 ? 3 : - ( sN4 < 0 ? 4 : - ( sN5 < 0 ? 5 : - ( sN6 < 0 ? 6 : - ( sN7 < 0 ? 7 : 8 )))))) }; - enum { rank_dynamic = 2 }; - - size_t N0 ; /* When 2 == rank_dynamic allow N0 >= 2^32 */ - size_t N1 ; /* When 2 == rank_dynamic allow N1 >= 2^32 */ - enum { N2 = 0 < sN2 ? sN2 : 1 }; - enum { N3 = 0 < sN3 ? sN3 : 1 }; - enum { N4 = 0 < sN4 ? sN4 : 1 }; - enum { N5 = 0 < sN5 ? sN5 : 1 }; - enum { N6 = 0 < sN6 ? sN6 : 1 }; - enum { N7 = 0 < sN7 ? sN7 : 1 }; - - ViewDimension() = default ; - ViewDimension( const ViewDimension & ) = default ; - ViewDimension & operator = ( const ViewDimension & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewDimension( size_t aN0 , unsigned aN1 , unsigned , unsigned - , unsigned , unsigned , unsigned , unsigned ) - : N0( aN0 ) , N1( aN1 ) {} -}; - -template< long sN3 - , long sN4 - , long sN5 - , long sN6 - , long sN7 - > -struct ViewDimension< 0, 0, 0, sN3, sN4, sN5, sN6, sN7 > { - - enum { arg_N0 = 0 }; - enum { arg_N1 = 0 }; - enum { arg_N2 = 0 }; - enum { arg_N3 = sN3 }; - enum { arg_N4 = sN4 }; - enum { arg_N5 = sN5 }; - enum { arg_N6 = sN6 }; - enum { arg_N7 = sN7 }; - - enum { rank = ( sN3 < 0 ? 3 : - ( sN4 < 0 ? 4 : - ( sN5 < 0 ? 5 : - ( sN6 < 0 ? 6 : - ( sN7 < 0 ? 7 : 8 ))))) }; - enum { rank_dynamic = 3 }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - enum { N3 = 0 < sN3 ? sN3 : 1 }; - enum { N4 = 0 < sN4 ? sN4 : 1 }; - enum { N5 = 0 < sN5 ? sN5 : 1 }; - enum { N6 = 0 < sN6 ? sN6 : 1 }; - enum { N7 = 0 < sN7 ? sN7 : 1 }; - - ViewDimension() = default ; - ViewDimension( const ViewDimension & ) = default ; - ViewDimension & operator = ( const ViewDimension & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewDimension( size_t aN0 , unsigned aN1 , unsigned aN2 , unsigned - , unsigned , unsigned , unsigned , unsigned ) - : N0( aN0 ) , N1( aN1 ) , N2( aN2 ) {} -}; - -template< long sN4 - , long sN5 - , long sN6 - , long sN7 - > -struct ViewDimension< 0, 0, 0, 0, sN4, sN5, sN6, sN7 > { - - enum { arg_N0 = 0 }; - enum { arg_N1 = 0 }; - enum { arg_N2 = 0 }; - enum { arg_N3 = 0 }; - enum { arg_N4 = sN4 }; - enum { arg_N5 = sN5 }; - enum { arg_N6 = sN6 }; - enum { arg_N7 = sN7 }; - - enum { rank = ( sN4 < 0 ? 4 : - ( sN5 < 0 ? 5 : - ( sN6 < 0 ? 6 : - ( sN7 < 0 ? 7 : 8 )))) }; - enum { rank_dynamic = 4 }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - unsigned N3 ; - enum { N4 = 0 < sN4 ? sN4 : 1 }; - enum { N5 = 0 < sN5 ? sN5 : 1 }; - enum { N6 = 0 < sN6 ? sN6 : 1 }; - enum { N7 = 0 < sN7 ? sN7 : 1 }; - - ViewDimension() = default ; - ViewDimension( const ViewDimension & ) = default ; - ViewDimension & operator = ( const ViewDimension & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewDimension( size_t aN0 , unsigned aN1 , unsigned aN2 , unsigned aN3 - , unsigned , unsigned , unsigned , unsigned ) - : N0( aN0 ) , N1( aN1 ) , N2( aN2 ) , N3( aN3 ) {} -}; - -template< long sN5 - , long sN6 - , long sN7 - > -struct ViewDimension< 0, 0, 0, 0, 0, sN5, sN6, sN7 > { - - enum { arg_N0 = 0 }; - enum { arg_N1 = 0 }; - enum { arg_N2 = 0 }; - enum { arg_N3 = 0 }; - enum { arg_N4 = 0 }; - enum { arg_N5 = sN5 }; - enum { arg_N6 = sN6 }; - enum { arg_N7 = sN7 }; - - enum { rank = ( sN5 < 0 ? 5 : - ( sN6 < 0 ? 6 : - ( sN7 < 0 ? 7 : 8 ))) }; - enum { rank_dynamic = 5 }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - unsigned N3 ; - unsigned N4 ; - enum { N5 = 0 < sN5 ? sN5 : 1 }; - enum { N6 = 0 < sN6 ? sN6 : 1 }; - enum { N7 = 0 < sN7 ? sN7 : 1 }; - - ViewDimension() = default ; - ViewDimension( const ViewDimension & ) = default ; - ViewDimension & operator = ( const ViewDimension & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewDimension( size_t aN0 , unsigned aN1 , unsigned aN2 , unsigned aN3 - , unsigned aN4 , unsigned , unsigned , unsigned ) - : N0( aN0 ) , N1( aN1 ) , N2( aN2 ) , N3( aN3 ) , N4( aN4 ) {} -}; - -template< long sN6 - , long sN7 - > -struct ViewDimension< 0, 0, 0, 0, 0, 0, sN6, sN7 > { - - enum { arg_N0 = 0 }; - enum { arg_N1 = 0 }; - enum { arg_N2 = 0 }; - enum { arg_N3 = 0 }; - enum { arg_N4 = 0 }; - enum { arg_N5 = 0 }; - enum { arg_N6 = sN6 }; - enum { arg_N7 = sN7 }; - - enum { rank = ( sN6 < 0 ? 6 : - ( sN7 < 0 ? 7 : 8 )) }; - enum { rank_dynamic = 6 }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - unsigned N3 ; - unsigned N4 ; - unsigned N5 ; - enum { N6 = 0 < sN6 ? sN6 : 1 }; - enum { N7 = 0 < sN7 ? sN7 : 1 }; - - ViewDimension() = default ; - ViewDimension( const ViewDimension & ) = default ; - ViewDimension & operator = ( const ViewDimension & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewDimension( size_t aN0 , unsigned aN1 , unsigned aN2 , unsigned aN3 - , unsigned aN4 , unsigned aN5 , unsigned , unsigned ) - : N0( aN0 ) , N1( aN1 ) , N2( aN2 ) , N3( aN3 ) , N4( aN4 ) , N5( aN5 ) {} -}; - -template< long sN7 > -struct ViewDimension< 0, 0, 0, 0, 0, 0, 0, sN7 > { - - enum { arg_N0 = 0 }; - enum { arg_N1 = 0 }; - enum { arg_N2 = 0 }; - enum { arg_N3 = 0 }; - enum { arg_N4 = 0 }; - enum { arg_N5 = 0 }; - enum { arg_N6 = 0 }; - enum { arg_N7 = sN7 }; - - enum { rank = ( sN7 < 0 ? 7 : 8 ) }; - enum { rank_dynamic = 7 }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - unsigned N3 ; - unsigned N4 ; - unsigned N5 ; - unsigned N6 ; - enum { N7 = 0 < sN7 ? sN7 : 1 }; - - ViewDimension() = default ; - ViewDimension( const ViewDimension & ) = default ; - ViewDimension & operator = ( const ViewDimension & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewDimension( size_t aN0 , unsigned aN1 , unsigned aN2 , unsigned aN3 - , unsigned aN4 , unsigned aN5 , unsigned aN6 , unsigned ) - : N0( aN0 ) , N1( aN1 ) , N2( aN2 ) , N3( aN3 ) , N4( aN4 ) , N5( aN5 ) , N6( aN6 ) {} -}; - -template<> -struct ViewDimension< 0, 0, 0, 0, 0, 0, 0, 0 > { - - enum { arg_N0 = 0 }; - enum { arg_N1 = 0 }; - enum { arg_N2 = 0 }; - enum { arg_N3 = 0 }; - enum { arg_N4 = 0 }; - enum { arg_N5 = 0 }; - enum { arg_N6 = 0 }; - enum { arg_N7 = 0 }; - - enum { rank = 8 }; - enum { rank_dynamic = 8 }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - unsigned N3 ; - unsigned N4 ; - unsigned N5 ; - unsigned N6 ; - unsigned N7 ; - - ViewDimension() = default ; - ViewDimension( const ViewDimension & ) = default ; - ViewDimension & operator = ( const ViewDimension & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewDimension( size_t aN0 , unsigned aN1 , unsigned aN2 , unsigned aN3 - , unsigned aN4 , unsigned aN5 , unsigned aN6 , unsigned aN7 ) - : N0( aN0 ) , N1( aN1 ) , N2( aN2 ) , N3( aN3 ) , N4( aN4 ) , N5( aN5 ) , N6( aN6 ) , N7( aN7 ) {} -}; - -//---------------------------------------------------------------------------- - -template< class DstDim , class SrcDim > -struct ViewDimensionAssignable ; - -template< long dN0 , long dN1 , long dN2 , long dN3 , long dN4 , long dN5 , long dN6 , long dN7 - , long sN0 , long sN1 , long sN2 , long sN3 , long sN4 , long sN5 , long sN6 , long sN7 > -struct ViewDimensionAssignable< ViewDimension - , ViewDimension > -{ - typedef ViewDimension dst ; - typedef ViewDimension src ; - - enum { value = dst::rank == src::rank && - dst::rank_dynamic >= src::rank_dynamic && - ( 0 < dst::rank_dynamic || dN0 == sN0 ) && - ( 1 < dst::rank_dynamic || dN1 == sN1 ) && - ( 2 < dst::rank_dynamic || dN2 == sN2 ) && - ( 3 < dst::rank_dynamic || dN3 == sN3 ) && - ( 4 < dst::rank_dynamic || dN4 == sN4 ) && - ( 5 < dst::rank_dynamic || dN5 == sN5 ) && - ( 6 < dst::rank_dynamic || dN6 == sN6 ) && - ( 7 < dst::rank_dynamic || dN7 == sN7 ) }; -}; - -}}} // namespace Kokkos::Experimental::Impl - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -/** \brief Given a value type and dimension generate the View data type */ -template< class T , class Dim /* ViewDimension */ > -struct ViewDataType { - enum { R = Dim::rank }; - enum { RD = Dim::rank_dynamic }; - - // Unused static dimensions are set to 1 (instead of 0 or -1L) to avoid compile errors - // in the 'false' clauses of the std::conditional. - - enum { N0 = 0 < Dim::arg_N0 ? Dim::arg_N0 : 1 }; - enum { N1 = 0 < Dim::arg_N1 ? Dim::arg_N1 : 1 }; - enum { N2 = 0 < Dim::arg_N2 ? Dim::arg_N2 : 1 }; - enum { N3 = 0 < Dim::arg_N3 ? Dim::arg_N3 : 1 }; - enum { N4 = 0 < Dim::arg_N4 ? Dim::arg_N4 : 1 }; - enum { N5 = 0 < Dim::arg_N5 ? Dim::arg_N5 : 1 }; - enum { N6 = 0 < Dim::arg_N6 ? Dim::arg_N6 : 1 }; - enum { N7 = 0 < Dim::arg_N7 ? Dim::arg_N7 : 1 }; - - typedef typename std::conditional< R == 0 , T , - typename std::conditional< R == 1 , - typename std::conditional< RD == 0 , T[N0] , T * >::type , - - typename std::conditional< R == 2 , - typename std::conditional< RD == 0 , T[N0][N1] , - typename std::conditional< RD == 1 , T* [N1] , - T** - >::type >::type , - - typename std::conditional< R == 3 , - typename std::conditional< RD == 0 , T[N0][N1][N2] , - typename std::conditional< RD == 1 , T* [N1][N2] , - typename std::conditional< RD == 2 , T** [N2] , - T*** - >::type >::type >::type , - - typename std::conditional< R == 4 , - typename std::conditional< RD == 0 , T[N0][N1][N2][N3] , - typename std::conditional< RD == 1 , T* [N1][N2][N3] , - typename std::conditional< RD == 2 , T** [N2][N3] , - typename std::conditional< RD == 3 , T*** [N3] , - T**** - >::type >::type >::type >::type , - - typename std::conditional< R == 5 , - typename std::conditional< RD == 0 , T[N0][N1][N2][N3][N4] , - typename std::conditional< RD == 1 , T* [N1][N2][N3][N4] , - typename std::conditional< RD == 2 , T** [N2][N3][N4] , - typename std::conditional< RD == 3 , T*** [N3][N4] , - typename std::conditional< RD == 4 , T**** [N4] , - T***** - >::type >::type >::type >::type >::type , - - typename std::conditional< R == 6 , - typename std::conditional< RD == 0 , T[N0][N1][N2][N3][N4][N5] , - typename std::conditional< RD == 1 , T* [N1][N2][N3][N4][N5] , - typename std::conditional< RD == 2 , T** [N2][N3][N4][N5] , - typename std::conditional< RD == 3 , T*** [N3][N4][N5] , - typename std::conditional< RD == 4 , T**** [N4][N5] , - typename std::conditional< RD == 5 , T***** [N5] , - T****** - >::type >::type >::type >::type >::type >::type , - - typename std::conditional< R == 7 , - typename std::conditional< RD == 0 , T[N0][N1][N2][N3][N4][N5][N6] , - typename std::conditional< RD == 1 , T* [N1][N2][N3][N4][N5][N6] , - typename std::conditional< RD == 2 , T** [N2][N3][N4][N5][N6] , - typename std::conditional< RD == 3 , T*** [N3][N4][N5][N6] , - typename std::conditional< RD == 4 , T**** [N4][N5][N6] , - typename std::conditional< RD == 5 , T***** [N5][N6] , - typename std::conditional< RD == 6 , T****** [N6] , - T******* - >::type >::type >::type >::type >::type >::type >::type , - - typename std::conditional< R == 8 , - typename std::conditional< RD == 0 , T[N0][N1][N2][N3][N4][N5][N6][N7] , - typename std::conditional< RD == 1 , T* [N1][N2][N3][N4][N5][N6][N7] , - typename std::conditional< RD == 2 , T** [N2][N3][N4][N5][N6][N7] , - typename std::conditional< RD == 3 , T*** [N3][N4][N5][N6][N7] , - typename std::conditional< RD == 4 , T**** [N4][N5][N6][N7] , - typename std::conditional< RD == 5 , T***** [N5][N6][N7] , - typename std::conditional< RD == 6 , T****** [N6][N7] , - typename std::conditional< RD == 7 , T******* [N7] , - T******** - >::type >::type >::type >::type >::type >::type >::type >::type , - - void >::type >::type >::type >::type >::type >::type >::type >::type >::type - type ; -}; - -/**\brief Analysis of View data type. - * - * Data type conforms to one of the following patterns : - * {const} value_type [][#][#][#] - * {const} value_type ***[#][#][#] - * Where the sum of counts of '*' and '[#]' is at most ten. - * - * Provide typedef for the ViewDimension<...> and value_type. - */ -template< class T > -struct ViewArrayAnalysis -{ -private: - // std::rank, std::extent, and std::remove_all_extents - // consider "const value_type***" to be the type. - - // Strip away pointers and count them - typedef typename std::remove_all_extents< T >::type t_0 ; // brackets removed - typedef typename std::remove_pointer< t_0 >::type t_1 ; - typedef typename std::remove_pointer< t_1 >::type t_2 ; - typedef typename std::remove_pointer< t_2 >::type t_3 ; - typedef typename std::remove_pointer< t_3 >::type t_4 ; - typedef typename std::remove_pointer< t_4 >::type t_5 ; - typedef typename std::remove_pointer< t_5 >::type t_6 ; - typedef typename std::remove_pointer< t_6 >::type t_7 ; - typedef typename std::remove_pointer< t_7 >::type t_8 ; - typedef typename std::remove_pointer< t_8 >::type t_9 ; - typedef typename std::remove_pointer< t_9 >::type t_10 ; - - enum { rank_pointer = - ( ! std::is_pointer< t_0 >::value ? 0 : - ( ! std::is_pointer< t_1 >::value ? 1 : - ( ! std::is_pointer< t_2 >::value ? 2 : - ( ! std::is_pointer< t_3 >::value ? 3 : - ( ! std::is_pointer< t_4 >::value ? 4 : - ( ! std::is_pointer< t_5 >::value ? 5 : - ( ! std::is_pointer< t_6 >::value ? 6 : - ( ! std::is_pointer< t_7 >::value ? 7 : - ( ! std::is_pointer< t_8 >::value ? 8 : - ( ! std::is_pointer< t_9 >::value ? 9 : - ( ! std::is_pointer< t_10 >::value ? 10 : 0x7fffffff ))))))))))) }; - - // The pointer-stripped type t_10 may have been an array typedef of the form 'type[#][#]...' - // Append those dimensions. - - enum { rank_bracket = std::rank< T >::value }; - enum { rank_bracket_nested = std::rank< t_10 >::value }; - enum { rank_base = rank_pointer + rank_bracket }; - enum { rank = rank_pointer + rank_bracket + rank_bracket_nested }; - - static_assert( rank <= 10 , "Maximum ten dimensional array" ); - - enum { extent_0 = 0 < rank_base ? std::extent< T , rank_pointer <= 0 ? 0 - rank_pointer : 10 >::value - : std::extent< t_10 , rank_base <= 0 ? 0 - rank_base : 10 >::value }; - - enum { extent_1 = 1 < rank_base ? std::extent< T , rank_pointer <= 1 ? 1 - rank_pointer : 10 >::value - : std::extent< t_10 , rank_base <= 1 ? 1 - rank_base : 10 >::value }; - - enum { extent_2 = 2 < rank_base ? std::extent< T , rank_pointer <= 2 ? 2 - rank_pointer : 10 >::value - : std::extent< t_10 , rank_base <= 2 ? 2 - rank_base : 10 >::value }; - - enum { extent_3 = 3 < rank_base ? std::extent< T , rank_pointer <= 3 ? 3 - rank_pointer : 10 >::value - : std::extent< t_10 , rank_base <= 3 ? 3 - rank_base : 10 >::value }; - - enum { extent_4 = 4 < rank_base ? std::extent< T , rank_pointer <= 4 ? 4 - rank_pointer : 10 >::value - : std::extent< t_10 , rank_base <= 4 ? 4 - rank_base : 10 >::value }; - - enum { extent_5 = 5 < rank_base ? std::extent< T , rank_pointer <= 5 ? 5 - rank_pointer : 10 >::value - : std::extent< t_10 , rank_base <= 5 ? 5 - rank_base : 10 >::value }; - - enum { extent_6 = 6 < rank_base ? std::extent< T , rank_pointer <= 6 ? 6 - rank_pointer : 10 >::value - : std::extent< t_10 , rank_base <= 6 ? 6 - rank_base : 10 >::value }; - - enum { extent_7 = 7 < rank_base ? std::extent< T , rank_pointer <= 7 ? 7 - rank_pointer : 10 >::value - : std::extent< t_10 , rank_base <= 7 ? 7 - rank_base : 10 >::value }; - - enum { extent_8 = 8 < rank_base ? std::extent< T , rank_pointer <= 8 ? 8 - rank_pointer : 10 >::value - : std::extent< t_10 , rank_base <= 8 ? 8 - rank_base : 10 >::value }; - - enum { extent_9 = 9 < rank_base ? std::extent< T , rank_pointer <= 9 ? 9 - rank_pointer : 10 >::value - : std::extent< t_10 , rank_base <= 9 ? 9 - rank_base : 10 >::value }; - - typedef typename std::remove_all_extents< t_10 >::type base_type ; - - enum { rank_dynamic = rank_pointer ? rank_pointer : ( ( rank_bracket && extent_0 == 0 ) ? 1 : 0 ) }; - -public: - - typedef ViewDimension< ( rank <= 0 ? -1L : extent_0 ) - , ( rank <= 1 ? -1L : extent_1 ) - , ( rank <= 2 ? -1L : extent_2 ) - , ( rank <= 3 ? -1L : extent_3 ) - , ( rank <= 4 ? -1L : extent_4 ) - , ( rank <= 5 ? -1L : extent_5 ) - , ( rank <= 6 ? -1L : extent_6 ) - , ( rank <= 7 ? -1L : extent_7 ) - > dimension ; - - typedef base_type value_type ; - typedef typename std::add_const< base_type >::type const_value_type ; - typedef typename std::remove_const< base_type >::type non_const_value_type ; - - static_assert( unsigned(dimension::rank) == unsigned(rank) , "" ); - static_assert( unsigned(dimension::rank_dynamic) == unsigned(rank_dynamic) , "" ); -}; - -template< class DataType , class ValueType , class ArrayLayout > -struct ViewDataAnalysis -{ -private: - - typedef ViewArrayAnalysis< DataType > array_analysis ; - - // ValueType is opportunity for partial specialization. - // Must match array analysis when this default template is used. - static_assert( std::is_same< ValueType , typename array_analysis::non_const_value_type >::value , "" ); - -public: - - typedef void specialize ; // No specialization - - typedef typename array_analysis::dimension dimension ; - typedef typename array_analysis::value_type value_type ; - typedef typename array_analysis::const_value_type const_value_type ; - typedef typename array_analysis::non_const_value_type non_const_value_type ; - - // Generate analogous multidimensional array specification type. - typedef typename ViewDataType< value_type , dimension >::type type ; - typedef typename ViewDataType< const_value_type , dimension >::type const_type ; - typedef typename ViewDataType< non_const_value_type , dimension >::type non_const_type ; - - // Generate "flattened" multidimensional array specification type. - typedef type array_scalar_type ; - typedef const_type const_array_scalar_type ; - typedef non_const_type non_const_array_scalar_type ; -}; - -}}} // namespace Kokkos::Experimental::Impl - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -template < class Dimension , class Layout , typename Enable = void > -struct ViewOffset { - using is_mapping_plugin = std::false_type ; -}; - -//---------------------------------------------------------------------------- -// LayoutLeft AND ( 1 >= rank OR 0 == rank_dynamic ) : no padding / striding -template < class Dimension > -struct ViewOffset< Dimension , Kokkos::LayoutLeft - , typename std::enable_if<( 1 >= Dimension::rank - || - 0 == Dimension::rank_dynamic - )>::type > -{ - using is_mapping_plugin = std::true_type ; - using is_regular = std::true_type ; - - typedef size_t size_type ; - typedef Dimension dimension_type ; - typedef Kokkos::LayoutLeft array_layout ; - - dimension_type m_dim ; - - //---------------------------------------- - - // rank 1 - template< typename I0 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0 ) const { return i0 ; } - - // rank 2 - template < typename I0 , typename I1 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0 , I1 const & i1 ) const - { return i0 + m_dim.N0 * i1 ; } - - //rank 3 - template < typename I0, typename I1, typename I2 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2 ) const - { - return i0 + m_dim.N0 * ( i1 + m_dim.N1 * i2 ); - } - - //rank 4 - template < typename I0, typename I1, typename I2, typename I3 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 ) const - { - return i0 + m_dim.N0 * ( - i1 + m_dim.N1 * ( - i2 + m_dim.N2 * i3 )); - } - - //rank 5 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4 ) const - { - return i0 + m_dim.N0 * ( - i1 + m_dim.N1 * ( - i2 + m_dim.N2 * ( - i3 + m_dim.N3 * i4 ))); - } - - //rank 6 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5 ) const - { - return i0 + m_dim.N0 * ( - i1 + m_dim.N1 * ( - i2 + m_dim.N2 * ( - i3 + m_dim.N3 * ( - i4 + m_dim.N4 * i5 )))); - } - - //rank 7 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5, typename I6 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5, I6 const & i6 ) const - { - return i0 + m_dim.N0 * ( - i1 + m_dim.N1 * ( - i2 + m_dim.N2 * ( - i3 + m_dim.N3 * ( - i4 + m_dim.N4 * ( - i5 + m_dim.N5 * i6 ))))); - } - - //rank 8 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5, typename I6, typename I7 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5, I6 const & i6, I7 const & i7 ) const - { - return i0 + m_dim.N0 * ( - i1 + m_dim.N1 * ( - i2 + m_dim.N2 * ( - i3 + m_dim.N3 * ( - i4 + m_dim.N4 * ( - i5 + m_dim.N5 * ( - i6 + m_dim.N6 * i7 )))))); - } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_0() const { return m_dim.N0 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_1() const { return m_dim.N1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_2() const { return m_dim.N2 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_3() const { return m_dim.N3 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_4() const { return m_dim.N4 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_5() const { return m_dim.N5 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_6() const { return m_dim.N6 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_7() const { return m_dim.N7 ; } - - /* Cardinality of the domain index space */ - KOKKOS_INLINE_FUNCTION - constexpr size_type size() const - { return m_dim.N0 * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 * m_dim.N6 * m_dim.N7 ; } - - /* Span of the range space */ - KOKKOS_INLINE_FUNCTION - constexpr size_type span() const - { return m_dim.N0 * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 * m_dim.N6 * m_dim.N7 ; } - - KOKKOS_INLINE_FUNCTION constexpr bool span_is_contiguous() const { return true ; } - - /* Strides of dimensions */ - KOKKOS_INLINE_FUNCTION constexpr size_type stride_0() const { return 1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_1() const { return m_dim.N0 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_2() const { return m_dim.N0 * m_dim.N1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_3() const { return m_dim.N0 * m_dim.N1 * m_dim.N2 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_4() const { return m_dim.N0 * m_dim.N1 * m_dim.N2 * m_dim.N3 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_5() const { return m_dim.N0 * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_6() const { return m_dim.N0 * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_7() const { return m_dim.N0 * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 * m_dim.N6 ; } - - // Stride with [ rank ] value is the total length - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { - s[0] = 1 ; - if ( 0 < dimension_type::rank ) { s[1] = m_dim.N0 ; } - if ( 1 < dimension_type::rank ) { s[2] = s[1] * m_dim.N1 ; } - if ( 2 < dimension_type::rank ) { s[3] = s[2] * m_dim.N2 ; } - if ( 3 < dimension_type::rank ) { s[4] = s[3] * m_dim.N3 ; } - if ( 4 < dimension_type::rank ) { s[5] = s[4] * m_dim.N4 ; } - if ( 5 < dimension_type::rank ) { s[6] = s[5] * m_dim.N5 ; } - if ( 6 < dimension_type::rank ) { s[7] = s[6] * m_dim.N6 ; } - if ( 7 < dimension_type::rank ) { s[8] = s[7] * m_dim.N7 ; } - } - - //---------------------------------------- - - ViewOffset() = default ; - ViewOffset( const ViewOffset & ) = default ; - ViewOffset & operator = ( const ViewOffset & ) = default ; - - template< unsigned TrivialScalarSize > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( std::integral_constant const & - , size_t aN0 , unsigned aN1 , unsigned aN2 , unsigned aN3 - , unsigned aN4 , unsigned aN5 , unsigned aN6 , unsigned aN7 ) - : m_dim( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - {} - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutLeft , void > & rhs ) - : m_dim( rhs.m_dim.N0 , rhs.m_dim.N1 , rhs.m_dim.N2 , rhs.m_dim.N3 - , rhs.m_dim.N4 , rhs.m_dim.N5 , rhs.m_dim.N6 , rhs.m_dim.N7 ) - { - static_assert( int(DimRHS::rank) == int(dimension_type::rank) , "ViewOffset assignment requires equal rank" ); - // Also requires equal static dimensions ... - } - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutRight , void > & rhs ) - : m_dim( rhs.m_dim.N0, 0, 0, 0, 0, 0, 0, 0 ) - { - static_assert( DimRHS::rank == 1 && dimension_type::rank == 1 && dimension_type::rank_dynamic == 1 - , "ViewOffset LayoutLeft and LayoutRight are only compatible when rank == 1" ); - } - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutStride , void > & rhs ) - : m_dim( rhs.m_dim.N0, 0, 0, 0, 0, 0, 0, 0 ) - { - static_assert( DimRHS::rank == 1 && dimension_type::rank == 1 && dimension_type::rank_dynamic == 1 - , "ViewOffset LayoutLeft and LayoutStride are only compatible when rank == 1" ); - if ( rhs.m_stride.S0 != 1 ) { - Kokkos::abort("Kokkos::Experimental::ViewOffset assignment of LayoutLeft from LayoutStride requires stride == 1" ); - } - } - - //---------------------------------------- - // Subview construction - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutLeft , void > & rhs - , const size_t n0 - , const size_t - , const size_t - , const size_t - , const size_t - , const size_t - , const size_t - , const size_t - ) - : m_dim( n0, 0, 0, 0, 0, 0, 0, 0 ) - { - static_assert( ( 0 == dimension_type::rank ) || - ( 1 == dimension_type::rank && 1 == dimension_type::rank_dynamic && 1 <= DimRHS::rank ) - , "ViewOffset subview construction requires compatible rank" ); - } -}; - -//---------------------------------------------------------------------------- -// LayoutLeft AND ( 1 < rank AND 0 < rank_dynamic ) : has padding / striding -template < class Dimension > -struct ViewOffset< Dimension , Kokkos::LayoutLeft - , typename std::enable_if<( 1 < Dimension::rank - && - 0 < Dimension::rank_dynamic - )>::type > -{ - using is_mapping_plugin = std::true_type ; - using is_regular = std::true_type ; - - typedef size_t size_type ; - typedef Dimension dimension_type ; - typedef Kokkos::LayoutLeft array_layout ; - - dimension_type m_dim ; - size_type m_stride ; - - //---------------------------------------- - - // rank 1 - template< typename I0 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0 ) const { return i0 ; } - - // rank 2 - template < typename I0 , typename I1 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0 , I1 const & i1 ) const - { return i0 + m_stride * i1 ; } - - //rank 3 - template < typename I0, typename I1, typename I2 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2 ) const - { - return i0 + m_stride * ( i1 + m_dim.N1 * i2 ); - } - - //rank 4 - template < typename I0, typename I1, typename I2, typename I3 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 ) const - { - return i0 + m_stride * ( - i1 + m_dim.N1 * ( - i2 + m_dim.N2 * i3 )); - } - - //rank 5 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4 ) const - { - return i0 + m_stride * ( - i1 + m_dim.N1 * ( - i2 + m_dim.N2 * ( - i3 + m_dim.N3 * i4 ))); - } - - //rank 6 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5 ) const - { - return i0 + m_stride * ( - i1 + m_dim.N1 * ( - i2 + m_dim.N2 * ( - i3 + m_dim.N3 * ( - i4 + m_dim.N4 * i5 )))); - } - - //rank 7 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5, typename I6 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5, I6 const & i6 ) const - { - return i0 + m_stride * ( - i1 + m_dim.N1 * ( - i2 + m_dim.N2 * ( - i3 + m_dim.N3 * ( - i4 + m_dim.N4 * ( - i5 + m_dim.N5 * i6 ))))); - } - - //rank 8 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5, typename I6, typename I7 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5, I6 const & i6, I7 const & i7 ) const - { - return i0 + m_stride * ( - i1 + m_dim.N1 * ( - i2 + m_dim.N2 * ( - i3 + m_dim.N3 * ( - i4 + m_dim.N4 * ( - i5 + m_dim.N5 * ( - i6 + m_dim.N6 * i7 )))))); - } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_0() const { return m_dim.N0 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_1() const { return m_dim.N1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_2() const { return m_dim.N2 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_3() const { return m_dim.N3 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_4() const { return m_dim.N4 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_5() const { return m_dim.N5 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_6() const { return m_dim.N6 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_7() const { return m_dim.N7 ; } - - /* Cardinality of the domain index space */ - KOKKOS_INLINE_FUNCTION - constexpr size_type size() const - { return m_dim.N0 * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 * m_dim.N6 * m_dim.N7 ; } - - /* Span of the range space */ - KOKKOS_INLINE_FUNCTION - constexpr size_type span() const - { return m_stride * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 * m_dim.N6 * m_dim.N7 ; } - - KOKKOS_INLINE_FUNCTION constexpr bool span_is_contiguous() const { return m_stride == m_dim.N0 ; } - - /* Strides of dimensions */ - KOKKOS_INLINE_FUNCTION constexpr size_type stride_0() const { return 1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_1() const { return m_stride ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_2() const { return m_stride * m_dim.N1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_3() const { return m_stride * m_dim.N1 * m_dim.N2 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_4() const { return m_stride * m_dim.N1 * m_dim.N2 * m_dim.N3 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_5() const { return m_stride * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_6() const { return m_stride * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_7() const { return m_stride * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 * m_dim.N6 ; } - - // Stride with [ rank ] value is the total length - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { - s[0] = 1 ; - if ( 0 < dimension_type::rank ) { s[1] = m_stride ; } - if ( 1 < dimension_type::rank ) { s[2] = s[1] * m_dim.N1 ; } - if ( 2 < dimension_type::rank ) { s[3] = s[2] * m_dim.N2 ; } - if ( 3 < dimension_type::rank ) { s[4] = s[3] * m_dim.N3 ; } - if ( 4 < dimension_type::rank ) { s[5] = s[4] * m_dim.N4 ; } - if ( 5 < dimension_type::rank ) { s[6] = s[5] * m_dim.N5 ; } - if ( 6 < dimension_type::rank ) { s[7] = s[6] * m_dim.N6 ; } - if ( 7 < dimension_type::rank ) { s[8] = s[7] * m_dim.N7 ; } - } - - //---------------------------------------- - -private: - - template< unsigned TrivialScalarSize > - struct Padding { - enum { div = TrivialScalarSize == 0 ? 0 : Kokkos::Impl::MEMORY_ALIGNMENT / ( TrivialScalarSize ? TrivialScalarSize : 1 ) }; - enum { mod = TrivialScalarSize == 0 ? 0 : Kokkos::Impl::MEMORY_ALIGNMENT % ( TrivialScalarSize ? TrivialScalarSize : 1 ) }; - - // If memory alignment is a multiple of the trivial scalar size then attempt to align. - enum { align = 0 != TrivialScalarSize && 0 == mod ? div : 0 }; - enum { div_ok = div ? div : 1 }; // To valid modulo zero in constexpr - - KOKKOS_INLINE_FUNCTION - static constexpr size_t stride( size_t const N ) - { - return ( align && ( Kokkos::Impl::MEMORY_ALIGNMENT_THRESHOLD * align < N ) && ( N % div_ok ) ) - ? N + align - ( N % div_ok ) : N ; - } - }; - -public: - - ViewOffset() = default ; - ViewOffset( const ViewOffset & ) = default ; - ViewOffset & operator = ( const ViewOffset & ) = default ; - - /* Enable padding for trivial scalar types with non-zero trivial scalar size */ - template< unsigned TrivialScalarSize > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( std::integral_constant const & padding_type_size - , size_t aN0 , unsigned aN1 , unsigned aN2 , unsigned aN3 - , unsigned aN4 , unsigned aN5 , unsigned aN6 , unsigned aN7 ) - : m_dim( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - , m_stride( Padding::stride( aN0 ) ) - {} - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutLeft , void > & rhs ) - : m_dim( rhs.m_dim.N0 , rhs.m_dim.N1 , rhs.m_dim.N2 , rhs.m_dim.N3 - , rhs.m_dim.N4 , rhs.m_dim.N5 , rhs.m_dim.N6 , rhs.m_dim.N7 ) - , m_stride( rhs.stride_1() ) - { - static_assert( int(DimRHS::rank) == int(dimension_type::rank) , "ViewOffset assignment requires equal rank" ); - // Also requires equal static dimensions ... - } - - //---------------------------------------- - // Subview construction - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutLeft , void > & rhs - , const size_t aN0 - , const size_t aN1 - , const size_t aN2 - , const size_t aN3 - , const size_t aN4 - , const size_t aN5 - , const size_t aN6 - , const size_t aN7 - ) - : m_dim( aN0 - , ( 1 < DimRHS::rank && aN1 ? aN1 : - ( 2 < DimRHS::rank && aN2 ? aN2 : - ( 3 < DimRHS::rank && aN3 ? aN3 : - ( 4 < DimRHS::rank && aN4 ? aN4 : - ( 5 < DimRHS::rank && aN5 ? aN5 : - ( 6 < DimRHS::rank && aN6 ? aN6 : - ( 7 < DimRHS::rank && aN7 ? aN7 : 0 ))))))) - , 0, 0, 0, 0, 0, 0 ) - , m_stride( ( 1 < DimRHS::rank && aN1 ? rhs.stride_1() : - ( 2 < DimRHS::rank && aN2 ? rhs.stride_2() : - ( 3 < DimRHS::rank && aN3 ? rhs.stride_3() : - ( 4 < DimRHS::rank && aN4 ? rhs.stride_4() : - ( 5 < DimRHS::rank && aN5 ? rhs.stride_5() : - ( 6 < DimRHS::rank && aN6 ? rhs.stride_6() : - ( 7 < DimRHS::rank && aN7 ? rhs.stride_7() : 0 ))))))) ) - { - // This subview must be 2 == rank and 2 == rank_dynamic - // due to only having stride #0. - // The source dimension #0 must be non-zero for stride-one leading dimension. - // At most subsequent dimension can be non-zero. - - static_assert( ( 2 == dimension_type::rank ) && - ( 2 == dimension_type::rank_dynamic ) && - ( 2 <= DimRHS::rank ) - , "ViewOffset subview construction requires compatible rank" ); - } -}; - -//---------------------------------------------------------------------------- -// LayoutRight AND ( 1 >= rank OR 0 == rank_dynamic ) : no padding / striding -template < class Dimension > -struct ViewOffset< Dimension , Kokkos::LayoutRight - , typename std::enable_if<( 1 >= Dimension::rank - || - 0 == Dimension::rank_dynamic - )>::type > -{ - using is_mapping_plugin = std::true_type ; - using is_regular = std::true_type ; - - typedef size_t size_type ; - typedef Dimension dimension_type ; - typedef Kokkos::LayoutRight array_layout ; - - dimension_type m_dim ; - - //---------------------------------------- - - // rank 1 - template< typename I0 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0 ) const { return i0 ; } - - // rank 2 - template < typename I0 , typename I1 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0 , I1 const & i1 ) const - { return i1 + m_dim.N1 * i0 ; } - - //rank 3 - template < typename I0, typename I1, typename I2 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2 ) const - { - return i2 + m_dim.N2 * ( i1 + m_dim.N1 * ( i0 )); - } - - //rank 4 - template < typename I0, typename I1, typename I2, typename I3 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 ) const - { - return i3 + m_dim.N3 * ( - i2 + m_dim.N2 * ( - i1 + m_dim.N1 * ( i0 ))); - } - - //rank 5 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4 ) const - { - return i4 + m_dim.N4 * ( - i3 + m_dim.N3 * ( - i2 + m_dim.N2 * ( - i1 + m_dim.N1 * ( i0 )))); - } - - //rank 6 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5 ) const - { - return i5 + m_dim.N5 * ( - i4 + m_dim.N4 * ( - i3 + m_dim.N3 * ( - i2 + m_dim.N2 * ( - i1 + m_dim.N1 * ( i0 ))))); - } - - //rank 7 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5, typename I6 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5, I6 const & i6 ) const - { - return i6 + m_dim.N6 * ( - i5 + m_dim.N5 * ( - i4 + m_dim.N4 * ( - i3 + m_dim.N3 * ( - i2 + m_dim.N2 * ( - i1 + m_dim.N1 * ( i0 )))))); - } - - //rank 8 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5, typename I6, typename I7 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5, I6 const & i6, I7 const & i7 ) const - { - return i7 + m_dim.N7 * ( - i6 + m_dim.N6 * ( - i5 + m_dim.N5 * ( - i4 + m_dim.N4 * ( - i3 + m_dim.N3 * ( - i2 + m_dim.N2 * ( - i1 + m_dim.N1 * ( i0 ))))))); - } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_0() const { return m_dim.N0 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_1() const { return m_dim.N1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_2() const { return m_dim.N2 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_3() const { return m_dim.N3 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_4() const { return m_dim.N4 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_5() const { return m_dim.N5 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_6() const { return m_dim.N6 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_7() const { return m_dim.N7 ; } - - /* Cardinality of the domain index space */ - KOKKOS_INLINE_FUNCTION - constexpr size_type size() const - { return m_dim.N0 * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 * m_dim.N6 * m_dim.N7 ; } - - /* Span of the range space */ - KOKKOS_INLINE_FUNCTION - constexpr size_type span() const - { return m_dim.N0 * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 * m_dim.N6 * m_dim.N7 ; } - - KOKKOS_INLINE_FUNCTION constexpr bool span_is_contiguous() const { return true ; } - - /* Strides of dimensions */ - KOKKOS_INLINE_FUNCTION constexpr size_type stride_7() const { return 1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_6() const { return m_dim.N7 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_5() const { return m_dim.N7 * m_dim.N6 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_4() const { return m_dim.N7 * m_dim.N6 * m_dim.N5 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_3() const { return m_dim.N7 * m_dim.N6 * m_dim.N5 * m_dim.N4 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_2() const { return m_dim.N7 * m_dim.N6 * m_dim.N5 * m_dim.N4 * m_dim.N3 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_1() const { return m_dim.N7 * m_dim.N6 * m_dim.N5 * m_dim.N4 * m_dim.N3 * m_dim.N2 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_0() const { return m_dim.N7 * m_dim.N6 * m_dim.N5 * m_dim.N4 * m_dim.N3 * m_dim.N2 * m_dim.N1 ; } - - // Stride with [ rank ] value is the total length - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { - size_type n = 1 ; - if ( 7 < dimension_type::rank ) { s[7] = n ; n *= m_dim.N7 ; } - if ( 6 < dimension_type::rank ) { s[6] = n ; n *= m_dim.N6 ; } - if ( 5 < dimension_type::rank ) { s[5] = n ; n *= m_dim.N5 ; } - if ( 4 < dimension_type::rank ) { s[4] = n ; n *= m_dim.N4 ; } - if ( 3 < dimension_type::rank ) { s[3] = n ; n *= m_dim.N3 ; } - if ( 2 < dimension_type::rank ) { s[2] = n ; n *= m_dim.N2 ; } - if ( 1 < dimension_type::rank ) { s[1] = n ; n *= m_dim.N1 ; } - if ( 0 < dimension_type::rank ) { s[0] = n ; } - s[dimension_type::rank] = n * m_dim.N0 ; - } - - //---------------------------------------- - - ViewOffset() = default ; - ViewOffset( const ViewOffset & ) = default ; - ViewOffset & operator = ( const ViewOffset & ) = default ; - - template< unsigned TrivialScalarSize > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( std::integral_constant const & - , size_t aN0 , unsigned aN1 , unsigned aN2 , unsigned aN3 - , unsigned aN4 , unsigned aN5 , unsigned aN6 , unsigned aN7 ) - : m_dim( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - {} - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutRight , void > & rhs ) - : m_dim( rhs.m_dim.N0 , rhs.m_dim.N1 , rhs.m_dim.N2 , rhs.m_dim.N3 - , rhs.m_dim.N4 , rhs.m_dim.N5 , rhs.m_dim.N6 , rhs.m_dim.N7 ) - { - static_assert( int(DimRHS::rank) == int(dimension_type::rank) , "ViewOffset assignment requires equal rank" ); - // Also requires equal static dimensions ... - } - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutLeft , void > & rhs ) - : m_dim( rhs.m_dim.N0, 0, 0, 0, 0, 0, 0, 0 ) - { - static_assert( DimRHS::rank == 1 && dimension_type::rank == 1 && dimension_type::rank_dynamic == 1 - , "ViewOffset LayoutRight and LayoutLeft are only compatible when rank == 1" ); - } - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutStride , void > & rhs ) - : m_dim( rhs.m_dim.N0, 0, 0, 0, 0, 0, 0, 0 ) - { - static_assert( DimRHS::rank == 1 && dimension_type::rank == 1 && dimension_type::rank_dynamic == 1 - , "ViewOffset LayoutLeft and LayoutStride are only compatible when rank == 1" ); - if ( rhs.m_stride.S0 != 1 ) { - Kokkos::abort("Kokkos::Experimental::ViewOffset assignment of LayoutRight from LayoutStride requires stride == 1" ); - } - } - - //---------------------------------------- - // Subview construction - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutRight , void > & rhs - , const size_t n0 - , const size_t - , const size_t - , const size_t - , const size_t - , const size_t - , const size_t - , const size_t - ) - : m_dim( n0, 0, 0, 0, 0, 0, 0, 0 ) - { - static_assert( ( 0 == dimension_type::rank ) || - ( 1 == dimension_type::rank && 1 == dimension_type::rank_dynamic && 1 <= DimRHS::rank ) - , "ViewOffset subview construction requires compatible rank" ); - } -}; - -//---------------------------------------------------------------------------- -// LayoutRight AND ( 1 < rank AND 0 < rank_dynamic ) : has padding / striding -template < class Dimension > -struct ViewOffset< Dimension , Kokkos::LayoutRight - , typename std::enable_if<( 1 < Dimension::rank - && - 0 < Dimension::rank_dynamic - )>::type > -{ - using is_mapping_plugin = std::true_type ; - using is_regular = std::true_type ; - - typedef size_t size_type ; - typedef Dimension dimension_type ; - typedef Kokkos::LayoutRight array_layout ; - - dimension_type m_dim ; - size_type m_stride ; - - //---------------------------------------- - - // rank 1 - template< typename I0 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0 ) const { return i0 ; } - - // rank 2 - template < typename I0 , typename I1 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0 , I1 const & i1 ) const - { return i1 + i0 * m_stride ; } - - //rank 3 - template < typename I0, typename I1, typename I2 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2 ) const - { return i2 + m_dim.N2 * ( i1 ) + i0 * m_stride ; } - - //rank 4 - template < typename I0, typename I1, typename I2, typename I3 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 ) const - { - return i3 + m_dim.N3 * ( - i2 + m_dim.N2 * ( i1 )) + - i0 * m_stride ; - } - - //rank 5 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4 ) const - { - return i4 + m_dim.N4 * ( - i3 + m_dim.N3 * ( - i2 + m_dim.N2 * ( i1 ))) + - i0 * m_stride ; - } - - //rank 6 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5 ) const - { - return i5 + m_dim.N5 * ( - i4 + m_dim.N4 * ( - i3 + m_dim.N3 * ( - i2 + m_dim.N2 * ( i1 )))) + - i0 * m_stride ; - } - - //rank 7 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5, typename I6 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5, I6 const & i6 ) const - { - return i6 + m_dim.N6 * ( - i5 + m_dim.N5 * ( - i4 + m_dim.N4 * ( - i3 + m_dim.N3 * ( - i2 + m_dim.N2 * ( i1 ))))) + - i0 * m_stride ; - } - - //rank 8 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5, typename I6, typename I7 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5, I6 const & i6, I7 const & i7 ) const - { - return i7 + m_dim.N7 * ( - i6 + m_dim.N6 * ( - i5 + m_dim.N5 * ( - i4 + m_dim.N4 * ( - i3 + m_dim.N3 * ( - i2 + m_dim.N2 * ( i1 )))))) + - i0 * m_stride ; - } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_0() const { return m_dim.N0 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_1() const { return m_dim.N1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_2() const { return m_dim.N2 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_3() const { return m_dim.N3 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_4() const { return m_dim.N4 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_5() const { return m_dim.N5 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_6() const { return m_dim.N6 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_7() const { return m_dim.N7 ; } - - /* Cardinality of the domain index space */ - KOKKOS_INLINE_FUNCTION - constexpr size_type size() const - { return m_dim.N0 * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 * m_dim.N6 * m_dim.N7 ; } - - /* Span of the range space */ - KOKKOS_INLINE_FUNCTION - constexpr size_type span() const - { return m_dim.N0 * m_stride ; } - - KOKKOS_INLINE_FUNCTION constexpr bool span_is_contiguous() const - { return m_stride == m_dim.N7 * m_dim.N6 * m_dim.N5 * m_dim.N4 * m_dim.N3 * m_dim.N2 * m_dim.N1 ; } - - /* Strides of dimensions */ - KOKKOS_INLINE_FUNCTION constexpr size_type stride_7() const { return 1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_6() const { return m_dim.N7 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_5() const { return m_dim.N7 * m_dim.N6 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_4() const { return m_dim.N7 * m_dim.N6 * m_dim.N5 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_3() const { return m_dim.N7 * m_dim.N6 * m_dim.N5 * m_dim.N4 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_2() const { return m_dim.N7 * m_dim.N6 * m_dim.N5 * m_dim.N4 * m_dim.N3 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_1() const { return m_dim.N7 * m_dim.N6 * m_dim.N5 * m_dim.N4 * m_dim.N3 * m_dim.N2 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_0() const { return m_stride ; } - - // Stride with [ rank ] value is the total length - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { - size_type n = 1 ; - if ( 7 < dimension_type::rank ) { s[7] = n ; n *= m_dim.N7 ; } - if ( 6 < dimension_type::rank ) { s[6] = n ; n *= m_dim.N6 ; } - if ( 5 < dimension_type::rank ) { s[5] = n ; n *= m_dim.N5 ; } - if ( 4 < dimension_type::rank ) { s[4] = n ; n *= m_dim.N4 ; } - if ( 3 < dimension_type::rank ) { s[3] = n ; n *= m_dim.N3 ; } - if ( 2 < dimension_type::rank ) { s[2] = n ; n *= m_dim.N2 ; } - if ( 1 < dimension_type::rank ) { s[1] = n ; } - if ( 0 < dimension_type::rank ) { s[0] = m_stride ; } - s[dimension_type::rank] = m_stride * m_dim.N0 ; - } - - //---------------------------------------- - -private: - - template< unsigned TrivialScalarSize > - struct Padding { - enum { div = TrivialScalarSize == 0 ? 0 : Kokkos::Impl::MEMORY_ALIGNMENT / ( TrivialScalarSize ? TrivialScalarSize : 1 ) }; - enum { mod = TrivialScalarSize == 0 ? 0 : Kokkos::Impl::MEMORY_ALIGNMENT % ( TrivialScalarSize ? TrivialScalarSize : 1 ) }; - - // If memory alignment is a multiple of the trivial scalar size then attempt to align. - enum { align = 0 != TrivialScalarSize && 0 == mod ? div : 0 }; - enum { div_ok = div ? div : 1 }; // To valid modulo zero in constexpr - - KOKKOS_INLINE_FUNCTION - static constexpr size_t stride( size_t const N ) - { - return ( align && ( Kokkos::Impl::MEMORY_ALIGNMENT_THRESHOLD * align < N ) && ( N % div_ok ) ) - ? N + align - ( N % div_ok ) : N ; - } - }; - -public: - - ViewOffset() = default ; - ViewOffset( const ViewOffset & ) = default ; - ViewOffset & operator = ( const ViewOffset & ) = default ; - - /* Enable padding for trivial scalar types with non-zero trivial scalar size. */ - template< unsigned TrivialScalarSize > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( std::integral_constant const & padding_type_size - , size_t aN0 , unsigned aN1 , unsigned aN2 , unsigned aN3 - , unsigned aN4 , unsigned aN5 , unsigned aN6 , unsigned aN7 ) - : m_dim( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - , m_stride( Padding:: - stride( /* 2 <= rank */ - m_dim.N1 * ( dimension_type::rank == 2 ? 1 : - m_dim.N2 * ( dimension_type::rank == 3 ? 1 : - m_dim.N3 * ( dimension_type::rank == 4 ? 1 : - m_dim.N4 * ( dimension_type::rank == 5 ? 1 : - m_dim.N5 * ( dimension_type::rank == 6 ? 1 : - m_dim.N6 * ( dimension_type::rank == 7 ? 1 : m_dim.N7 )))))) )) - {} - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutLeft , void > & rhs ) - : m_dim( rhs.m_dim.N0 , rhs.m_dim.N1 , rhs.m_dim.N2 , rhs.m_dim.N3 - , rhs.m_dim.N4 , rhs.m_dim.N5 , rhs.m_dim.N6 , rhs.m_dim.N7 ) - , m_stride( rhs.stride_0() ) - { - static_assert( int(DimRHS::rank) == int(dimension_type::rank) , "ViewOffset assignment requires equal rank" ); - // Also requires equal static dimensions ... - } - - //---------------------------------------- - // Subview construction - // Last dimension must be non-zero - - template< class DimRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , Kokkos::LayoutRight , void > & rhs - , const size_t aN0 - , const size_t aN1 - , const size_t aN2 - , const size_t aN3 - , const size_t aN4 - , const size_t aN5 - , const size_t aN6 - , const size_t aN7 - ) - : m_dim( // N0 == First non-zero dimension before the last dimension. - ( 1 < DimRHS::rank && aN0 ? aN0 : - ( 2 < DimRHS::rank && aN1 ? aN1 : - ( 3 < DimRHS::rank && aN2 ? aN2 : - ( 4 < DimRHS::rank && aN3 ? aN3 : - ( 5 < DimRHS::rank && aN4 ? aN4 : - ( 6 < DimRHS::rank && aN5 ? aN5 : - ( 7 < DimRHS::rank && aN6 ? aN6 : 0 ))))))) - , // N1 == Last dimension. - ( 2 == DimRHS::rank ? aN1 : - ( 3 == DimRHS::rank ? aN2 : - ( 4 == DimRHS::rank ? aN3 : - ( 5 == DimRHS::rank ? aN4 : - ( 6 == DimRHS::rank ? aN5 : - ( 7 == DimRHS::rank ? aN6 : aN7 )))))) - , 0, 0, 0, 0, 0, 0 ) - , m_stride( ( 1 < DimRHS::rank && aN0 ? rhs.stride_0() : - ( 2 < DimRHS::rank && aN1 ? rhs.stride_1() : - ( 3 < DimRHS::rank && aN2 ? rhs.stride_2() : - ( 4 < DimRHS::rank && aN3 ? rhs.stride_3() : - ( 5 < DimRHS::rank && aN4 ? rhs.stride_4() : - ( 6 < DimRHS::rank && aN5 ? rhs.stride_5() : - ( 7 < DimRHS::rank && aN6 ? rhs.stride_6() : 0 ))))))) ) - { - // This subview must be 2 == rank and 2 == rank_dynamic - // due to only having stride #0. - // The source dimension #0 must be non-zero for stride-one leading dimension. - // At most subsequent dimension can be non-zero. - - static_assert( ( 2 == dimension_type::rank ) && - ( 2 == dimension_type::rank_dynamic ) && - ( 2 <= DimRHS::rank ) - , "ViewOffset subview construction requires compatible rank" ); - } -}; - -//---------------------------------------------------------------------------- -/* Strided array layout only makes sense for 0 < rank */ - -template< unsigned Rank > -struct ViewStride ; - -template<> -struct ViewStride<1> { - size_t S0 ; - enum { S1 = 0 , S2 = 0 , S3 = 0 , S4 = 0 , S5 = 0 , S6 = 0 , S7 = 0 }; - - ViewStride() = default ; - ViewStride( const ViewStride & ) = default ; - ViewStride & operator = ( const ViewStride & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewStride( size_t aS0 , size_t , size_t , size_t - , size_t , size_t , size_t , size_t ) - : S0( aS0 ) - {} -}; - -template<> -struct ViewStride<2> { - size_t S0 , S1 ; - enum { S2 = 0 , S3 = 0 , S4 = 0 , S5 = 0 , S6 = 0 , S7 = 0 }; - - ViewStride() = default ; - ViewStride( const ViewStride & ) = default ; - ViewStride & operator = ( const ViewStride & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewStride( size_t aS0 , size_t aS1 , size_t , size_t - , size_t , size_t , size_t , size_t ) - : S0( aS0 ) , S1( aS1 ) - {} -}; - -template<> -struct ViewStride<3> { - size_t S0 , S1 , S2 ; - enum { S3 = 0 , S4 = 0 , S5 = 0 , S6 = 0 , S7 = 0 }; - - ViewStride() = default ; - ViewStride( const ViewStride & ) = default ; - ViewStride & operator = ( const ViewStride & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewStride( size_t aS0 , size_t aS1 , size_t aS2 , size_t - , size_t , size_t , size_t , size_t ) - : S0( aS0 ) , S1( aS1 ) , S2( aS2 ) - {} -}; - -template<> -struct ViewStride<4> { - size_t S0 , S1 , S2 , S3 ; - enum { S4 = 0 , S5 = 0 , S6 = 0 , S7 = 0 }; - - ViewStride() = default ; - ViewStride( const ViewStride & ) = default ; - ViewStride & operator = ( const ViewStride & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewStride( size_t aS0 , size_t aS1 , size_t aS2 , size_t aS3 - , size_t , size_t , size_t , size_t ) - : S0( aS0 ) , S1( aS1 ) , S2( aS2 ) , S3( aS3 ) - {} -}; - -template<> -struct ViewStride<5> { - size_t S0 , S1 , S2 , S3 , S4 ; - enum { S5 = 0 , S6 = 0 , S7 = 0 }; - - ViewStride() = default ; - ViewStride( const ViewStride & ) = default ; - ViewStride & operator = ( const ViewStride & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewStride( size_t aS0 , size_t aS1 , size_t aS2 , size_t aS3 - , size_t aS4 , size_t , size_t , size_t ) - : S0( aS0 ) , S1( aS1 ) , S2( aS2 ) , S3( aS3 ) - , S4( aS4 ) - {} -}; - -template<> -struct ViewStride<6> { - size_t S0 , S1 , S2 , S3 , S4 , S5 ; - enum { S6 = 0 , S7 = 0 }; - - ViewStride() = default ; - ViewStride( const ViewStride & ) = default ; - ViewStride & operator = ( const ViewStride & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewStride( size_t aS0 , size_t aS1 , size_t aS2 , size_t aS3 - , size_t aS4 , size_t aS5 , size_t , size_t ) - : S0( aS0 ) , S1( aS1 ) , S2( aS2 ) , S3( aS3 ) - , S4( aS4 ) , S5( aS5 ) - {} -}; - -template<> -struct ViewStride<7> { - size_t S0 , S1 , S2 , S3 , S4 , S5 , S6 ; - enum { S7 = 0 }; - - ViewStride() = default ; - ViewStride( const ViewStride & ) = default ; - ViewStride & operator = ( const ViewStride & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewStride( size_t aS0 , size_t aS1 , size_t aS2 , size_t aS3 - , size_t aS4 , size_t aS5 , size_t aS6 , size_t ) - : S0( aS0 ) , S1( aS1 ) , S2( aS2 ) , S3( aS3 ) - , S4( aS4 ) , S5( aS5 ) , S6( aS6 ) - {} -}; - -template<> -struct ViewStride<8> { - size_t S0 , S1 , S2 , S3 , S4 , S5 , S6 , S7 ; - - ViewStride() = default ; - ViewStride( const ViewStride & ) = default ; - ViewStride & operator = ( const ViewStride & ) = default ; - - KOKKOS_INLINE_FUNCTION - constexpr ViewStride( size_t aS0 , size_t aS1 , size_t aS2 , size_t aS3 - , size_t aS4 , size_t aS5 , size_t aS6 , size_t aS7 ) - : S0( aS0 ) , S1( aS1 ) , S2( aS2 ) , S3( aS3 ) - , S4( aS4 ) , S5( aS5 ) , S6( aS6 ) , S7( aS7 ) - {} -}; - -template < class Dimension > -struct ViewOffset< Dimension , Kokkos::LayoutStride - , typename std::enable_if<( 0 < Dimension::rank )>::type > -{ -private: - typedef ViewStride< Dimension::rank > stride_type ; -public: - - using is_mapping_plugin = std::true_type ; - using is_regular = std::true_type ; - - typedef size_t size_type ; - typedef Dimension dimension_type ; - typedef Kokkos::LayoutStride array_layout ; - - dimension_type m_dim ; - stride_type m_stride ; - - //---------------------------------------- - - // rank 1 - template< typename I0 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0 ) const - { - return i0 * m_stride.S0 ; - } - - // rank 2 - template < typename I0 , typename I1 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0 , I1 const & i1 ) const - { - return i0 * m_stride.S0 + - i1 * m_stride.S1 ; - } - - //rank 3 - template < typename I0, typename I1, typename I2 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2 ) const - { - return i0 * m_stride.S0 + - i1 * m_stride.S1 + - i2 * m_stride.S2 ; - } - - //rank 4 - template < typename I0, typename I1, typename I2, typename I3 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 ) const - { - return i0 * m_stride.S0 + - i1 * m_stride.S1 + - i2 * m_stride.S2 + - i3 * m_stride.S3 ; - } - - //rank 5 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4 ) const - { - return i0 * m_stride.S0 + - i1 * m_stride.S1 + - i2 * m_stride.S2 + - i3 * m_stride.S3 + - i4 * m_stride.S4 ; - } - - //rank 6 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5 ) const - { - return i0 * m_stride.S0 + - i1 * m_stride.S1 + - i2 * m_stride.S2 + - i3 * m_stride.S3 + - i4 * m_stride.S4 + - i5 * m_stride.S5 ; - } - - //rank 7 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5, typename I6 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5, I6 const & i6 ) const - { - return i0 * m_stride.S0 + - i1 * m_stride.S1 + - i2 * m_stride.S2 + - i3 * m_stride.S3 + - i4 * m_stride.S4 + - i5 * m_stride.S5 + - i6 * m_stride.S6 ; - } - - //rank 8 - template < typename I0, typename I1, typename I2, typename I3 - , typename I4, typename I5, typename I6, typename I7 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0, I1 const & i1, I2 const & i2, I3 const & i3 - , I4 const & i4, I5 const & i5, I6 const & i6, I7 const & i7 ) const - { - return i0 * m_stride.S0 + - i1 * m_stride.S1 + - i2 * m_stride.S2 + - i3 * m_stride.S3 + - i4 * m_stride.S4 + - i5 * m_stride.S5 + - i6 * m_stride.S6 + - i7 * m_stride.S7 ; - } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_0() const { return m_dim.N0 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_1() const { return m_dim.N1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_2() const { return m_dim.N2 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_3() const { return m_dim.N3 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_4() const { return m_dim.N4 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_5() const { return m_dim.N5 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_6() const { return m_dim.N6 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type dimension_7() const { return m_dim.N7 ; } - - /* Cardinality of the domain index space */ - KOKKOS_INLINE_FUNCTION - constexpr size_type size() const - { return m_dim.N0 * m_dim.N1 * m_dim.N2 * m_dim.N3 * m_dim.N4 * m_dim.N5 * m_dim.N6 * m_dim.N7 ; } - -private: - - KOKKOS_INLINE_FUNCTION - static constexpr size_type Max( size_type lhs , size_type rhs ) - { return lhs < rhs ? rhs : lhs ; } - -public: - - /* Span of the range space, largest stride * dimension */ - KOKKOS_INLINE_FUNCTION - constexpr size_type span() const - { - return Max( m_dim.N0 * m_stride.S0 , - Max( m_dim.N1 * m_stride.S1 , - Max( m_dim.N2 * m_stride.S2 , - Max( m_dim.N3 * m_stride.S3 , - Max( m_dim.N4 * m_stride.S4 , - Max( m_dim.N5 * m_stride.S5 , - Max( m_dim.N6 * m_stride.S6 , - m_dim.N7 * m_stride.S7 ))))))); - } - - KOKKOS_INLINE_FUNCTION constexpr bool span_is_contiguous() const { return span() == size(); } - - /* Strides of dimensions */ - KOKKOS_INLINE_FUNCTION constexpr size_type stride_0() const { return m_stride.S0 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_1() const { return m_stride.S1 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_2() const { return m_stride.S2 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_3() const { return m_stride.S3 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_4() const { return m_stride.S4 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_5() const { return m_stride.S5 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_6() const { return m_stride.S6 ; } - KOKKOS_INLINE_FUNCTION constexpr size_type stride_7() const { return m_stride.S7 ; } - - // Stride with [ rank ] value is the total length - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { - if ( 0 < dimension_type::rank ) { s[0] = m_stride.S0 ; } - if ( 1 < dimension_type::rank ) { s[1] = m_stride.S1 ; } - if ( 2 < dimension_type::rank ) { s[2] = m_stride.S2 ; } - if ( 3 < dimension_type::rank ) { s[3] = m_stride.S3 ; } - if ( 4 < dimension_type::rank ) { s[4] = m_stride.S4 ; } - if ( 5 < dimension_type::rank ) { s[5] = m_stride.S5 ; } - if ( 6 < dimension_type::rank ) { s[6] = m_stride.S6 ; } - if ( 7 < dimension_type::rank ) { s[7] = m_stride.S7 ; } - s[dimension_type::rank] = span(); - } - - //---------------------------------------- - - ViewOffset() = default ; - ViewOffset( const ViewOffset & ) = default ; - ViewOffset & operator = ( const ViewOffset & ) = default ; - - KOKKOS_INLINE_FUNCTION - ViewOffset( const Kokkos::LayoutStride & rhs ) - : m_dim( rhs.dimension[0] , rhs.dimension[1] , rhs.dimension[2] , rhs.dimension[3] - , rhs.dimension[4] , rhs.dimension[5] , rhs.dimension[6] , rhs.dimension[7] ) - , m_stride( rhs.stride[0] , rhs.stride[1] , rhs.stride[2] , rhs.stride[3] - , rhs.stride[4] , rhs.stride[5] , rhs.stride[6] , rhs.stride[7] ) - {} - - template< class DimRHS , class LayoutRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , LayoutRHS , void > & rhs ) - : m_dim( rhs.m_dim.N0 , rhs.m_dim.N1 , rhs.m_dim.N2 , rhs.m_dim.N3 - , rhs.m_dim.N4 , rhs.m_dim.N5 , rhs.m_dim.N6 , rhs.m_dim.N7 ) - , m_stride( rhs.stride_0() , rhs.stride_1() , rhs.stride_2() , rhs.stride_3() - , rhs.stride_4() , rhs.stride_5() , rhs.stride_6() , rhs.stride_7() ) - { - static_assert( int(DimRHS::rank) == int(dimension_type::rank) , "ViewOffset assignment requires equal rank" ); - // Also requires equal static dimensions ... - } - - //---------------------------------------- - // Subview construction - -private: - - KOKKOS_INLINE_FUNCTION - static constexpr unsigned - count_non_zero( const size_t aN0 = 0 - , const size_t aN1 = 0 - , const size_t aN2 = 0 - , const size_t aN3 = 0 - , const size_t aN4 = 0 - , const size_t aN5 = 0 - , const size_t aN6 = 0 - , const size_t aN7 = 0 - ) - { - return ( aN0 ? 1 : 0 ) + - ( aN1 ? 1 : 0 ) + - ( aN2 ? 1 : 0 ) + - ( aN3 ? 1 : 0 ) + - ( aN4 ? 1 : 0 ) + - ( aN5 ? 1 : 0 ) + - ( aN6 ? 1 : 0 ) + - ( aN7 ? 1 : 0 ); - } - - template< unsigned Rank , unsigned I > - KOKKOS_INLINE_FUNCTION - static constexpr size_t - get_non_zero( const size_t aN0 - , const size_t aN1 - , const size_t aN2 - , const size_t aN3 - , const size_t aN4 - , const size_t aN5 - , const size_t aN6 - , const size_t aN7 - ) - { - return ( 0 < Rank && I < 1 && aN0 ? aN0 : - ( 1 < Rank && I < 2 && I == count_non_zero(aN0) && aN1 ? aN1 : - ( 2 < Rank && I < 3 && I == count_non_zero(aN0,aN1) && aN2 ? aN2 : - ( 3 < Rank && I < 4 && I == count_non_zero(aN0,aN1,aN2) && aN3 ? aN3 : - ( 4 < Rank && I < 5 && I == count_non_zero(aN0,aN1,aN2,aN3) && aN4 ? aN4 : - ( 5 < Rank && I < 6 && I == count_non_zero(aN0,aN1,aN2,aN3,aN4) && aN5 ? aN5 : - ( 6 < Rank && I < 7 && I == count_non_zero(aN0,aN1,aN2,aN3,aN4,aN5) && aN6 ? aN6 : - ( 7 < Rank && I < 8 && I == count_non_zero(aN0,aN1,aN2,aN3,aN4,aN5,aN6) && aN7 ? aN7 : 0 )))))))); - } - - template< unsigned Rank , unsigned I , class DimRHS , class LayoutRHS > - KOKKOS_INLINE_FUNCTION - static constexpr size_t - get_non_zero( const size_t aN0 , const size_t aN1 , const size_t aN2 , const size_t aN3 - , const size_t aN4 , const size_t aN5 , const size_t aN6 , const size_t aN7 - , const ViewOffset< DimRHS , LayoutRHS , void > & rhs ) - { - return ( 0 < Rank && I < 1 && aN0 ? rhs.stride_0() : - ( 1 < Rank && I < 2 && I == count_non_zero(aN0) && aN1 ? rhs.stride_1() : - ( 2 < Rank && I < 3 && I == count_non_zero(aN0,aN1) && aN2 ? rhs.stride_2() : - ( 3 < Rank && I < 4 && I == count_non_zero(aN0,aN1,aN2) && aN3 ? rhs.stride_3() : - ( 4 < Rank && I < 5 && I == count_non_zero(aN0,aN1,aN2,aN3) && aN4 ? rhs.stride_4() : - ( 5 < Rank && I < 6 && I == count_non_zero(aN0,aN1,aN2,aN3,aN4) && aN5 ? rhs.stride_5() : - ( 6 < Rank && I < 7 && I == count_non_zero(aN0,aN1,aN2,aN3,aN4,aN5) && aN6 ? rhs.stride_6() : - ( 7 < Rank && I < 8 && I == count_non_zero(aN0,aN1,aN2,aN3,aN4,aN5,aN6) && aN7 ? rhs.stride_7() : 0 )))))))); - } - - -public: - - template< class DimRHS , class LayoutRHS > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( const ViewOffset< DimRHS , LayoutRHS , void > & rhs - , const size_t aN0 - , const size_t aN1 - , const size_t aN2 - , const size_t aN3 - , const size_t aN4 - , const size_t aN5 - , const size_t aN6 - , const size_t aN7 - ) - // Contract the non-zero dimensions - : m_dim( ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7 ) - ) - , m_stride( ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7, rhs ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7, rhs ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7, rhs ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7, rhs ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7, rhs ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7, rhs ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7, rhs ) - , ViewOffset::template get_non_zero( aN0, aN1, aN2, aN3, aN4, aN5, aN6, aN7, rhs ) - ) - { - } - - //---------------------------------------- -}; - -}}} // namespace Kokkos::Experimental::Impl - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -struct ALL_t { - KOKKOS_INLINE_FUNCTION - constexpr const ALL_t & operator()() const { return *this ; } -}; - -template< class T > -struct ViewOffsetRange { - - static_assert( std::is_integral::value , "Non-range must be an integral type" ); - - enum { is_range = false }; - - KOKKOS_INLINE_FUNCTION static - size_t dimension( size_t const , T const & ) { return 0 ; } - - KOKKOS_INLINE_FUNCTION static - size_t begin( T const & i ) { return size_t(i) ; } -}; - -template<> -struct ViewOffsetRange { - enum { is_range = false }; -}; - -template<> -struct ViewOffsetRange< Kokkos::Experimental::Impl::ALL_t > { - enum { is_range = true }; - - KOKKOS_INLINE_FUNCTION static - size_t dimension( size_t const n , Experimental::Impl::ALL_t const & ) { return n ; } - - KOKKOS_INLINE_FUNCTION static - size_t begin( Experimental::Impl::ALL_t const & ) { return 0 ; } -}; - -template< typename iType > -struct ViewOffsetRange< std::pair > { - - static_assert( std::is_integral::value , "Range bounds must be an integral type" ); - - enum { is_range = true }; - - KOKKOS_INLINE_FUNCTION static - size_t dimension( size_t const n , std::pair const & r ) - { return ( size_t(r.first) < size_t(r.second) && size_t(r.second) <= n ) ? size_t(r.second) - size_t(r.first) : 0 ; } - - KOKKOS_INLINE_FUNCTION static - size_t begin( std::pair const & r ) { return size_t(r.first) ; } -}; - -template< typename iType > -struct ViewOffsetRange< Kokkos::pair > { - - static_assert( std::is_integral::value , "Range bounds must be an integral type" ); - - enum { is_range = true }; - - KOKKOS_INLINE_FUNCTION static - size_t dimension( size_t const n , Kokkos::pair const & r ) - { return ( size_t(r.first) < size_t(r.second) && size_t(r.second) <= n ) ? size_t(r.second) - size_t(r.first) : 0 ; } - - KOKKOS_INLINE_FUNCTION static - size_t begin( Kokkos::pair const & r ) { return size_t(r.first) ; } -}; - -template< typename iType > -struct ViewOffsetRange< std::initializer_list< iType > > { - - static_assert( std::is_integral::value , "Range bounds must be an integral type" ); - - enum { is_range = true }; - - KOKKOS_INLINE_FUNCTION static - size_t dimension( size_t const n , std::initializer_list< iType > const & r ) - { - return ( size_t(r.begin()[0]) < size_t(r.begin()[1]) && size_t(r.begin()[1]) <= n ) - ? size_t(r.begin()[1]) - size_t(r.begin()[0]) : 0 ; - } - - KOKKOS_INLINE_FUNCTION static - size_t begin( std::initializer_list< iType > const & r ) { return size_t(r.begin()[0]) ; } -}; - -}}} // namespace Kokkos::Experimental::Impl - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -/** \brief ViewDataHandle provides the type of the 'data handle' which the view - * uses to access data with the [] operator. It also provides - * an allocate function and a function to extract a raw ptr from the - * data handle. ViewDataHandle also defines an enum ReferenceAble which - * specifies whether references/pointers to elements can be taken and a - * 'return_type' which is what the view operators will give back. - * Specialisation of this object allows three things depending - * on ViewTraits and compiler options: - * (i) Use special allocator (e.g. huge pages/small pages and pinned memory) - * (ii) Use special data handle type (e.g. add Cuda Texture Object) - * (iii) Use special access intrinsics (e.g. texture fetch and non-caching loads) - */ -template< class Traits , class Enable = void > -struct ViewDataHandle { - - typedef typename Traits::value_type value_type ; - typedef typename Traits::value_type * handle_type ; - typedef typename Traits::value_type & return_type ; - typedef Kokkos::Experimental::Impl::SharedAllocationTracker track_type ; - - KOKKOS_INLINE_FUNCTION - static handle_type assign( value_type * arg_data_ptr - , track_type const & /*arg_tracker*/ ) - { - return handle_type( arg_data_ptr ); - } -}; - -template< class Traits > -struct ViewDataHandle< Traits , - typename std::enable_if<( std::is_same< typename Traits::non_const_value_type - , typename Traits::value_type >::value - && - std::is_same< typename Traits::specialize , void >::value - && - Traits::memory_traits::Atomic - )>::type > -{ - typedef typename Traits::value_type value_type ; - typedef typename Kokkos::Impl::AtomicViewDataHandle< Traits > handle_type ; - typedef typename Kokkos::Impl::AtomicDataElement< Traits > return_type ; - typedef Kokkos::Experimental::Impl::SharedAllocationTracker track_type ; - - KOKKOS_INLINE_FUNCTION - static handle_type assign( value_type * arg_data_ptr - , track_type const & /*arg_tracker*/ ) - { - return handle_type( arg_data_ptr ); - } -}; - -}}} // namespace Kokkos::Experimental::Impl - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -template< class Traits - , bool R0 = false - , bool R1 = false - , bool R2 = false - , bool R3 = false - , bool R4 = false - , bool R5 = false - , bool R6 = false - , bool R7 = false - , typename Enable = void > -struct SubviewMapping ; - -/** \brief View mapping for non-specialized data type and standard layout */ -template< class Traits > -class ViewMapping< Traits , void , - typename std::enable_if<( - std::is_same< typename Traits::specialize , void >::value - && - ViewOffset< typename Traits::dimension - , typename Traits::array_layout - , void >::is_mapping_plugin::value - )>::type > -{ -private: - - template< class , class , typename > friend class ViewMapping ; - template< class , bool , bool , bool , bool , bool , bool , bool , bool , class > friend struct SubviewMapping ; - template< class , class , class , class > friend class Kokkos::Experimental::View ; - - typedef ViewOffset< typename Traits::dimension - , typename Traits::array_layout - , void - > offset_type ; - - typedef typename ViewDataHandle< Traits >::handle_type handle_type ; - - handle_type m_handle ; - offset_type m_offset ; - - KOKKOS_INLINE_FUNCTION - ViewMapping( const handle_type & arg_handle , const offset_type & arg_offset ) - : m_handle( arg_handle ) - , m_offset( arg_offset ) - {} - -public: - - //---------------------------------------- - // Domain dimensions - - enum { Rank = Traits::dimension::rank }; - - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_0() const { return m_offset.dimension_0(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_1() const { return m_offset.dimension_1(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_2() const { return m_offset.dimension_2(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_3() const { return m_offset.dimension_3(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_4() const { return m_offset.dimension_4(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_5() const { return m_offset.dimension_5(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_6() const { return m_offset.dimension_6(); } - KOKKOS_INLINE_FUNCTION constexpr size_t dimension_7() const { return m_offset.dimension_7(); } - - // Is a regular layout with uniform striding for each index. - using is_regular = typename offset_type::is_regular ; - - KOKKOS_INLINE_FUNCTION constexpr size_t stride_0() const { return m_offset.stride_0(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_1() const { return m_offset.stride_1(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_2() const { return m_offset.stride_2(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_3() const { return m_offset.stride_3(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_4() const { return m_offset.stride_4(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_5() const { return m_offset.stride_5(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_6() const { return m_offset.stride_6(); } - KOKKOS_INLINE_FUNCTION constexpr size_t stride_7() const { return m_offset.stride_7(); } - - //---------------------------------------- - // Range span - - /** \brief Span of the mapped range */ - KOKKOS_INLINE_FUNCTION constexpr size_t span() const { return m_offset.span(); } - - /** \brief Is the mapped range span contiguous */ - KOKKOS_INLINE_FUNCTION constexpr bool span_is_contiguous() const { return m_offset.span_is_contiguous(); } - - typedef typename ViewDataHandle< Traits >::return_type reference_type ; - - /** \brief If data references are lvalue_reference than can query pointer to memory */ - KOKKOS_INLINE_FUNCTION constexpr typename Traits::value_type * data() const - { - typedef typename Traits::value_type * ptr_type ; - - return std::is_lvalue_reference< reference_type >::value - ? (ptr_type) m_handle - : (ptr_type) 0 ; - } - - //---------------------------------------- - // The View class performs all rank and bounds checking before - // calling these element reference methods. - - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference() const { return m_handle[0]; } - - template< typename I0 > - KOKKOS_FORCEINLINE_FUNCTION - typename - std::enable_if< std::is_integral::value && - ! std::is_same< typename Traits::array_layout , Kokkos::LayoutStride >::value - , reference_type >::type - reference( const I0 & i0 ) const { return m_handle[i0]; } - - template< typename I0 > - KOKKOS_FORCEINLINE_FUNCTION - typename - std::enable_if< std::is_integral::value && - std::is_same< typename Traits::array_layout , Kokkos::LayoutStride >::value - , reference_type >::type - reference( const I0 & i0 ) const { return m_handle[ m_offset(i0) ]; } - - template< typename I0 , typename I1 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 ) const - { return m_handle[ m_offset(i0,i1) ]; } - - template< typename I0 , typename I1 , typename I2 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 ) const - { return m_handle[ m_offset(i0,i1,i2) ]; } - - template< typename I0 , typename I1 , typename I2 , typename I3 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 ) const - { return m_handle[ m_offset(i0,i1,i2,i3) ]; } - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 ) const - { return m_handle[ m_offset(i0,i1,i2,i3,i4) ]; } - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 , typename I5 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 , const I5 & i5 ) const - { return m_handle[ m_offset(i0,i1,i2,i3,i4,i5) ]; } - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 , typename I5 , typename I6 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 , const I5 & i5 , const I6 & i6 ) const - { return m_handle[ m_offset(i0,i1,i2,i3,i4,i5,i6) ]; } - - template< typename I0 , typename I1 , typename I2 , typename I3 - , typename I4 , typename I5 , typename I6 , typename I7 > - KOKKOS_FORCEINLINE_FUNCTION - reference_type reference( const I0 & i0 , const I1 & i1 , const I2 & i2 , const I3 & i3 - , const I4 & i4 , const I5 & i5 , const I6 & i6 , const I7 & i7 ) const - { return m_handle[ m_offset(i0,i1,i2,i3,i4,i5,i6,i7) ]; } - - //---------------------------------------- - -private: - - enum { MemorySpanMask = 8 - 1 /* Force alignment on 8 byte boundary */ }; - enum { MemorySpanSize = sizeof(typename Traits::value_type) }; - -public: - - /** \brief Span, in bytes, of the referenced memory */ - KOKKOS_INLINE_FUNCTION constexpr size_t memory_span() const - { - return ( m_offset.span() * sizeof(typename Traits::value_type) + MemorySpanMask ) & ~size_t(MemorySpanMask); - } - - /** \brief Span, in bytes, of the required memory */ - template< bool AllowPadding > - KOKKOS_INLINE_FUNCTION - static constexpr size_t memory_span( const std::integral_constant & - , const size_t N0 , const size_t N1 , const size_t N2 , const size_t N3 - , const size_t N4 , const size_t N5 , const size_t N6 , const size_t N7 ) - { - typedef std::integral_constant< unsigned , AllowPadding ? MemorySpanSize : 0 > padding ; - return ( offset_type( padding(), N0, N1, N2, N3, N4, N5, N6, N7 ).span() * MemorySpanSize + MemorySpanMask ) & ~size_t(MemorySpanMask); - } - - /** \brief Span, in bytes, of the required memory */ - template< bool AllowPadding > - KOKKOS_INLINE_FUNCTION - static constexpr size_t memory_span( const std::integral_constant & - , const typename Traits::array_layout & layout ) - { - return ( offset_type( layout ).span() * MemorySpanSize + MemorySpanMask ) & ~size_t(MemorySpanMask); - } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION ~ViewMapping() {} - KOKKOS_INLINE_FUNCTION ViewMapping() : m_handle(), m_offset() {} - KOKKOS_INLINE_FUNCTION ViewMapping( const ViewMapping & rhs ) - : m_handle( rhs.m_handle ), m_offset( rhs.m_offset ) {} - KOKKOS_INLINE_FUNCTION ViewMapping & operator = ( const ViewMapping & rhs ) - { m_handle = rhs.m_handle ; m_offset = rhs.m_offset ; return *this ; } - - KOKKOS_INLINE_FUNCTION ViewMapping( ViewMapping && rhs ) - : m_handle( rhs.m_handle ), m_offset( rhs.m_offset ) {} - KOKKOS_INLINE_FUNCTION ViewMapping & operator = ( ViewMapping && rhs ) - { m_handle = rhs.m_handle ; m_offset = rhs.m_offset ; return *this ; } - - template< bool AllowPadding > - KOKKOS_INLINE_FUNCTION - ViewMapping( void * ptr - , const std::integral_constant & - , const size_t N0 , const size_t N1 , const size_t N2 , const size_t N3 - , const size_t N4 , const size_t N5 , const size_t N6 , const size_t N7 ) - : m_handle( reinterpret_cast< handle_type >( ptr ) ) - , m_offset( std::integral_constant< unsigned , AllowPadding ? sizeof(typename Traits::value_type) : 0 >() - , N0, N1, N2, N3, N4, N5, N6, N7 ) - {} - - template< bool AllowPadding > - KOKKOS_INLINE_FUNCTION - ViewMapping( void * ptr - , const std::integral_constant & - , const typename Traits::array_layout & layout ) - : m_handle( reinterpret_cast< handle_type >( ptr ) ) - , m_offset( layout ) - {} - - //---------------------------------------- - // If the View is to construct or destroy the elements. - - struct FunctorTagConstructScalar {}; - struct FunctorTagConstructNonScalar {}; - struct FunctorTagDestructNonScalar {}; - - KOKKOS_FORCEINLINE_FUNCTION - void operator()( const FunctorTagConstructScalar & , const size_t i ) const - { m_handle[i] = 0 ; } - - KOKKOS_FORCEINLINE_FUNCTION - void operator()( const FunctorTagConstructNonScalar & , const size_t i ) const - { - typedef typename Traits::value_type value_type ; - new( & m_handle[i] ) value_type(); - } - - KOKKOS_FORCEINLINE_FUNCTION - void operator()( const FunctorTagDestructNonScalar & , const size_t i ) const - { - typedef typename Traits::value_type value_type ; - ( & (m_handle[i]) )->~value_type(); - } - - template< class ExecSpace > - typename std::enable_if< Kokkos::Impl::is_execution_space::value && - std::is_scalar< typename Traits::value_type >::value >::type - construct( const ExecSpace & space ) const - { - typedef Kokkos::RangePolicy< ExecSpace , FunctorTagConstructScalar , size_t > Policy ; - - (void) Kokkos::Impl::ParallelFor< ViewMapping , Policy >( *this , Policy( 0 , m_offset.span() ) ); - ExecSpace::fence(); - } - - template< class ExecSpace > - typename std::enable_if< Kokkos::Impl::is_execution_space::value && - ! std::is_scalar< typename Traits::value_type >::value >::type - construct( const ExecSpace & space ) const - { - typedef Kokkos::RangePolicy< ExecSpace , FunctorTagConstructNonScalar , size_t > Policy ; - - (void) Kokkos::Impl::ParallelFor< ViewMapping , Policy >( *this , Policy( 0 , m_offset.span() ) ); - ExecSpace::fence(); - } - - template< class ExecSpace > - typename std::enable_if< Kokkos::Impl::is_execution_space::value && - std::is_scalar< typename Traits::value_type >::value >::type - destroy( const ExecSpace & ) const {} - - template< class ExecSpace > - typename std::enable_if< Kokkos::Impl::is_execution_space::value && - ! std::is_scalar< typename Traits::value_type >::value >::type - destroy( const ExecSpace & space ) const - { - typedef Kokkos::RangePolicy< ExecSpace , FunctorTagDestructNonScalar , size_t > Policy ; - - (void) Kokkos::Impl::ParallelFor< ViewMapping , Policy >( *this , Policy( 0 , m_offset.span() ) ); - ExecSpace::fence(); - } -}; - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- -/** \brief Assign compatible default mappings */ - -template< class DstTraits , class SrcTraits > -class ViewMapping< DstTraits , SrcTraits , - typename std::enable_if<( - std::is_same< typename DstTraits::memory_space , typename SrcTraits::memory_space >::value - && - std::is_same< typename DstTraits::specialize , void >::value - && - ( - std::is_same< typename DstTraits::array_layout , Kokkos::LayoutLeft >::value || - std::is_same< typename DstTraits::array_layout , Kokkos::LayoutRight >::value || - std::is_same< typename DstTraits::array_layout , Kokkos::LayoutStride >::value - ) - && - std::is_same< typename SrcTraits::specialize , void >::value - && - ( - std::is_same< typename SrcTraits::array_layout , Kokkos::LayoutLeft >::value || - std::is_same< typename SrcTraits::array_layout , Kokkos::LayoutRight >::value || - std::is_same< typename SrcTraits::array_layout , Kokkos::LayoutStride >::value - ) - )>::type > -{ -public: - - enum { is_assignable = true }; - - typedef Kokkos::Experimental::Impl::SharedAllocationTracker TrackType ; - typedef ViewMapping< DstTraits , void , void > DstType ; - typedef ViewMapping< SrcTraits , void , void > SrcType ; - - KOKKOS_INLINE_FUNCTION - static void assign( DstType & dst , const SrcType & src , const TrackType & src_track ) - { - static_assert( std::is_same< typename DstTraits::value_type , typename SrcTraits::value_type >::value || - std::is_same< typename DstTraits::value_type , typename SrcTraits::const_value_type >::value - , "View assignment must have same value type or const = non-const" ); - - static_assert( ViewDimensionAssignable< typename DstTraits::dimension , typename SrcTraits::dimension >::value - , "View assignment must have compatible dimensions" ); - - static_assert( std::is_same< typename DstTraits::array_layout , typename SrcTraits::array_layout >::value || - std::is_same< typename DstTraits::array_layout , Kokkos::LayoutStride >::value || - ( DstTraits::dimension::rank == 0 ) || - ( DstTraits::dimension::rank == 1 && DstTraits::dimension::rank_dynamic == 1 ) - , "View assignment must have compatible layout or have rank <= 1" ); - - typedef typename DstType::offset_type dst_offset_type ; - - dst.m_offset = dst_offset_type( src.m_offset ); - dst.m_handle = Kokkos::Experimental::Impl::ViewDataHandle< DstTraits >::assign( src.m_handle , src_track ); - } -}; - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -/** \brief View mapping for non-specialized data type and standard layout */ -template< class Traits , bool R0 , bool R1 , bool R2 , bool R3 , bool R4 , bool R5 , bool R6 , bool R7 > -struct SubviewMapping< Traits, R0, R1, R2, R3, R4, R5, R6, R7 , - typename std::enable_if<( - std::is_same< typename Traits::specialize , void >::value - && - ( - std::is_same< typename Traits::array_layout , Kokkos::LayoutLeft >::value || - std::is_same< typename Traits::array_layout , Kokkos::LayoutRight >::value || - std::is_same< typename Traits::array_layout , Kokkos::LayoutStride >::value - ) - )>::type > -{ -private: - - // Subview's rank - enum { rank = unsigned(R0) + unsigned(R1) + unsigned(R2) + unsigned(R3) - + unsigned(R4) + unsigned(R5) + unsigned(R6) + unsigned(R7) }; - - // Whether right-most rank is a range. - enum { R0_rev = 0 == Traits::rank ? false : ( - 1 == Traits::rank ? R0 : ( - 2 == Traits::rank ? R1 : ( - 3 == Traits::rank ? R2 : ( - 4 == Traits::rank ? R3 : ( - 5 == Traits::rank ? R4 : ( - 6 == Traits::rank ? R5 : ( - 7 == Traits::rank ? R6 : R7 ))))))) }; - - // Subview's layout - typedef typename std::conditional< - ( /* Same array layout IF */ - ( rank == 0 ) /* output rank zero */ - || - // OutputRank 1 or 2, InputLayout Left, Interval 0 - // because single stride one or second index has a stride. - ( rank <= 2 && R0 && std::is_same< typename Traits::array_layout , Kokkos::LayoutLeft >::value ) - || - // OutputRank 1 or 2, InputLayout Right, Interval [InputRank-1] - // because single stride one or second index has a stride. - ( rank <= 2 && R0_rev && std::is_same< typename Traits::array_layout , Kokkos::LayoutRight >::value ) - ), typename Traits::array_layout , Kokkos::LayoutStride - >::type array_layout ; - - typedef typename Traits::value_type value_type ; - - typedef typename std::conditional< rank == 0 , value_type , - typename std::conditional< rank == 1 , value_type * , - typename std::conditional< rank == 2 , value_type ** , - typename std::conditional< rank == 3 , value_type *** , - typename std::conditional< rank == 4 , value_type **** , - typename std::conditional< rank == 5 , value_type ***** , - typename std::conditional< rank == 6 , value_type ****** , - typename std::conditional< rank == 7 , value_type ******* , - value_type ******** - >::type >::type >::type >::type >::type >::type >::type >::type - data_type ; - -public: - - typedef - Kokkos::Experimental::ViewTraits< data_type , array_layout - , typename Traits::device_type - , typename Traits::memory_traits > traits_type ; - - typedef Kokkos::Experimental::View< data_type - , array_layout - , typename Traits::device_type - , typename Traits::memory_traits > type ; - - template< class T0 , class T1 , class T2 , class T3 - , class T4 , class T5 , class T6 , class T7 > - KOKKOS_INLINE_FUNCTION - static void assign( ViewMapping< traits_type , void , void > & dst - , ViewMapping< Traits , void , void > const & src - , T0 const & arg0 - , T1 const & arg1 - , T2 const & arg2 - , T3 const & arg3 - , T4 const & arg4 - , T5 const & arg5 - , T6 const & arg6 - , T7 const & arg7 - ) - { - typedef ViewMapping< traits_type , void , void > DstType ; - - typedef typename DstType::offset_type dst_offset_type ; - typedef typename DstType::handle_type dst_handle_type ; - - typedef Kokkos::Experimental::Impl::ViewOffsetRange V0 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V1 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V2 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V3 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V4 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V5 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V6 ; - typedef Kokkos::Experimental::Impl::ViewOffsetRange V7 ; - - dst.m_offset = dst_offset_type - ( src.m_offset - , V0::dimension( src.m_offset.dimension_0() , arg0 ) - , V1::dimension( src.m_offset.dimension_1() , arg1 ) - , V2::dimension( src.m_offset.dimension_2() , arg2 ) - , V3::dimension( src.m_offset.dimension_3() , arg3 ) - , V4::dimension( src.m_offset.dimension_4() , arg4 ) - , V5::dimension( src.m_offset.dimension_5() , arg5 ) - , V6::dimension( src.m_offset.dimension_6() , arg6 ) - , V7::dimension( src.m_offset.dimension_7() , arg7 ) - ); - - dst.m_handle = dst_handle_type( src.m_handle + - src.m_offset( V0::begin( arg0 ) - , V1::begin( arg1 ) - , V2::begin( arg2 ) - , V3::begin( arg3 ) - , V4::begin( arg4 ) - , V5::begin( arg5 ) - , V6::begin( arg6 ) - , V7::begin( arg7 ) - ) ); - } -}; - -}}} // namespace Kokkos::Experimental::Impl - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -template< class V - , bool R0 = false , bool R1 = false , bool R2 = false , bool R3 = false - , bool R4 = false , bool R5 = false , bool R6 = false , bool R7 = false > -struct SubviewType ; - -template< class D , class A1, class A2, class A3 - , bool R0 , bool R1 , bool R2 , bool R3 - , bool R4 , bool R5 , bool R6 , bool R7 > -struct SubviewType< Kokkos::Experimental::View< D , A1, A2, A3 > , R0 , R1 , R2 , R3 , R4 , R5 , R6 , R7 > -{ -private: - typedef Kokkos::Experimental::ViewTraits< D , A1 , A2 , A3 > traits ; - typedef Kokkos::Experimental::Impl::SubviewMapping< traits , R0 , R1 , R2 , R3 , R4 , R5 , R6 , R7 > mapping ; -public: - typedef typename mapping::type type ; -}; - -}}} // namespace Kokkos::Experimental::Impl - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -class Error_view_scalar_reference_to_non_scalar_view ; - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -#if defined( KOKKOS_EXPRESSION_CHECK ) - -#define KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( SPACE , MAP , RANK , I0 , I1 , I2 , I3 , I4 , I5 , I6 , I7 ) \ - Kokkos::Impl::VerifyExecutionCanAccessMemorySpace< \ - Kokkos::Impl::ActiveExecutionMemorySpace , SPACE >::verify( MAP.data() ); \ - /* array bounds checking */ - -#else - -#define KOKKOS_ASSERT_VIEW_MAPPING_ACCESS( SPACE , MAP , RANK , I0 , I1 , I2 , I3 , I4 , I5 , I6 , I7 ) \ - Kokkos::Impl::VerifyExecutionCanAccessMemorySpace< \ - Kokkos::Impl::ActiveExecutionMemorySpace , SPACE >::verify( MAP.data() ) - -#endif - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_EXPERIMENTAL_VIEW_MAPPING_HPP */ - diff --git a/lib/kokkos/core/src/impl/KokkosExp_ViewTile.hpp b/lib/kokkos/core/src/impl/KokkosExp_ViewTile.hpp deleted file mode 100644 index a661a35347..0000000000 --- a/lib/kokkos/core/src/impl/KokkosExp_ViewTile.hpp +++ /dev/null @@ -1,219 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXPERIMENTAL_VIEWTILE_HPP -#define KOKKOS_EXPERIMENTAL_VIEWTILE_HPP - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -// View mapping for rank two tiled array - -template< class L > -struct is_layout_tile : public std::false_type {}; - -template< unsigned N0 , unsigned N1 > -struct is_layout_tile< Kokkos::LayoutTileLeft > : public std::true_type {}; - -template< class Dimension , class Layout > -struct ViewOffset< Dimension , Layout , - typename std::enable_if<( - ( Dimension::rank == 2 ) - && - is_layout_tile< Layout >::value - )>::type > -{ -public: - - enum { SHIFT_0 = Kokkos::Impl::power_of_two::value }; - enum { SHIFT_1 = Kokkos::Impl::power_of_two::value }; - enum { SHIFT_T = SHIFT_0 + SHIFT_1 }; - enum { MASK_0 = Layout::N0 - 1 }; - enum { MASK_1 = Layout::N1 - 1 }; - - // Is an irregular layout that does not have uniform striding for each index. - using is_mapping_plugin = std::true_type ; - using is_regular = std::false_type ; - - typedef size_t size_type ; - typedef Dimension dimension_type ; - typedef Layout array_layout ; - - dimension_type m_dim ; - size_type m_tile_N0 ; - - //---------------------------------------- - - // Only instantiated for rank 2 - template< typename I0 , typename I1 > - KOKKOS_INLINE_FUNCTION constexpr - size_type operator()( I0 const & i0 , I1 const & i1 - , int = 0 , int = 0 - , int = 0 , int = 0 - , int = 0 , int = 0 - ) const - { - return /* ( ( Tile offset ) * Tile size ) */ - ( ( (i0>>SHIFT_0) + m_tile_N0 * (i1>>SHIFT_1) ) << SHIFT_T) + - /* ( Offset within tile ) */ - ( (i0 & MASK_0) + ((i1 & MASK_1)<> SHIFT_1 ) ) << SHIFT_T ; - } - - KOKKOS_INLINE_FUNCTION constexpr bool span_is_contiguous() const - { - // Only if dimensions align with tile size - return ( m_dim.N0 & MASK_0 ) == 0 && ( m_dim.N1 & MASK_1 ) == 0 ; - } - - //---------------------------------------- - - ~ViewOffset() = default ; - ViewOffset() = default ; - ViewOffset( const ViewOffset & ) = default ; - ViewOffset & operator = ( const ViewOffset & ) = default ; - - template< unsigned TrivialScalarSize > - KOKKOS_INLINE_FUNCTION - constexpr ViewOffset( std::integral_constant const & - , size_t aN0 , size_t aN1 - , unsigned , unsigned , unsigned , unsigned , unsigned , unsigned ) - : m_dim( aN0, aN1, 0, 0, 0, 0, 0, 0 ) - , m_tile_N0( ( aN0 + MASK_0 ) >> SHIFT_0 /* number of tiles in first dimension */ ) - {} -}; - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -namespace Kokkos { -namespace Experimental { - -// Using View with an invalid data type to construct the tiling subview. -// View is a friend of View so we use this invalid data type partial specialization -// to access implementation of both source and destination view for constructing -// the tile subview. - -template< unsigned N0 , unsigned N1 > -struct View< void , Kokkos::LayoutTileLeft , void , void > -{ - typedef Kokkos::LayoutTileLeft Layout ; - - template< typename T , class A2 , class A3 > - KOKKOS_INLINE_FUNCTION static - Kokkos::Experimental::View< T[N0][N1] , LayoutLeft , A2 , A3 > - tile_subview( const Kokkos::Experimental::View & src - , const size_t i_tile0 - , const size_t i_tile1 - ) - { - typedef Kokkos::Experimental::View SrcView ; - typedef Kokkos::Experimental::View< T[N0][N1] , LayoutLeft , A2 , A3 > DstView ; - - typedef typename SrcView::map_type::offset_type src_offset_type ; - typedef typename DstView::map_type dst_map_type ; - typedef typename DstView::map_type::handle_type dst_handle_type ; - typedef typename DstView::map_type::offset_type dst_offset_type ; - - return DstView( src.m_track , - dst_map_type( - dst_handle_type( src.m_map.m_handle + - ( ( i_tile0 + src.m_map.m_offset.m_tile_N0 * i_tile1 ) << src_offset_type::SHIFT_T ) ) , - dst_offset_type() ) - ); - } -}; - -template< typename T , unsigned N0 , unsigned N1 , class A2 , class A3 > -KOKKOS_INLINE_FUNCTION -Kokkos::Experimental::View< T[N0][N1] , LayoutLeft , A2 , A3 > -tile_subview( const Kokkos::Experimental::View,A2,A3> & src - , const size_t i_tile0 - , const size_t i_tile1 - ) -{ - return View< void , Kokkos::LayoutTileLeft , void , void >:: - tile_subview( src , i_tile0 , i_tile1 ); -} - -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_EXPERIENTAL_VIEWTILE_HPP */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_AllocationTracker.cpp b/lib/kokkos/core/src/impl/Kokkos_AllocationTracker.cpp deleted file mode 100644 index 7fb33853d6..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_AllocationTracker.cpp +++ /dev/null @@ -1,844 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - -#include - -#include -#include -#include - - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -/* Enable clean up of memory leaks */ -#define CLEAN_UP_MEMORY_LEAKS 0 - -namespace Kokkos { namespace Impl { - -namespace { - - -//----------------------------------------------------------------------------- -// AllocationRecord -//----------------------------------------------------------------------------- -// -// Used to track details about an allocation and provide a ref count -// sizeof(AllocationRecord) == 128 -struct AllocationRecord -{ - enum { - OFFSET = sizeof(AllocatorBase*) // allocator - + sizeof(void*) // alloc_ptr - + sizeof(uint64_t) // alloc_size - + sizeof(AllocatorAttributeBase*) // attribute - + sizeof(uint32_t) // node_index - + sizeof(uint32_t) // ref_count - , LABEL_LENGTH = 128 - OFFSET - }; - - AllocatorBase * const allocator; - void * const alloc_ptr; - const uint64_t alloc_size; - AllocatorAttributeBase * const attribute; - const int32_t node_index; - volatile uint32_t ref_count; - const char label[LABEL_LENGTH]; - - - AllocationRecord( AllocatorBase * const arg_allocator - , void * arg_alloc_ptr - , uint64_t arg_alloc_size - , int32_t arg_node_index - , const std::string & arg_label - ) - : allocator(arg_allocator) - , alloc_ptr(arg_alloc_ptr) - , alloc_size(arg_alloc_size) - , attribute(NULL) - , node_index(arg_node_index) - , ref_count(1) - , label() // zero fill - { - const size_t length = static_cast(LABEL_LENGTH-1u) < arg_label.size() ? static_cast(LABEL_LENGTH-1u) : arg_label.size(); - strncpy( const_cast(label), arg_label.c_str(), length ); - } - - ~AllocationRecord() - { - if (attribute) { - delete attribute; - } - } - - uint32_t increment_ref_count() - { - uint32_t old_value = atomic_fetch_add( &ref_count, static_cast(1) ); - return old_value + 1u; - } - - uint32_t decrement_ref_count() - { - uint32_t old_value = atomic_fetch_sub( &ref_count, static_cast(1) ); - return old_value - 1u; - } - - void print( std::ostream & oss ) const - { - oss << "{ " << allocator->name() - << " } : \"" << label - << "\" ref_count(" << ref_count - << ") memory[ " << alloc_ptr - << " + " << alloc_size - << " ]" ; - } - - bool set_attribute( AllocatorAttributeBase * attr ) - { - bool result = false; - if (attribute == NULL) { - result = NULL == atomic_compare_exchange( const_cast(&attribute) - , reinterpret_cast(NULL) - , attr ); - } - - return result; - } - - // disallow copy and assignment - AllocationRecord( const AllocationRecord & ); - AllocationRecord & operator=(const AllocationRecord &); -}; - -template -struct Bitset -{ - enum { blocks = NumBlocks }; - enum { size = blocks * 64 }; - enum { block_mask = 63u }; - enum { block_shift = 6 }; - - // used to find free bits in a bitset - static int count_trailing_zeros(uint64_t x) - { - #if defined( KOKKOS_COMPILER_GNU ) || defined( KOKKOS_COMPILER_CLANG ) || defined( KOKKOS_COMPILER_APPLECC ) - return x ? __builtin_ctzll(x) : 64; - #elif defined( KOKKOS_COMPILER_INTEL ) - enum { shift = 32 }; - enum { mask = (static_cast(1) << shift) - 1u }; - return (x & mask) ? _bit_scan_forward(static_cast(x & mask)) : - (x >> shift) ? shift + _bit_scan_forward(static_cast(x >> shift)) : - 64 ; - #elif defined( KOKKOS_COMPILER_IBM ) - return x ? __cnttz8(x) : 64; - #else - int i = 0; - for (; ((x & (static_cast(1) << i)) == 0u) && i < 64; ++i ) {} - return i; - #endif - } - - Bitset() - : m_bits() - { - for (int i=0; i < blocks; ++i) { - m_bits[i] = 0u; - } - } - - bool set( int i ) - { - const uint64_t bit = static_cast(1) << ( i & block_mask ); - return !( atomic_fetch_or( m_bits + (i >> block_shift), bit ) & bit ); - } - - bool reset( int i ) - { - const uint64_t bit = static_cast(1) << ( i & block_mask ); - return atomic_fetch_and( m_bits + (i >> block_shift), ~bit ) & bit; - } - - bool test( int i ) - { - const uint64_t block = m_bits[ i >> block_shift ]; - const uint64_t bit = static_cast(1) << ( i & block_mask ); - return block & bit; - } - - int find_first_unset() const - { - for (int i=0; i < blocks; ++i) { - const uint64_t block = m_bits[i]; - int b = count_trailing_zeros( ~block ); - - if ( b < 64 ) { - return (i << block_shift) + b; - } - } - return size; - } - - volatile uint64_t m_bits[blocks]; -}; - -//----------------------------------------------------------------------------- -// AllocationRecordPool -- singleton class -// -// global_alloc_rec_pool is the ONLY instance of this class -// -//----------------------------------------------------------------------------- -// Record AllocationRecords in a lock-free circular list. -// Each node in the list has a buffer with space for 959 ((15*64)-1) records -// managed by a bitset. Atomics are used to set and reset bits in the bit set. -// The head of the list is atomically updated to the last node found with -// unused space. -// -// Cost time to create an allocation record: amortized O(1), worst case O(num nodes) -// Cost to destroy an allocation recored: O(1) -// -// Singleton allocations are pushed onto a lock-free stack that is destroyed -// after the circular list of allocation records. -struct AllocationRecordPool -{ - enum { BITSET_BLOCKS = 15 }; - - typedef Bitset bitset_type; - - enum { BUFFER_SIZE = (bitset_type::size - 1) * sizeof(AllocationRecord) }; - - struct AllocationNode - { - AllocationNode() - : next() - , bitset() - , buffer() - { - // set the first bit to used - bitset.set(0); - } - - void * get_buffer( int32_t node_index ) - { - return buffer + (node_index-1) * sizeof(AllocationRecord); - } - - // return 0 if no space is available in the node - int32_t get_node_index() - { - int32_t node_index = 0; - do { - node_index = bitset.find_first_unset(); - - // successfully claimed a bit - if ( node_index != bitset.size && bitset.set(node_index) ) - { - return node_index; - } - } while ( node_index != bitset.size ); - return 0; - } - - void clear_node_index( int32_t node_index ) - { - bitset.reset(node_index); - } - - AllocationNode * next; - bitset_type bitset; - char buffer[BUFFER_SIZE]; - }; - - struct SingletonNode - { - void * buffer; - SingletonNode * next; - Impl::singleton_destroy_function_type destroy; - - SingletonNode( size_t size, Impl::singleton_create_function_type create_func, Impl::singleton_destroy_function_type destroy_func ) - : buffer(NULL) - , next(NULL) - , destroy(destroy_func) - { - if (size) { - buffer = malloc(size); - create_func(buffer); - } - } - - ~SingletonNode() - { - if (buffer) { - try { - destroy(buffer); - } catch(...) {} - free(buffer); - } - } - }; - - AllocationRecordPool() - : head( new AllocationNode() ) - , singleton_head(NULL) - { - // setup ring - head->next = head; - } - - ~AllocationRecordPool() - { - // delete allocation records - { - AllocationNode * start = head; - - AllocationNode * curr = start; - - std::vector< std::string > string_vec; - - do { - AllocationNode * next = curr->next; - - #if defined( KOKKOS_DEBUG_PRINT_ALLOCATION_BITSET ) - // print node bitset - for (int i=0; i < bitset_type::blocks; ++i ) { - std::cout << std::hex << std::showbase << curr->bitset.m_bits[i] << " "; - } - std::cout << std::endl; - #endif - - // bit zero does not map to an AllocationRecord - for ( int32_t i=1; i < bitset_type::size; ++i ) - { - if (curr->bitset.test(i)) { - AllocationRecord * alloc_rec = reinterpret_cast( curr->get_buffer(i) ); - - std::ostringstream oss; - alloc_rec->print( oss ); - string_vec.push_back( oss.str() ); - -#if CLEAN_UP_MEMORY_LEAKS -/* Cleaning up memory leaks prevents memory error detection tools - * from reporting the original source of allocation, which can - * impede debugging with such tools. - */ - try { - destroy(alloc_rec); - } - catch(...) {} -#endif - } - } - - curr->next = NULL; - - delete curr; - - curr = next; - } while ( curr != start ); - - if ( !string_vec.empty() ) { - std::sort( string_vec.begin(), string_vec.end() ); - - std::ostringstream oss; - oss << "Error: Allocation pool destroyed with the following memory leak(s):\n"; - for (size_t i=0; i< string_vec.size(); ++i) - { - oss << " " << string_vec[i] << std::endl; - } - - std::cerr << oss.str() << std::endl; - } - } - - // delete singletons - { - SingletonNode * curr = singleton_head; - - while (curr) { - SingletonNode * next = curr->next; - delete curr; - curr = next; - } - } - } - - AllocationRecord * create( AllocatorBase * arg_allocator - , void * arg_alloc_ptr - , size_t arg_alloc_size - , const std::string & arg_label - ) - { - AllocationNode * start = volatile_load(&head); - - AllocationNode * curr = start; - - - int32_t node_index = curr->get_node_index(); - - if (node_index == 0) { - curr = volatile_load(&curr->next); - } - - while (node_index == 0 && curr != start) - { - node_index = curr->get_node_index(); - if (node_index == 0) { - curr = volatile_load(&curr->next); - } - } - - // Need to allocate and insert a new node - if (node_index == 0 && curr == start) - { - AllocationNode * new_node = new AllocationNode(); - - node_index = new_node->get_node_index(); - - AllocationNode * next = NULL; - do { - next = volatile_load(&curr->next); - new_node->next = next; - memory_fence(); - } while ( next != atomic_compare_exchange( &(curr->next), next, new_node ) ); - - curr = new_node; - } - - void * buffer = curr->get_buffer(node_index); - - // try to set head to curr - if ( start != curr ) - { - atomic_compare_exchange( & head, start, curr ); - } - - return new (buffer) AllocationRecord( arg_allocator - , arg_alloc_ptr - , arg_alloc_size - , node_index - , arg_label - ); - } - - void destroy( AllocationRecord * alloc_rec ) - { - if (alloc_rec) { - const int32_t node_index = alloc_rec->node_index; - AllocationNode * node = get_node( alloc_rec ); - - // deallocate memory - alloc_rec->allocator->deallocate( alloc_rec->alloc_ptr, alloc_rec->alloc_size ); - - // call destructor - alloc_rec->~AllocationRecord(); - - // wait for writes to complete - memory_fence(); - - // clear node index - node->clear_node_index( node_index ); - } - } - - void * create_singleton( size_t size, Impl::singleton_create_function_type create_func, Impl::singleton_destroy_function_type destroy_func ) - { - SingletonNode * node = new SingletonNode( size, create_func, destroy_func ); - SingletonNode * next; - - // insert new node at the head of the list - do { - next = volatile_load(&singleton_head); - node->next = next; - } while ( next != atomic_compare_exchange( &singleton_head, next, node ) ); - - return node->buffer; - } - - void print_memory( std::ostream & out ) const - { - AllocationNode * start = head; - - AllocationNode * curr = start; - - std::vector< std::string > string_vec; - - do { - AllocationNode * next = curr->next; - - // bit zero does not map to an AllocationRecord - for ( int32_t i=1; i < bitset_type::size; ++i ) - { - if (curr->bitset.test(i)) { - AllocationRecord * alloc_rec = reinterpret_cast( curr->get_buffer(i) ); - - std::ostringstream oss; - alloc_rec->print( oss ); - string_vec.push_back( oss.str() ); - } - } - curr = next; - } while ( curr != start ); - - if ( !string_vec.empty() ) { - std::sort( string_vec.begin(), string_vec.end() ); - - std::ostringstream oss; - oss << "Tracked Memory:" << std::endl; - for (size_t i=0; i< string_vec.size(); ++i) - { - oss << " " << string_vec[i] << std::endl; - } - out << oss.str() << std::endl; - } - else { - out << "No Tracked Memory" << std::endl; - } - } - - // find an AllocationRecord such that - // alloc_ptr <= ptr < alloc_ptr + alloc_size - // otherwise return NULL - AllocationRecord * find( void const * ptr, AllocatorBase const * allocator ) const - { - AllocationNode * start = head; - - AllocationNode * curr = start; - - char const * const char_ptr = reinterpret_cast(ptr); - - do { - AllocationNode * next = curr->next; - - // bit zero does not map to an AllocationRecord - for ( int32_t i=1; i < bitset_type::size; ++i ) - { - if (curr->bitset.test(i)) { - AllocationRecord * alloc_rec = reinterpret_cast( curr->get_buffer(i) ); - - char const * const alloc_ptr = reinterpret_cast(alloc_rec->alloc_ptr); - - if ( (allocator == alloc_rec->allocator) - && (alloc_ptr <= char_ptr) - && (char_ptr < (alloc_ptr + alloc_rec->alloc_size)) ) - { - return alloc_rec; - } - } - } - curr = next; - } while ( curr != start ); - - return NULL; - } - -private: - - AllocationNode * get_node( AllocationRecord * alloc_rec ) - { - return reinterpret_cast( alloc_rec - alloc_rec->node_index); - } - - AllocationNode * head; - SingletonNode * singleton_head; -}; - -// create the global pool for allocation records -AllocationRecordPool global_alloc_rec_pool; - - - -// convert a uintptr_t to an AllocationRecord pointer -inline -AllocationRecord * to_alloc_rec( uintptr_t alloc_rec ) -{ - return reinterpret_cast( alloc_rec & ~static_cast(1) ); -} - -} // unnamed namespace - -//----------------------------------------------------------------------------- -// Allocation Tracker methods -//----------------------------------------------------------------------------- - -// Create a reference counted AllocationTracker -void AllocationTracker::initalize( AllocatorBase * arg_allocator - , void * arg_alloc_ptr - , size_t arg_alloc_size - , const std::string & arg_label - ) -{ - if ( arg_allocator && arg_alloc_ptr && arg_alloc_size) { - // create record - AllocationRecord * alloc_rec = global_alloc_rec_pool.create( arg_allocator - , arg_alloc_ptr - , arg_alloc_size - , arg_label - ); - - m_alloc_rec = reinterpret_cast(alloc_rec) | REF_COUNT_BIT; - } -} - -void AllocationTracker::reallocate( size_t size ) const -{ - AllocationRecord * rec = to_alloc_rec( m_alloc_rec ); - - void * the_alloc_ptr = rec->allocator->reallocate( rec->alloc_ptr, rec->alloc_size, size ); - - if ( NULL != the_alloc_ptr ) - { - *const_cast(&rec->alloc_ptr) = the_alloc_ptr; - *const_cast(&rec->alloc_size) = size; - } - else { - Impl::throw_runtime_exception( "Error: unable to reallocate allocation tracker"); - } -} - - -void AllocationTracker::increment_ref_count() const -{ - to_alloc_rec( m_alloc_rec )->increment_ref_count(); -} - - -void AllocationTracker::decrement_ref_count() const -{ - AllocationRecord * alloc_rec = to_alloc_rec( m_alloc_rec ); - uint32_t the_ref_count = alloc_rec->decrement_ref_count(); - if (the_ref_count == 0u) { - try { - global_alloc_rec_pool.destroy( alloc_rec ); - } - catch(...) {} - } -} - -namespace { - -struct NullAllocator { static const char * name() { return "Null Allocator"; } }; - -} - -AllocatorBase * AllocationTracker::allocator() const -{ - if (m_alloc_rec & REF_COUNT_MASK) { - return to_alloc_rec(m_alloc_rec)->allocator; - } - return Allocator::singleton(); -} - -void * AllocationTracker::alloc_ptr() const -{ - if (m_alloc_rec & REF_COUNT_MASK) { - return to_alloc_rec(m_alloc_rec)->alloc_ptr; - } - return NULL; -} - -size_t AllocationTracker::alloc_size() const -{ - if (m_alloc_rec & REF_COUNT_MASK) { - return to_alloc_rec(m_alloc_rec)->alloc_size; - } - return 0u; -} - -size_t AllocationTracker::ref_count() const -{ - if (m_alloc_rec & REF_COUNT_MASK) { - return to_alloc_rec(m_alloc_rec)->ref_count; - } - return 0u; -} - -char const * AllocationTracker::label() const -{ - if (m_alloc_rec & REF_COUNT_MASK) { - return to_alloc_rec(m_alloc_rec)->label; - } - return "[Empty Allocation Tracker]"; -} - -void AllocationTracker::print( std::ostream & oss) const -{ - if (m_alloc_rec & REF_COUNT_MASK) { - to_alloc_rec(m_alloc_rec)->print(oss); - } - else { - oss << label(); - } -} - -bool AllocationTracker::set_attribute( AllocatorAttributeBase * attr ) const -{ - bool result = false; - if (m_alloc_rec & REF_COUNT_MASK) { - result = to_alloc_rec(m_alloc_rec)->set_attribute(attr); - } - return result; -} - -AllocatorAttributeBase * AllocationTracker::attribute() const -{ - if (m_alloc_rec & REF_COUNT_MASK) { - return to_alloc_rec(m_alloc_rec)->attribute; - } - return NULL; -} - -void AllocationTracker::print_tracked_memory( std::ostream & out ) -{ - global_alloc_rec_pool.print_memory( out ); -} - - -AllocationTracker AllocationTracker::find( void const * ptr, AllocatorBase const * arg_allocator ) -{ - AllocationRecord * alloc_rec = global_alloc_rec_pool.find(ptr, arg_allocator); - - AllocationTracker tracker; - - if ( alloc_rec != NULL ) - { - if ( tracking_enabled() ) { - alloc_rec->increment_ref_count(); - tracker.m_alloc_rec = reinterpret_cast(alloc_rec) | REF_COUNT_BIT; - } - else { - tracker.m_alloc_rec = reinterpret_cast(alloc_rec); - } - } - - return tracker ; -} - - - -//----------------------------------------------------------------------------- -// static AllocationTracker -//----------------------------------------------------------------------------- -#if defined( KOKKOS_USE_DECENTRALIZED_HOST ) -namespace { - - // TODO : Detect compiler support for thread local variables - #if defined( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_OPENMP ) - bool g_thread_local_tracking_enabled = true; - #pragma omp threadprivate(g_thread_local_tracking_enabled) - #elif defined( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_THREADS ) - __thread bool g_thread_local_tracking_enabled = true; - #elif defined( KOKKOS_HAVE_OPENMP ) - bool g_thread_local_tracking_enabled = true; - #pragma omp threadprivate(g_thread_local_tracking_enabled) - #elif defined( KOKKOS_HAVE_PTHREAD ) - __thread bool g_thread_local_tracking_enabled = true; - #elif defined( KOKKOS_HAVE_SERIAL ) - bool g_thread_local_tracking_enabled = true; - #endif -} // unnamed namespace - -void AllocationTracker::disable_tracking() -{ - g_thread_local_tracking_enabled = false; -} - -void AllocationTracker::enable_tracking() -{ - g_thread_local_tracking_enabled = true; -} - -bool AllocationTracker::tracking_enabled() -{ - return g_thread_local_tracking_enabled; -} -#else -namespace { -enum TrackingEnum { TRACKING_ENABLED, TRACKING_DISABLED }; -volatile TrackingEnum g_tracking_enabled = TRACKING_ENABLED; -} - -void AllocationTracker::disable_tracking() -{ - if ( TRACKING_ENABLED != atomic_compare_exchange( &g_tracking_enabled, TRACKING_ENABLED, TRACKING_DISABLED ) ) { - Impl::throw_runtime_exception("Error: Tracking already disabled"); - } -} - -void AllocationTracker::enable_tracking() -{ - if ( TRACKING_DISABLED != atomic_compare_exchange( &g_tracking_enabled, TRACKING_DISABLED, TRACKING_ENABLED ) ) { - Impl::throw_runtime_exception("Error: Tracking already enabled"); - } -} - -bool AllocationTracker::tracking_enabled() -{ - return g_tracking_enabled == TRACKING_ENABLED; -} -#endif - - -//----------------------------------------------------------------------------- -// create singleton free function -//----------------------------------------------------------------------------- -void * create_singleton( size_t size - , Impl::singleton_create_function_type create_func - , Impl::singleton_destroy_function_type destroy_func ) -{ - return global_alloc_rec_pool.create_singleton( size, create_func, destroy_func ); -} - -}} // namespace Kokkos::Impl - -#endif /* #if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_AllocationTracker.hpp b/lib/kokkos/core/src/impl/Kokkos_AllocationTracker.hpp deleted file mode 100644 index 331c4e8fac..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_AllocationTracker.hpp +++ /dev/null @@ -1,586 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_ALLOCATION_TRACKER_HPP -#define KOKKOS_ALLOCATION_TRACKER_HPP - -#include - -#include -#include - -#include -#include -#include -#include - -namespace Kokkos { namespace Impl { - -//----------------------------------------------------------------------------- -// Create Singleton objects -//----------------------------------------------------------------------------- - -typedef void * (*singleton_create_function_type)(void * buffer); -typedef void (*singleton_destroy_function_type)(void *); - -void * create_singleton( size_t size - , singleton_create_function_type create_func - , singleton_destroy_function_type destroy_func - ); - - - -/// class Singleton -/// -/// Default construct a singleton type. This method is used to circumvent -/// order of construction issues. Singleton objects are destroyed after all -/// other allocations in the reverse order of their creation. -template -class Singleton -{ -public: - /// Get a pointer to the Singleton. Default construct the singleton if it does not already exist - static Type * get() - { - static Type * singleton = NULL; - if (singleton == NULL) { - Impl::singleton_create_function_type create_func = &create; - Impl::singleton_destroy_function_type destroy_func = &destroy; - singleton = reinterpret_cast( Impl::create_singleton( sizeof(Type), create_func, destroy_func ) ); - } - return singleton; - } - -private: - - /// Call the Type constructor - static void destroy(void * ptr) - { - reinterpret_cast(ptr)->~Type(); - } - - /// placement new the Type in buffer - static void * create(void * buffer) - { - return new (buffer) Type(); - } -}; - - -//----------------------------------------------------------------------------- -// AllocatorBase -//----------------------------------------------------------------------------- - -/// class AllocatorBase -/// -/// Abstract base class for all Allocators. -/// Allocators should be singleton objects, use Singleton::get to create -/// to avoid order of destruction issues -class AllocatorBase -{ -public: - /// name of the allocator - /// used to report memory leaks - virtual const char * name() const = 0; - - /// Allocate a buffer of size number of bytes - virtual void* allocate(size_t size) const = 0; - - /// Deallocate a buffer with size number of bytes - /// The pointer must have been allocated with a call to corresponding allocate - virtual void deallocate(void * ptr, size_t size) const = 0; - - /// Changes the size of the memory block pointed to by ptr. - /// Ptr must have been allocated with the corresponding allocate call - /// The function may move the memory block to a new location - /// (whose address is returned by the function). - /// - /// The content of the memory block is preserved up to the lesser of the new and - /// old sizes, even if the block is moved to a new location. If the new size is larger, - /// the value of the newly allocated portion is indeterminate. - /// - /// In case that ptr is a null pointer, the function behaves like allocate, assigning a - /// new block of size bytes and returning a pointer to its beginning. - virtual void * reallocate(void * old_ptr, size_t old_size, size_t new_size) const = 0; - - /// can a texture object be bound to the allocated memory - virtual bool support_texture_binding() const = 0; - - /// virtual destructor - virtual ~AllocatorBase() {} -}; - -/// class AllocatorAttributeBase -class AllocatorAttributeBase -{ -public: - virtual ~AllocatorAttributeBase() {} -}; - -//----------------------------------------------------------------------------- -// Allocator< StaticAllocator > : public AllocatorBase -//----------------------------------------------------------------------------- - -// HasStaticName -template -class HasStaticName -{ - typedef const char * (*static_method)(); - template struct SFINAE {}; - template static char Test(SFINAE*); - template static int Test(...); -public: - enum { value = sizeof(Test(0)) == sizeof(char) }; -}; - - -template -inline -typename enable_if::value, const char *>::type -allocator_name() -{ - return T::name(); -} - -template -inline -typename enable_if::value, const char *>::type -allocator_name() -{ - return "Unnamed Allocator"; -} - - -// HasStaticAllocate -template -class HasStaticAllocate -{ - typedef void * (*static_method)(size_t); - template struct SFINAE {}; - template static char Test(SFINAE*); - template static int Test(...); -public: - enum { value = sizeof(Test(0)) == sizeof(char) }; -}; - -template -inline -typename enable_if::value, void *>::type -allocator_allocate(size_t size) -{ - return T::allocate(size); -} - -template -inline -typename enable_if::value, void *>::type -allocator_allocate(size_t) -{ - throw_runtime_exception( std::string("Error: ") - + std::string(allocator_name()) - + std::string(" cannot allocate memory!") ); - return NULL; -} - -// HasStaticDeallocate -template -class HasStaticDeallocate -{ - typedef void (*static_method)(void *, size_t); - template struct SFINAE {}; - template static char Test(SFINAE*); - template static int Test(...); -public: - enum { value = sizeof(Test(0)) == sizeof(char) }; -}; - -template -inline -typename enable_if::value, void>::type -allocator_deallocate(void * ptr, size_t size) -{ - T::deallocate(ptr,size); -} - -template -inline -typename enable_if::value, void>::type -allocator_deallocate(void *, size_t) -{ - throw_runtime_exception( std::string("Error: ") - + std::string(allocator_name()) - + std::string(" cannot deallocate memory!") ); -} - -// HasStaticReallocate -template -class HasStaticReallocate -{ - typedef void * (*static_method)(void *, size_t, size_t); - template struct SFINAE {}; - template static char Test(SFINAE*); - template static int Test(...); -public: - enum { value = sizeof(Test(0)) == sizeof(char) }; -}; - -template -inline -typename enable_if::value, void *>::type -allocator_reallocate(void * old_ptr, size_t old_size, size_t new_size) -{ - return T::reallocate(old_ptr, old_size, new_size); -} - -template -inline -typename enable_if::value, void *>::type -allocator_reallocate(void *, size_t, size_t) -{ - throw_runtime_exception( std::string("Error: ") - + std::string(allocator_name()) - + std::string(" cannot reallocate memory!") ); - return NULL; -} - -// HasStaticReallocate -template -class HasStaticSupportTextureBinding -{ - typedef bool (*static_method)(); - template struct SFINAE {}; - template static char Test(SFINAE*); - template static int Test(...); -public: - enum { value = sizeof(Test(0)) == sizeof(char) }; -}; - -template -inline -typename enable_if::value, bool>::type -allocator_support_texture_binding() -{ - return T::support_texture_binding(); -} - -template -inline -typename enable_if::value, bool>::type -allocator_support_texture_binding() -{ - return false; -} - -template -class Allocator : public AllocatorBase -{ -public: - virtual const char * name() const - { - return allocator_name(); - } - - virtual void* allocate(size_t size) const - { - return allocator_allocate(size); - } - - virtual void deallocate(void * ptr, size_t size) const - { - allocator_deallocate(ptr,size); - } - - virtual void * reallocate(void * old_ptr, size_t old_size, size_t new_size) const - { - return allocator_reallocate(old_ptr, old_size, new_size); - } - - virtual bool support_texture_binding() const - { - return allocator_support_texture_binding(); - } - - static AllocatorBase * singleton() - { - return Singleton< Allocator >::get(); - } -}; - -//----------------------------------------------------------------------------- -// AllocationTracker -//----------------------------------------------------------------------------- - -// forward declaration for friend classes -struct CopyWithoutTracking; -struct MallocHelper; - -/// class AllocationTracker -/// Will call deallocate from the AllocatorBase when the reference count reaches 0. -/// Reference counting is disabled when the host is in parallel. -class AllocationTracker -{ - // use the least significant bit of the AllocationRecord pointer to indicate if the - // AllocationTracker should reference count - enum { - REF_COUNT_BIT = static_cast(1) - , REF_COUNT_MASK = ~static_cast(1) - }; - -public: - - /// Find an AllocationTracker such that - /// alloc_ptr <= ptr < alloc_ptr + alloc_size - /// O(n) where n is the number of tracked allocations. - template - static AllocationTracker find( void const * ptr ) - { - return find( ptr, Allocator::singleton() ); - } - - - /// Pretty print all the currently tracked memory - static void print_tracked_memory( std::ostream & out ); - - /// Default constructor - KOKKOS_INLINE_FUNCTION - AllocationTracker() - : m_alloc_rec(0) - {} - - /// Create a AllocationTracker - /// - /// Start reference counting the alloc_ptr. - /// When the reference count reachs 0 the allocator deallocate method - /// will be call with the given size. The alloc_ptr should have been - /// allocated with the allocator's allocate method. - /// - /// If arg_allocator == NULL OR arg_alloc_ptr == NULL OR size == 0 - /// do nothing - template - AllocationTracker( StaticAllocator const & - , void * arg_alloc_ptr - , size_t arg_alloc_size - , const std::string & arg_label = std::string("") ) - : m_alloc_rec(0) - { - AllocatorBase * arg_allocator = Allocator::singleton(); - initalize( arg_allocator, arg_alloc_ptr, arg_alloc_size, arg_label); - } - - /// Create a AllocationTracker - /// - /// Start reference counting the alloc_ptr. - /// When the reference count reachs 0 the allocator deallocate method - /// will be call with the given size. The alloc_ptr should have been - /// allocated with the allocator's allocate method. - /// - /// If arg_allocator == NULL OR arg_alloc_ptr == NULL OR size == 0 - /// do nothing - template - AllocationTracker( StaticAllocator const & - , size_t arg_alloc_size - , const std::string & arg_label = std::string("") - ) - : m_alloc_rec(0) - { - AllocatorBase * arg_allocator = Allocator::singleton(); - void * arg_alloc_ptr = arg_allocator->allocate( arg_alloc_size ); - - initalize( arg_allocator, arg_alloc_ptr, arg_alloc_size, arg_label); - } - - /// Copy an AllocatorTracker - KOKKOS_INLINE_FUNCTION - AllocationTracker( const AllocationTracker & rhs ) - : m_alloc_rec( rhs.m_alloc_rec) - { -#if !defined( __CUDA_ARCH__ ) - if ( rhs.ref_counting() && tracking_enabled() ) { - increment_ref_count(); - } - else { - m_alloc_rec = m_alloc_rec & REF_COUNT_MASK; - } -#else - m_alloc_rec = m_alloc_rec & REF_COUNT_MASK; -#endif - } - - /// Copy an AllocatorTracker - /// Decrement the reference count of the current tracker if necessary - KOKKOS_INLINE_FUNCTION - AllocationTracker & operator=( const AllocationTracker & rhs ) - { - if (this != &rhs) { -#if !defined( __CUDA_ARCH__ ) - if ( ref_counting() ) { - decrement_ref_count(); - } - - m_alloc_rec = rhs.m_alloc_rec; - - if ( rhs.ref_counting() && tracking_enabled() ) { - increment_ref_count(); - } - else { - m_alloc_rec = m_alloc_rec & REF_COUNT_MASK; - } -#else - m_alloc_rec = rhs.m_alloc_rec & REF_COUNT_MASK; -#endif - } - - return * this; - } - - /// Destructor - /// Decrement the reference count if necessary - KOKKOS_INLINE_FUNCTION - ~AllocationTracker() - { -#if !defined( __CUDA_ARCH__ ) - if ( ref_counting() ) { - decrement_ref_count(); - } -#endif - } - - /// Is the tracker valid? - KOKKOS_INLINE_FUNCTION - bool is_valid() const - { - return (m_alloc_rec & REF_COUNT_MASK); - } - - - - /// clear the tracker - KOKKOS_INLINE_FUNCTION - void clear() - { -#if !defined( __CUDA_ARCH__ ) - if ( ref_counting() ) { - decrement_ref_count(); - } -#endif - m_alloc_rec = 0; - } - - /// is this tracker currently counting allocations? - KOKKOS_INLINE_FUNCTION - bool ref_counting() const - { - return (m_alloc_rec & REF_COUNT_BIT); - } - - AllocatorBase * allocator() const; - - /// pointer to the allocated memory - void * alloc_ptr() const; - - /// size in bytes of the allocated memory - size_t alloc_size() const; - - /// the current reference count - size_t ref_count() const; - - /// the label given to the allocation - char const * label() const; - - /// pretty print all the tracker's information to the std::ostream - void print( std::ostream & oss) const; - - - /// set an attribute ptr on the allocation record - /// the arg_attribute pointer will be deleted when the record is destroyed - /// the attribute ptr can only be set once - bool set_attribute( AllocatorAttributeBase * arg_attribute) const; - - /// get the attribute ptr from the allocation record - AllocatorAttributeBase * attribute() const; - - - /// reallocate the memory tracked by this allocation - /// NOT thread-safe - void reallocate( size_t size ) const; - -private: - - static AllocationTracker find( void const * ptr, AllocatorBase const * arg_allocator ); - - void initalize( AllocatorBase * arg_allocator - , void * arg_alloc_ptr - , size_t arg_alloc_size - , std::string const & label ); - - void increment_ref_count() const; - void decrement_ref_count() const; - - static void disable_tracking(); - static void enable_tracking(); - static bool tracking_enabled(); - - friend struct Impl::CopyWithoutTracking; - friend struct Impl::MallocHelper; - - uintptr_t m_alloc_rec; -}; - - - -/// Make a copy of the functor with reference counting disabled -struct CopyWithoutTracking -{ - template - static Functor apply( const Functor & f ) - { - AllocationTracker::disable_tracking(); - Functor func(f); - AllocationTracker::enable_tracking(); - return func; - } -}; - -}} // namespace Kokkos::Impl - -#endif //KOKKOS_ALLOCATION_TRACKER_HPP diff --git a/lib/kokkos/core/src/impl/Kokkos_AnalyzeShape.hpp b/lib/kokkos/core/src/impl/Kokkos_AnalyzeShape.hpp deleted file mode 100644 index 2de9df008e..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_AnalyzeShape.hpp +++ /dev/null @@ -1,260 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_ANALYZESHAPE_HPP -#define KOKKOS_ANALYZESHAPE_HPP - -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -//---------------------------------------------------------------------------- - -/** \brief Analyze the array shape defined by a Kokkos::View data type. - * - * It is presumed that the data type can be mapped down to a multidimensional - * array of an intrinsic scalar numerical type (double, float, int, ... ). - * The 'value_type' of an array may be an embedded aggregate type such - * as a fixed length array 'Array'. - * In this case the 'array_intrinsic_type' represents the - * underlying array of intrinsic scalar numerical type. - * - * The embedded aggregate type must have an AnalyzeShape specialization - * to map it down to a shape and intrinsic scalar numerical type. - */ -template< class T > -struct AnalyzeShape : public Shape< sizeof(T) , 0 > -{ - typedef void specialize ; - - typedef Shape< sizeof(T), 0 > shape ; - - typedef T array_intrinsic_type ; - typedef T value_type ; - typedef T type ; - - typedef const T const_array_intrinsic_type ; - typedef const T const_value_type ; - typedef const T const_type ; - - typedef T non_const_array_intrinsic_type ; - typedef T non_const_value_type ; - typedef T non_const_type ; -}; - -template<> -struct AnalyzeShape : public Shape< 0 , 0 > -{ - typedef void specialize ; - - typedef Shape< 0 , 0 > shape ; - - typedef void array_intrinsic_type ; - typedef void value_type ; - typedef void type ; - typedef const void const_array_intrinsic_type ; - typedef const void const_value_type ; - typedef const void const_type ; - typedef void non_const_array_intrinsic_type ; - typedef void non_const_value_type ; - typedef void non_const_type ; -}; - -template< class T > -struct AnalyzeShape< const T > : public AnalyzeShape::shape -{ -private: - typedef AnalyzeShape nested ; -public: - - typedef typename nested::specialize specialize ; - - typedef typename nested::shape shape ; - - typedef typename nested::const_array_intrinsic_type array_intrinsic_type ; - typedef typename nested::const_value_type value_type ; - typedef typename nested::const_type type ; - - typedef typename nested::const_array_intrinsic_type const_array_intrinsic_type ; - typedef typename nested::const_value_type const_value_type ; - typedef typename nested::const_type const_type ; - - typedef typename nested::non_const_array_intrinsic_type non_const_array_intrinsic_type ; - typedef typename nested::non_const_value_type non_const_value_type ; - typedef typename nested::non_const_type non_const_type ; -}; - -template< class T > -struct AnalyzeShape< T * > - : public ShapeInsert< typename AnalyzeShape::shape , 0 >::type -{ -private: - typedef AnalyzeShape nested ; -public: - - typedef typename nested::specialize specialize ; - - typedef typename ShapeInsert< typename nested::shape , 0 >::type shape ; - - typedef typename nested::array_intrinsic_type * array_intrinsic_type ; - typedef typename nested::value_type value_type ; - typedef typename nested::type * type ; - - typedef typename nested::const_array_intrinsic_type * const_array_intrinsic_type ; - typedef typename nested::const_value_type const_value_type ; - typedef typename nested::const_type * const_type ; - - typedef typename nested::non_const_array_intrinsic_type * non_const_array_intrinsic_type ; - typedef typename nested::non_const_value_type non_const_value_type ; - typedef typename nested::non_const_type * non_const_type ; -}; - -template< class T > -struct AnalyzeShape< T[] > - : public ShapeInsert< typename AnalyzeShape::shape , 0 >::type -{ -private: - typedef AnalyzeShape nested ; -public: - - typedef typename nested::specialize specialize ; - - typedef typename ShapeInsert< typename nested::shape , 0 >::type shape ; - - typedef typename nested::array_intrinsic_type array_intrinsic_type [] ; - typedef typename nested::value_type value_type ; - typedef typename nested::type type [] ; - - typedef typename nested::const_array_intrinsic_type const_array_intrinsic_type [] ; - typedef typename nested::const_value_type const_value_type ; - typedef typename nested::const_type const_type [] ; - - typedef typename nested::non_const_array_intrinsic_type non_const_array_intrinsic_type [] ; - typedef typename nested::non_const_value_type non_const_value_type ; - typedef typename nested::non_const_type non_const_type [] ; -}; - -template< class T > -struct AnalyzeShape< const T[] > - : public ShapeInsert< typename AnalyzeShape< const T >::shape , 0 >::type -{ -private: - typedef AnalyzeShape< const T > nested ; -public: - - typedef typename nested::specialize specialize ; - - typedef typename ShapeInsert< typename nested::shape , 0 >::type shape ; - - typedef typename nested::array_intrinsic_type array_intrinsic_type [] ; - typedef typename nested::value_type value_type ; - typedef typename nested::type type [] ; - - typedef typename nested::const_array_intrinsic_type const_array_intrinsic_type [] ; - typedef typename nested::const_value_type const_value_type ; - typedef typename nested::const_type const_type [] ; - - typedef typename nested::non_const_array_intrinsic_type non_const_array_intrinsic_type [] ; - typedef typename nested::non_const_value_type non_const_value_type ; - typedef typename nested::non_const_type non_const_type [] ; -}; - -template< class T , unsigned N > -struct AnalyzeShape< T[N] > - : public ShapeInsert< typename AnalyzeShape::shape , N >::type -{ -private: - typedef AnalyzeShape nested ; -public: - - typedef typename nested::specialize specialize ; - - typedef typename ShapeInsert< typename nested::shape , N >::type shape ; - - typedef typename nested::array_intrinsic_type array_intrinsic_type [N] ; - typedef typename nested::value_type value_type ; - typedef typename nested::type type [N] ; - - typedef typename nested::const_array_intrinsic_type const_array_intrinsic_type [N] ; - typedef typename nested::const_value_type const_value_type ; - typedef typename nested::const_type const_type [N] ; - - typedef typename nested::non_const_array_intrinsic_type non_const_array_intrinsic_type [N] ; - typedef typename nested::non_const_value_type non_const_value_type ; - typedef typename nested::non_const_type non_const_type [N] ; -}; - -template< class T , unsigned N > -struct AnalyzeShape< const T[N] > - : public ShapeInsert< typename AnalyzeShape< const T >::shape , N >::type -{ -private: - typedef AnalyzeShape< const T > nested ; -public: - - typedef typename nested::specialize specialize ; - - typedef typename ShapeInsert< typename nested::shape , N >::type shape ; - - typedef typename nested::array_intrinsic_type array_intrinsic_type [N] ; - typedef typename nested::value_type value_type ; - typedef typename nested::type type [N] ; - - typedef typename nested::const_array_intrinsic_type const_array_intrinsic_type [N] ; - typedef typename nested::const_value_type const_value_type ; - typedef typename nested::const_type const_type [N] ; - - typedef typename nested::non_const_array_intrinsic_type non_const_array_intrinsic_type [N] ; - typedef typename nested::non_const_value_type non_const_value_type ; - typedef typename nested::non_const_type non_const_type [N] ; -}; - -} // namespace Impl -} // namespace Kokkos - -#endif /* #ifndef KOKKOS_ANALYZESHAPE_HPP */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_Atomic_Assembly_X86.hpp b/lib/kokkos/core/src/impl/Kokkos_Atomic_Assembly_X86.hpp deleted file mode 100644 index e9c7a16d58..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Atomic_Assembly_X86.hpp +++ /dev/null @@ -1,214 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ -#if defined( KOKKOS_ATOMIC_HPP ) && ! defined( KOKKOS_ATOMIC_ASSEMBLY_X86_HPP ) -#define KOKKOS_ATOMIC_ASSEMBLY_X86_HPP -namespace Kokkos { - -#ifdef KOKKOS_ENABLE_ASM -#ifndef __CUDA_ARCH__ -template<> -KOKKOS_INLINE_FUNCTION -void atomic_increment(volatile char* a) { - __asm__ __volatile__( - "lock incb %0" - : /* no output registers */ - : "m" (a[0]) - : "memory" - ); -} - -template<> -KOKKOS_INLINE_FUNCTION -void atomic_increment(volatile short* a) { - __asm__ __volatile__( - "lock incw %0" - : /* no output registers */ - : "m" (a[0]) - : "memory" - ); -} - -template<> -KOKKOS_INLINE_FUNCTION -void atomic_increment(volatile int* a) { - __asm__ __volatile__( - "lock incl %0" - : /* no output registers */ - : "m" (a[0]) - : "memory" - ); -} - -template<> -KOKKOS_INLINE_FUNCTION -void atomic_increment(volatile long long int* a) { - __asm__ __volatile__( - "lock incq %0" - : /* no output registers */ - : "m" (a[0]) - : "memory" - ); -} - -template<> -KOKKOS_INLINE_FUNCTION -void atomic_decrement(volatile char* a) { - __asm__ __volatile__( - "lock decb %0" - : /* no output registers */ - : "m" (a[0]) - : "memory" - ); -} - -template<> -KOKKOS_INLINE_FUNCTION -void atomic_decrement(volatile short* a) { - __asm__ __volatile__( - "lock decw %0" - : /* no output registers */ - : "m" (a[0]) - : "memory" - ); -} - -template<> -KOKKOS_INLINE_FUNCTION -void atomic_decrement(volatile int* a) { - __asm__ __volatile__( - "lock decl %0" - : /* no output registers */ - : "m" (a[0]) - : "memory" - ); -} - -template<> -KOKKOS_INLINE_FUNCTION -void atomic_decrement(volatile long long int* a) { - __asm__ __volatile__( - "lock decq %0" - : /* no output registers */ - : "m" (a[0]) - : "memory" - ); -} -#endif -#endif - -namespace Impl { - struct cas128_t - { - uint64_t lower; - uint64_t upper; - - KOKKOS_INLINE_FUNCTION - cas128_t () { - lower = 0; - upper = 0; - } - - KOKKOS_INLINE_FUNCTION - cas128_t (const cas128_t& a) { - lower = a.lower; - upper = a.upper; - } - KOKKOS_INLINE_FUNCTION - cas128_t (volatile cas128_t* a) { - lower = a->lower; - upper = a->upper; - } - - KOKKOS_INLINE_FUNCTION - bool operator != (const cas128_t& a) const { - return (lower != a.lower) || upper!=a.upper; - } - - KOKKOS_INLINE_FUNCTION - void operator = (const cas128_t& a) { - lower = a.lower; - upper = a.upper; - } - KOKKOS_INLINE_FUNCTION - void operator = (const cas128_t& a) volatile { - lower = a.lower; - upper = a.upper; - } - } - __attribute__ (( __aligned__( 16 ) )); - - - - - inline cas128_t cas128( volatile cas128_t * ptr, cas128_t cmp, cas128_t swap ) - { - #ifdef KOKKOS_ENABLE_ASM - bool swapped = false; - __asm__ __volatile__ - ( - "lock cmpxchg16b %1\n\t" - "setz %0" - : "=q" ( swapped ) - , "+m" ( *ptr ) - , "+d" ( cmp.upper ) - , "+a" ( cmp.lower ) - : "c" ( swap.upper ) - , "b" ( swap.lower ) - , "q" ( swapped ) - ); - return cmp; - #else - cas128_t tmp(ptr); - if(tmp != cmp) { - return tmp; - } else { - *ptr = swap; - return swap; - } - #endif - } - -} -} - -#endif diff --git a/lib/kokkos/core/src/impl/Kokkos_Atomic_Compare_Exchange_Strong.hpp b/lib/kokkos/core/src/impl/Kokkos_Atomic_Compare_Exchange_Strong.hpp deleted file mode 100644 index 524cd7327d..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Atomic_Compare_Exchange_Strong.hpp +++ /dev/null @@ -1,259 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#if defined( KOKKOS_ATOMIC_HPP ) && ! defined( KOKKOS_ATOMIC_COMPARE_EXCHANGE_STRONG_HPP ) -#define KOKKOS_ATOMIC_COMPARE_EXCHANGE_STRONG_HPP - -namespace Kokkos { - -//---------------------------------------------------------------------------- -// Cuda native CAS supports int, unsigned int, and unsigned long long int (non-standard type). -// Must cast-away 'volatile' for the CAS call. - -#if defined( KOKKOS_ATOMICS_USE_CUDA ) - -__inline__ __device__ -int atomic_compare_exchange( volatile int * const dest, const int compare, const int val) -{ return atomicCAS((int*)dest,compare,val); } - -__inline__ __device__ -unsigned int atomic_compare_exchange( volatile unsigned int * const dest, const unsigned int compare, const unsigned int val) -{ return atomicCAS((unsigned int*)dest,compare,val); } - -__inline__ __device__ -unsigned long long int atomic_compare_exchange( volatile unsigned long long int * const dest , - const unsigned long long int compare , - const unsigned long long int val ) -{ return atomicCAS((unsigned long long int*)dest,compare,val); } - -template < typename T > -__inline__ __device__ -T atomic_compare_exchange( volatile T * const dest , const T & compare , - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(int) , const T & >::type val ) -{ - const int tmp = atomicCAS( (int*) dest , *((int*)&compare) , *((int*)&val) ); - return *((T*)&tmp); -} - -template < typename T > -__inline__ __device__ -T atomic_compare_exchange( volatile T * const dest , const T & compare , - typename Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) == sizeof(unsigned long long int) , const T & >::type val ) -{ - typedef unsigned long long int type ; - const type tmp = atomicCAS( (type*) dest , *((type*)&compare) , *((type*)&val) ); - return *((T*)&tmp); -} - -template < typename T > -__inline__ __device__ -T atomic_compare_exchange( volatile T * const dest , const T & compare , - typename ::Kokkos::Impl::enable_if< - ( sizeof(T) != 4 ) - && ( sizeof(T) != 8 ) - , const T >::type& val ) -{ - T return_val; - // This is a way to (hopefully) avoid dead lock in a warp - bool done = false; - while (! done ) { - if( Impl::lock_address_cuda_space( (void*) dest ) ) { - return_val = *dest; - if( return_val == compare ) - *dest = val; - Impl::unlock_address_cuda_space( (void*) dest ); - } - } - return return_val; -} - -//---------------------------------------------------------------------------- -// GCC native CAS supports int, long, unsigned int, unsigned long. -// Intel native CAS support int and long with the same interface as GCC. - -#elif defined(KOKKOS_ATOMICS_USE_GCC) || defined(KOKKOS_ATOMICS_USE_INTEL) - -KOKKOS_INLINE_FUNCTION -int atomic_compare_exchange( volatile int * const dest, const int compare, const int val) -{ return __sync_val_compare_and_swap(dest,compare,val); } - -KOKKOS_INLINE_FUNCTION -long atomic_compare_exchange( volatile long * const dest, const long compare, const long val ) -{ return __sync_val_compare_and_swap(dest,compare,val); } - -#if defined( KOKKOS_ATOMICS_USE_GCC ) - -// GCC supports unsigned - -KOKKOS_INLINE_FUNCTION -unsigned int atomic_compare_exchange( volatile unsigned int * const dest, const unsigned int compare, const unsigned int val ) -{ return __sync_val_compare_and_swap(dest,compare,val); } - -KOKKOS_INLINE_FUNCTION -unsigned long atomic_compare_exchange( volatile unsigned long * const dest , - const unsigned long compare , - const unsigned long val ) -{ return __sync_val_compare_and_swap(dest,compare,val); } - -#endif - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_compare_exchange( volatile T * const dest, const T & compare, - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(int) , const T & >::type val ) -{ -#ifdef KOKKOS_HAVE_CXX11 - union U { - int i ; - T t ; - KOKKOS_INLINE_FUNCTION U() {}; - } tmp ; -#else - union U { - int i ; - T t ; - } tmp ; -#endif - - tmp.i = __sync_val_compare_and_swap( (int*) dest , *((int*)&compare) , *((int*)&val) ); - return tmp.t ; -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_compare_exchange( volatile T * const dest, const T & compare, - typename Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) == sizeof(long) , const T & >::type val ) -{ -#ifdef KOKKOS_HAVE_CXX11 - union U { - long i ; - T t ; - KOKKOS_INLINE_FUNCTION U() {}; - } tmp ; -#else - union U { - long i ; - T t ; - } tmp ; -#endif - - tmp.i = __sync_val_compare_and_swap( (long*) dest , *((long*)&compare) , *((long*)&val) ); - return tmp.t ; -} - -#ifdef KOKKOS_ENABLE_ASM -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_compare_exchange( volatile T * const dest, const T & compare, - typename Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) != sizeof(long) && - sizeof(T) == sizeof(Impl::cas128_t), const T & >::type val ) -{ - union U { - Impl::cas128_t i ; - T t ; - KOKKOS_INLINE_FUNCTION U() {}; - } tmp ; - - tmp.i = Impl::cas128( (Impl::cas128_t*) dest , *((Impl::cas128_t*)&compare) , *((Impl::cas128_t*)&val) ); - return tmp.t ; -} -#endif - -template < typename T > -inline -T atomic_compare_exchange( volatile T * const dest , const T compare , - typename ::Kokkos::Impl::enable_if< - ( sizeof(T) != 4 ) - && ( sizeof(T) != 8 ) - #if defined(KOKKOS_ENABLE_ASM) - && ( sizeof(T) != 16 ) - #endif - , const T >::type& val ) -{ - while( !Impl::lock_address_host_space( (void*) dest ) ); - T return_val = *dest; - if( return_val == compare ) { - const T tmp = *dest = val; - #ifndef KOKKOS_COMPILER_CLANG - (void) tmp; - #endif - } - Impl::unlock_address_host_space( (void*) dest ); - return return_val; -} -//---------------------------------------------------------------------------- - -#elif defined( KOKKOS_ATOMICS_USE_OMP31 ) - -template< typename T > -KOKKOS_INLINE_FUNCTION -T atomic_compare_exchange( volatile T * const dest, const T compare, const T val ) -{ - T retval; -#pragma omp critical - { - retval = dest[0]; - if ( retval == compare ) - dest[0] = val; - } - return retval; -} - -#endif - -template -KOKKOS_INLINE_FUNCTION -bool atomic_compare_exchange_strong(volatile T* const dest, const T compare, const T val) -{ - return compare == atomic_compare_exchange(dest, compare, val); -} - -//---------------------------------------------------------------------------- - -} // namespace Kokkos - -#endif - diff --git a/lib/kokkos/core/src/impl/Kokkos_Atomic_Exchange.hpp b/lib/kokkos/core/src/impl/Kokkos_Atomic_Exchange.hpp deleted file mode 100644 index 1bdbdbc7f9..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Atomic_Exchange.hpp +++ /dev/null @@ -1,340 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#if defined( KOKKOS_ATOMIC_HPP ) && ! defined( KOKKOS_ATOMIC_EXCHANGE_HPP ) -#define KOKKOS_ATOMIC_EXCHANGE_HPP - -namespace Kokkos { - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_ATOMICS_USE_CUDA ) - -__inline__ __device__ -int atomic_exchange( volatile int * const dest , const int val ) -{ - // return __iAtomicExch( (int*) dest , val ); - return atomicExch( (int*) dest , val ); -} - -__inline__ __device__ -unsigned int atomic_exchange( volatile unsigned int * const dest , const unsigned int val ) -{ - // return __uAtomicExch( (unsigned int*) dest , val ); - return atomicExch( (unsigned int*) dest , val ); -} - -__inline__ __device__ -unsigned long long int atomic_exchange( volatile unsigned long long int * const dest , const unsigned long long int val ) -{ - // return __ullAtomicExch( (unsigned long long*) dest , val ); - return atomicExch( (unsigned long long*) dest , val ); -} - -/** \brief Atomic exchange for any type with compatible size */ -template< typename T > -__inline__ __device__ -T atomic_exchange( - volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(int) , const T & >::type val ) -{ - // int tmp = __ullAtomicExch( (int*) dest , *((int*)&val) ); - int tmp = atomicExch( ((int*)dest) , *((int*)&val) ); - return *((T*)&tmp); -} - -template< typename T > -__inline__ __device__ -T atomic_exchange( - volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) == sizeof(unsigned long long int) , const T & >::type val ) -{ - typedef unsigned long long int type ; - // type tmp = __ullAtomicExch( (type*) dest , *((type*)&val) ); - type tmp = atomicExch( ((type*)dest) , *((type*)&val) ); - return *((T*)&tmp); -} - -template < typename T > -__inline__ __device__ -T atomic_exchange( volatile T * const dest , - typename ::Kokkos::Impl::enable_if< - ( sizeof(T) != 4 ) - && ( sizeof(T) != 8 ) - , const T >::type& val ) -{ - T return_val; - // This is a way to (hopefully) avoid dead lock in a warp - bool done = false; - while (! done ) { - if( Impl::lock_address_cuda_space( (void*) dest ) ) { - return_val = *dest; - *dest = val; - Impl::unlock_address_cuda_space( (void*) dest ); - } - } - return return_val; -} -/** \brief Atomic exchange for any type with compatible size */ -template< typename T > -__inline__ __device__ -void atomic_assign( - volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(int) , const T & >::type val ) -{ - // (void) __ullAtomicExch( (int*) dest , *((int*)&val) ); - (void) atomicExch( ((int*)dest) , *((int*)&val) ); -} - -template< typename T > -__inline__ __device__ -void atomic_assign( - volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) == sizeof(unsigned long long int) , const T & >::type val ) -{ - typedef unsigned long long int type ; - // (void) __ullAtomicExch( (type*) dest , *((type*)&val) ); - (void) atomicExch( ((type*)dest) , *((type*)&val) ); -} - -template< typename T > -__inline__ __device__ -void atomic_assign( - volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) != sizeof(unsigned long long int) - , const T & >::type val ) -{ - (void) atomic_exchange(dest,val); -} - -//---------------------------------------------------------------------------- - -#elif defined(KOKKOS_ATOMICS_USE_GCC) || defined(KOKKOS_ATOMICS_USE_INTEL) - -template< typename T > -KOKKOS_INLINE_FUNCTION -T atomic_exchange( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(int) || sizeof(T) == sizeof(long) - , const T & >::type val ) -{ - typedef typename Kokkos::Impl::if_c< sizeof(T) == sizeof(int) , int , long >::type type ; - - const type v = *((type*)&val); // Extract to be sure the value doesn't change - - type assumed ; - -#ifdef KOKKOS_HAVE_CXX11 - union U { - T val_T ; - type val_type ; - KOKKOS_INLINE_FUNCTION U() {}; - } old ; -#else - union { T val_T ; type val_type ; } old ; -#endif - - old.val_T = *dest ; - - do { - assumed = old.val_type ; - old.val_type = __sync_val_compare_and_swap( (volatile type *) dest , assumed , v ); - } while ( assumed != old.val_type ); - - return old.val_T ; -} - -#if defined(KOKKOS_ENABLE_ASM) -template< typename T > -KOKKOS_INLINE_FUNCTION -T atomic_exchange( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(Impl::cas128_t) - , const T & >::type val ) -{ - union U { - Impl::cas128_t i ; - T t ; - KOKKOS_INLINE_FUNCTION U() {}; - } assume , oldval , newval ; - - oldval.t = *dest ; - newval.t = val; - - do { - assume.i = oldval.i ; - oldval.i = Impl::cas128( (volatile Impl::cas128_t*) dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return oldval.t ; -} -#endif - -//---------------------------------------------------------------------------- - -template < typename T > -inline -T atomic_exchange( volatile T * const dest , - typename ::Kokkos::Impl::enable_if< - ( sizeof(T) != 4 ) - && ( sizeof(T) != 8 ) - #if defined(KOKKOS_ENABLE_ASM) - && ( sizeof(T) != 16 ) - #endif - , const T >::type& val ) -{ - while( !Impl::lock_address_host_space( (void*) dest ) ); - T return_val = *dest; - const T tmp = *dest = val; - #ifndef KOKKOS_COMPILER_CLANG - (void) tmp; - #endif - Impl::unlock_address_host_space( (void*) dest ); - return return_val; -} - -template< typename T > -KOKKOS_INLINE_FUNCTION -void atomic_assign( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(int) || sizeof(T) == sizeof(long) - , const T & >::type val ) -{ - typedef typename Kokkos::Impl::if_c< sizeof(T) == sizeof(int) , int , long >::type type ; - - const type v = *((type*)&val); // Extract to be sure the value doesn't change - - type assumed ; - -#ifdef KOKKOS_HAVE_CXX11 - union U { - T val_T ; - type val_type ; - KOKKOS_INLINE_FUNCTION U() {}; - } old ; -#else - union { T val_T ; type val_type ; } old ; -#endif - - old.val_T = *dest ; - - do { - assumed = old.val_type ; - old.val_type = __sync_val_compare_and_swap( (volatile type *) dest , assumed , v ); - } while ( assumed != old.val_type ); -} - -#ifdef KOKKOS_ENABLE_ASM -template< typename T > -KOKKOS_INLINE_FUNCTION -void atomic_assign( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(Impl::cas128_t) - , const T & >::type val ) -{ - union U { - Impl::cas128_t i ; - T t ; - KOKKOS_INLINE_FUNCTION U() {}; - } assume , oldval , newval ; - - oldval.t = *dest ; - newval.t = val; - do { - assume.i = oldval.i ; - oldval.i = Impl::cas128( (volatile Impl::cas128_t*) dest , assume.i , newval.i); - } while ( assume.i != oldval.i ); -} -#endif - -template < typename T > -inline -void atomic_assign( volatile T * const dest , - typename ::Kokkos::Impl::enable_if< - ( sizeof(T) != 4 ) - && ( sizeof(T) != 8 ) - #if defined(KOKKOS_ENABLE_ASM) - && ( sizeof(T) != 16 ) - #endif - , const T >::type& val ) -{ - while( !Impl::lock_address_host_space( (void*) dest ) ); - *dest = val; - Impl::unlock_address_host_space( (void*) dest ); -} -//---------------------------------------------------------------------------- - -#elif defined( KOKKOS_ATOMICS_USE_OMP31 ) - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_exchange( volatile T * const dest , const T val ) -{ - T retval; -//#pragma omp atomic capture - #pragma omp critical - { - retval = dest[0]; - dest[0] = val; - } - return retval; -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -void atomic_assign( volatile T * const dest , const T val ) -{ -//#pragma omp atomic - #pragma omp critical - { - dest[0] = val; - } -} - -#endif - -} // namespace Kokkos - -#endif - -//---------------------------------------------------------------------------- - diff --git a/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_Add.hpp b/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_Add.hpp deleted file mode 100644 index b06a5b4243..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_Add.hpp +++ /dev/null @@ -1,326 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#if defined( KOKKOS_ATOMIC_HPP ) && ! defined( KOKKOS_ATOMIC_FETCH_ADD_HPP ) -#define KOKKOS_ATOMIC_FETCH_ADD_HPP - -namespace Kokkos { - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_ATOMICS_USE_CUDA ) - -// Support for int, unsigned int, unsigned long long int, and float - -__inline__ __device__ -int atomic_fetch_add( volatile int * const dest , const int val ) -{ return atomicAdd((int*)dest,val); } - -__inline__ __device__ -unsigned int atomic_fetch_add( volatile unsigned int * const dest , const unsigned int val ) -{ return atomicAdd((unsigned int*)dest,val); } - -__inline__ __device__ -unsigned long long int atomic_fetch_add( volatile unsigned long long int * const dest , - const unsigned long long int val ) -{ return atomicAdd((unsigned long long int*)dest,val); } - -__inline__ __device__ -float atomic_fetch_add( volatile float * const dest , const float val ) -{ return atomicAdd((float*)dest,val); } - -template < typename T > -__inline__ __device__ -T atomic_fetch_add( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(int) , const T >::type val ) -{ -#ifdef KOKKOS_HAVE_CXX11 - union U { - int i ; - T t ; - KOKKOS_INLINE_FUNCTION U() {}; - } assume , oldval , newval ; -#else - union U { - int i ; - T t ; - } assume , oldval , newval ; -#endif - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = assume.t + val ; - oldval.i = atomicCAS( (int*)dest , assume.i , newval.i ); - } while ( assumed.i != oldval.i ); - - return oldval.t ; -} - -template < typename T > -__inline__ __device__ -T atomic_fetch_add( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) == sizeof(unsigned long long int) , const T >::type val ) -{ -#ifdef KOKKOS_HAVE_CXX11 - union U { - unsigned long long int i ; - T t ; - KOKKOS_INLINE_FUNCTION U() {}; - } assume , oldval , newval ; -#else - union U { - unsigned long long int i ; - T t ; - } assume , oldval , newval ; -#endif - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = assume.t + val ; - oldval.i = atomicCAS( (unsigned long long int*)dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return oldval.t ; -} - -//---------------------------------------------------------------------------- - -template < typename T > -__inline__ __device__ -T atomic_fetch_add( volatile T * const dest , - typename ::Kokkos::Impl::enable_if< - ( sizeof(T) != 4 ) - && ( sizeof(T) != 8 ) - , const T >::type& val ) -{ - T return_val; - // This is a way to (hopefully) avoid dead lock in a warp - bool done = false; - while (! done ) { - if( Impl::lock_address_cuda_space( (void*) dest ) ) { - return_val = *dest; - *dest = return_val + val; - Impl::unlock_address_cuda_space( (void*) dest ); - } - } - return return_val; -} -//---------------------------------------------------------------------------- - -#elif defined(KOKKOS_ATOMICS_USE_GCC) || defined(KOKKOS_ATOMICS_USE_INTEL) - -KOKKOS_INLINE_FUNCTION -int atomic_fetch_add( volatile int * const dest , const int val ) -{ return __sync_fetch_and_add(dest,val); } - -KOKKOS_INLINE_FUNCTION -long int atomic_fetch_add( volatile long int * const dest , const long int val ) -{ return __sync_fetch_and_add(dest,val); } - -#if defined( KOKKOS_ATOMICS_USE_GCC ) - -KOKKOS_INLINE_FUNCTION -unsigned int atomic_fetch_add( volatile unsigned int * const dest , const unsigned int val ) -{ return __sync_fetch_and_add(dest,val); } - -KOKKOS_INLINE_FUNCTION -unsigned long int atomic_fetch_add( volatile unsigned long int * const dest , const unsigned long int val ) -{ return __sync_fetch_and_add(dest,val); } - -#endif - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_add( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(int) , const T >::type val ) -{ -#ifdef KOKKOS_HAVE_CXX11 - union U { - int i ; - T t ; - KOKKOS_INLINE_FUNCTION U() {}; - } assume , oldval , newval ; -#else - union U { - int i ; - T t ; - } assume , oldval , newval ; -#endif - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = assume.t + val ; - oldval.i = __sync_val_compare_and_swap( (int*) dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return oldval.t ; -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_add( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) == sizeof(long) , const T >::type val ) -{ -#ifdef KOKKOS_HAVE_CXX11 - union U { - long i ; - T t ; - KOKKOS_INLINE_FUNCTION U() {}; - } assume , oldval , newval ; -#else - union U { - long i ; - T t ; - } assume , oldval , newval ; -#endif - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = assume.t + val ; - oldval.i = __sync_val_compare_and_swap( (long*) dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return oldval.t ; -} - -#ifdef KOKKOS_ENABLE_ASM -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_add( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) != sizeof(long) && - sizeof(T) == sizeof(Impl::cas128_t) , const T >::type val ) -{ - union U { - Impl::cas128_t i ; - T t ; - KOKKOS_INLINE_FUNCTION U() {}; - } assume , oldval , newval ; - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = assume.t + val ; - oldval.i = Impl::cas128( (volatile Impl::cas128_t*) dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return oldval.t ; -} -#endif - -//---------------------------------------------------------------------------- - -template < typename T > -inline -T atomic_fetch_add( volatile T * const dest , - typename ::Kokkos::Impl::enable_if< - ( sizeof(T) != 4 ) - && ( sizeof(T) != 8 ) - #if defined(KOKKOS_ENABLE_ASM) - && ( sizeof(T) != 16 ) - #endif - , const T >::type& val ) -{ - while( !Impl::lock_address_host_space( (void*) dest ) ); - T return_val = *dest; - const T tmp = *dest = return_val + val; - #ifndef KOKKOS_COMPILER_CLANG - (void) tmp; - #endif - Impl::unlock_address_host_space( (void*) dest ); - return return_val; -} -//---------------------------------------------------------------------------- - -#elif defined( KOKKOS_ATOMICS_USE_OMP31 ) - -template< typename T > -T atomic_fetch_add( volatile T * const dest , const T val ) -{ - T retval; -#pragma omp atomic capture - { - retval = dest[0]; - dest[0] += val; - } - return retval; -} - -#endif - -//---------------------------------------------------------------------------- - -// Simpler version of atomic_fetch_add without the fetch -template -KOKKOS_INLINE_FUNCTION -void atomic_add(volatile T * const dest, const T src) { - atomic_fetch_add(dest,src); -} - -// Atomic increment -template -KOKKOS_INLINE_FUNCTION -void atomic_increment(volatile T* a) { - Kokkos::atomic_fetch_add(a,1); -} - -template -KOKKOS_INLINE_FUNCTION -void atomic_decrement(volatile T* a) { - Kokkos::atomic_fetch_add(a,-1); -} - -} -#endif - diff --git a/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_And.hpp b/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_And.hpp deleted file mode 100644 index 9b7ebae4ac..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_And.hpp +++ /dev/null @@ -1,125 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#if defined( KOKKOS_ATOMIC_HPP ) && ! defined( KOKKOS_ATOMIC_FETCH_AND_HPP ) -#define KOKKOS_ATOMIC_FETCH_AND_HPP - -namespace Kokkos { - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_ATOMICS_USE_CUDA ) - -// Support for int, unsigned int, unsigned long long int, and float - -__inline__ __device__ -int atomic_fetch_and( volatile int * const dest , const int val ) -{ return atomicAnd((int*)dest,val); } - -__inline__ __device__ -unsigned int atomic_fetch_and( volatile unsigned int * const dest , const unsigned int val ) -{ return atomicAnd((unsigned int*)dest,val); } - -#if defined( __CUDA_ARCH__ ) && ( 350 <= __CUDA_ARCH__ ) -__inline__ __device__ -unsigned long long int atomic_fetch_and( volatile unsigned long long int * const dest , - const unsigned long long int val ) -{ return atomicAnd((unsigned long long int*)dest,val); } -#endif - -//---------------------------------------------------------------------------- - -#elif defined(KOKKOS_ATOMICS_USE_GCC) || defined(KOKKOS_ATOMICS_USE_INTEL) - -KOKKOS_INLINE_FUNCTION -int atomic_fetch_and( volatile int * const dest , const int val ) -{ return __sync_fetch_and_and(dest,val); } - -KOKKOS_INLINE_FUNCTION -long int atomic_fetch_and( volatile long int * const dest , const long int val ) -{ return __sync_fetch_and_and(dest,val); } - -#if defined( KOKKOS_ATOMICS_USE_GCC ) - -KOKKOS_INLINE_FUNCTION -unsigned int atomic_fetch_and( volatile unsigned int * const dest , const unsigned int val ) -{ return __sync_fetch_and_and(dest,val); } - -KOKKOS_INLINE_FUNCTION -unsigned long int atomic_fetch_and( volatile unsigned long int * const dest , const unsigned long int val ) -{ return __sync_fetch_and_and(dest,val); } - -#endif - -//---------------------------------------------------------------------------- - -#elif defined( KOKKOS_ATOMICS_USE_OMP31 ) - -template< typename T > -T atomic_fetch_and( volatile T * const dest , const T val ) -{ - T retval; -#pragma omp atomic capture - { - retval = dest[0]; - dest[0] &= val; - } - return retval; -} - -#endif - -//---------------------------------------------------------------------------- - -// Simpler version of atomic_fetch_and without the fetch -template -KOKKOS_INLINE_FUNCTION -void atomic_and(volatile T * const dest, const T src) { - (void)atomic_fetch_and(dest,src); -} - -} - -#endif - - diff --git a/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_Or.hpp b/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_Or.hpp deleted file mode 100644 index f15e61a3ae..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_Or.hpp +++ /dev/null @@ -1,125 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#if defined( KOKKOS_ATOMIC_HPP ) && ! defined( KOKKOS_ATOMIC_FETCH_OR_HPP ) -#define KOKKOS_ATOMIC_FETCH_OR_HPP - -namespace Kokkos { - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_ATOMICS_USE_CUDA ) - -// Support for int, unsigned int, unsigned long long int, and float - -__inline__ __device__ -int atomic_fetch_or( volatile int * const dest , const int val ) -{ return atomicOr((int*)dest,val); } - -__inline__ __device__ -unsigned int atomic_fetch_or( volatile unsigned int * const dest , const unsigned int val ) -{ return atomicOr((unsigned int*)dest,val); } - -#if defined( __CUDA_ARCH__ ) && ( 350 <= __CUDA_ARCH__ ) -__inline__ __device__ -unsigned long long int atomic_fetch_or( volatile unsigned long long int * const dest , - const unsigned long long int val ) -{ return atomicOr((unsigned long long int*)dest,val); } -#endif - -//---------------------------------------------------------------------------- - -#elif defined(KOKKOS_ATOMICS_USE_GCC) || defined(KOKKOS_ATOMICS_USE_INTEL) - -KOKKOS_INLINE_FUNCTION -int atomic_fetch_or( volatile int * const dest , const int val ) -{ return __sync_fetch_and_or(dest,val); } - -KOKKOS_INLINE_FUNCTION -long int atomic_fetch_or( volatile long int * const dest , const long int val ) -{ return __sync_fetch_and_or(dest,val); } - -#if defined( KOKKOS_ATOMICS_USE_GCC ) - -KOKKOS_INLINE_FUNCTION -unsigned int atomic_fetch_or( volatile unsigned int * const dest , const unsigned int val ) -{ return __sync_fetch_and_or(dest,val); } - -KOKKOS_INLINE_FUNCTION -unsigned long int atomic_fetch_or( volatile unsigned long int * const dest , const unsigned long int val ) -{ return __sync_fetch_and_or(dest,val); } - -#endif - -//---------------------------------------------------------------------------- - -#elif defined( KOKKOS_ATOMICS_USE_OMP31 ) - -template< typename T > -T atomic_fetch_or( volatile T * const dest , const T val ) -{ - T retval; -#pragma omp atomic capture - { - retval = dest[0]; - dest[0] |= val; - } - return retval; -} - -#endif - -//---------------------------------------------------------------------------- - -// Simpler version of atomic_fetch_or without the fetch -template -KOKKOS_INLINE_FUNCTION -void atomic_or(volatile T * const dest, const T src) { - (void)atomic_fetch_or(dest,src); -} - -} - -#endif - - diff --git a/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_Sub.hpp b/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_Sub.hpp deleted file mode 100644 index 259cba794a..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Atomic_Fetch_Sub.hpp +++ /dev/null @@ -1,233 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#if defined( KOKKOS_ATOMIC_HPP ) && ! defined( KOKKOS_ATOMIC_FETCH_SUB_HPP ) -#define KOKKOS_ATOMIC_FETCH_SUB_HPP - -namespace Kokkos { - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_ATOMICS_USE_CUDA ) - -// Support for int, unsigned int, unsigned long long int, and float - -__inline__ __device__ -int atomic_fetch_sub( volatile int * const dest , const int val ) -{ return atomicSub((int*)dest,val); } - -__inline__ __device__ -unsigned int atomic_fetch_sub( volatile unsigned int * const dest , const unsigned int val ) -{ return atomicSub((unsigned int*)dest,val); } - -template < typename T > -__inline__ __device__ -T atomic_fetch_sub( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(int) , const T >::type val ) -{ - union { int i ; T t ; } oldval , assume , newval ; - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = assume.t - val ; - oldval.i = atomicCAS( (int*)dest , assume.i , newval.i ); - } while ( assumed.i != oldval.i ); - - return oldval.t ; -} - -template < typename T > -__inline__ __device__ -T atomic_fetch_sub( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) == sizeof(unsigned long long int) , const T >::type val ) -{ - union { unsigned long long int i ; T t ; } oldval , assume , newval ; - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = assume.t - val ; - oldval.i = atomicCAS( (unsigned long long int*)dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return oldval.t ; -} - - -//---------------------------------------------------------------------------- - -template < typename T > -__inline__ __device__ -T atomic_fetch_sub( volatile T * const dest , - typename ::Kokkos::Impl::enable_if< - ( sizeof(T) != 4 ) - && ( sizeof(T) != 8 ) - , const T >::type& val ) -{ - T return_val; - // This is a way to (hopefully) avoid dead lock in a warp - bool done = false; - while (! done ) { - if( Impl::lock_address_cuda_space( (void*) dest ) ) { - return_val = *dest; - *dest = return_val - val; - Impl::unlock_address_cuda_space( (void*) dest ); - } - } - return return_val; -} - -//---------------------------------------------------------------------------- - -#elif defined(KOKKOS_ATOMICS_USE_GCC) || defined(KOKKOS_ATOMICS_USE_INTEL) - -KOKKOS_INLINE_FUNCTION -int atomic_fetch_sub( volatile int * const dest , const int val ) -{ return __sync_fetch_and_sub(dest,val); } - -KOKKOS_INLINE_FUNCTION -long int atomic_fetch_sub( volatile long int * const dest , const long int val ) -{ return __sync_fetch_and_sub(dest,val); } - -#if defined( KOKKOS_ATOMICS_USE_GCC ) - -KOKKOS_INLINE_FUNCTION -unsigned int atomic_fetch_sub( volatile unsigned int * const dest , const unsigned int val ) -{ return __sync_fetch_and_sub(dest,val); } - -KOKKOS_INLINE_FUNCTION -unsigned long int atomic_fetch_sub( volatile unsigned long int * const dest , const unsigned long int val ) -{ return __sync_fetch_and_sub(dest,val); } - -#endif - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_sub( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(int) , const T >::type val ) -{ - union { int i ; T t ; } assume , oldval , newval ; - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = assume.t - val ; - oldval.i = __sync_val_compare_and_swap( (int*) dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return oldval.t ; -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_sub( volatile T * const dest , - typename Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) == sizeof(long) , const T >::type val ) -{ - union { long i ; T t ; } assume , oldval , newval ; - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = assume.t - val ; - oldval.i = __sync_val_compare_and_swap( (long*) dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return oldval.t ; -} - - -//---------------------------------------------------------------------------- - -template < typename T > -inline -T atomic_fetch_sub( volatile T * const dest , - typename ::Kokkos::Impl::enable_if< - ( sizeof(T) != 4 ) - && ( sizeof(T) != 8 ) - , const T >::type& val ) -{ - while( !Impl::lock_address_host_space( (void*) dest ) ); - T return_val = *dest; - *dest = return_val - val; - Impl::unlock_address_host_space( (void*) dest ); - return return_val; -} - -//---------------------------------------------------------------------------- - -#elif defined( KOKKOS_ATOMICS_USE_OMP31 ) - -template< typename T > -T atomic_fetch_sub( volatile T * const dest , const T val ) -{ - T retval; -#pragma omp atomic capture - { - retval = dest[0]; - dest[0] -= val; - } - return retval; -} - -#endif - -// Simpler version of atomic_fetch_sub without the fetch -template -KOKKOS_INLINE_FUNCTION -void atomic_sub(volatile T * const dest, const T src) { - atomic_fetch_sub(dest,src); -} - -} - -#include -#endif - - diff --git a/lib/kokkos/core/src/impl/Kokkos_Atomic_Generic.hpp b/lib/kokkos/core/src/impl/Kokkos_Atomic_Generic.hpp deleted file mode 100644 index bd968633bb..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Atomic_Generic.hpp +++ /dev/null @@ -1,375 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ -#if defined( KOKKOS_ATOMIC_HPP ) && ! defined( KOKKOS_ATOMIC_GENERIC_HPP ) -#define KOKKOS_ATOMIC_GENERIC_HPP -#include - -// Combination operands to be used in an Compare and Exchange based atomic operation -namespace Kokkos { -namespace Impl { - -template -struct AddOper { - KOKKOS_FORCEINLINE_FUNCTION - static Scalar1 apply(const Scalar1& val1, const Scalar2& val2) { - return val1+val2; - } -}; - -template -struct SubOper { - KOKKOS_FORCEINLINE_FUNCTION - static Scalar1 apply(const Scalar1& val1, const Scalar2& val2) { - return val1-val2; - } -}; - -template -struct MulOper { - KOKKOS_FORCEINLINE_FUNCTION - static Scalar1 apply(const Scalar1& val1, const Scalar2& val2) { - return val1*val2; - } -}; - -template -struct DivOper { - KOKKOS_FORCEINLINE_FUNCTION - static Scalar1 apply(const Scalar1& val1, const Scalar2& val2) { - return val1/val2; - } -}; - -template -struct ModOper { - KOKKOS_FORCEINLINE_FUNCTION - static Scalar1 apply(const Scalar1& val1, const Scalar2& val2) { - return val1%val2; - } -}; - -template -struct AndOper { - KOKKOS_FORCEINLINE_FUNCTION - static Scalar1 apply(const Scalar1& val1, const Scalar2& val2) { - return val1&val2; - } -}; - -template -struct OrOper { - KOKKOS_FORCEINLINE_FUNCTION - static Scalar1 apply(const Scalar1& val1, const Scalar2& val2) { - return val1|val2; - } -}; - -template -struct XorOper { - KOKKOS_FORCEINLINE_FUNCTION - static Scalar1 apply(const Scalar1& val1, const Scalar2& val2) { - return val1^val2; - } -}; - -template -struct LShiftOper { - KOKKOS_FORCEINLINE_FUNCTION - static Scalar1 apply(const Scalar1& val1, const Scalar2& val2) { - return val1< -struct RShiftOper { - KOKKOS_FORCEINLINE_FUNCTION - static Scalar1 apply(const Scalar1& val1, const Scalar2& val2) { - return val1>>val2; - } -}; - -template < class Oper, typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_oper( const Oper& op, volatile T * const dest , - typename ::Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) == sizeof(unsigned long long int) , const T >::type val ) -{ - union { unsigned long long int i ; T t ; } oldval , assume , newval ; - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = Oper::apply(assume.t, val) ; - oldval.i = ::Kokkos::atomic_compare_exchange( (unsigned long long int*)dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return oldval.t ; -} - -template < class Oper, typename T > -KOKKOS_INLINE_FUNCTION -T atomic_oper_fetch( const Oper& op, volatile T * const dest , - typename ::Kokkos::Impl::enable_if< sizeof(T) != sizeof(int) && - sizeof(T) == sizeof(unsigned long long int) , const T >::type val ) -{ - union { unsigned long long int i ; T t ; } oldval , assume , newval ; - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = Oper::apply(assume.t, val) ; - oldval.i = ::Kokkos::atomic_compare_exchange( (unsigned long long int*)dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return newval.t ; -} - -template < class Oper, typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_oper( const Oper& op, volatile T * const dest , - typename ::Kokkos::Impl::enable_if< sizeof(T) == sizeof(int) , const T >::type val ) -{ - union { int i ; T t ; } oldval , assume , newval ; - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = Oper::apply(assume.t, val) ; - oldval.i = ::Kokkos::atomic_compare_exchange( (int*)dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return oldval.t ; -} - -template < class Oper, typename T > -KOKKOS_INLINE_FUNCTION -T atomic_oper_fetch( const Oper& op, volatile T * const dest , - typename ::Kokkos::Impl::enable_if< sizeof(T) == sizeof(int), const T >::type val ) -{ - union { int i ; T t ; } oldval , assume , newval ; - - oldval.t = *dest ; - - do { - assume.i = oldval.i ; - newval.t = Oper::apply(assume.t, val) ; - oldval.i = ::Kokkos::atomic_compare_exchange( (int*)dest , assume.i , newval.i ); - } while ( assume.i != oldval.i ); - - return newval.t ; -} - -template < class Oper, typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_oper( const Oper& op, volatile T * const dest , - typename ::Kokkos::Impl::enable_if< - ( sizeof(T) != 4 ) - && ( sizeof(T) != 8 ) - #if defined(KOKKOS_ENABLE_ASM) && defined(KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST) - && ( sizeof(T) != 16 ) - #endif - , const T >::type val ) -{ - -#ifdef KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST - while( !Impl::lock_address_host_space( (void*) dest ) ); - T return_val = *dest; - *dest = Oper::apply(return_val, val); - Impl::unlock_address_host_space( (void*) dest ); - return return_val; -#else - // This is a way to (hopefully) avoid dead lock in a warp - bool done = false; - while (! done ) { - if( Impl::lock_address_cuda_space( (void*) dest ) ) { - T return_val = *dest; - *dest = Oper::apply(return_val, val);; - Impl::unlock_address_cuda_space( (void*) dest ); - } - } - return return_val; -#endif -} - -template < class Oper, typename T > -KOKKOS_INLINE_FUNCTION -T atomic_oper_fetch( const Oper& op, volatile T * const dest , - typename ::Kokkos::Impl::enable_if< - ( sizeof(T) != 4 ) - && ( sizeof(T) != 8 ) - #if defined(KOKKOS_ENABLE_ASM) && defined(KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST) - && ( sizeof(T) != 16 ) - #endif - , const T >::type& val ) -{ - -#ifdef KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST - while( !Impl::lock_address_host_space( (void*) dest ) ); - T return_val = Oper::apply(*dest, val); - *dest = return_val; - Impl::unlock_address_host_space( (void*) dest ); - return return_val; -#else - // This is a way to (hopefully) avoid dead lock in a warp - bool done = false; - while (! done ) { - if( Impl::lock_address_cuda_space( (void*) dest ) ) { - T return_val = Oper::apply(*dest, val); - *dest = return_val; - Impl::unlock_address_cuda_space( (void*) dest ); - } - } - return return_val; -#endif -} - -} -} - -namespace Kokkos { - -// Fetch_Oper atomics: return value before operation -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_mul(volatile T * const dest, const T val) { - return Impl::atomic_fetch_oper(Impl::MulOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_div(volatile T * const dest, const T val) { - return Impl::atomic_fetch_oper(Impl::DivOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_mod(volatile T * const dest, const T val) { - return Impl::atomic_fetch_oper(Impl::ModOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_and(volatile T * const dest, const T val) { - return Impl::atomic_fetch_oper(Impl::AndOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_or(volatile T * const dest, const T val) { - return Impl::atomic_fetch_oper(Impl::OrOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_xor(volatile T * const dest, const T val) { - return Impl::atomic_fetch_oper(Impl::XorOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_lshift(volatile T * const dest, const unsigned int val) { - return Impl::atomic_fetch_oper(Impl::LShiftOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_fetch_rshift(volatile T * const dest, const unsigned int val) { - return Impl::atomic_fetch_oper(Impl::RShiftOper(),dest,val); -} - - -// Oper Fetch atomics: return value after operation -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_mul_fetch(volatile T * const dest, const T val) { - return Impl::atomic_oper_fetch(Impl::MulOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_div_fetch(volatile T * const dest, const T val) { - return Impl::atomic_oper_fetch(Impl::DivOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_mod_fetch(volatile T * const dest, const T val) { - return Impl::atomic_oper_fetch(Impl::ModOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_and_fetch(volatile T * const dest, const T val) { - return Impl::atomic_oper_fetch(Impl::AndOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_or_fetch(volatile T * const dest, const T val) { - return Impl::atomic_oper_fetch(Impl::OrOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_xor_fetch(volatile T * const dest, const T val) { - return Impl::atomic_oper_fetch(Impl::XorOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_lshift_fetch(volatile T * const dest, const unsigned int val) { - return Impl::atomic_oper_fetch(Impl::LShiftOper(),dest,val); -} - -template < typename T > -KOKKOS_INLINE_FUNCTION -T atomic_rshift_fetch(volatile T * const dest, const unsigned int val) { - return Impl::atomic_oper_fetch(Impl::RShiftOper(),dest,val); -} - - -} -#endif diff --git a/lib/kokkos/core/src/impl/Kokkos_Atomic_View.hpp b/lib/kokkos/core/src/impl/Kokkos_Atomic_View.hpp deleted file mode 100644 index f95ed67da9..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Atomic_View.hpp +++ /dev/null @@ -1,462 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ -#ifndef KOKKOS_ATOMIC_VIEW_HPP -#define KOKKOS_ATOMIC_VIEW_HPP - -#include -#include - -namespace Kokkos { namespace Impl { - -class AllocationTracker; - -//The following tag is used to prevent an implicit call of the constructor when trying -//to assign a literal 0 int ( = 0 ); -struct AtomicViewConstTag {}; - -template -class AtomicDataElement { -public: - typedef typename ViewTraits::value_type value_type; - typedef typename ViewTraits::const_value_type const_value_type; - typedef typename ViewTraits::non_const_value_type non_const_value_type; - volatile value_type* const ptr; - - KOKKOS_INLINE_FUNCTION - AtomicDataElement(value_type* ptr_, AtomicViewConstTag ):ptr(ptr_){} - - KOKKOS_INLINE_FUNCTION - const_value_type operator = (const_value_type& val) const { - *ptr = val; - return val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator = (volatile const_value_type& val) const { - *ptr = val; - return val; - } - - KOKKOS_INLINE_FUNCTION - void inc() const { - Kokkos::atomic_increment(ptr); - } - - KOKKOS_INLINE_FUNCTION - void dec() const { - Kokkos::atomic_decrement(ptr); - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator ++ () const { - const_value_type tmp = Kokkos::atomic_fetch_add(ptr,1); - return tmp+1; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator -- () const { - const_value_type tmp = Kokkos::atomic_fetch_add(ptr,-1); - return tmp-1; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator ++ (int) const { - return Kokkos::atomic_fetch_add(ptr,1); - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator -- (int) const { - return Kokkos::atomic_fetch_add(ptr,-1); - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator += (const_value_type& val) const { - const_value_type tmp = Kokkos::atomic_fetch_add(ptr,val); - return tmp+val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator += (volatile const_value_type& val) const { - const_value_type tmp = Kokkos::atomic_fetch_add(ptr,val); - return tmp+val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator -= (const_value_type& val) const { - const_value_type tmp = Kokkos::atomic_fetch_add(ptr,-val); - return tmp-val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator -= (volatile const_value_type& val) const { - const_value_type tmp = Kokkos::atomic_fetch_add(ptr,-val); - return tmp-val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator *= (const_value_type& val) const { - return Kokkos::atomic_mul_fetch(ptr,val); - } - KOKKOS_INLINE_FUNCTION - const_value_type operator *= (volatile const_value_type& val) const { - return Kokkos::atomic_mul_fetch(ptr,val); - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator /= (const_value_type& val) const { - return Kokkos::atomic_div_fetch(ptr,val); - } - KOKKOS_INLINE_FUNCTION - const_value_type operator /= (volatile const_value_type& val) const { - return Kokkos::atomic_div_fetch(ptr,val); - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator %= (const_value_type& val) const { - return Kokkos::atomic_mod_fetch(ptr,val); - } - KOKKOS_INLINE_FUNCTION - const_value_type operator %= (volatile const_value_type& val) const { - return Kokkos::atomic_mod_fetch(ptr,val); - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator &= (const_value_type& val) const { - return Kokkos::atomic_and_fetch(ptr,val); - } - KOKKOS_INLINE_FUNCTION - const_value_type operator &= (volatile const_value_type& val) const { - return Kokkos::atomic_and_fetch(ptr,val); - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator ^= (const_value_type& val) const { - return Kokkos::atomic_xor_fetch(ptr,val); - } - KOKKOS_INLINE_FUNCTION - const_value_type operator ^= (volatile const_value_type& val) const { - return Kokkos::atomic_xor_fetch(ptr,val); - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator |= (const_value_type& val) const { - return Kokkos::atomic_or_fetch(ptr,val); - } - KOKKOS_INLINE_FUNCTION - const_value_type operator |= (volatile const_value_type& val) const { - return Kokkos::atomic_or_fetch(ptr,val); - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator <<= (const_value_type& val) const { - return Kokkos::atomic_lshift_fetch(ptr,val); - } - KOKKOS_INLINE_FUNCTION - const_value_type operator <<= (volatile const_value_type& val) const { - return Kokkos::atomic_lshift_fetch(ptr,val); - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator >>= (const_value_type& val) const { - return Kokkos::atomic_rshift_fetch(ptr,val); - } - KOKKOS_INLINE_FUNCTION - const_value_type operator >>= (volatile const_value_type& val) const { - return Kokkos::atomic_rshift_fetch(ptr,val); - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator + (const_value_type& val) const { - return *ptr+val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator + (volatile const_value_type& val) const { - return *ptr+val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator - (const_value_type& val) const { - return *ptr-val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator - (volatile const_value_type& val) const { - return *ptr-val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator * (const_value_type& val) const { - return *ptr*val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator * (volatile const_value_type& val) const { - return *ptr*val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator / (const_value_type& val) const { - return *ptr/val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator / (volatile const_value_type& val) const { - return *ptr/val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator % (const_value_type& val) const { - return *ptr^val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator % (volatile const_value_type& val) const { - return *ptr^val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator ! () const { - return !*ptr; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator && (const_value_type& val) const { - return *ptr&&val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator && (volatile const_value_type& val) const { - return *ptr&&val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator || (const_value_type& val) const { - return *ptr|val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator || (volatile const_value_type& val) const { - return *ptr|val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator & (const_value_type& val) const { - return *ptr&val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator & (volatile const_value_type& val) const { - return *ptr&val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator | (const_value_type& val) const { - return *ptr|val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator | (volatile const_value_type& val) const { - return *ptr|val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator ^ (const_value_type& val) const { - return *ptr^val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator ^ (volatile const_value_type& val) const { - return *ptr^val; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator ~ () const { - return ~*ptr; - } - - KOKKOS_INLINE_FUNCTION - const_value_type operator << (const unsigned int& val) const { - return *ptr<> (const unsigned int& val) const { - return *ptr>>val; - } - KOKKOS_INLINE_FUNCTION - const_value_type operator >> (volatile const unsigned int& val) const { - return *ptr>>val; - } - - KOKKOS_INLINE_FUNCTION - bool operator == (const_value_type& val) const { - return *ptr == val; - } - KOKKOS_INLINE_FUNCTION - bool operator == (volatile const_value_type& val) const { - return *ptr == val; - } - - KOKKOS_INLINE_FUNCTION - bool operator != (const_value_type& val) const { - return *ptr != val; - } - KOKKOS_INLINE_FUNCTION - bool operator != (volatile const_value_type& val) const { - return *ptr != val; - } - - KOKKOS_INLINE_FUNCTION - bool operator >= (const_value_type& val) const { - return *ptr >= val; - } - KOKKOS_INLINE_FUNCTION - bool operator >= (volatile const_value_type& val) const { - return *ptr >= val; - } - - KOKKOS_INLINE_FUNCTION - bool operator <= (const_value_type& val) const { - return *ptr <= val; - } - KOKKOS_INLINE_FUNCTION - bool operator <= (volatile const_value_type& val) const { - return *ptr <= val; - } - - KOKKOS_INLINE_FUNCTION - bool operator < (const_value_type& val) const { - return *ptr < val; - } - KOKKOS_INLINE_FUNCTION - bool operator < (volatile const_value_type& val) const { - return *ptr < val; - } - - KOKKOS_INLINE_FUNCTION - bool operator > (const_value_type& val) const { - return *ptr > val; - } - KOKKOS_INLINE_FUNCTION - bool operator > (volatile const_value_type& val) const { - return *ptr > val; - } - - KOKKOS_INLINE_FUNCTION - operator const_value_type () const { - //return Kokkos::atomic_load(ptr); - return *ptr; - } - - KOKKOS_INLINE_FUNCTION - operator volatile non_const_value_type () volatile const { - //return Kokkos::atomic_load(ptr); - return *ptr; - } -}; - -template -class AtomicViewDataHandle { -public: - typename ViewTraits::value_type* ptr; - - KOKKOS_INLINE_FUNCTION - AtomicViewDataHandle() - : ptr(NULL) - {} - - KOKKOS_INLINE_FUNCTION - AtomicViewDataHandle(typename ViewTraits::value_type* ptr_) - :ptr(ptr_) - {} - - template - KOKKOS_INLINE_FUNCTION - AtomicDataElement operator[] (const iType& i) const { - return AtomicDataElement(ptr+i,AtomicViewConstTag()); - } - - - KOKKOS_INLINE_FUNCTION - operator typename ViewTraits::value_type * () const { return ptr ; } - -}; - -template -struct Kokkos_Atomic_is_only_allowed_with_32bit_and_64bit_scalars; - -template<> -struct Kokkos_Atomic_is_only_allowed_with_32bit_and_64bit_scalars<4> { - typedef int type; -}; - -template<> -struct Kokkos_Atomic_is_only_allowed_with_32bit_and_64bit_scalars<8> { - typedef int64_t type; -}; - -// Must be non-const, atomic access trait, and 32 or 64 bit type for true atomics. -template -class ViewDataHandle< - ViewTraits , - typename enable_if< - ( ! is_same::value) && - ( ViewTraits::memory_traits::Atomic ) - >::type > -{ -private: -// typedef typename if_c<(sizeof(typename ViewTraits::const_value_type)==4) || -// (sizeof(typename ViewTraits::const_value_type)==8), -// int, Kokkos_Atomic_is_only_allowed_with_32bit_and_64bit_scalars >::type -// atomic_view_possible; - typedef typename Kokkos_Atomic_is_only_allowed_with_32bit_and_64bit_scalars::type enable_atomic_type; - typedef ViewDataHandle self_type; - -public: - enum { ReturnTypeIsReference = false }; - - typedef Impl::AtomicViewDataHandle handle_type; - typedef Impl::AtomicDataElement return_type; - - KOKKOS_INLINE_FUNCTION - static handle_type create_handle( typename ViewTraits::value_type * arg_data_ptr, AllocationTracker const & /*arg_tracker*/ ) - { - return handle_type(arg_data_ptr); - } -}; - -}} // namespace Kokkos::Impl - -#endif diff --git a/lib/kokkos/core/src/impl/Kokkos_Atomic_Windows.hpp b/lib/kokkos/core/src/impl/Kokkos_Atomic_Windows.hpp deleted file mode 100644 index 62581569fb..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Atomic_Windows.hpp +++ /dev/null @@ -1,211 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ -#ifndef KOKKOS_ATOMIC_WINDOWS_HPP -#define KOKKOS_ATOMIC_WINDOWS_HPP -#ifdef _WIN32 - -#define NOMINMAX -#include - -namespace Kokkos { - namespace Impl { - _declspec(align(16)) - struct cas128_t - { - LONGLONG lower; - LONGLONG upper; - KOKKOS_INLINE_FUNCTION - bool operator != (const cas128_t& a) const { - return (lower != a.lower) || upper != a.upper; - } - }; - } - -#ifdef KOKKOS_HAVE_CXX11 - template < typename T > - KOKKOS_INLINE_FUNCTION - T atomic_compare_exchange(volatile T * const dest, const T & compare, - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(LONG), const T & >::type val) - { - union U { - LONG i; - T t; - KOKKOS_INLINE_FUNCTION U() {}; - } tmp; - - tmp.i = _InterlockedCompareExchange((LONG*)dest, *((LONG*)&val), *((LONG*)&compare)); - return tmp.t; - } - - template < typename T > - KOKKOS_INLINE_FUNCTION - T atomic_compare_exchange(volatile T * const dest, const T & compare, - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(LONGLONG), const T & >::type val) - { - union U { - LONGLONG i; - T t; - KOKKOS_INLINE_FUNCTION U() {}; - } tmp; - - tmp.i = _InterlockedCompareExchange64((LONGLONG*)dest, *((LONGLONG*)&val), *((LONGLONG*)&compare)); - return tmp.t; - } - - template < typename T > - KOKKOS_INLINE_FUNCTION - T atomic_compare_exchange(volatile T * const dest, const T & compare, - typename Kokkos::Impl::enable_if< sizeof(T) == sizeof(Impl::cas128_t), const T & >::type val) - { - union U { - Impl::cas128_t i; - T t; - KOKKOS_INLINE_FUNCTION U() {}; - } tmp, newval; - newval.t = val; - tmp.i = _InterlockedCompareExchange128((LONGLONG*)dest, newval.i.upper, newval.i.lower, *((LONGLONG*)&compare)); - return tmp.t; - } - - template< typename T > - T atomic_fetch_or(volatile T * const dest, const T val) { - T oldval = *dest; - T assume; - do { - assume = oldval; - T newval = val | oldval; - oldval = atomic_compare_exchange(dest, assume, newval); - } while (assume != oldval); - - return oldval; - } - - template< typename T > - T atomic_fetch_and(volatile T * const dest, const T val) { - T oldval = *dest; - T assume; - do { - assume = oldval; - T newval = val & oldval; - oldval = atomic_compare_exchange(dest, assume, newval); - } while (assume != oldval); - - return oldval; - } - - template< typename T > - T atomic_fetch_add(volatile T * const dest, const T val) { - T oldval = *dest; - T assume; - do { - assume = oldval; - T newval = val + oldval; - oldval = atomic_compare_exchange(dest, assume, newval); - } while (assume != oldval); - - return oldval; - } - - template< typename T > - T atomic_fetch_exchange(volatile T * const dest, const T val) { - T oldval = *dest; - T assume; - do { - assume = oldval; - oldval = atomic_compare_exchange(dest, assume, val); - } while (assume != oldval); - - return oldval; - } - - template< typename T > - void atomic_or(volatile T * const dest, const T val) { - atomic_fetch_or(dest, val); - } - - template< typename T > - void atomic_and(volatile T * const dest, const T val) { - atomic_fetch_and(dest, val); - } - - template< typename T > - void atomic_add(volatile T * const dest, const T val) { - atomic_fetch_add(dest, val); - } - - template< typename T > - void atomic_exchange(volatile T * const dest, const T val) { - atomic_fetch_exchange(dest, val); - } - - template< typename T > - void atomic_assign(volatile T * const dest, const T val) { - atomic_fetch_exchange(dest, val); - } - - template< typename T > - T atomic_increment(volatile T * const dest) { - T oldval = *dest; - T assume; - do { - assume = oldval; - T newval = assume++; - oldval = atomic_compare_exchange(dest, assume, newval); - } while (assume != oldval); - } - - template< typename T > - T atomic_decrement(volatile T * const dest) { - T oldval = *dest; - T assume; - do { - assume = oldval; - T newval = assume--; - oldval = atomic_compare_exchange(dest, assume, newval); - } while (assume != oldval); - } - -} -#endif -#endif -#endif \ No newline at end of file diff --git a/lib/kokkos/core/src/impl/Kokkos_BasicAllocators.cpp b/lib/kokkos/core/src/impl/Kokkos_BasicAllocators.cpp deleted file mode 100644 index 08085dca36..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_BasicAllocators.cpp +++ /dev/null @@ -1,281 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include - - -#include // uintptr_t -#include // for malloc, realloc, and free -#include // for memcpy -#include // for mmap, munmap, MAP_ANON, etc -#include // for sysconf, _SC_PAGE_SIZE, _SC_PHYS_PAGES - -#include - -namespace Kokkos { namespace Impl { - -/*--------------------------------------------------------------------------*/ - -void* MallocAllocator::allocate( size_t size ) -{ - void * ptr = NULL; - if (size) { - ptr = malloc(size); - - if (!ptr) - { - std::ostringstream msg ; - msg << name() << ": allocate(" << size << ") FAILED"; - throw_runtime_exception( msg.str() ); - } - } - return ptr; -} - -void MallocAllocator::deallocate( void * ptr, size_t /*size*/ ) -{ - if (ptr) { - free(ptr); - } -} - -void * MallocAllocator::reallocate(void * old_ptr, size_t /*old_size*/, size_t new_size) -{ - void * ptr = realloc(old_ptr, new_size); - - if (new_size > 0u && ptr == NULL) { - throw_runtime_exception("Error: Malloc Allocator could not reallocate memory"); - } - return ptr; -} - -/*--------------------------------------------------------------------------*/ - -namespace { - -void * raw_aligned_allocate( size_t size, size_t alignment ) -{ - void * ptr = NULL; - if ( size ) { -#if defined( __INTEL_COMPILER ) && !defined ( KOKKOS_HAVE_CUDA ) - ptr = _mm_malloc( size , alignment ); - -#elif ( defined( _POSIX_C_SOURCE ) && _POSIX_C_SOURCE >= 200112L ) || \ - ( defined( _XOPEN_SOURCE ) && _XOPEN_SOURCE >= 600 ) - - posix_memalign( & ptr, alignment , size ); - -#else - // Over-allocate to and round up to guarantee proper alignment. - size_t size_padded = size + alignment + sizeof(void *); - void * alloc_ptr = malloc( size_padded ); - - if (alloc_ptr) { - uintptr_t address = reinterpret_cast(alloc_ptr); - // offset enough to record the alloc_ptr - address += sizeof(void *); - uintptr_t rem = address % alignment; - uintptr_t offset = rem ? (alignment - rem) : 0u; - address += offset; - ptr = reinterpret_cast(address); - // record the alloc'd pointer - address -= sizeof(void *); - *reinterpret_cast(address) = alloc_ptr; - } -#endif - } - return ptr; -} - -void raw_aligned_deallocate( void * ptr, size_t /*size*/ ) -{ - if ( ptr ) { -#if defined( __INTEL_COMPILER ) && !defined ( KOKKOS_HAVE_CUDA ) - _mm_free( ptr ); - -#elif ( defined( _POSIX_C_SOURCE ) && _POSIX_C_SOURCE >= 200112L ) || \ - ( defined( _XOPEN_SOURCE ) && _XOPEN_SOURCE >= 600 ) - free( ptr ); -#else - // get the alloc'd pointer - void * alloc_ptr = *(reinterpret_cast(ptr) -1); - free( alloc_ptr ); -#endif - } - -} - -} - -void* AlignedAllocator::allocate( size_t size ) -{ - void * ptr = 0 ; - - if ( size ) { - ptr = raw_aligned_allocate(size, MEMORY_ALIGNMENT); - - if (!ptr) - { - std::ostringstream msg ; - msg << name() << ": allocate(" << size << ") FAILED"; - throw_runtime_exception( msg.str() ); - } - } - return ptr; -} - -void AlignedAllocator::deallocate( void * ptr, size_t size ) -{ - raw_aligned_deallocate( ptr, size); -} - -void * AlignedAllocator::reallocate(void * old_ptr, size_t old_size, size_t new_size) -{ - void * ptr = old_ptr;; - - if (old_size < new_size) { - ptr = allocate( new_size ); - - memcpy(ptr, old_ptr, old_size ); - - deallocate( old_ptr, old_size ); - } - - return ptr; -} - -/*--------------------------------------------------------------------------*/ - -// mmap flags for private anonymous memory allocation -#if defined( MAP_ANONYMOUS ) && defined( MAP_PRIVATE ) - #define MMAP_FLAGS (MAP_PRIVATE | MAP_ANONYMOUS) -#elif defined( MAP_ANON) && defined( MAP_PRIVATE ) - #define MMAP_FLAGS (MAP_PRIVATE | MAP_ANON) -#else - #define NO_MMAP -#endif - -// huge page tables -#if !defined( NO_MMAP ) - #if defined( MAP_HUGETLB ) - #define MMAP_FLAGS_HUGE (MMAP_FLAGS | MAP_HUGETLB ) - #elif defined( MMAP_FLAGS ) - #define MMAP_FLAGS_HUGE MMAP_FLAGS - #endif - // threshold to use huge pages - #define MMAP_USE_HUGE_PAGES (1u << 27) -#endif - -// read write access to private memory -#if !defined( NO_MMAP ) - #define MMAP_PROTECTION (PROT_READ | PROT_WRITE) -#endif - - -void* PageAlignedAllocator::allocate( size_t size ) -{ - void *ptr = NULL; - if (size) { -#if !defined NO_MMAP - if ( size < MMAP_USE_HUGE_PAGES ) { - ptr = mmap( NULL, size, MMAP_PROTECTION, MMAP_FLAGS, -1 /*file descriptor*/, 0 /*offset*/); - } else { - ptr = mmap( NULL, size, MMAP_PROTECTION, MMAP_FLAGS_HUGE, -1 /*file descriptor*/, 0 /*offset*/); - } - if (ptr == MAP_FAILED) { - ptr = NULL; - } -#else - static const size_t page_size = 4096; // TODO: read in from sysconf( _SC_PAGE_SIZE ) - - ptr = raw_aligned_allocate( size, page_size); -#endif - if (!ptr) - { - std::ostringstream msg ; - msg << name() << ": allocate(" << size << ") FAILED"; - throw_runtime_exception( msg.str() ); - } - } - return ptr; -} - -void PageAlignedAllocator::deallocate( void * ptr, size_t size ) -{ -#if !defined( NO_MMAP ) - munmap(ptr, size); -#else - raw_aligned_deallocate(ptr, size); -#endif -} - -void * PageAlignedAllocator::reallocate(void * old_ptr, size_t old_size, size_t new_size) -{ - void * ptr = NULL; -#if defined( NO_MMAP ) || defined( __APPLE__ ) || defined( __CYGWIN__ ) - - if (old_size != new_size) { - ptr = allocate( new_size ); - - memcpy(ptr, old_ptr, (old_size < new_size ? old_size : new_size) ); - - deallocate( old_ptr, old_size ); - } - else { - ptr = old_ptr; - } -#else - ptr = mremap( old_ptr, old_size, new_size, MREMAP_MAYMOVE ); - - if (ptr == MAP_FAILED) { - throw_runtime_exception("Error: Page Aligned Allocator could not reallocate memory"); - } -#endif - - return ptr; -} - -}} // namespace Kokkos::Impl diff --git a/lib/kokkos/core/src/impl/Kokkos_BasicAllocators.hpp b/lib/kokkos/core/src/impl/Kokkos_BasicAllocators.hpp deleted file mode 100644 index 76377c5f15..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_BasicAllocators.hpp +++ /dev/null @@ -1,118 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_BASIC_ALLOCATORS_HPP -#define KOKKOS_BASIC_ALLOCATORS_HPP - - -namespace Kokkos { namespace Impl { - -/// class UnmanagedAllocator -/// does nothing when deallocate(ptr,size) is called -class UnmanagedAllocator -{ -public: - static const char * name() { return "Unmanaged Allocator"; } - - static void deallocate(void * /*ptr*/, size_t /*size*/) {} -}; - - -/// class MallocAllocator -class MallocAllocator -{ -public: - static const char * name() - { - return "Malloc Allocator"; - } - - static void* allocate(size_t size); - - static void deallocate(void * ptr, size_t size); - - static void * reallocate(void * old_ptr, size_t old_size, size_t new_size); -}; - - -/// class AlignedAllocator -/// memory aligned to Kokkos::Impl::MEMORY_ALIGNMENT -class AlignedAllocator -{ -public: - static const char * name() - { - return "Aligned Allocator"; - } - - static void* allocate(size_t size); - - static void deallocate(void * ptr, size_t size); - - static void * reallocate(void * old_ptr, size_t old_size, size_t new_size); -}; - - -/// class PageAlignedAllocator -/// memory aligned to PAGE_SIZE -class PageAlignedAllocator -{ -public: - static const char * name() - { - return "Page Aligned Allocator"; - } - - static void* allocate(size_t size); - - static void deallocate(void * ptr, size_t size); - - static void * reallocate(void * old_ptr, size_t old_size, size_t new_size); -}; - - -}} // namespace Kokkos::Impl - -#endif //KOKKOS_BASIC_ALLOCATORS_HPP - - diff --git a/lib/kokkos/core/src/impl/Kokkos_Core.cpp b/lib/kokkos/core/src/impl/Kokkos_Core.cpp deleted file mode 100644 index 1c3c83cfe7..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Core.cpp +++ /dev/null @@ -1,447 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { -namespace { - -bool is_unsigned_int(const char* str) -{ - const size_t len = strlen (str); - for (size_t i = 0; i < len; ++i) { - if (! isdigit (str[i])) { - return false; - } - } - return true; -} - -void initialize_internal(const InitArguments& args) -{ - // Protect declarations, to prevent "unused variable" warnings. -#if defined( KOKKOS_HAVE_OPENMP ) || defined( KOKKOS_HAVE_PTHREAD ) - const int num_threads = args.num_threads; - const int use_numa = args.num_numa; -#endif // defined( KOKKOS_HAVE_OPENMP ) || defined( KOKKOS_HAVE_PTHREAD ) -#if defined( KOKKOS_HAVE_CUDA ) - const int use_gpu = args.device_id; -#endif // defined( KOKKOS_HAVE_CUDA ) - -#if defined( KOKKOS_HAVE_OPENMP ) - if( Impl::is_same< Kokkos::OpenMP , Kokkos::DefaultExecutionSpace >::value || - Impl::is_same< Kokkos::OpenMP , Kokkos::HostSpace::execution_space >::value ) { - if(num_threads>0) { - if(use_numa>0) { - Kokkos::OpenMP::initialize(num_threads,use_numa); - } - else { - Kokkos::OpenMP::initialize(num_threads); - } - } else { - Kokkos::OpenMP::initialize(); - } - //std::cout << "Kokkos::initialize() fyi: OpenMP enabled and initialized" << std::endl ; - } - else { - //std::cout << "Kokkos::initialize() fyi: OpenMP enabled but not initialized" << std::endl ; - } -#endif - -#if defined( KOKKOS_HAVE_PTHREAD ) - if( Impl::is_same< Kokkos::Threads , Kokkos::DefaultExecutionSpace >::value || - Impl::is_same< Kokkos::Threads , Kokkos::HostSpace::execution_space >::value ) { - if(num_threads>0) { - if(use_numa>0) { - Kokkos::Threads::initialize(num_threads,use_numa); - } - else { - Kokkos::Threads::initialize(num_threads); - } - } else { - Kokkos::Threads::initialize(); - } - //std::cout << "Kokkos::initialize() fyi: Pthread enabled and initialized" << std::endl ; - } - else { - //std::cout << "Kokkos::initialize() fyi: Pthread enabled but not initialized" << std::endl ; - } -#endif - -#if defined( KOKKOS_HAVE_SERIAL ) - // Prevent "unused variable" warning for 'args' input struct. If - // Serial::initialize() ever needs to take arguments from the input - // struct, you may remove this line of code. - (void) args; - - if( Impl::is_same< Kokkos::Serial , Kokkos::DefaultExecutionSpace >::value || - Impl::is_same< Kokkos::Serial , Kokkos::HostSpace::execution_space >::value ) { - Kokkos::Serial::initialize(); - } -#endif - -#if defined( KOKKOS_HAVE_CUDA ) - if( Impl::is_same< Kokkos::Cuda , Kokkos::DefaultExecutionSpace >::value || 0 < use_gpu ) { - if (use_gpu > -1) { - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice( use_gpu ) ); - } - else { - Kokkos::Cuda::initialize(); - } - //std::cout << "Kokkos::initialize() fyi: Cuda enabled and initialized" << std::endl ; - } -#endif - -#ifdef KOKKOSP_ENABLE_PROFILING - Kokkos::Experimental::initialize(); -#endif -} - -void finalize_internal( const bool all_spaces = false ) -{ - -#if defined( KOKKOS_HAVE_CUDA ) - if( Impl::is_same< Kokkos::Cuda , Kokkos::DefaultExecutionSpace >::value || all_spaces ) { - if(Kokkos::Cuda::is_initialized()) - Kokkos::Cuda::finalize(); - } -#endif - -#if defined( KOKKOS_HAVE_OPENMP ) - if( Impl::is_same< Kokkos::OpenMP , Kokkos::DefaultExecutionSpace >::value || - Impl::is_same< Kokkos::OpenMP , Kokkos::HostSpace::execution_space >::value || - all_spaces ) { - if(Kokkos::OpenMP::is_initialized()) - Kokkos::OpenMP::finalize(); - } -#endif - -#if defined( KOKKOS_HAVE_PTHREAD ) - if( Impl::is_same< Kokkos::Threads , Kokkos::DefaultExecutionSpace >::value || - Impl::is_same< Kokkos::Threads , Kokkos::HostSpace::execution_space >::value || - all_spaces ) { - if(Kokkos::Threads::is_initialized()) - Kokkos::Threads::finalize(); - } -#endif - -#if defined( KOKKOS_HAVE_SERIAL ) - if( Impl::is_same< Kokkos::Serial , Kokkos::DefaultExecutionSpace >::value || - Impl::is_same< Kokkos::Serial , Kokkos::HostSpace::execution_space >::value || - all_spaces ) { - if(Kokkos::Serial::is_initialized()) - Kokkos::Serial::finalize(); - } -#endif - -#ifdef KOKKOSP_ENABLE_PROFILING - Kokkos::Experimental::finalize(); -#endif - -} - -void fence_internal() -{ - -#if defined( KOKKOS_HAVE_CUDA ) - if( Impl::is_same< Kokkos::Cuda , Kokkos::DefaultExecutionSpace >::value ) { - Kokkos::Cuda::fence(); - } -#endif - -#if defined( KOKKOS_HAVE_OPENMP ) - if( Impl::is_same< Kokkos::OpenMP , Kokkos::DefaultExecutionSpace >::value || - Impl::is_same< Kokkos::OpenMP , Kokkos::HostSpace::execution_space >::value ) { - Kokkos::OpenMP::fence(); - } -#endif - -#if defined( KOKKOS_HAVE_PTHREAD ) - if( Impl::is_same< Kokkos::Threads , Kokkos::DefaultExecutionSpace >::value || - Impl::is_same< Kokkos::Threads , Kokkos::HostSpace::execution_space >::value ) { - Kokkos::Threads::fence(); - } -#endif - -#if defined( KOKKOS_HAVE_SERIAL ) - if( Impl::is_same< Kokkos::Serial , Kokkos::DefaultExecutionSpace >::value || - Impl::is_same< Kokkos::Serial , Kokkos::HostSpace::execution_space >::value ) { - Kokkos::Serial::fence(); - } -#endif - -} - -} // namespace -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- - -namespace Kokkos { - -void initialize(int& narg, char* arg[]) -{ - int num_threads = -1; - int numa = -1; - int device = -1; - - int kokkos_threads_found = 0; - int kokkos_numa_found = 0; - int kokkos_device_found = 0; - int kokkos_ndevices_found = 0; - - int iarg = 0; - - while (iarg < narg) { - if ((strncmp(arg[iarg],"--kokkos-threads",16) == 0) || (strncmp(arg[iarg],"--threads",9) == 0)) { - //Find the number of threads (expecting --threads=XX) - if (!((strncmp(arg[iarg],"--kokkos-threads=",17) == 0) || (strncmp(arg[iarg],"--threads=",10) == 0))) - Impl::throw_runtime_exception("Error: expecting an '=INT' after command line argument '--threads/--kokkos-threads'. Raised by Kokkos::initialize(int narg, char* argc[])."); - - char* number = strchr(arg[iarg],'=')+1; - - if(!Impl::is_unsigned_int(number) || (strlen(number)==0)) - Impl::throw_runtime_exception("Error: expecting an '=INT' after command line argument '--threads/--kokkos-threads'. Raised by Kokkos::initialize(int narg, char* argc[])."); - - if((strncmp(arg[iarg],"--kokkos-threads",16) == 0) || !kokkos_threads_found) - num_threads = atoi(number); - - //Remove the --kokkos-threads argument from the list but leave --threads - if(strncmp(arg[iarg],"--kokkos-threads",16) == 0) { - for(int k=iarg;k= skip_device) device++; - } - if ((str = getenv("MV2_COMM_WORLD_LOCAL_RANK"))) { - int local_rank = atoi(str); - device = local_rank % ndevices; - if (device >= skip_device) device++; - } - if ((str = getenv("OMPI_COMM_WORLD_LOCAL_RANK"))) { - int local_rank = atoi(str); - device = local_rank % ndevices; - if (device >= skip_device) device++; - } - if(device==-1) { - device = 0; - if (device >= skip_device) device++; - } - } - - //Remove the --kokkos-ndevices argument from the list but leave --ndevices - if(strncmp(arg[iarg],"--kokkos-ndevices",17) == 0) { - for(int k=iarg;k -#include -#include - -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -void host_abort( const char * const message ) -{ - fwrite(message,1,strlen(message),stderr); - fflush(stderr); - abort(); -} - -void throw_runtime_exception( const std::string & msg ) -{ - std::ostringstream o ; - o << msg ; - traceback_callstack( o ); - throw std::runtime_error( o.str() ); -} - - -std::string human_memory_size(size_t arg_bytes) -{ - double bytes = arg_bytes; - const double K = 1024; - const double M = K*1024; - const double G = M*1024; - - std::ostringstream out; - if (bytes < K) { - out << std::setprecision(4) << bytes << " B"; - } else if (bytes < M) { - bytes /= K; - out << std::setprecision(4) << bytes << " K"; - } else if (bytes < G) { - bytes /= M; - out << std::setprecision(4) << bytes << " M"; - } else { - bytes /= G; - out << std::setprecision(4) << bytes << " G"; - } - return out.str(); -} - -} -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#if defined( __GNUC__ ) && defined( ENABLE_TRACEBACK ) - -/* This is only known to work with GNU C++ - * Must be compiled with '-rdynamic' - * Must be linked with '-ldl' - */ - -/* Print call stack into an error stream, - * so one knows in which function the error occured. - * - * Code copied from: - * http://stupefydeveloper.blogspot.com/2008/10/cc-call-stack.html - * - * License on this site: - * This blog is licensed under a - * Creative Commons Attribution-Share Alike 3.0 Unported License. - * - * http://creativecommons.org/licenses/by-sa/3.0/ - * - * Modified to output to std::ostream. - */ -#include -#include -#include -#include -#include - -namespace Kokkos { -namespace Impl { - -void traceback_callstack( std::ostream & msg ) -{ - using namespace abi; - - enum { MAX_DEPTH = 32 }; - - void *trace[MAX_DEPTH]; - Dl_info dlinfo; - - int status; - - int trace_size = backtrace(trace, MAX_DEPTH); - - msg << std::endl << "Call stack {" << std::endl ; - - for (int i=1; i -#include - -namespace Kokkos { -namespace Impl { - -void host_abort( const char * const ); - -void throw_runtime_exception( const std::string & ); - -void traceback_callstack( std::ostream & ); - -std::string human_memory_size(size_t arg_bytes); - -} -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) -namespace Kokkos { -inline -void abort( const char * const message ) { Kokkos::Impl::host_abort(message); } -} -#endif /* defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_CUDA ) */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_IMPL_ERROR_HPP */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_FunctorAdapter.hpp b/lib/kokkos/core/src/impl/Kokkos_FunctorAdapter.hpp deleted file mode 100644 index 9d1119e56e..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_FunctorAdapter.hpp +++ /dev/null @@ -1,1108 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_FUNCTORADAPTER_HPP -#define KOKKOS_FUNCTORADAPTER_HPP - -#include -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class ArgTag , class Enable = void > -struct FunctorDeclaresValueType : public Impl::false_type {}; - -template< class FunctorType , class ArgTag > -struct FunctorDeclaresValueType< FunctorType , ArgTag - , typename Impl::enable_if_type< typename FunctorType::value_type >::type > - : public Impl::true_type {}; - - -/** \brief Query Functor and execution policy argument tag for value type. - * - * If C++11 enabled and 'value_type' is not explicitly declared then attempt - * to deduce the type from FunctorType::operator(). - */ -template< class FunctorType , class ArgTag , bool Dec = FunctorDeclaresValueType::value > -struct FunctorValueTraits -{ - typedef void value_type ; - typedef void pointer_type ; - typedef void reference_type ; - - enum { StaticValueSize = 0 }; - - KOKKOS_FORCEINLINE_FUNCTION static - unsigned value_count( const FunctorType & ) { return 0 ; } - - KOKKOS_FORCEINLINE_FUNCTION static - unsigned value_size( const FunctorType & ) { return 0 ; } -}; - -template -struct FunctorValueTraits -{ - typedef void reference_type; -}; - -/** \brief FunctorType::value_type is explicitly declared so use it. - * - * Two options for declaration - * - * 1) A plain-old-data (POD) type - * typedef {pod_type} value_type ; - * - * 2) An array of POD of a runtime specified count. - * typedef {pod_type} value_type[] ; - * const unsigned value_count ; - */ -template< class FunctorType , class ArgTag > -struct FunctorValueTraits< FunctorType , ArgTag , true /* == exists FunctorType::value_type */ > -{ - typedef typename Impl::remove_extent< typename FunctorType::value_type >::type value_type ; - - // If not an array then what is the sizeof(value_type) - enum { StaticValueSize = Impl::is_array< typename FunctorType::value_type >::value ? 0 : sizeof(value_type) }; - - typedef value_type * pointer_type ; - - // The reference_type for an array is 'value_type *' - // The reference_type for a single value is 'value_type &' - - typedef typename Impl::if_c< ! StaticValueSize , value_type * - , value_type & >::type reference_type ; - - // Number of values if single value - template< class F > - KOKKOS_FORCEINLINE_FUNCTION static - typename Impl::enable_if< Impl::is_same::value && StaticValueSize , unsigned >::type - value_count( const F & ) { return 1 ; } - - // Number of values if an array, protect via templating because 'f.value_count' - // will only exist when the functor declares the value_type to be an array. - template< class F > - KOKKOS_FORCEINLINE_FUNCTION static - typename Impl::enable_if< Impl::is_same::value && ! StaticValueSize , unsigned >::type - value_count( const F & f ) { return f.value_count ; } - - // Total size of the value - KOKKOS_INLINE_FUNCTION static - unsigned value_size( const FunctorType & f ) { return value_count( f ) * sizeof(value_type) ; } -}; - - -#if defined( KOKKOS_HAVE_CXX11 ) - -template< class FunctorType , class ArgTag > -struct FunctorValueTraits< FunctorType - , ArgTag - , false /* == exists FunctorType::value_type */ - > -{ -private: - - struct VOIDTAG {}; // Allow declaration of non-matching operator() with void argument tag. - struct REJECTTAG {}; // Reject tagged operator() when using non-tagged execution policy. - - typedef typename - Impl::if_c< Impl::is_same< ArgTag , void >::value , VOIDTAG , ArgTag >::type tag_type ; - - //---------------------------------------- - // parallel_for operator without a tag: - - template< class ArgMember > - KOKKOS_INLINE_FUNCTION - static VOIDTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( ArgMember ) const ) {} - - template< class ArgMember > - KOKKOS_INLINE_FUNCTION - static VOIDTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const ArgMember & ) const ) {} - - template< class TagType , class ArgMember > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( TagType , ArgMember ) const ) {} - - template< class TagType , class ArgMember > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( TagType , const ArgMember & ) const ) {} - - template< class TagType , class ArgMember > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const TagType & , ArgMember ) const ) {} - - template< class TagType , class ArgMember > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const TagType & , const ArgMember & ) const ) {} - - //---------------------------------------- - // parallel_for operator with a tag: - - template< class ArgMember > - KOKKOS_INLINE_FUNCTION - static VOIDTAG deduce_reduce_type( tag_type , void (FunctorType::*)( tag_type , ArgMember ) const ) {} - - template< class ArgMember > - KOKKOS_INLINE_FUNCTION - static VOIDTAG deduce_reduce_type( tag_type , void (FunctorType::*)( const tag_type & , ArgMember ) const ) {} - - template< class ArgMember > - KOKKOS_INLINE_FUNCTION - static VOIDTAG deduce_reduce_type( tag_type , void (FunctorType::*)( tag_type , const ArgMember & ) const ) {} - - template< class ArgMember > - KOKKOS_INLINE_FUNCTION - static VOIDTAG deduce_reduce_type( tag_type , void (FunctorType::*)( const tag_type & , const ArgMember & ) const ) {} - - //---------------------------------------- - // parallel_reduce operator without a tag: - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( VOIDTAG , void (FunctorType::*)( ArgMember , T & ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const ArgMember & , T & ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( TagType , ArgMember , T & ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( TagType , const ArgMember & , T & ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const TagType & , ArgMember , T & ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const TagType & , const ArgMember & , T & ) const ) {} - - //---------------------------------------- - // parallel_reduce operator with a tag: - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( tag_type , ArgMember , T & ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( const tag_type & , ArgMember , T & ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( tag_type , const ArgMember & , T & ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( const tag_type & , const ArgMember & , T & ) const ) {} - - //---------------------------------------- - // parallel_scan operator without a tag: - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( VOIDTAG , void (FunctorType::*)( ArgMember , T & , bool ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const ArgMember & , T & , bool ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( TagType , ArgMember , T & , bool ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( TagType , const ArgMember & , T & , bool ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const TagType & , ArgMember , T & , bool ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const TagType & , const ArgMember & , T & , bool ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( VOIDTAG , void (FunctorType::*)( ArgMember , T & , const bool& ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const ArgMember & , T & , const bool& ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( TagType , ArgMember , T & , const bool& ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( TagType , const ArgMember & , T & , const bool& ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const TagType & , ArgMember , T & , const bool& ) const ) {} - - template< class TagType , class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static REJECTTAG deduce_reduce_type( VOIDTAG , void (FunctorType::*)( const TagType & , const ArgMember & , T & , const bool& ) const ) {} - //---------------------------------------- - // parallel_scan operator with a tag: - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( tag_type , ArgMember , T & , bool ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( const tag_type & , ArgMember , T & , bool ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( tag_type , const ArgMember& , T & , bool ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( const tag_type & , const ArgMember& , T & , bool ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( tag_type , ArgMember , T & , const bool& ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( const tag_type & , ArgMember , T & , const bool& ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( tag_type , const ArgMember& , T & , const bool& ) const ) {} - - template< class ArgMember , class T > - KOKKOS_INLINE_FUNCTION - static T deduce_reduce_type( tag_type , void (FunctorType::*)( const tag_type & , const ArgMember& , T & , const bool& ) const ) {} - //---------------------------------------- - - typedef decltype( deduce_reduce_type( tag_type() , & FunctorType::operator() ) ) ValueType ; - - enum { IS_VOID = Impl::is_same::value }; - enum { IS_REJECT = Impl::is_same::value }; - -public: - - typedef typename Impl::if_c< IS_VOID || IS_REJECT , void , ValueType >::type value_type ; - typedef typename Impl::if_c< IS_VOID || IS_REJECT , void , ValueType * >::type pointer_type ; - typedef typename Impl::if_c< IS_VOID || IS_REJECT , void , ValueType & >::type reference_type ; - - enum { StaticValueSize = IS_VOID || IS_REJECT ? 0 : sizeof(ValueType) }; - - KOKKOS_FORCEINLINE_FUNCTION static - unsigned value_size( const FunctorType & ) { return StaticValueSize ; } - - KOKKOS_FORCEINLINE_FUNCTION static - unsigned value_count( const FunctorType & ) { return IS_VOID || IS_REJECT ? 0 : 1 ; } -}; - -#endif /* #if defined( KOKKOS_HAVE_CXX11 ) */ - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -// Function signatures for FunctorType::init function with a tag and not an array -template< class FunctorType , class ArgTag , bool IsArray = 0 == FunctorValueTraits::StaticValueSize > -struct FunctorValueInitFunction { - - typedef typename FunctorValueTraits::value_type value_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type & ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type & ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type & ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type & ) ); - - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type volatile & ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type volatile & ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type volatile & ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type volatile & ) ); -}; - -// Function signatures for FunctorType::init function with a tag and is an array -template< class FunctorType , class ArgTag > -struct FunctorValueInitFunction< FunctorType , ArgTag , true > { - - typedef typename FunctorValueTraits::value_type value_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type * ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type * ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type * ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type * ) ); - - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type volatile * ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type volatile * ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type volatile * ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type volatile * ) ); -}; - -// Function signatures for FunctorType::init function without a tag and not an array -template< class FunctorType > -struct FunctorValueInitFunction< FunctorType , void , false > { - - typedef typename FunctorValueTraits::reference_type value_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( value_type & ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( value_type & ) ); - - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( value_type volatile & ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( value_type volatile & ) ); -}; - -// Function signatures for FunctorType::init function without a tag and is an array -template< class FunctorType > -struct FunctorValueInitFunction< FunctorType , void , true > { - - typedef typename FunctorValueTraits::reference_type value_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( value_type * ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( value_type * ) ); - - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( value_type volatile * ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( value_type volatile * ) ); -}; - -// Adapter for value initialization function. -// If a proper FunctorType::init is declared then use it, -// otherwise use default constructor. -template< class FunctorType , class ArgTag - , class T = typename FunctorValueTraits::reference_type - , class Enable = void > -struct FunctorValueInit ; - -/* No 'init' function provided for single value */ -template< class FunctorType , class ArgTag , class T , class Enable > -struct FunctorValueInit< FunctorType , ArgTag , T & , Enable > -{ - KOKKOS_FORCEINLINE_FUNCTION static - T & init( const FunctorType & f , void * p ) - { return *( new(p) T() ); }; -}; - -/* No 'init' function provided for array value */ -template< class FunctorType , class ArgTag , class T , class Enable > -struct FunctorValueInit< FunctorType , ArgTag , T * , Enable > -{ - KOKKOS_FORCEINLINE_FUNCTION static - T * init( const FunctorType & f , void * p ) - { - const int n = FunctorValueTraits< FunctorType , ArgTag >::value_count(f); - for ( int i = 0 ; i < n ; ++i ) { new( ((T*)p) + i ) T(); } - return (T*)p ; - } -}; - -/* 'init' function provided for single value */ -template< class FunctorType , class T > -struct FunctorValueInit - < FunctorType - , void - , T & - // First substitution failure when FunctorType::init does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when FunctorType::init is not compatible. - , decltype( FunctorValueInitFunction< FunctorType , void >::enable_if( & FunctorType::init ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::init ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - T & init( const FunctorType & f , void * p ) - { f.init( *((T*)p) ); return *((T*)p) ; } -}; - -/* 'init' function provided for array value */ -template< class FunctorType , class T > -struct FunctorValueInit - < FunctorType - , void - , T * - // First substitution failure when FunctorType::init does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when FunctorType::init is not compatible - , decltype( FunctorValueInitFunction< FunctorType , void >::enable_if( & FunctorType::init ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::init ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - T * init( const FunctorType & f , void * p ) - { f.init( (T*)p ); return (T*)p ; } -}; - -/* 'init' function provided for single value */ -template< class FunctorType , class ArgTag , class T > -struct FunctorValueInit - < FunctorType - , ArgTag - , T & - // First substitution failure when FunctorType::init does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when FunctorType::init is not compatible. - , decltype( FunctorValueInitFunction< FunctorType , ArgTag >::enable_if( & FunctorType::init ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::init ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - T & init( const FunctorType & f , void * p ) - { f.init( ArgTag() , *((T*)p) ); return *((T*)p) ; } -}; - -/* 'init' function provided for array value */ -template< class FunctorType , class ArgTag , class T > -struct FunctorValueInit - < FunctorType - , ArgTag - , T * - // First substitution failure when FunctorType::init does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when FunctorType::init is not compatible - , decltype( FunctorValueInitFunction< FunctorType , ArgTag >::enable_if( & FunctorType::init ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::init ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - T * init( const FunctorType & f , void * p ) - { f.init( ArgTag() , (T*)p ); return (T*)p ; } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -// Signatures for compatible FunctorType::join with tag and not an array -template< class FunctorType , class ArgTag , bool IsArray = 0 == FunctorValueTraits::StaticValueSize > -struct FunctorValueJoinFunction { - - typedef typename FunctorValueTraits::value_type value_type ; - - typedef volatile value_type & vref_type ; - typedef const volatile value_type & cvref_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , vref_type , cvref_type ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , vref_type , cvref_type ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , vref_type , cvref_type ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , vref_type , cvref_type ) ); -}; - -// Signatures for compatible FunctorType::join with tag and is an array -template< class FunctorType , class ArgTag > -struct FunctorValueJoinFunction< FunctorType , ArgTag , true > { - - typedef typename FunctorValueTraits::value_type value_type ; - - typedef volatile value_type * vptr_type ; - typedef const volatile value_type * cvptr_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , vptr_type , cvptr_type ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , vptr_type , cvptr_type ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , vptr_type , cvptr_type ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , vptr_type , cvptr_type ) ); -}; - -// Signatures for compatible FunctorType::join without tag and not an array -template< class FunctorType > -struct FunctorValueJoinFunction< FunctorType , void , false > { - - typedef typename FunctorValueTraits::value_type value_type ; - - typedef volatile value_type & vref_type ; - typedef const volatile value_type & cvref_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( vref_type , cvref_type ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( vref_type , cvref_type ) ); -}; - -// Signatures for compatible FunctorType::join without tag and is an array -template< class FunctorType > -struct FunctorValueJoinFunction< FunctorType , void , true > { - - typedef typename FunctorValueTraits::value_type value_type ; - - typedef volatile value_type * vptr_type ; - typedef const volatile value_type * cvptr_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( vptr_type , cvptr_type ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( vptr_type , cvptr_type ) ); -}; - - -template< class FunctorType , class ArgTag - , class T = typename FunctorValueTraits::reference_type - , class Enable = void > -struct FunctorValueJoin ; - -/* No 'join' function provided, single value */ -template< class FunctorType , class ArgTag , class T , class Enable > -struct FunctorValueJoin< FunctorType , ArgTag , T & , Enable > -{ - KOKKOS_FORCEINLINE_FUNCTION static - void join( const FunctorType & f , volatile void * const lhs , const volatile void * const rhs ) - { - *((volatile T*)lhs) += *((const volatile T*)rhs); - } -}; - -/* No 'join' function provided, array of values */ -template< class FunctorType , class ArgTag , class T , class Enable > -struct FunctorValueJoin< FunctorType , ArgTag , T * , Enable > -{ - KOKKOS_FORCEINLINE_FUNCTION static - void join( const FunctorType & f , volatile void * const lhs , const volatile void * const rhs ) - { - const int n = FunctorValueTraits::value_count(f); - - for ( int i = 0 ; i < n ; ++i ) { ((volatile T*)lhs)[i] += ((const volatile T*)rhs)[i]; } - } -}; - -/* 'join' function provided, single value */ -template< class FunctorType , class ArgTag , class T > -struct FunctorValueJoin - < FunctorType - , ArgTag - , T & - // First substitution failure when FunctorType::join does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when enable_if( & Functor::join ) does not exist - , decltype( FunctorValueJoinFunction< FunctorType , ArgTag >::enable_if( & FunctorType::join ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::join ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - void join( const FunctorType & f , volatile void * const lhs , const volatile void * const rhs ) - { - f.join( ArgTag() , *((volatile T *)lhs) , *((const volatile T *)rhs) ); - } -}; - -/* 'join' function provided, no tag, single value */ -template< class FunctorType , class T > -struct FunctorValueJoin - < FunctorType - , void - , T & - // First substitution failure when FunctorType::join does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when enable_if( & Functor::join ) does not exist - , decltype( FunctorValueJoinFunction< FunctorType , void >::enable_if( & FunctorType::join ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::join ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - void join( const FunctorType & f , volatile void * const lhs , const volatile void * const rhs ) - { - f.join( *((volatile T *)lhs) , *((const volatile T *)rhs) ); - } -}; - -/* 'join' function provided for array value */ -template< class FunctorType , class ArgTag , class T > -struct FunctorValueJoin - < FunctorType - , ArgTag - , T * - // First substitution failure when FunctorType::join does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when enable_if( & Functor::join ) does not exist - , decltype( FunctorValueJoinFunction< FunctorType , ArgTag >::enable_if( & FunctorType::join ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::join ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - void join( const FunctorType & f , volatile void * const lhs , const volatile void * const rhs ) - { - f.join( ArgTag() , (volatile T *)lhs , (const volatile T *)rhs ); - } -}; - -/* 'join' function provided, no tag, array value */ -template< class FunctorType , class T > -struct FunctorValueJoin - < FunctorType - , void - , T * - // First substitution failure when FunctorType::join does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when enable_if( & Functor::join ) does not exist - , decltype( FunctorValueJoinFunction< FunctorType , void >::enable_if( & FunctorType::join ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::join ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - void join( const FunctorType & f , volatile void * const lhs , const volatile void * const rhs ) - { - f.join( (volatile T *)lhs , (const volatile T *)rhs ); - } -}; - -} // namespace Impl -} // namespace Kokkos - -namespace Kokkos { - -namespace Impl { - -#if defined( KOKKOS_HAVE_CXX11 ) - - template - struct JoinLambdaAdapter { - typedef ValueType value_type; - const JoinOp& lambda; - KOKKOS_INLINE_FUNCTION - JoinLambdaAdapter(const JoinOp& lambda_):lambda(lambda_) {} - - KOKKOS_INLINE_FUNCTION - void join(volatile value_type& dst, const volatile value_type& src) const { - lambda(dst,src); - } - - KOKKOS_INLINE_FUNCTION - void join(value_type& dst, const value_type& src) const { - lambda(dst,src); - } - - KOKKOS_INLINE_FUNCTION - void operator() (volatile value_type& dst, const volatile value_type& src) const { - lambda(dst,src); - } - - KOKKOS_INLINE_FUNCTION - void operator() (value_type& dst, const value_type& src) const { - lambda(dst,src); - } - }; - - template - struct JoinLambdaAdapter::enable_if( & JoinOp::join ) )> { - typedef ValueType value_type; - typedef StaticAssertSame assert_value_types_match; - const JoinOp& lambda; - KOKKOS_INLINE_FUNCTION - JoinLambdaAdapter(const JoinOp& lambda_):lambda(lambda_) {} - - KOKKOS_INLINE_FUNCTION - void join(volatile value_type& dst, const volatile value_type& src) const { - lambda.join(dst,src); - } - - KOKKOS_INLINE_FUNCTION - void join(value_type& dst, const value_type& src) const { - lambda.join(dst,src); - } - - KOKKOS_INLINE_FUNCTION - void operator() (volatile value_type& dst, const volatile value_type& src) const { - lambda.join(dst,src); - } - - KOKKOS_INLINE_FUNCTION - void operator() (value_type& dst, const value_type& src) const { - lambda.join(dst,src); - } - }; - -#endif - - template - struct JoinAdd { - typedef ValueType value_type; - - KOKKOS_INLINE_FUNCTION - JoinAdd() {} - - KOKKOS_INLINE_FUNCTION - void join(volatile value_type& dst, const volatile value_type& src) const { - dst+=src; - } - KOKKOS_INLINE_FUNCTION - void operator() (value_type& dst, const value_type& src) const { - dst+=src; - } - KOKKOS_INLINE_FUNCTION - void operator() (volatile value_type& dst, const volatile value_type& src) const { - dst+=src; - } - }; - -} -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class ArgTag - , class T = typename FunctorValueTraits::reference_type > -struct FunctorValueOps ; - -template< class FunctorType , class ArgTag , class T > -struct FunctorValueOps< FunctorType , ArgTag , T & > -{ - KOKKOS_FORCEINLINE_FUNCTION static - T * pointer( T & r ) { return & r ; } - - KOKKOS_FORCEINLINE_FUNCTION static - T & reference( void * p ) { return *((T*)p); } - - KOKKOS_FORCEINLINE_FUNCTION static - void copy( const FunctorType & , void * const lhs , const void * const rhs ) - { *((T*)lhs) = *((const T*)rhs); } -}; - -/* No 'join' function provided, array of values */ -template< class FunctorType , class ArgTag , class T > -struct FunctorValueOps< FunctorType , ArgTag , T * > -{ - KOKKOS_FORCEINLINE_FUNCTION static - T * pointer( T * p ) { return p ; } - - KOKKOS_FORCEINLINE_FUNCTION static - T * reference( void * p ) { return ((T*)p); } - - KOKKOS_FORCEINLINE_FUNCTION static - void copy( const FunctorType & f , void * const lhs , const void * const rhs ) - { - const int n = FunctorValueTraits::value_count(f); - for ( int i = 0 ; i < n ; ++i ) { ((T*)lhs)[i] = ((const T*)rhs)[i]; } - } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -// Compatible functions for 'final' function and value_type not an array -template< class FunctorType , class ArgTag , bool IsArray = 0 == FunctorValueTraits::StaticValueSize > -struct FunctorFinalFunction { - - typedef typename FunctorValueTraits::value_type value_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type & ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type & ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type & ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type & ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type & ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type & ) ); - - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type volatile & ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type volatile & ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type volatile & ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type volatile & ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type volatile & ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type volatile & ) ); - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type const & ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type const & ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type const & ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type const & ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type const & ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type const & ) ); - - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type const volatile & ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type const volatile & ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type const volatile & ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type const volatile & ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type const volatile & ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type const volatile & ) ); -}; - -// Compatible functions for 'final' function and value_type is an array -template< class FunctorType , class ArgTag > -struct FunctorFinalFunction< FunctorType , ArgTag , true > { - - typedef typename FunctorValueTraits::value_type value_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type * ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type * ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type * ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type * ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type * ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type * ) ); - - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type volatile * ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type volatile * ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type volatile * ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type volatile * ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type volatile * ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type volatile * ) ); - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type const * ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type const * ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type const * ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type const * ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type const * ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type const * ) ); - - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type const volatile * ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type const volatile * ) const ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , value_type const volatile * ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , value_type const volatile * ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , value_type const volatile * ) ); - // KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , value_type const volatile * ) ); -}; - -template< class FunctorType > -struct FunctorFinalFunction< FunctorType , void , false > { - - typedef typename FunctorValueTraits::value_type value_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( value_type & ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( value_type & ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( value_type & ) ); - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( const value_type & ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( const value_type & ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( const value_type & ) ); -}; - -template< class FunctorType > -struct FunctorFinalFunction< FunctorType , void , true > { - - typedef typename FunctorValueTraits::value_type value_type ; - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( value_type * ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( value_type * ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( value_type * ) ); - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( const value_type * ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( const value_type * ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( const value_type * ) ); -}; - -/* No 'final' function provided */ -template< class FunctorType , class ArgTag - , class ResultType = typename FunctorValueTraits::reference_type - , class Enable = void > -struct FunctorFinal -{ - KOKKOS_FORCEINLINE_FUNCTION static - void final( const FunctorType & , void * ) {} -}; - -/* 'final' function provided */ -template< class FunctorType , class ArgTag , class T > -struct FunctorFinal - < FunctorType - , ArgTag - , T & - // First substitution failure when FunctorType::final does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when enable_if( & Functor::final ) does not exist - , decltype( FunctorFinalFunction< FunctorType , ArgTag >::enable_if( & FunctorType::final ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::final ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - void final( const FunctorType & f , void * p ) { f.final( *((T*)p) ); } - - KOKKOS_FORCEINLINE_FUNCTION static - void final( FunctorType & f , void * p ) { f.final( *((T*)p) ); } -}; - -/* 'final' function provided for array value */ -template< class FunctorType , class ArgTag , class T > -struct FunctorFinal - < FunctorType - , ArgTag - , T * - // First substitution failure when FunctorType::final does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when enable_if( & Functor::final ) does not exist - , decltype( FunctorFinalFunction< FunctorType , ArgTag >::enable_if( & FunctorType::final ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::final ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - void final( const FunctorType & f , void * p ) { f.final( (T*)p ); } - - KOKKOS_FORCEINLINE_FUNCTION static - void final( FunctorType & f , void * p ) { f.final( (T*)p ); } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class FunctorType , class ArgTag - , class ReferenceType = typename FunctorValueTraits::reference_type > -struct FunctorApplyFunction { - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , ReferenceType ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , ReferenceType ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag , ReferenceType ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ArgTag const & , ReferenceType ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag , ReferenceType ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ArgTag const & , ReferenceType ) ); -}; - -template< class FunctorType , class ReferenceType > -struct FunctorApplyFunction< FunctorType , void , ReferenceType > { - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ReferenceType ) const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)( ReferenceType ) ); - KOKKOS_INLINE_FUNCTION static void enable_if( void ( *)( ReferenceType ) ); -}; - -template< class FunctorType > -struct FunctorApplyFunction< FunctorType , void , void > { - - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)() const ); - KOKKOS_INLINE_FUNCTION static void enable_if( void (FunctorType::*)() ); -}; - -template< class FunctorType , class ArgTag , class ReferenceType - , class Enable = void > -struct FunctorApply -{ - KOKKOS_FORCEINLINE_FUNCTION static - void apply( const FunctorType & , void * ) {} -}; - -/* 'apply' function provided for void value */ -template< class FunctorType , class ArgTag > -struct FunctorApply - < FunctorType - , ArgTag - , void - // First substitution failure when FunctorType::apply does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when enable_if( & Functor::apply ) does not exist - , decltype( FunctorApplyFunction< FunctorType , ArgTag , void >::enable_if( & FunctorType::apply ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::apply ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - void apply( FunctorType & f ) { f.apply(); } - - KOKKOS_FORCEINLINE_FUNCTION static - void apply( const FunctorType & f ) { f.apply(); } -}; - -/* 'apply' function provided for single value */ -template< class FunctorType , class ArgTag , class T > -struct FunctorApply - < FunctorType - , ArgTag - , T & - // First substitution failure when FunctorType::apply does not exist. -#if defined( KOKKOS_HAVE_CXX11 ) - // Second substitution failure when enable_if( & Functor::apply ) does not exist - , decltype( FunctorApplyFunction< FunctorType , ArgTag >::enable_if( & FunctorType::apply ) ) -#else - , typename Impl::enable_if< 0 < sizeof( & FunctorType::apply ) >::type -#endif - > -{ - KOKKOS_FORCEINLINE_FUNCTION static - void apply( const FunctorType & f , void * p ) { f.apply( *((T*)p) ); } - - KOKKOS_FORCEINLINE_FUNCTION static - void apply( FunctorType & f , void * p ) { f.apply( *((T*)p) ); } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* KOKKOS_FUNCTORADAPTER_HPP */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_HostSpace.cpp b/lib/kokkos/core/src/impl/Kokkos_HostSpace.cpp deleted file mode 100644 index 69b8ce86d0..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_HostSpace.cpp +++ /dev/null @@ -1,441 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - - -#include - -/*--------------------------------------------------------------------------*/ - -#if defined( __INTEL_COMPILER ) && ! defined ( KOKKOS_HAVE_CUDA ) - -// Intel specialized allocator does not interoperate with CUDA memory allocation - -#define KOKKOS_INTEL_MM_ALLOC_AVAILABLE - -#endif - -/*--------------------------------------------------------------------------*/ - -#if ( defined( _POSIX_C_SOURCE ) && _POSIX_C_SOURCE >= 200112L ) || \ - ( defined( _XOPEN_SOURCE ) && _XOPEN_SOURCE >= 600 ) - -#define KOKKOS_POSIX_MEMALIGN_AVAILABLE - -#include -#include - -/* mmap flags for private anonymous memory allocation */ - -#if defined( MAP_ANONYMOUS ) && defined( MAP_PRIVATE ) - #define KOKKOS_POSIX_MMAP_FLAGS (MAP_PRIVATE | MAP_ANONYMOUS) -#elif defined( MAP_ANON ) && defined( MAP_PRIVATE ) - #define KOKKOS_POSIX_MMAP_FLAGS (MAP_PRIVATE | MAP_ANON) -#endif - -// mmap flags for huge page tables -#if defined( KOKKOS_POSIX_MMAP_FLAGS ) - #if defined( MAP_HUGETLB ) - #define KOKKOS_POSIX_MMAP_FLAGS_HUGE (KOKKOS_POSIX_MMAP_FLAGS | MAP_HUGETLB ) - #else - #define KOKKOS_POSIX_MMAP_FLAGS_HUGE KOKKOS_POSIX_MMAP_FLAGS - #endif -#endif - -#endif - -/*--------------------------------------------------------------------------*/ - -#include -#include -#include -#include - -#include -#include -#include - -#include -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace { - -static const int QUERY_SPACE_IN_PARALLEL_MAX = 16 ; - -typedef int (* QuerySpaceInParallelPtr )(); - -QuerySpaceInParallelPtr s_in_parallel_query[ QUERY_SPACE_IN_PARALLEL_MAX ] ; -int s_in_parallel_query_count = 0 ; - -} // namespace - -void HostSpace::register_in_parallel( int (*device_in_parallel)() ) -{ - if ( 0 == device_in_parallel ) { - Kokkos::Impl::throw_runtime_exception( std::string("Kokkos::HostSpace::register_in_parallel ERROR : given NULL" ) ); - } - - int i = -1 ; - - if ( ! (device_in_parallel)() ) { - for ( i = 0 ; i < s_in_parallel_query_count && ! (*(s_in_parallel_query[i]))() ; ++i ); - } - - if ( i < s_in_parallel_query_count ) { - Kokkos::Impl::throw_runtime_exception( std::string("Kokkos::HostSpace::register_in_parallel_query ERROR : called in_parallel" ) ); - - } - - if ( QUERY_SPACE_IN_PARALLEL_MAX <= i ) { - Kokkos::Impl::throw_runtime_exception( std::string("Kokkos::HostSpace::register_in_parallel_query ERROR : exceeded maximum" ) ); - - } - - for ( i = 0 ; i < s_in_parallel_query_count && s_in_parallel_query[i] != device_in_parallel ; ++i ); - - if ( i == s_in_parallel_query_count ) { - s_in_parallel_query[s_in_parallel_query_count++] = device_in_parallel ; - } -} - -int HostSpace::in_parallel() -{ - const int n = s_in_parallel_query_count ; - - int i = 0 ; - - while ( i < n && ! (*(s_in_parallel_query[i]))() ) { ++i ; } - - return i < n ; -} - -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -Impl::AllocationTracker HostSpace::allocate_and_track( const std::string & label, const size_t size ) -{ - return Impl::AllocationTracker( allocator(), size, label ); -} - -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -/* Default allocation mechanism */ -HostSpace::HostSpace() - : m_alloc_mech( -#if defined( KOKKOS_INTEL_MM_ALLOC_AVAILABLE ) - HostSpace::INTEL_MM_ALLOC -#elif defined( KOKKOS_POSIX_MMAP_FLAGS ) - HostSpace::POSIX_MMAP -#elif defined( KOKKOS_POSIX_MEMALIGN_AVAILABLE ) - HostSpace::POSIX_MEMALIGN -#else - HostSpace::STD_MALLOC -#endif - ) -{} - -/* Default allocation mechanism */ -HostSpace::HostSpace( const HostSpace::AllocationMechanism & arg_alloc_mech ) - : m_alloc_mech( HostSpace::STD_MALLOC ) -{ - if ( arg_alloc_mech == STD_MALLOC ) { - m_alloc_mech = HostSpace::STD_MALLOC ; - } -#if defined( KOKKOS_INTEL_MM_ALLOC_AVAILABLE ) - else if ( arg_alloc_mech == HostSpace::INTEL_MM_ALLOC ) { - m_alloc_mech = HostSpace::INTEL_MM_ALLOC ; - } -#elif defined( KOKKOS_POSIX_MEMALIGN_AVAILABLE ) - else if ( arg_alloc_mech == HostSpace::POSIX_MEMALIGN ) { - m_alloc_mech = HostSpace::POSIX_MEMALIGN ; - } -#elif defined( KOKKOS_POSIX_MMAP_FLAGS ) - else if ( arg_alloc_mech == HostSpace::POSIX_MMAP ) { - m_alloc_mech = HostSpace::POSIX_MMAP ; - } -#endif - else { - const char * const mech = - ( arg_alloc_mech == HostSpace::INTEL_MM_ALLOC ) ? "INTEL_MM_ALLOC" : ( - ( arg_alloc_mech == HostSpace::POSIX_MEMALIGN ) ? "POSIX_MEMALIGN" : ( - ( arg_alloc_mech == HostSpace::POSIX_MMAP ) ? "POSIX_MMAP" : "" )); - - std::string msg ; - msg.append("Kokkos::HostSpace "); - msg.append(mech); - msg.append(" is not available" ); - Kokkos::Impl::throw_runtime_exception( msg ); - } -} - -void * HostSpace::allocate( const size_t arg_alloc_size ) const -{ - static_assert( sizeof(void*) == sizeof(uintptr_t) - , "Error sizeof(void*) != sizeof(uintptr_t)" ); - - static_assert( Kokkos::Impl::power_of_two< Kokkos::Impl::MEMORY_ALIGNMENT >::value - , "Memory alignment must be power of two" ); - - constexpr size_t alignment = Kokkos::Impl::MEMORY_ALIGNMENT ; - constexpr size_t alignment_mask = alignment - 1 ; - - void * ptr = NULL; - - if ( arg_alloc_size ) { - - if ( m_alloc_mech == STD_MALLOC ) { - // Over-allocate to and round up to guarantee proper alignment. - size_t size_padded = arg_alloc_size + sizeof(void*) + alignment ; - - void * alloc_ptr = malloc( size_padded ); - - if (alloc_ptr) { - uintptr_t address = reinterpret_cast(alloc_ptr); - - // offset enough to record the alloc_ptr - address += sizeof(void *); - uintptr_t rem = address % alignment; - uintptr_t offset = rem ? (alignment - rem) : 0u; - address += offset; - ptr = reinterpret_cast(address); - // record the alloc'd pointer - address -= sizeof(void *); - *reinterpret_cast(address) = alloc_ptr; - } - } - -#if defined( KOKKOS_INTEL_MM_ALLOC_AVAILABLE ) - else if ( m_alloc_mech == INTEL_MM_ALLOC ) { - ptr = _mm_malloc( arg_alloc_size , alignment ); - } -#endif - -#if defined( KOKKOS_POSIX_MEMALIGN_AVAILABLE ) - else if ( m_alloc_mech == POSIX_MEMALIGN ) { - posix_memalign( & ptr, alignment , arg_alloc_size ); - } -#endif - -#if defined( KOKKOS_POSIX_MMAP_FLAGS ) - else if ( m_alloc_mech == POSIX_MMAP ) { - constexpr size_t use_huge_pages = (1u << 27); - constexpr int prot = PROT_READ | PROT_WRITE ; - const int flags = arg_alloc_size < use_huge_pages - ? KOKKOS_POSIX_MMAP_FLAGS - : KOKKOS_POSIX_MMAP_FLAGS_HUGE ; - - // read write access to private memory - - ptr = mmap( NULL /* address hint, if NULL OS kernel chooses address */ - , arg_alloc_size /* size in bytes */ - , prot /* memory protection */ - , flags /* visibility of updates */ - , -1 /* file descriptor */ - , 0 /* offset */ - ); - -/* Associated reallocation: - ptr = mremap( old_ptr , old_size , new_size , MREMAP_MAYMOVE ); -*/ - } -#endif - } - - if ( reinterpret_cast(ptr) & alignment_mask ) { - Kokkos::Impl::throw_runtime_exception( "Kokkos::HostSpace aligned allocation failed" ); - } - - return ptr; -} - - -void HostSpace::deallocate( void * const arg_alloc_ptr , const size_t arg_alloc_size ) const -{ - if ( arg_alloc_ptr ) { - - if ( m_alloc_mech == STD_MALLOC ) { - void * alloc_ptr = *(reinterpret_cast(arg_alloc_ptr) -1); - free( alloc_ptr ); - } - -#if defined( KOKKOS_INTEL_MM_ALLOC_AVAILABLE ) - else if ( m_alloc_mech == INTEL_MM_ALLOC ) { - _mm_free( arg_alloc_ptr ); - } -#endif - -#if defined( KOKKOS_POSIX_MEMALIGN_AVAILABLE ) - else if ( m_alloc_mech == POSIX_MEMALIGN ) { - free( arg_alloc_ptr ); - } -#endif - -#if defined( KOKKOS_POSIX_MMAP_FLAGS ) - else if ( m_alloc_mech == POSIX_MMAP ) { - munmap( arg_alloc_ptr , arg_alloc_size ); - } -#endif - - } -} - -} // namespace Kokkos - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -SharedAllocationRecord< void , void > -SharedAllocationRecord< Kokkos::HostSpace , void >::s_root_record ; - -void -SharedAllocationRecord< Kokkos::HostSpace , void >:: -deallocate( SharedAllocationRecord< void , void > * arg_rec ) -{ - delete static_cast(arg_rec); -} - -SharedAllocationRecord< Kokkos::HostSpace , void >:: -~SharedAllocationRecord() -{ - m_space.deallocate( SharedAllocationRecord< void , void >::m_alloc_ptr - , SharedAllocationRecord< void , void >::m_alloc_size - ); -} - -SharedAllocationRecord< Kokkos::HostSpace , void >:: -SharedAllocationRecord( const Kokkos::HostSpace & arg_space - , const std::string & arg_label - , const size_t arg_alloc_size - , const SharedAllocationRecord< void , void >::function_type arg_dealloc - ) - // Pass through allocated [ SharedAllocationHeader , user_memory ] - // Pass through deallocation function - : SharedAllocationRecord< void , void > - ( & SharedAllocationRecord< Kokkos::HostSpace , void >::s_root_record - , reinterpret_cast( arg_space.allocate( sizeof(SharedAllocationHeader) + arg_alloc_size ) ) - , sizeof(SharedAllocationHeader) + arg_alloc_size - , arg_dealloc - ) - , m_space( arg_space ) -{ - // Fill in the Header information - RecordBase::m_alloc_ptr->m_record = static_cast< SharedAllocationRecord< void , void > * >( this ); - - strncpy( RecordBase::m_alloc_ptr->m_label - , arg_label.c_str() - , SharedAllocationHeader::maximum_label_length - ); -} - -SharedAllocationRecord< Kokkos::HostSpace , void > * -SharedAllocationRecord< Kokkos::HostSpace , void >::get_record( void * alloc_ptr ) -{ - typedef SharedAllocationHeader Header ; - typedef SharedAllocationRecord< Kokkos::HostSpace , void > RecordHost ; - - SharedAllocationHeader const * const head = Header::get_header( alloc_ptr ); - RecordHost * const record = static_cast< RecordHost * >( head->m_record ); - - if ( record->m_alloc_ptr != head ) { - Kokkos::Impl::throw_runtime_exception( std::string("Kokkos::Experimental::Impl::SharedAllocationRecord< Kokkos::HostSpace , void >::get_record ERROR" ) ); - } - - return record ; -} - -// Iterate records to print orphaned memory ... -void SharedAllocationRecord< Kokkos::HostSpace , void >:: -print_records( std::ostream & s , const Kokkos::HostSpace & space , bool detail ) -{ - SharedAllocationRecord< void , void >::print_host_accessible_records( s , "HostSpace" , & s_root_record , detail ); -} - -} // namespace Impl -} // namespace Experimental -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace { - const unsigned HOST_SPACE_ATOMIC_MASK = 0xFFFF; - const unsigned HOST_SPACE_ATOMIC_XOR_MASK = 0x5A39; - static int HOST_SPACE_ATOMIC_LOCKS[HOST_SPACE_ATOMIC_MASK+1]; -} - -namespace Impl { -void init_lock_array_host_space() { - static int is_initialized = 0; - if(! is_initialized) - for(int i = 0; i < static_cast (HOST_SPACE_ATOMIC_MASK+1); i++) - HOST_SPACE_ATOMIC_LOCKS[i] = 0; -} - -bool lock_address_host_space(void* ptr) { - return 0 == atomic_compare_exchange( &HOST_SPACE_ATOMIC_LOCKS[ - (( size_t(ptr) >> 2 ) & HOST_SPACE_ATOMIC_MASK) ^ HOST_SPACE_ATOMIC_XOR_MASK] , - 0 , 1); -} - -void unlock_address_host_space(void* ptr) { - atomic_exchange( &HOST_SPACE_ATOMIC_LOCKS[ - (( size_t(ptr) >> 2 ) & HOST_SPACE_ATOMIC_MASK) ^ HOST_SPACE_ATOMIC_XOR_MASK] , - 0); -} - -} -} diff --git a/lib/kokkos/core/src/impl/Kokkos_Memory_Fence.hpp b/lib/kokkos/core/src/impl/Kokkos_Memory_Fence.hpp deleted file mode 100644 index 17eb0c2f4b..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Memory_Fence.hpp +++ /dev/null @@ -1,73 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#if defined( KOKKOS_ATOMIC_HPP ) && ! defined( KOKKOS_MEMORY_FENCE ) -#define KOKKOS_MEMORY_FENCE -namespace Kokkos { - -//---------------------------------------------------------------------------- - -KOKKOS_FORCEINLINE_FUNCTION -void memory_fence() -{ -#if defined( KOKKOS_ATOMICS_USE_CUDA ) - __threadfence(); -#elif defined( KOKKOS_ATOMICS_USE_GCC ) || \ - ( defined( KOKKOS_COMPILER_NVCC ) && defined( KOKKOS_ATOMICS_USE_INTEL ) ) - __sync_synchronize(); -#elif defined( KOKKOS_ATOMICS_USE_INTEL ) - _mm_mfence(); -#elif defined( KOKKOS_ATOMICS_USE_OMP31 ) - #pragma omp flush -#elif defined( KOKKOS_ATOMICS_USE_WINDOWS ) - MemoryBarrier(); -#else - #error "Error: memory_fence() not defined" -#endif -} - -} // namespace kokkos - -#endif - - diff --git a/lib/kokkos/core/src/impl/Kokkos_PhysicalLayout.hpp b/lib/kokkos/core/src/impl/Kokkos_PhysicalLayout.hpp deleted file mode 100644 index 0e87c63e44..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_PhysicalLayout.hpp +++ /dev/null @@ -1,84 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_PHYSICAL_LAYOUT_HPP -#define KOKKOS_PHYSICAL_LAYOUT_HPP - - -#include -namespace Kokkos { -namespace Impl { - - - -struct PhysicalLayout { - enum LayoutType {Left,Right,Scalar,Error}; - LayoutType layout_type; - int rank; - long long int stride[8]; //distance between two neighboring elements in a given dimension - - template< class T , class L , class D , class M > - PhysicalLayout( const View & view ) - : layout_type( is_same< typename View::array_layout , LayoutLeft >::value ? Left : ( - is_same< typename View::array_layout , LayoutRight >::value ? Right : Error )) - , rank( view.Rank ) - { - for(int i=0;i<8;i++) stride[i] = 0; - view.stride( stride ); - } - #ifdef KOKKOS_HAVE_CUDA - template< class T , class L , class D , class M > - PhysicalLayout( const View & view ) - : layout_type( is_same< typename View::array_layout , LayoutLeft >::value ? Left : ( - is_same< typename View::array_layout , LayoutRight >::value ? Right : Error )) - , rank( view.Rank ) - { - for(int i=0;i<8;i++) stride[i] = 0; - view.stride( stride ); - } - #endif -}; - -} -} -#endif diff --git a/lib/kokkos/core/src/impl/Kokkos_Profiling_DeviceInfo.hpp b/lib/kokkos/core/src/impl/Kokkos_Profiling_DeviceInfo.hpp deleted file mode 100644 index 5da60841d4..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Profiling_DeviceInfo.hpp +++ /dev/null @@ -1,57 +0,0 @@ -/* - //@HEADER - // ************************************************************************ - // - // Kokkos v. 2.0 - // Copyright (2014) Sandia Corporation - // - // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, - // the U.S. Government retains certain rights in this software. - // - // Redistribution and use in source and binary forms, with or without - // modification, are permitted provided that the following conditions are - // met: - // - // 1. Redistributions of source code must retain the above copyright - // notice, this list of conditions and the following disclaimer. - // - // 2. Redistributions in binary form must reproduce the above copyright - // notice, this list of conditions and the following disclaimer in the - // documentation and/or other materials provided with the distribution. - // - // 3. Neither the name of the Corporation nor the names of the - // contributors may be used to endorse or promote products derived from - // this software without specific prior written permission. - // - // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY - // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE - // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR - // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE - // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, - // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, - // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR - // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF - // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING - // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - // - // Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) - // - // ************************************************************************ - //@HEADER -*/ - -#ifndef KOKKOSP_DEVICE_INFO_HPP -#define KOKKOSP_DEVICE_INFO_HPP - -namespace Kokkos { -namespace Experimental { - - struct KokkosPDeviceInfo { - uint32_t deviceID; - }; - -} -} - -#endif diff --git a/lib/kokkos/core/src/impl/Kokkos_Profiling_Interface.cpp b/lib/kokkos/core/src/impl/Kokkos_Profiling_Interface.cpp deleted file mode 100644 index a88be37dde..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Profiling_Interface.cpp +++ /dev/null @@ -1,148 +0,0 @@ -/* - //@HEADER - // ************************************************************************ - // - // Kokkos v. 2.0 - // Copyright (2014) Sandia Corporation - // - // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, - // the U.S. Government retains certain rights in this software. - // - // Redistribution and use in source and binary forms, with or without - // modification, are permitted provided that the following conditions are - // met: - // - // 1. Redistributions of source code must retain the above copyright - // notice, this list of conditions and the following disclaimer. - // - // 2. Redistributions in binary form must reproduce the above copyright - // notice, this list of conditions and the following disclaimer in the - // documentation and/or other materials provided with the distribution. - // - // 3. Neither the name of the Corporation nor the names of the - // contributors may be used to endorse or promote products derived from - // this software without specific prior written permission. - // - // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY - // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE - // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR - // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE - // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, - // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, - // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR - // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF - // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING - // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - // - // Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) - // - // ************************************************************************ - //@HEADER - */ - -#include - -#ifdef KOKKOSP_ENABLE_PROFILING -#include - -namespace Kokkos { - namespace Experimental { - bool profileLibraryLoaded() { - return (NULL != initProfileLibrary); - } - - void beginParallelFor(const std::string& kernelPrefix, const uint32_t devID, uint64_t* kernelID) { - if(NULL != beginForCallee) { - Kokkos::fence(); - (*beginForCallee)(kernelPrefix.c_str(), devID, kernelID); - } - }; - - void endParallelFor(const uint64_t kernelID) { - if(NULL != endForCallee) { - Kokkos::fence(); - (*endForCallee)(kernelID); - } - }; - - void beginParallelScan(const std::string& kernelPrefix, const uint32_t devID, uint64_t* kernelID) { - if(NULL != beginScanCallee) { - Kokkos::fence(); - (*beginScanCallee)(kernelPrefix.c_str(), devID, kernelID); - } - }; - - void endParallelScan(const uint64_t kernelID) { - if(NULL != endScanCallee) { - Kokkos::fence(); - (*endScanCallee)(kernelID); - } - }; - - void beginParallelReduce(const std::string& kernelPrefix, const uint32_t devID, uint64_t* kernelID) { - if(NULL != beginReduceCallee) { - Kokkos::fence(); - (*beginReduceCallee)(kernelPrefix.c_str(), devID, kernelID); - } - }; - - void endParallelReduce(const uint64_t kernelID) { - if(NULL != endReduceCallee) { - Kokkos::fence(); - (*endReduceCallee)(kernelID); - } - }; - - void initialize() { - void* firstProfileLibrary; - - char* envProfileLibrary = getenv("KOKKOS_PROFILE_LIBRARY"); - - // If we do not find a profiling library in the environment then exit - // early. - if( NULL == envProfileLibrary ) { - return ; - } - - char* profileLibraryName = strtok(envProfileLibrary, ";"); - - if( (NULL != profileLibraryName) && (strcmp(profileLibraryName, "") != 0) ) { - firstProfileLibrary = dlopen(profileLibraryName, RTLD_NOW | RTLD_GLOBAL); - - if(NULL == firstProfileLibrary) { - std::cerr << "Error: Unable to load KokkosP library: " << - profileLibraryName << std::endl; - } else { - std::cout << "KokkosP: Library Loaded: " << profileLibraryName << std::endl; - - beginForCallee = (beginFunction) dlsym(firstProfileLibrary, "kokkosp_begin_parallel_for"); - beginScanCallee = (beginFunction) dlsym(firstProfileLibrary, "kokkosp_begin_parallel_scan"); - beginReduceCallee = (beginFunction) dlsym(firstProfileLibrary, "kokkosp_begin_parallel_reduce"); - - endScanCallee = (endFunction) dlsym(firstProfileLibrary, "kokkosp_end_parallel_scan"); - endForCallee = (endFunction) dlsym(firstProfileLibrary, "kokkosp_end_parallel_for"); - endReduceCallee = (endFunction) dlsym(firstProfileLibrary, "kokkosp_end_parallel_reduce"); - - initProfileLibrary = (initFunction) dlsym(firstProfileLibrary, "kokkosp_init_library"); - finalizeProfileLibrary = (finalizeFunction) dlsym(firstProfileLibrary, "kokkosp_finalize_library"); - } - } - - if(NULL != initProfileLibrary) { - (*initProfileLibrary)(0, - (uint64_t) KOKKOSP_INTERFACE_VERSION, - (uint32_t) 0, - NULL); - } - }; - - void finalize() { - if(NULL != finalizeProfileLibrary) { - (*finalizeProfileLibrary)(); - } - }; - } -} - -#endif diff --git a/lib/kokkos/core/src/impl/Kokkos_Profiling_Interface.hpp b/lib/kokkos/core/src/impl/Kokkos_Profiling_Interface.hpp deleted file mode 100644 index 1e2f715f36..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Profiling_Interface.hpp +++ /dev/null @@ -1,98 +0,0 @@ -/* - //@HEADER - // ************************************************************************ - // - // Kokkos v. 2.0 - // Copyright (2014) Sandia Corporation - // - // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, - // the U.S. Government retains certain rights in this software. - // - // Redistribution and use in source and binary forms, with or without - // modification, are permitted provided that the following conditions are - // met: - // - // 1. Redistributions of source code must retain the above copyright - // notice, this list of conditions and the following disclaimer. - // - // 2. Redistributions in binary form must reproduce the above copyright - // notice, this list of conditions and the following disclaimer in the - // documentation and/or other materials provided with the distribution. - // - // 3. Neither the name of the Corporation nor the names of the - // contributors may be used to endorse or promote products derived from - // this software without specific prior written permission. - // - // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY - // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE - // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR - // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE - // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, - // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, - // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR - // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF - // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING - // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - // - // Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) - // - // ************************************************************************ - //@HEADER - */ - -#ifndef KOKKOSP_INTERFACE_HPP -#define KOKKOSP_INTERFACE_HPP - -#include -#include -#include -#include - -#ifdef KOKKOSP_ENABLE_PROFILING -#include -#include -#include -#include -#endif - -#define KOKKOSP_INTERFACE_VERSION 20150628 - -#ifdef KOKKOSP_ENABLE_PROFILING -namespace Kokkos { - namespace Experimental { - - typedef void (*initFunction)(const int, - const uint64_t, - const uint32_t, - KokkosPDeviceInfo*); - typedef void (*finalizeFunction)(); - typedef void (*beginFunction)(const char*, const uint32_t, uint64_t*); - typedef void (*endFunction)(uint64_t); - - static initFunction initProfileLibrary = NULL; - static finalizeFunction finalizeProfileLibrary = NULL; - static beginFunction beginForCallee = NULL; - static beginFunction beginScanCallee = NULL; - static beginFunction beginReduceCallee = NULL; - static endFunction endForCallee = NULL; - static endFunction endScanCallee = NULL; - static endFunction endReduceCallee = NULL; - - bool profileLibraryLoaded(); - - void beginParallelFor(const std::string& kernelPrefix, const uint32_t devID, uint64_t* kernelID); - void endParallelFor(const uint64_t kernelID); - void beginParallelScan(const std::string& kernelPrefix, const uint32_t devID, uint64_t* kernelID); - void endParallelScan(const uint64_t kernelID); - void beginParallelReduce(const std::string& kernelPrefix, const uint32_t devID, uint64_t* kernelID); - void endParallelReduce(const uint64_t kernelID); - - void initialize(); - void finalize(); - - } -} - -#endif -#endif diff --git a/lib/kokkos/core/src/impl/Kokkos_Serial.cpp b/lib/kokkos/core/src/impl/Kokkos_Serial.cpp deleted file mode 100644 index 562c7afc6d..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Serial.cpp +++ /dev/null @@ -1,119 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include - -#if defined( KOKKOS_HAVE_SERIAL ) - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { -namespace SerialImpl { - -Sentinel::Sentinel() : m_scratch(0), m_reduce_end(0), m_shared_end(0) {} - -Sentinel::~Sentinel() -{ - if ( m_scratch ) { free( m_scratch ); } - m_scratch = 0 ; - m_reduce_end = 0 ; - m_shared_end = 0 ; -} - -Sentinel & Sentinel::singleton() -{ - static Sentinel s ; return s ; -} - -inline -unsigned align( unsigned n ) -{ - enum { ALIGN = 0x0100 /* 256 */ , MASK = ALIGN - 1 }; - return ( n + MASK ) & ~MASK ; -} - -} // namespace - -SerialTeamMember::SerialTeamMember( int arg_league_rank - , int arg_league_size - , int arg_shared_size - ) - : m_space( ((char *) SerialImpl::Sentinel::singleton().m_scratch) + SerialImpl::Sentinel::singleton().m_reduce_end - , arg_shared_size ) - , m_league_rank( arg_league_rank ) - , m_league_size( arg_league_size ) -{} - -} // namespace Impl - -void * Serial::scratch_memory_resize( unsigned reduce_size , unsigned shared_size ) -{ - static Impl::SerialImpl::Sentinel & s = Impl::SerialImpl::Sentinel::singleton(); - - reduce_size = Impl::SerialImpl::align( reduce_size ); - shared_size = Impl::SerialImpl::align( shared_size ); - - if ( ( s.m_reduce_end < reduce_size ) || - ( s.m_shared_end < s.m_reduce_end + shared_size ) ) { - - if ( s.m_scratch ) { free( s.m_scratch ); } - - if ( s.m_reduce_end < reduce_size ) s.m_reduce_end = reduce_size ; - if ( s.m_shared_end < s.m_reduce_end + shared_size ) s.m_shared_end = s.m_reduce_end + shared_size ; - - s.m_scratch = malloc( s.m_shared_end ); - } - - return s.m_scratch ; -} - -} // namespace Kokkos - -#endif // defined( KOKKOS_HAVE_SERIAL ) - - diff --git a/lib/kokkos/core/src/impl/Kokkos_Serial_TaskPolicy.cpp b/lib/kokkos/core/src/impl/Kokkos_Serial_TaskPolicy.cpp deleted file mode 100644 index 688f97f42e..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Serial_TaskPolicy.cpp +++ /dev/null @@ -1,336 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -// Experimental unified task-data parallel manycore LDRD - -#include - -#if defined( KOKKOS_HAVE_SERIAL ) -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -TaskPolicy< Kokkos::Serial >::member_type & -TaskPolicy< Kokkos::Serial >::member_single() -{ - static member_type s(0,1,0); - return s ; -} - -} // namespace Experimental -} // namespace Kokkos - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -typedef TaskMember< Kokkos::Serial , void , void > Task ; - -//---------------------------------------------------------------------------- - -namespace { - -inline -unsigned padded_sizeof_derived( unsigned sizeof_derived ) -{ - return sizeof_derived + - ( sizeof_derived % sizeof(Task*) ? sizeof(Task*) - sizeof_derived % sizeof(Task*) : 0 ); -} - -} // namespace - -void Task::deallocate( void * ptr ) -{ - free( ptr ); -} - -void * Task::allocate( const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity ) -{ - return malloc( padded_sizeof_derived( arg_sizeof_derived ) + arg_dependence_capacity * sizeof(Task*) ); -} - -Task::~TaskMember() -{ - -} - -Task::TaskMember( const Task::function_verify_type arg_verify - , const Task::function_dealloc_type arg_dealloc - , const Task::function_apply_type arg_apply - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - ) - : m_dealloc( arg_dealloc ) - , m_verify( arg_verify ) - , m_apply( arg_apply ) - , m_dep( (Task **)( ((unsigned char *) this) + padded_sizeof_derived( arg_sizeof_derived ) ) ) - , m_wait( 0 ) - , m_next( 0 ) - , m_dep_capacity( arg_dependence_capacity ) - , m_dep_size( 0 ) - , m_ref_count( 0 ) - , m_state( TASK_STATE_CONSTRUCTING ) -{ - for ( unsigned i = 0 ; i < arg_dependence_capacity ; ++i ) m_dep[i] = 0 ; -} - -Task::TaskMember( const Task::function_dealloc_type arg_dealloc - , const Task::function_apply_type arg_apply - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - ) - : m_dealloc( arg_dealloc ) - , m_verify( & Task::verify_type ) - , m_apply( arg_apply ) - , m_dep( (Task **)( ((unsigned char *) this) + padded_sizeof_derived( arg_sizeof_derived ) ) ) - , m_wait( 0 ) - , m_next( 0 ) - , m_dep_capacity( arg_dependence_capacity ) - , m_dep_size( 0 ) - , m_ref_count( 0 ) - , m_state( TASK_STATE_CONSTRUCTING ) -{ - for ( unsigned i = 0 ; i < arg_dependence_capacity ; ++i ) m_dep[i] = 0 ; -} - -//---------------------------------------------------------------------------- - -void Task::throw_error_add_dependence() const -{ - std::cerr << "TaskMember< Serial >::add_dependence ERROR" - << " state(" << m_state << ")" - << " dep_size(" << m_dep_size << ")" - << std::endl ; - throw std::runtime_error("TaskMember< Serial >::add_dependence ERROR"); -} - -void Task::throw_error_verify_type() -{ - throw std::runtime_error("TaskMember< Serial >::verify_type ERROR"); -} - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - -void Task::assign( Task ** const lhs , Task * rhs , const bool no_throw ) -{ - static const char msg_error_header[] = "Kokkos::Experimental::Impl::TaskManager::assign ERROR" ; - static const char msg_error_count[] = ": negative reference count" ; - static const char msg_error_complete[] = ": destroy task that is not complete" ; - static const char msg_error_dependences[] = ": destroy task that has dependences" ; - static const char msg_error_exception[] = ": caught internal exception" ; - - const char * msg_error = 0 ; - - try { - - if ( *lhs ) { - - const int count = --((**lhs).m_ref_count); - - if ( 0 == count ) { - - // Reference count at zero, delete it - - // Should only be deallocating a completed task - if ( (**lhs).m_state == Kokkos::Experimental::TASK_STATE_COMPLETE ) { - - // A completed task should not have dependences... - for ( int i = 0 ; i < (**lhs).m_dep_size && 0 == msg_error ; ++i ) { - if ( (**lhs).m_dep[i] ) msg_error = msg_error_dependences ; - } - } - else { - msg_error = msg_error_complete ; - } - - if ( 0 == msg_error ) { - // Get deletion function and apply it - const Task::function_dealloc_type d = (**lhs).m_dealloc ; - - (*d)( *lhs ); - } - } - else if ( count <= 0 ) { - msg_error = msg_error_count ; - } - } - - if ( 0 == msg_error && rhs ) { ++( rhs->m_ref_count ); } - - *lhs = rhs ; - } - catch( ... ) { - if ( 0 == msg_error ) msg_error = msg_error_exception ; - } - - if ( 0 != msg_error ) { - if ( no_throw ) { - std::cerr << msg_error_header << msg_error << std::endl ; - std::cerr.flush(); - } - else { - std::string msg(msg_error_header); - msg.append(msg_error); - throw std::runtime_error( msg ); - } - } -} -#endif - -namespace { - -Task * s_ready = 0 ; -Task * s_denied = reinterpret_cast( ~((unsigned long)0) ); - -} - -void Task::schedule() -{ - // Execute ready tasks in case the task being scheduled - // is dependent upon a waiting and ready task. - - Task::execute_ready_tasks(); - - // spawning : Constructing -> Waiting - // respawning : Executing -> Waiting - // updating : Waiting -> Waiting - - // Must not be in a dependence linked list: 0 == t->m_next - - const bool ok_state = TASK_STATE_COMPLETE != m_state ; - const bool ok_list = 0 == m_next ; - - if ( ok_state && ok_list ) { - - // Will be waiting for execution upon return from this function - - m_state = Kokkos::Experimental::TASK_STATE_WAITING ; - - // Insert this task into another dependence that is not complete - - int i = 0 ; - for ( ; i < m_dep_size ; ++i ) { - Task * const y = m_dep[i] ; - if ( y && s_denied != ( m_next = y->m_wait ) ) { - y->m_wait = this ; // CAS( & y->m_wait , m_next , this ); - break ; - } - } - if ( i == m_dep_size ) { - // All dependences are complete, insert into the ready list - m_next = s_ready ; - s_ready = this ; // CAS( & s_ready , m_next = s_ready , this ); - } - } - else { - throw std::runtime_error(std::string("Kokkos::Experimental::Impl::Task spawn or respawn state error")); - } -} - -void Task::execute_ready_tasks() -{ - while ( s_ready ) { - - // Remove this task from the ready list - - // Task * task ; - // while ( ! CAS( & s_ready , task = s_ready , s_ready->m_next ) ); - - Task * const task = s_ready ; - s_ready = task->m_next ; - - task->m_next = 0 ; - - // precondition: task->m_state = TASK_STATE_WAITING - // precondition: task->m_dep[i]->m_state == TASK_STATE_COMPLETE for all i - // precondition: does not exist T such that T->m_wait = task - // precondition: does not exist T such that T->m_next = task - - task->m_state = Kokkos::Experimental::TASK_STATE_EXECUTING ; - - (*task->m_apply)( task ); - - if ( task->m_state == Kokkos::Experimental::TASK_STATE_EXECUTING ) { - // task did not respawn itself - task->m_state = Kokkos::Experimental::TASK_STATE_COMPLETE ; - - // release dependences: - for ( int i = 0 ; i < task->m_dep_size ; ++i ) { - assign( task->m_dep + i , 0 ); - } - - // Stop other tasks from adding themselves to 'task->m_wait' ; - - Task * x ; - // CAS( & task->m_wait , x = task->m_wait , s_denied ); - x = task->m_wait ; task->m_wait = s_denied ; - - // update tasks waiting on this task - while ( x ) { - Task * const next = x->m_next ; - - x->m_next = 0 ; - - x->schedule(); // could happen concurrently - - x = next ; - } - } - } -} - -} // namespace Impl -} // namespace Experimental -} // namespace Kokkos - -#endif // defined( KOKKOS_HAVE_SERIAL ) diff --git a/lib/kokkos/core/src/impl/Kokkos_Serial_TaskPolicy.hpp b/lib/kokkos/core/src/impl/Kokkos_Serial_TaskPolicy.hpp deleted file mode 100644 index 4eec2f66be..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Serial_TaskPolicy.hpp +++ /dev/null @@ -1,845 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -// Experimental unified task-data parallel manycore LDRD - -#ifndef KOKKOS_SERIAL_TASKPOLICY_HPP -#define KOKKOS_SERIAL_TASKPOLICY_HPP - -#include -#if defined( KOKKOS_HAVE_SERIAL ) - -#include -#include -#include - -#include -#include -#include - -#include - -//---------------------------------------------------------------------------- -/* Inheritance structure to allow static_cast from the task root type - * and a task's FunctorType. - * - * task_root_type == TaskMember< Space , void , void > - * - * TaskMember< PolicyType , ResultType , FunctorType > - * : TaskMember< PolicyType::Space , ResultType , FunctorType > - * { ... }; - * - * TaskMember< Space , ResultType , FunctorType > - * : TaskMember< Space , ResultType , void > - * , FunctorType - * { ... }; - * - * when ResultType != void - * - * TaskMember< Space , ResultType , void > - * : TaskMember< Space , void , void > - * { ... }; - * - */ -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { -namespace Impl { - -/** \brief Base class for all tasks in the Serial execution space */ -template<> -class TaskMember< Kokkos::Serial , void , void > -{ -public: - - typedef void (* function_apply_type) ( TaskMember * ); - typedef void (* function_dealloc_type)( TaskMember * ); - typedef TaskMember * (* function_verify_type) ( TaskMember * ); - -private: - - const function_dealloc_type m_dealloc ; ///< Deallocation - const function_verify_type m_verify ; ///< Result type verification - const function_apply_type m_apply ; ///< Apply function - TaskMember ** const m_dep ; ///< Dependences - TaskMember * m_wait ; ///< Linked list of tasks waiting on this task - TaskMember * m_next ; ///< Linked list of tasks waiting on a different task - const int m_dep_capacity ; ///< Capacity of dependences - int m_dep_size ; ///< Actual count of dependences - int m_ref_count ; ///< Reference count - int m_state ; ///< State of the task - - // size = 6 Pointers + 4 ints - - TaskMember() /* = delete */ ; - TaskMember( const TaskMember & ) /* = delete */ ; - TaskMember & operator = ( const TaskMember & ) /* = delete */ ; - - static void * allocate( const unsigned arg_sizeof_derived , const unsigned arg_dependence_capacity ); - static void deallocate( void * ); - - void throw_error_add_dependence() const ; - static void throw_error_verify_type(); - - template < class DerivedTaskType > - static - void deallocate( TaskMember * t ) - { - DerivedTaskType * ptr = static_cast< DerivedTaskType * >(t); - ptr->~DerivedTaskType(); - deallocate( (void *) ptr ); - } - -protected : - - ~TaskMember(); - - // Used by TaskMember< Serial , ResultType , void > - TaskMember( const function_verify_type arg_verify - , const function_dealloc_type arg_dealloc - , const function_apply_type arg_apply - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - ); - - // Used for TaskMember< Serial , void , void > - TaskMember( const function_dealloc_type arg_dealloc - , const function_apply_type arg_apply - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - ); - -public: - - template< typename ResultType > - KOKKOS_FUNCTION static - TaskMember * verify_type( TaskMember * t ) - { - enum { check_type = ! Kokkos::Impl::is_same< ResultType , void >::value }; - - if ( check_type && t != 0 ) { - - // Verify that t->m_verify is this function - const function_verify_type self = & TaskMember::template verify_type< ResultType > ; - - if ( t->m_verify != self ) { - t = 0 ; -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - throw_error_verify_type(); -#endif - } - } - return t ; - } - - //---------------------------------------- - /* Inheritence Requirements on task types: - * typedef FunctorType::value_type value_type ; - * class DerivedTaskType - * : public TaskMember< Serial , value_type , FunctorType > - * { ... }; - * class TaskMember< Serial , value_type , FunctorType > - * : public TaskMember< Serial , value_type , void > - * , public Functor - * { ... }; - * If value_type != void - * class TaskMember< Serial , value_type , void > - * : public TaskMember< Serial , void , void > - * - * Allocate space for DerivedTaskType followed by TaskMember*[ dependence_capacity ] - * - */ - - /** \brief Allocate and construct a single-thread task */ - template< class DerivedTaskType > - static - TaskMember * create( const typename DerivedTaskType::functor_type & arg_functor - , const unsigned arg_dependence_capacity - ) - { - typedef typename DerivedTaskType::functor_type functor_type ; - typedef typename functor_type::value_type value_type ; - - DerivedTaskType * const task = - new( allocate( sizeof(DerivedTaskType) , arg_dependence_capacity ) ) - DerivedTaskType( & TaskMember::template deallocate< DerivedTaskType > - , & TaskMember::template apply_single< functor_type , value_type > - , sizeof(DerivedTaskType) - , arg_dependence_capacity - , arg_functor ); - - return static_cast< TaskMember * >( task ); - } - - /** \brief Allocate and construct a data parallel task */ - template< class DerivedTaskType > - static - TaskMember * create( const typename DerivedTaskType::policy_type & arg_policy - , const typename DerivedTaskType::functor_type & arg_functor - , const unsigned arg_dependence_capacity - ) - { - DerivedTaskType * const task = - new( allocate( sizeof(DerivedTaskType) , arg_dependence_capacity ) ) - DerivedTaskType( & TaskMember::template deallocate< DerivedTaskType > - , sizeof(DerivedTaskType) - , arg_dependence_capacity - , arg_policy - , arg_functor - ); - - return static_cast< TaskMember * >( task ); - } - - /** \brief Allocate and construct a thread-team task */ - template< class DerivedTaskType > - static - TaskMember * create_team( const typename DerivedTaskType::functor_type & arg_functor - , const unsigned arg_dependence_capacity - ) - { - typedef typename DerivedTaskType::functor_type functor_type ; - typedef typename functor_type::value_type value_type ; - - DerivedTaskType * const task = - new( allocate( sizeof(DerivedTaskType) , arg_dependence_capacity ) ) - DerivedTaskType( & TaskMember::template deallocate< DerivedTaskType > - , & TaskMember::template apply_team< functor_type , value_type > - , sizeof(DerivedTaskType) - , arg_dependence_capacity - , arg_functor ); - - return static_cast< TaskMember * >( task ); - } - - void schedule(); - static void execute_ready_tasks(); - - //---------------------------------------- - - typedef FutureValueTypeIsVoidError get_result_type ; - - KOKKOS_INLINE_FUNCTION - get_result_type get() const { return get_result_type() ; } - - KOKKOS_INLINE_FUNCTION - Kokkos::Experimental::TaskState get_state() const { return Kokkos::Experimental::TaskState( m_state ); } - - //---------------------------------------- - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - static - void assign( TaskMember ** const lhs , TaskMember * const rhs , const bool no_throw = false ); -#else - KOKKOS_INLINE_FUNCTION static - void assign( TaskMember ** const lhs , TaskMember * const rhs , const bool no_throw = false ) {} -#endif - - KOKKOS_INLINE_FUNCTION - TaskMember * get_dependence( int i ) const - { return ( Kokkos::Experimental::TASK_STATE_EXECUTING == m_state && 0 <= i && i < m_dep_size ) ? m_dep[i] : (TaskMember*) 0 ; } - - KOKKOS_INLINE_FUNCTION - int get_dependence() const - { return m_dep_size ; } - - KOKKOS_INLINE_FUNCTION - void clear_dependence() - { - for ( int i = 0 ; i < m_dep_size ; ++i ) assign( m_dep + i , 0 ); - m_dep_size = 0 ; - } - - KOKKOS_INLINE_FUNCTION - void add_dependence( TaskMember * before ) - { - if ( ( Kokkos::Experimental::TASK_STATE_CONSTRUCTING == m_state || - Kokkos::Experimental::TASK_STATE_EXECUTING == m_state ) && - m_dep_size < m_dep_capacity ) { - assign( m_dep + m_dep_size , before ); - ++m_dep_size ; - } - else { - throw_error_add_dependence(); - } - } - - //---------------------------------------- - - template< class FunctorType , class ResultType > - KOKKOS_INLINE_FUNCTION static - void apply_single( typename Kokkos::Impl::enable_if< ! Kokkos::Impl::is_same< ResultType , void >::value , TaskMember * >::type t ) - { - typedef TaskMember< Kokkos::Serial , ResultType , FunctorType > derived_type ; - - // TaskMember< Kokkos::Serial , ResultType , FunctorType > - // : public TaskMember< Kokkos::Serial , ResultType , void > - // , public FunctorType - // { ... }; - - derived_type & m = * static_cast< derived_type * >( t ); - - Kokkos::Impl::FunctorApply< FunctorType , void , ResultType & >::apply( (FunctorType &) m , & m.m_result ); - } - - template< class FunctorType , class ResultType > - KOKKOS_INLINE_FUNCTION static - void apply_single( typename Kokkos::Impl::enable_if< Kokkos::Impl::is_same< ResultType , void >::value , TaskMember * >::type t ) - { - typedef TaskMember< Kokkos::Serial , ResultType , FunctorType > derived_type ; - - // TaskMember< Kokkos::Serial , ResultType , FunctorType > - // : public TaskMember< Kokkos::Serial , ResultType , void > - // , public FunctorType - // { ... }; - - derived_type & m = * static_cast< derived_type * >( t ); - - Kokkos::Impl::FunctorApply< FunctorType , void , void >::apply( (FunctorType &) m ); - } - - //---------------------------------------- - - template< class FunctorType , class ResultType > - static - void apply_team( typename Kokkos::Impl::enable_if< ! Kokkos::Impl::is_same< ResultType , void >::value , TaskMember * >::type t ) - { - typedef TaskMember< Kokkos::Serial , ResultType , FunctorType > derived_type ; - typedef Kokkos::Impl::SerialTeamMember member_type ; - - // TaskMember< Kokkos::Serial , ResultType , FunctorType > - // : public TaskMember< Kokkos::Serial , ResultType , void > - // , public FunctorType - // { ... }; - - derived_type & m = * static_cast< derived_type * >( t ); - - m.FunctorType::apply( member_type(0,1,0) , m.m_result ); - } - - template< class FunctorType , class ResultType > - static - void apply_team( typename Kokkos::Impl::enable_if< Kokkos::Impl::is_same< ResultType , void >::value , TaskMember * >::type t ) - { - typedef TaskMember< Kokkos::Serial , ResultType , FunctorType > derived_type ; - typedef Kokkos::Impl::SerialTeamMember member_type ; - - // TaskMember< Kokkos::Serial , ResultType , FunctorType > - // : public TaskMember< Kokkos::Serial , ResultType , void > - // , public FunctorType - // { ... }; - - derived_type & m = * static_cast< derived_type * >( t ); - - m.FunctorType::apply( member_type(0,1,0) ); - } -}; - -//---------------------------------------------------------------------------- -/** \brief Base class for tasks with a result value in the Serial execution space. - * - * The FunctorType must be void because this class is accessed by the - * Future class for the task and result value. - * - * Must be derived from TaskMember 'root class' so the Future class - * can correctly static_cast from the 'root class' to this class. - */ -template < class ResultType > -class TaskMember< Kokkos::Serial , ResultType , void > - : public TaskMember< Kokkos::Serial , void , void > -{ -public: - - ResultType m_result ; - - typedef const ResultType & get_result_type ; - - KOKKOS_INLINE_FUNCTION - get_result_type get() const { return m_result ; } - -protected: - - typedef TaskMember< Kokkos::Serial , void , void > task_root_type ; - typedef task_root_type::function_dealloc_type function_dealloc_type ; - typedef task_root_type::function_apply_type function_apply_type ; - - inline - TaskMember( const function_dealloc_type arg_dealloc - , const function_apply_type arg_apply - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - ) - : task_root_type( & task_root_type::template verify_type< ResultType > - , arg_dealloc - , arg_apply - , arg_sizeof_derived - , arg_dependence_capacity ) - , m_result() - {} -}; - -template< class ResultType , class FunctorType > -class TaskMember< Kokkos::Serial , ResultType , FunctorType > - : public TaskMember< Kokkos::Serial , ResultType , void > - , public FunctorType -{ -public: - - typedef FunctorType functor_type ; - - typedef TaskMember< Kokkos::Serial , void , void > task_root_type ; - typedef TaskMember< Kokkos::Serial , ResultType , void > task_base_type ; - typedef task_root_type::function_dealloc_type function_dealloc_type ; - typedef task_root_type::function_apply_type function_apply_type ; - - inline - TaskMember( const function_dealloc_type arg_dealloc - , const function_apply_type arg_apply - , const unsigned arg_sizeof_derived - , const unsigned arg_dependence_capacity - , const functor_type & arg_functor - ) - : task_base_type( arg_dealloc , arg_apply , arg_sizeof_derived , arg_dependence_capacity ) - , functor_type( arg_functor ) - {} -}; - -//---------------------------------------------------------------------------- -/** \brief ForEach task in the Serial execution space - * - * Derived from TaskMember< Kokkos::Serial , ResultType , FunctorType > - * so that Functor can be cast to task root type without knowing policy. - */ -template< class Arg0 , class Arg1 , class Arg2 , class ResultType , class FunctorType > -class TaskForEach< Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Serial > - , ResultType - , FunctorType > - : TaskMember< Kokkos::Serial , ResultType , FunctorType > -{ -public: - - typedef FunctorType functor_type ; - typedef RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Serial > policy_type ; - -private: - - friend class Kokkos::Experimental::TaskPolicy< Kokkos::Serial > ; - friend class Kokkos::Experimental::Impl::TaskMember< Kokkos::Serial , void , void > ; - - typedef TaskMember< Kokkos::Serial , void , void > task_root_type ; - typedef TaskMember< Kokkos::Serial , ResultType , FunctorType > task_base_type ; - typedef task_root_type::function_dealloc_type function_dealloc_type ; - - policy_type m_policy ; - - template< class Tag > - inline - typename Kokkos::Impl::enable_if< Kokkos::Impl::is_same::value >::type - apply_policy() const - { - const typename policy_type::member_type e = m_policy.end(); - for ( typename policy_type::member_type i = m_policy.begin() ; i < e ; ++i ) { - functor_type::operator()(i); - } - } - - template< class Tag > - inline - typename Kokkos::Impl::enable_if< ! Kokkos::Impl::is_same::value >::type - apply_policy() const - { - const Tag tag ; - const typename policy_type::member_type e = m_policy.end(); - for ( typename policy_type::member_type i = m_policy.begin() ; i < e ; ++i ) { - functor_type::operator()(tag,i); - } - } - - static - void apply_parallel( task_root_type * t ) - { - static_cast(t)->template apply_policy< typename policy_type::work_tag >(); - - task_root_type::template apply_single< functor_type , ResultType >( t ); - } - - TaskForEach( const function_dealloc_type arg_dealloc - , const int arg_sizeof_derived - , const int arg_dependence_capacity - , const policy_type & arg_policy - , const functor_type & arg_functor - ) - : task_base_type( arg_dealloc - , & apply_parallel - , arg_sizeof_derived - , arg_dependence_capacity - , arg_functor ) - , m_policy( arg_policy ) - {} - - TaskForEach() /* = delete */ ; - TaskForEach( const TaskForEach & ) /* = delete */ ; - TaskForEach & operator = ( const TaskForEach & ) /* = delete */ ; -}; - -//---------------------------------------------------------------------------- -/** \brief Reduce task in the Serial execution space - * - * Derived from TaskMember< Kokkos::Serial , ResultType , FunctorType > - * so that Functor can be cast to task root type without knowing policy. - */ -template< class Arg0 , class Arg1 , class Arg2 , class ResultType , class FunctorType > -class TaskReduce< Kokkos::RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Serial > - , ResultType - , FunctorType > - : TaskMember< Kokkos::Serial , ResultType , FunctorType > -{ -public: - - typedef FunctorType functor_type ; - typedef RangePolicy< Arg0 , Arg1 , Arg2 , Kokkos::Serial > policy_type ; - -private: - - friend class Kokkos::Experimental::TaskPolicy< Kokkos::Serial > ; - friend class Kokkos::Experimental::Impl::TaskMember< Kokkos::Serial , void , void > ; - - typedef TaskMember< Kokkos::Serial , void , void > task_root_type ; - typedef TaskMember< Kokkos::Serial , ResultType , FunctorType > task_base_type ; - typedef task_root_type::function_dealloc_type function_dealloc_type ; - - policy_type m_policy ; - - template< class Tag > - inline - void apply_policy( typename Kokkos::Impl::enable_if< Kokkos::Impl::is_same::value , ResultType & >::type result ) const - { - Kokkos::Impl::FunctorValueInit< functor_type , Tag >::init( *this , & result ); - const typename policy_type::member_type e = m_policy.end(); - for ( typename policy_type::member_type i = m_policy.begin() ; i < e ; ++i ) { - functor_type::operator()( i, result ); - } - } - - template< class Tag > - inline - void apply_policy( typename Kokkos::Impl::enable_if< ! Kokkos::Impl::is_same::value , ResultType & >::type result ) const - { - Kokkos::Impl::FunctorValueInit< functor_type , Tag >::init( *this , & result ); - const Tag tag ; - const typename policy_type::member_type e = m_policy.end(); - for ( typename policy_type::member_type i = m_policy.begin() ; i < e ; ++i ) { - functor_type::operator()( tag, i, result ); - } - } - - static - void apply_parallel( task_root_type * t ) - { - TaskReduce * const task = static_cast(t); - - task->template apply_policy< typename policy_type::work_tag >( task->task_base_type::m_result ); - - task_root_type::template apply_single< functor_type , ResultType >( t ); - } - - TaskReduce( const function_dealloc_type arg_dealloc - , const int arg_sizeof_derived - , const int arg_dependence_capacity - , const policy_type & arg_policy - , const functor_type & arg_functor - ) - : task_base_type( arg_dealloc - , & apply_parallel - , arg_sizeof_derived - , arg_dependence_capacity - , arg_functor ) - , m_policy( arg_policy ) - {} - - TaskReduce() /* = delete */ ; - TaskReduce( const TaskReduce & ) /* = delete */ ; - TaskReduce & operator = ( const TaskReduce & ) /* = delete */ ; -}; - -} /* namespace Impl */ -} /* namespace Experimental */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Experimental { - -template<> -class TaskPolicy< Kokkos::Serial > -{ -public: - - typedef Kokkos::Serial execution_space ; - typedef Kokkos::Impl::SerialTeamMember member_type ; - -private: - - typedef Impl::TaskMember< execution_space , void , void > task_root_type ; - - template< class FunctorType > - static inline - const task_root_type * get_task_root( const FunctorType * f ) - { - typedef Impl::TaskMember< execution_space , typename FunctorType::value_type , FunctorType > task_type ; - return static_cast< const task_root_type * >( static_cast< const task_type * >(f) ); - } - - template< class FunctorType > - static inline - task_root_type * get_task_root( FunctorType * f ) - { - typedef Impl::TaskMember< execution_space , typename FunctorType::value_type , FunctorType > task_type ; - return static_cast< task_root_type * >( static_cast< task_type * >(f) ); - } - - unsigned m_default_dependence_capacity ; - -public: - - KOKKOS_INLINE_FUNCTION - TaskPolicy() : m_default_dependence_capacity(4) {} - - KOKKOS_INLINE_FUNCTION - TaskPolicy( const TaskPolicy & rhs ) : m_default_dependence_capacity( rhs.m_default_dependence_capacity ) {} - - KOKKOS_INLINE_FUNCTION - explicit - TaskPolicy( const unsigned arg_default_dependence_capacity ) - : m_default_dependence_capacity( arg_default_dependence_capacity ) {} - - KOKKOS_INLINE_FUNCTION - TaskPolicy( const TaskPolicy & - , const unsigned arg_default_dependence_capacity ) - : m_default_dependence_capacity( arg_default_dependence_capacity ) {} - - TaskPolicy & operator = ( const TaskPolicy &rhs ) - { - m_default_dependence_capacity = rhs.m_default_dependence_capacity; - return *this; - } - - //---------------------------------------- - - template< class ValueType > - KOKKOS_INLINE_FUNCTION - const Future< ValueType , execution_space > & - spawn( const Future< ValueType , execution_space > & f ) const - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - f.m_task->schedule(); -#endif - return f ; - } - - // Create single-thread task - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - Future< typename FunctorType::value_type , execution_space > - create( const FunctorType & functor - , const unsigned dependence_capacity = ~0u ) const - { - typedef typename FunctorType::value_type value_type ; - typedef Impl::TaskMember< execution_space , value_type , FunctorType > task_type ; - return Future< value_type , execution_space >( -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - task_root_type::create< task_type >( - functor , ( ~0u == dependence_capacity ? m_default_dependence_capacity : dependence_capacity ) ) -#endif - ); - } - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - Future< typename FunctorType::value_type , execution_space > - create_team( const FunctorType & functor - , const unsigned dependence_capacity = ~0u ) const - { - typedef typename FunctorType::value_type value_type ; - typedef Impl::TaskMember< execution_space , value_type , FunctorType > task_type ; - return Future< value_type , execution_space >( -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - task_root_type::create_team< task_type >( - functor , ( ~0u == dependence_capacity ? m_default_dependence_capacity : dependence_capacity ) ) -#endif - ); - } - - // Create parallel foreach task - - template< class PolicyType , class FunctorType > - KOKKOS_INLINE_FUNCTION - Future< typename FunctorType::value_type , execution_space > - create_foreach( const PolicyType & policy - , const FunctorType & functor - , const unsigned dependence_capacity = ~0u ) const - { - typedef typename FunctorType::value_type value_type ; - typedef Impl::TaskForEach< PolicyType , value_type , FunctorType > task_type ; - return Future< value_type , execution_space >( -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - task_root_type::create< task_type >( policy , functor , - ( ~0u == dependence_capacity ? m_default_dependence_capacity : dependence_capacity ) ) -#endif - ); - } - - // Create parallel reduce task - - template< class PolicyType , class FunctorType > - KOKKOS_INLINE_FUNCTION - Future< typename FunctorType::value_type , execution_space > - create_reduce( const PolicyType & policy - , const FunctorType & functor - , const unsigned dependence_capacity = ~0u ) const - { - typedef typename FunctorType::value_type value_type ; - typedef Impl::TaskReduce< PolicyType , value_type , FunctorType > task_type ; - return Future< value_type , execution_space >( -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - task_root_type::create< task_type >( policy , functor , - ( ~0u == dependence_capacity ? m_default_dependence_capacity : dependence_capacity ) ) -#endif - ); - } - - // Add dependence - template< class A1 , class A2 , class A3 , class A4 > - KOKKOS_INLINE_FUNCTION - void add_dependence( const Future & after - , const Future & before - , typename Kokkos::Impl::enable_if - < Kokkos::Impl::is_same< typename Future::execution_space , execution_space >::value - && - Kokkos::Impl::is_same< typename Future::execution_space , execution_space >::value - >::type * = 0 - ) const - { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - after.m_task->add_dependence( before.m_task ); -#endif - } - - //---------------------------------------- - // Functions for an executing task functor to query dependences, - // set new dependences, and respawn itself. - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - Future< void , execution_space > - get_dependence( const FunctorType * task_functor , int i ) const - { - return Future( -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - get_task_root(task_functor)->get_dependence(i) -#endif - ); - } - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - int get_dependence( const FunctorType * task_functor ) const -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { return get_task_root(task_functor)->get_dependence(); } -#else - { return 0 ; } -#endif - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - void clear_dependence( FunctorType * task_functor ) const -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { get_task_root(task_functor)->clear_dependence(); } -#else - {} -#endif - - template< class FunctorType , class A3 , class A4 > - KOKKOS_INLINE_FUNCTION - void add_dependence( FunctorType * task_functor - , const Future & before - , typename Kokkos::Impl::enable_if - < Kokkos::Impl::is_same< typename Future::execution_space , execution_space >::value - >::type * = 0 - ) const -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { get_task_root(task_functor)->add_dependence( before.m_task ); } -#else - {} -#endif - - template< class FunctorType > - KOKKOS_INLINE_FUNCTION - void respawn( FunctorType * task_functor ) const -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { get_task_root(task_functor)->schedule(); } -#else - {} -#endif - - //---------------------------------------- - - static member_type & member_single(); -}; - -inline -void wait( TaskPolicy< Kokkos::Serial > & ) -{ Impl::TaskMember< Kokkos::Serial , void , void >::execute_ready_tasks(); } - -} /* namespace Experimental */ -} // namespace Kokkos - -//---------------------------------------------------------------------------- - -#endif /* defined( KOKKOS_HAVE_SERIAL ) */ -#endif /* #define KOKKOS_SERIAL_TASK_HPP */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_Shape.cpp b/lib/kokkos/core/src/impl/Kokkos_Shape.cpp deleted file mode 100644 index da12db1f38..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Shape.cpp +++ /dev/null @@ -1,178 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - - -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -void assert_counts_are_equal_throw( - const size_t x_count , - const size_t y_count ) -{ - std::ostringstream msg ; - - msg << "Kokkos::Impl::assert_counts_are_equal_throw( " - << x_count << " != " << y_count << " )" ; - - throw_runtime_exception( msg.str() ); -} - -void assert_shapes_are_equal_throw( - const unsigned x_scalar_size , - const unsigned x_rank , - const size_t x_N0 , const unsigned x_N1 , - const unsigned x_N2 , const unsigned x_N3 , - const unsigned x_N4 , const unsigned x_N5 , - const unsigned x_N6 , const unsigned x_N7 , - - const unsigned y_scalar_size , - const unsigned y_rank , - const size_t y_N0 , const unsigned y_N1 , - const unsigned y_N2 , const unsigned y_N3 , - const unsigned y_N4 , const unsigned y_N5 , - const unsigned y_N6 , const unsigned y_N7 ) -{ - std::ostringstream msg ; - - msg << "Kokkos::Impl::assert_shape_are_equal_throw( {" - << " scalar_size(" << x_scalar_size - << ") rank(" << x_rank - << ") dimension(" ; - if ( 0 < x_rank ) { msg << " " << x_N0 ; } - if ( 1 < x_rank ) { msg << " " << x_N1 ; } - if ( 2 < x_rank ) { msg << " " << x_N2 ; } - if ( 3 < x_rank ) { msg << " " << x_N3 ; } - if ( 4 < x_rank ) { msg << " " << x_N4 ; } - if ( 5 < x_rank ) { msg << " " << x_N5 ; } - if ( 6 < x_rank ) { msg << " " << x_N6 ; } - if ( 7 < x_rank ) { msg << " " << x_N7 ; } - msg << " ) } != { " - << " scalar_size(" << y_scalar_size - << ") rank(" << y_rank - << ") dimension(" ; - if ( 0 < y_rank ) { msg << " " << y_N0 ; } - if ( 1 < y_rank ) { msg << " " << y_N1 ; } - if ( 2 < y_rank ) { msg << " " << y_N2 ; } - if ( 3 < y_rank ) { msg << " " << y_N3 ; } - if ( 4 < y_rank ) { msg << " " << y_N4 ; } - if ( 5 < y_rank ) { msg << " " << y_N5 ; } - if ( 6 < y_rank ) { msg << " " << y_N6 ; } - if ( 7 < y_rank ) { msg << " " << y_N7 ; } - msg << " ) } )" ; - - throw_runtime_exception( msg.str() ); -} - -void AssertShapeBoundsAbort< Kokkos::HostSpace >::apply( - const size_t rank , - const size_t n0 , const size_t n1 , - const size_t n2 , const size_t n3 , - const size_t n4 , const size_t n5 , - const size_t n6 , const size_t n7 , - - const size_t arg_rank , - const size_t i0 , const size_t i1 , - const size_t i2 , const size_t i3 , - const size_t i4 , const size_t i5 , - const size_t i6 , const size_t i7 ) -{ - std::ostringstream msg ; - msg << "Kokkos::Impl::AssertShapeBoundsAbort( shape = {" ; - if ( 0 < rank ) { msg << " " << n0 ; } - if ( 1 < rank ) { msg << " " << n1 ; } - if ( 2 < rank ) { msg << " " << n2 ; } - if ( 3 < rank ) { msg << " " << n3 ; } - if ( 4 < rank ) { msg << " " << n4 ; } - if ( 5 < rank ) { msg << " " << n5 ; } - if ( 6 < rank ) { msg << " " << n6 ; } - if ( 7 < rank ) { msg << " " << n7 ; } - msg << " } index = {" ; - if ( 0 < arg_rank ) { msg << " " << i0 ; } - if ( 1 < arg_rank ) { msg << " " << i1 ; } - if ( 2 < arg_rank ) { msg << " " << i2 ; } - if ( 3 < arg_rank ) { msg << " " << i3 ; } - if ( 4 < arg_rank ) { msg << " " << i4 ; } - if ( 5 < arg_rank ) { msg << " " << i5 ; } - if ( 6 < arg_rank ) { msg << " " << i6 ; } - if ( 7 < arg_rank ) { msg << " " << i7 ; } - msg << " } )" ; - - throw_runtime_exception( msg.str() ); -} - -void assert_shape_effective_rank1_at_leastN_throw( - const size_t x_rank , const size_t x_N0 , - const size_t x_N1 , const size_t x_N2 , - const size_t x_N3 , const size_t x_N4 , - const size_t x_N5 , const size_t x_N6 , - const size_t x_N7 , - const size_t N0 ) -{ - std::ostringstream msg ; - - msg << "Kokkos::Impl::assert_shape_effective_rank1_at_leastN_throw( shape = {" ; - if ( 0 < x_rank ) { msg << " " << x_N0 ; } - if ( 1 < x_rank ) { msg << " " << x_N1 ; } - if ( 2 < x_rank ) { msg << " " << x_N2 ; } - if ( 3 < x_rank ) { msg << " " << x_N3 ; } - if ( 4 < x_rank ) { msg << " " << x_N4 ; } - if ( 5 < x_rank ) { msg << " " << x_N5 ; } - if ( 6 < x_rank ) { msg << " " << x_N6 ; } - if ( 7 < x_rank ) { msg << " " << x_N7 ; } - msg << " } N = " << N0 << " )" ; - - throw_runtime_exception( msg.str() ); -} - - - -} -} - diff --git a/lib/kokkos/core/src/impl/Kokkos_Shape.hpp b/lib/kokkos/core/src/impl/Kokkos_Shape.hpp deleted file mode 100644 index dba7301270..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Shape.hpp +++ /dev/null @@ -1,917 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_SHAPE_HPP -#define KOKKOS_SHAPE_HPP - -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -//---------------------------------------------------------------------------- -/** \brief The shape of a Kokkos with dynamic and static dimensions. - * Dynamic dimensions are member values and static dimensions are - * 'static const' values. - * - * The upper bound on the array rank is eight. - */ -template< unsigned ScalarSize , - unsigned Rank , - unsigned s0 = 1 , - unsigned s1 = 1 , - unsigned s2 = 1 , - unsigned s3 = 1 , - unsigned s4 = 1 , - unsigned s5 = 1 , - unsigned s6 = 1 , - unsigned s7 = 1 > -struct Shape ; - -//---------------------------------------------------------------------------- -/** \brief Shape equality if the value type, layout, and dimensions - * are equal. - */ -template< unsigned xSize , unsigned xRank , - unsigned xN0 , unsigned xN1 , unsigned xN2 , unsigned xN3 , - unsigned xN4 , unsigned xN5 , unsigned xN6 , unsigned xN7 , - - unsigned ySize , unsigned yRank , - unsigned yN0 , unsigned yN1 , unsigned yN2 , unsigned yN3 , - unsigned yN4 , unsigned yN5 , unsigned yN6 , unsigned yN7 > -KOKKOS_INLINE_FUNCTION -bool operator == ( const Shape & x , - const Shape & y ) -{ - enum { same_size = xSize == ySize }; - enum { same_rank = xRank == yRank }; - - return same_size && same_rank && - size_t( x.N0 ) == size_t( y.N0 ) && - unsigned( x.N1 ) == unsigned( y.N1 ) && - unsigned( x.N2 ) == unsigned( y.N2 ) && - unsigned( x.N3 ) == unsigned( y.N3 ) && - unsigned( x.N4 ) == unsigned( y.N4 ) && - unsigned( x.N5 ) == unsigned( y.N5 ) && - unsigned( x.N6 ) == unsigned( y.N6 ) && - unsigned( x.N7 ) == unsigned( y.N7 ) ; -} - -template< unsigned xSize , unsigned xRank , - unsigned xN0 , unsigned xN1 , unsigned xN2 , unsigned xN3 , - unsigned xN4 , unsigned xN5 , unsigned xN6 , unsigned xN7 , - - unsigned ySize ,unsigned yRank , - unsigned yN0 , unsigned yN1 , unsigned yN2 , unsigned yN3 , - unsigned yN4 , unsigned yN5 , unsigned yN6 , unsigned yN7 > -KOKKOS_INLINE_FUNCTION -bool operator != ( const Shape & x , - const Shape & y ) -{ return ! operator == ( x , y ); } - -//---------------------------------------------------------------------------- - -void assert_counts_are_equal_throw( - const size_t x_count , - const size_t y_count ); - -inline -void assert_counts_are_equal( - const size_t x_count , - const size_t y_count ) -{ - if ( x_count != y_count ) { - assert_counts_are_equal_throw( x_count , y_count ); - } -} - -void assert_shapes_are_equal_throw( - const unsigned x_scalar_size , - const unsigned x_rank , - const size_t x_N0 , const unsigned x_N1 , - const unsigned x_N2 , const unsigned x_N3 , - const unsigned x_N4 , const unsigned x_N5 , - const unsigned x_N6 , const unsigned x_N7 , - - const unsigned y_scalar_size , - const unsigned y_rank , - const size_t y_N0 , const unsigned y_N1 , - const unsigned y_N2 , const unsigned y_N3 , - const unsigned y_N4 , const unsigned y_N5 , - const unsigned y_N6 , const unsigned y_N7 ); - -template< unsigned xSize , unsigned xRank , - unsigned xN0 , unsigned xN1 , unsigned xN2 , unsigned xN3 , - unsigned xN4 , unsigned xN5 , unsigned xN6 , unsigned xN7 , - - unsigned ySize , unsigned yRank , - unsigned yN0 , unsigned yN1 , unsigned yN2 , unsigned yN3 , - unsigned yN4 , unsigned yN5 , unsigned yN6 , unsigned yN7 > -inline -void assert_shapes_are_equal( - const Shape & x , - const Shape & y ) -{ - typedef Shape x_type ; - typedef Shape y_type ; - - if ( x != y ) { - assert_shapes_are_equal_throw( - x_type::scalar_size, x_type::rank, x.N0, x.N1, x.N2, x.N3, x.N4, x.N5, x.N6, x.N7, - y_type::scalar_size, y_type::rank, y.N0, y.N1, y.N2, y.N3, y.N4, y.N5, y.N6, y.N7 ); - } -} - -template< unsigned xSize , unsigned xRank , - unsigned xN0 , unsigned xN1 , unsigned xN2 , unsigned xN3 , - unsigned xN4 , unsigned xN5 , unsigned xN6 , unsigned xN7 , - - unsigned ySize , unsigned yRank , - unsigned yN0 , unsigned yN1 , unsigned yN2 , unsigned yN3 , - unsigned yN4 , unsigned yN5 , unsigned yN6 , unsigned yN7 > -void assert_shapes_equal_dimension( - const Shape & x , - const Shape & y ) -{ - typedef Shape x_type ; - typedef Shape y_type ; - - // Omit comparison of scalar_size. - if ( unsigned( x.rank ) != unsigned( y.rank ) || - size_t( x.N0 ) != size_t( y.N0 ) || - unsigned( x.N1 ) != unsigned( y.N1 ) || - unsigned( x.N2 ) != unsigned( y.N2 ) || - unsigned( x.N3 ) != unsigned( y.N3 ) || - unsigned( x.N4 ) != unsigned( y.N4 ) || - unsigned( x.N5 ) != unsigned( y.N5 ) || - unsigned( x.N6 ) != unsigned( y.N6 ) || - unsigned( x.N7 ) != unsigned( y.N7 ) ) { - assert_shapes_are_equal_throw( - x_type::scalar_size, x_type::rank, x.N0, x.N1, x.N2, x.N3, x.N4, x.N5, x.N6, x.N7, - y_type::scalar_size, y_type::rank, y.N0, y.N1, y.N2, y.N3, y.N4, y.N5, y.N6, y.N7 ); - } -} - -//---------------------------------------------------------------------------- - -template< class ShapeType > struct assert_shape_is_rank_zero ; -template< class ShapeType > struct assert_shape_is_rank_one ; - -template< unsigned Size > -struct assert_shape_is_rank_zero< Shape > - : public true_type {}; - -template< unsigned Size , unsigned s0 > -struct assert_shape_is_rank_one< Shape > - : public true_type {}; - -//---------------------------------------------------------------------------- - -/** \brief Array bounds assertion templated on the execution space - * to allow device-specific abort code. - */ -template< class Space > -struct AssertShapeBoundsAbort ; - -template<> -struct AssertShapeBoundsAbort< Kokkos::HostSpace > -{ - static void apply( const size_t rank , - const size_t n0 , const size_t n1 , - const size_t n2 , const size_t n3 , - const size_t n4 , const size_t n5 , - const size_t n6 , const size_t n7 , - const size_t arg_rank , - const size_t i0 , const size_t i1 , - const size_t i2 , const size_t i3 , - const size_t i4 , const size_t i5 , - const size_t i6 , const size_t i7 ); -}; - -template< class ExecutionSpace > -struct AssertShapeBoundsAbort -{ - KOKKOS_INLINE_FUNCTION - static void apply( const size_t rank , - const size_t n0 , const size_t n1 , - const size_t n2 , const size_t n3 , - const size_t n4 , const size_t n5 , - const size_t n6 , const size_t n7 , - const size_t arg_rank , - const size_t i0 , const size_t i1 , - const size_t i2 , const size_t i3 , - const size_t i4 , const size_t i5 , - const size_t i6 , const size_t i7 ) - { - AssertShapeBoundsAbort< Kokkos::HostSpace > - ::apply( rank , n0 , n1 , n2 , n3 , n4 , n5 , n6 , n7 , - arg_rank, i0 , i1 , i2 , i3 , i4 , i5 , i6 , i7 ); - } -}; - -template< class ShapeType > -KOKKOS_INLINE_FUNCTION -void assert_shape_bounds( const ShapeType & shape , - const size_t arg_rank , - const size_t i0 , - const size_t i1 = 0 , - const size_t i2 = 0 , - const size_t i3 = 0 , - const size_t i4 = 0 , - const size_t i5 = 0 , - const size_t i6 = 0 , - const size_t i7 = 0 ) -{ - // Must supply at least as many indices as ranks. - // Every index must be within bounds. - const bool ok = ShapeType::rank <= arg_rank && - i0 < shape.N0 && - i1 < shape.N1 && - i2 < shape.N2 && - i3 < shape.N3 && - i4 < shape.N4 && - i5 < shape.N5 && - i6 < shape.N6 && - i7 < shape.N7 ; - - if ( ! ok ) { - AssertShapeBoundsAbort< Kokkos::Impl::ActiveExecutionMemorySpace > - ::apply( ShapeType::rank , - shape.N0 , shape.N1 , shape.N2 , shape.N3 , - shape.N4 , shape.N5 , shape.N6 , shape.N7 , - arg_rank , i0 , i1 , i2 , i3 , i4 , i5 , i6 , i7 ); - } -} - -#if defined( KOKKOS_ENABLE_DEBUG_BOUNDS_CHECK ) -#define KOKKOS_ASSERT_SHAPE_BOUNDS_1( S , I0 ) assert_shape_bounds(S,1,I0); -#define KOKKOS_ASSERT_SHAPE_BOUNDS_2( S , I0 , I1 ) assert_shape_bounds(S,2,I0,I1); -#define KOKKOS_ASSERT_SHAPE_BOUNDS_3( S , I0 , I1 , I2 ) assert_shape_bounds(S,3,I0,I1,I2); -#define KOKKOS_ASSERT_SHAPE_BOUNDS_4( S , I0 , I1 , I2 , I3 ) assert_shape_bounds(S,4,I0,I1,I2,I3); -#define KOKKOS_ASSERT_SHAPE_BOUNDS_5( S , I0 , I1 , I2 , I3 , I4 ) assert_shape_bounds(S,5,I0,I1,I2,I3,I4); -#define KOKKOS_ASSERT_SHAPE_BOUNDS_6( S , I0 , I1 , I2 , I3 , I4 , I5 ) assert_shape_bounds(S,6,I0,I1,I2,I3,I4,I5); -#define KOKKOS_ASSERT_SHAPE_BOUNDS_7( S , I0 , I1 , I2 , I3 , I4 , I5 , I6 ) assert_shape_bounds(S,7,I0,I1,I2,I3,I4,I5,I6); -#define KOKKOS_ASSERT_SHAPE_BOUNDS_8( S , I0 , I1 , I2 , I3 , I4 , I5 , I6 , I7 ) assert_shape_bounds(S,8,I0,I1,I2,I3,I4,I5,I6,I7); -#else -#define KOKKOS_ASSERT_SHAPE_BOUNDS_1( S , I0 ) /* */ -#define KOKKOS_ASSERT_SHAPE_BOUNDS_2( S , I0 , I1 ) /* */ -#define KOKKOS_ASSERT_SHAPE_BOUNDS_3( S , I0 , I1 , I2 ) /* */ -#define KOKKOS_ASSERT_SHAPE_BOUNDS_4( S , I0 , I1 , I2 , I3 ) /* */ -#define KOKKOS_ASSERT_SHAPE_BOUNDS_5( S , I0 , I1 , I2 , I3 , I4 ) /* */ -#define KOKKOS_ASSERT_SHAPE_BOUNDS_6( S , I0 , I1 , I2 , I3 , I4 , I5 ) /* */ -#define KOKKOS_ASSERT_SHAPE_BOUNDS_7( S , I0 , I1 , I2 , I3 , I4 , I5 , I6 ) /* */ -#define KOKKOS_ASSERT_SHAPE_BOUNDS_8( S , I0 , I1 , I2 , I3 , I4 , I5 , I6 , I7 ) /* */ -#endif - - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- -// Specialization and optimization for the Rank 0 shape. - -template < unsigned ScalarSize > -struct Shape< ScalarSize , 0, 1,1,1,1, 1,1,1,1 > -{ - enum { scalar_size = ScalarSize }; - enum { rank_dynamic = 0 }; - enum { rank = 0 }; - - enum { N0 = 1 }; - enum { N1 = 1 }; - enum { N2 = 1 }; - enum { N3 = 1 }; - enum { N4 = 1 }; - enum { N5 = 1 }; - enum { N6 = 1 }; - enum { N7 = 1 }; - - KOKKOS_INLINE_FUNCTION - static - void assign( Shape & , - unsigned = 0 , unsigned = 0 , unsigned = 0 , unsigned = 0 , - unsigned = 0 , unsigned = 0 , unsigned = 0 , unsigned = 0 ) - {} -}; - -//---------------------------------------------------------------------------- - -template< unsigned R > struct assign_shape_dimension ; - -#define KOKKOS_ASSIGN_SHAPE_DIMENSION( R ) \ -template<> \ -struct assign_shape_dimension< R > \ -{ \ - template< class ShapeType > \ - KOKKOS_INLINE_FUNCTION \ - assign_shape_dimension( ShapeType & shape \ - , typename Impl::enable_if<( R < ShapeType::rank_dynamic ), size_t >::type n \ - ) { shape.N ## R = n ; } \ -}; - -KOKKOS_ASSIGN_SHAPE_DIMENSION(0) -KOKKOS_ASSIGN_SHAPE_DIMENSION(1) -KOKKOS_ASSIGN_SHAPE_DIMENSION(2) -KOKKOS_ASSIGN_SHAPE_DIMENSION(3) -KOKKOS_ASSIGN_SHAPE_DIMENSION(4) -KOKKOS_ASSIGN_SHAPE_DIMENSION(5) -KOKKOS_ASSIGN_SHAPE_DIMENSION(6) -KOKKOS_ASSIGN_SHAPE_DIMENSION(7) - -#undef KOKKOS_ASSIGN_SHAPE_DIMENSION - -//---------------------------------------------------------------------------- -// All-static dimension array - -template < unsigned ScalarSize , - unsigned Rank , - unsigned s0 , - unsigned s1 , - unsigned s2 , - unsigned s3 , - unsigned s4 , - unsigned s5 , - unsigned s6 , - unsigned s7 > -struct Shape { - - enum { scalar_size = ScalarSize }; - enum { rank_dynamic = 0 }; - enum { rank = Rank }; - - enum { N0 = s0 }; - enum { N1 = s1 }; - enum { N2 = s2 }; - enum { N3 = s3 }; - enum { N4 = s4 }; - enum { N5 = s5 }; - enum { N6 = s6 }; - enum { N7 = s7 }; - - KOKKOS_INLINE_FUNCTION - static - void assign( Shape & , - unsigned = 0 , unsigned = 0 , unsigned = 0 , unsigned = 0 , - unsigned = 0 , unsigned = 0 , unsigned = 0 , unsigned = 0 ) - {} -}; - -// 1 == dynamic_rank <= rank <= 8 -template < unsigned ScalarSize , - unsigned Rank , - unsigned s1 , - unsigned s2 , - unsigned s3 , - unsigned s4 , - unsigned s5 , - unsigned s6 , - unsigned s7 > -struct Shape< ScalarSize , Rank , 0,s1,s2,s3, s4,s5,s6,s7 > -{ - enum { scalar_size = ScalarSize }; - enum { rank_dynamic = 1 }; - enum { rank = Rank }; - - size_t N0 ; // For 1 == dynamic_rank allow N0 > 2^32 - - enum { N1 = s1 }; - enum { N2 = s2 }; - enum { N3 = s3 }; - enum { N4 = s4 }; - enum { N5 = s5 }; - enum { N6 = s6 }; - enum { N7 = s7 }; - - KOKKOS_INLINE_FUNCTION - static - void assign( Shape & s , - size_t n0 , unsigned = 0 , unsigned = 0 , unsigned = 0 , - unsigned = 0 , unsigned = 0 , unsigned = 0 , unsigned = 0 ) - { s.N0 = n0 ; } -}; - -// 2 == dynamic_rank <= rank <= 8 -template < unsigned ScalarSize , unsigned Rank , - unsigned s2 , - unsigned s3 , - unsigned s4 , - unsigned s5 , - unsigned s6 , - unsigned s7 > -struct Shape< ScalarSize , Rank , 0,0,s2,s3, s4,s5,s6,s7 > -{ - enum { scalar_size = ScalarSize }; - enum { rank_dynamic = 2 }; - enum { rank = Rank }; - - unsigned N0 ; - unsigned N1 ; - - enum { N2 = s2 }; - enum { N3 = s3 }; - enum { N4 = s4 }; - enum { N5 = s5 }; - enum { N6 = s6 }; - enum { N7 = s7 }; - - KOKKOS_INLINE_FUNCTION - static - void assign( Shape & s , - unsigned n0 , unsigned n1 , unsigned = 0 , unsigned = 0 , - unsigned = 0 , unsigned = 0 , unsigned = 0 , unsigned = 0 ) - { s.N0 = n0 ; s.N1 = n1 ; } -}; - -// 3 == dynamic_rank <= rank <= 8 -template < unsigned Rank , unsigned ScalarSize , - unsigned s3 , - unsigned s4 , - unsigned s5 , - unsigned s6 , - unsigned s7 > -struct Shape< ScalarSize , Rank , 0,0,0,s3, s4,s5,s6,s7> -{ - enum { scalar_size = ScalarSize }; - enum { rank_dynamic = 3 }; - enum { rank = Rank }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - - enum { N3 = s3 }; - enum { N4 = s4 }; - enum { N5 = s5 }; - enum { N6 = s6 }; - enum { N7 = s7 }; - - KOKKOS_INLINE_FUNCTION - static - void assign( Shape & s , - unsigned n0 , unsigned n1 , unsigned n2 , unsigned = 0 , - unsigned = 0 , unsigned = 0 , unsigned = 0 , unsigned = 0 ) - { s.N0 = n0 ; s.N1 = n1 ; s.N2 = n2 ; } -}; - -// 4 == dynamic_rank <= rank <= 8 -template < unsigned ScalarSize , unsigned Rank , - unsigned s4 , - unsigned s5 , - unsigned s6 , - unsigned s7 > -struct Shape< ScalarSize , Rank, 0,0,0,0, s4,s5,s6,s7 > -{ - enum { scalar_size = ScalarSize }; - enum { rank_dynamic = 4 }; - enum { rank = Rank }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - unsigned N3 ; - - enum { N4 = s4 }; - enum { N5 = s5 }; - enum { N6 = s6 }; - enum { N7 = s7 }; - - KOKKOS_INLINE_FUNCTION - static - void assign( Shape & s , - unsigned n0 , unsigned n1 , unsigned n2 , unsigned n3 , - unsigned = 0 , unsigned = 0 , unsigned = 0 , unsigned = 0 ) - { s.N0 = n0 ; s.N1 = n1 ; s.N2 = n2 ; s.N3 = n3 ; } -}; - -// 5 == dynamic_rank <= rank <= 8 -template < unsigned ScalarSize , unsigned Rank , - unsigned s5 , - unsigned s6 , - unsigned s7 > -struct Shape< ScalarSize , Rank , 0,0,0,0, 0,s5,s6,s7 > -{ - enum { scalar_size = ScalarSize }; - enum { rank_dynamic = 5 }; - enum { rank = Rank }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - unsigned N3 ; - unsigned N4 ; - - enum { N5 = s5 }; - enum { N6 = s6 }; - enum { N7 = s7 }; - - KOKKOS_INLINE_FUNCTION - static - void assign( Shape & s , - unsigned n0 , unsigned n1 , unsigned n2 , unsigned n3 , - unsigned n4 , unsigned = 0 , unsigned = 0 , unsigned = 0 ) - { s.N0 = n0 ; s.N1 = n1 ; s.N2 = n2 ; s.N3 = n3 ; s.N4 = n4 ; } -}; - -// 6 == dynamic_rank <= rank <= 8 -template < unsigned ScalarSize , unsigned Rank , - unsigned s6 , - unsigned s7 > -struct Shape< ScalarSize , Rank , 0,0,0,0, 0,0,s6,s7 > -{ - enum { scalar_size = ScalarSize }; - enum { rank_dynamic = 6 }; - enum { rank = Rank }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - unsigned N3 ; - unsigned N4 ; - unsigned N5 ; - - enum { N6 = s6 }; - enum { N7 = s7 }; - - KOKKOS_INLINE_FUNCTION - static - void assign( Shape & s , - unsigned n0 , unsigned n1 , unsigned n2 , unsigned n3 , - unsigned n4 , unsigned n5 = 0 , unsigned = 0 , unsigned = 0 ) - { - s.N0 = n0 ; s.N1 = n1 ; s.N2 = n2 ; s.N3 = n3 ; - s.N4 = n4 ; s.N5 = n5 ; - } -}; - -// 7 == dynamic_rank <= rank <= 8 -template < unsigned ScalarSize , unsigned Rank , - unsigned s7 > -struct Shape< ScalarSize , Rank , 0,0,0,0, 0,0,0,s7 > -{ - enum { scalar_size = ScalarSize }; - enum { rank_dynamic = 7 }; - enum { rank = Rank }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - unsigned N3 ; - unsigned N4 ; - unsigned N5 ; - unsigned N6 ; - - enum { N7 = s7 }; - - KOKKOS_INLINE_FUNCTION - static - void assign( Shape & s , - unsigned n0 , unsigned n1 , unsigned n2 , unsigned n3 , - unsigned n4 , unsigned n5 , unsigned n6 , unsigned = 0 ) - { - s.N0 = n0 ; s.N1 = n1 ; s.N2 = n2 ; s.N3 = n3 ; - s.N4 = n4 ; s.N5 = n5 ; s.N6 = n6 ; - } -}; - -// 8 == dynamic_rank <= rank <= 8 -template < unsigned ScalarSize > -struct Shape< ScalarSize , 8 , 0,0,0,0, 0,0,0,0 > -{ - enum { scalar_size = ScalarSize }; - enum { rank_dynamic = 8 }; - enum { rank = 8 }; - - unsigned N0 ; - unsigned N1 ; - unsigned N2 ; - unsigned N3 ; - unsigned N4 ; - unsigned N5 ; - unsigned N6 ; - unsigned N7 ; - - KOKKOS_INLINE_FUNCTION - static - void assign( Shape & s , - unsigned n0 , unsigned n1 , unsigned n2 , unsigned n3 , - unsigned n4 , unsigned n5 , unsigned n6 , unsigned n7 ) - { - s.N0 = n0 ; s.N1 = n1 ; s.N2 = n2 ; s.N3 = n3 ; - s.N4 = n4 ; s.N5 = n5 ; s.N6 = n6 ; s.N7 = n7 ; - } -}; - -//---------------------------------------------------------------------------- - -template< class ShapeType , unsigned N , - unsigned R = ShapeType::rank_dynamic > -struct ShapeInsert ; - -template< class ShapeType , unsigned N > -struct ShapeInsert< ShapeType , N , 0 > -{ - typedef Shape< ShapeType::scalar_size , - ShapeType::rank + 1 , - N , - ShapeType::N0 , - ShapeType::N1 , - ShapeType::N2 , - ShapeType::N3 , - ShapeType::N4 , - ShapeType::N5 , - ShapeType::N6 > type ; -}; - -template< class ShapeType , unsigned N > -struct ShapeInsert< ShapeType , N , 1 > -{ - typedef Shape< ShapeType::scalar_size , - ShapeType::rank + 1 , - 0 , - N , - ShapeType::N1 , - ShapeType::N2 , - ShapeType::N3 , - ShapeType::N4 , - ShapeType::N5 , - ShapeType::N6 > type ; -}; - -template< class ShapeType , unsigned N > -struct ShapeInsert< ShapeType , N , 2 > -{ - typedef Shape< ShapeType::scalar_size , - ShapeType::rank + 1 , - 0 , - 0 , - N , - ShapeType::N2 , - ShapeType::N3 , - ShapeType::N4 , - ShapeType::N5 , - ShapeType::N6 > type ; -}; - -template< class ShapeType , unsigned N > -struct ShapeInsert< ShapeType , N , 3 > -{ - typedef Shape< ShapeType::scalar_size , - ShapeType::rank + 1 , - 0 , - 0 , - 0 , - N , - ShapeType::N3 , - ShapeType::N4 , - ShapeType::N5 , - ShapeType::N6 > type ; -}; - -template< class ShapeType , unsigned N > -struct ShapeInsert< ShapeType , N , 4 > -{ - typedef Shape< ShapeType::scalar_size , - ShapeType::rank + 1 , - 0 , - 0 , - 0 , - 0 , - N , - ShapeType::N4 , - ShapeType::N5 , - ShapeType::N6 > type ; -}; - -template< class ShapeType , unsigned N > -struct ShapeInsert< ShapeType , N , 5 > -{ - typedef Shape< ShapeType::scalar_size , - ShapeType::rank + 1 , - 0 , - 0 , - 0 , - 0 , - 0 , - N , - ShapeType::N5 , - ShapeType::N6 > type ; -}; - -template< class ShapeType , unsigned N > -struct ShapeInsert< ShapeType , N , 6 > -{ - typedef Shape< ShapeType::scalar_size , - ShapeType::rank + 1 , - 0 , - 0 , - 0 , - 0 , - 0 , - 0 , - N , - ShapeType::N6 > type ; -}; - -template< class ShapeType , unsigned N > -struct ShapeInsert< ShapeType , N , 7 > -{ - typedef Shape< ShapeType::scalar_size , - ShapeType::rank + 1 , - 0 , - 0 , - 0 , - 0 , - 0 , - 0 , - 0 , - N > type ; -}; - -//---------------------------------------------------------------------------- - -template< class DstShape , class SrcShape , - unsigned DstRankDynamic = DstShape::rank_dynamic , - bool DstRankDynamicOK = unsigned(DstShape::rank_dynamic) >= unsigned(SrcShape::rank_dynamic) > -struct ShapeCompatible { enum { value = false }; }; - -template< class DstShape , class SrcShape > -struct ShapeCompatible< DstShape , SrcShape , 8 , true > -{ - enum { value = unsigned(DstShape::scalar_size) == unsigned(SrcShape::scalar_size) }; -}; - -template< class DstShape , class SrcShape > -struct ShapeCompatible< DstShape , SrcShape , 7 , true > -{ - enum { value = unsigned(DstShape::scalar_size) == unsigned(SrcShape::scalar_size) && - unsigned(DstShape::N7) == unsigned(SrcShape::N7) }; -}; - -template< class DstShape , class SrcShape > -struct ShapeCompatible< DstShape , SrcShape , 6 , true > -{ - enum { value = unsigned(DstShape::scalar_size) == unsigned(SrcShape::scalar_size) && - unsigned(DstShape::N6) == unsigned(SrcShape::N6) && - unsigned(DstShape::N7) == unsigned(SrcShape::N7) }; -}; - -template< class DstShape , class SrcShape > -struct ShapeCompatible< DstShape , SrcShape , 5 , true > -{ - enum { value = unsigned(DstShape::scalar_size) == unsigned(SrcShape::scalar_size) && - unsigned(DstShape::N5) == unsigned(SrcShape::N5) && - unsigned(DstShape::N6) == unsigned(SrcShape::N6) && - unsigned(DstShape::N7) == unsigned(SrcShape::N7) }; -}; - -template< class DstShape , class SrcShape > -struct ShapeCompatible< DstShape , SrcShape , 4 , true > -{ - enum { value = unsigned(DstShape::scalar_size) == unsigned(SrcShape::scalar_size) && - unsigned(DstShape::N4) == unsigned(SrcShape::N4) && - unsigned(DstShape::N5) == unsigned(SrcShape::N5) && - unsigned(DstShape::N6) == unsigned(SrcShape::N6) && - unsigned(DstShape::N7) == unsigned(SrcShape::N7) }; -}; - -template< class DstShape , class SrcShape > -struct ShapeCompatible< DstShape , SrcShape , 3 , true > -{ - enum { value = unsigned(DstShape::scalar_size) == unsigned(SrcShape::scalar_size) && - unsigned(DstShape::N3) == unsigned(SrcShape::N3) && - unsigned(DstShape::N4) == unsigned(SrcShape::N4) && - unsigned(DstShape::N5) == unsigned(SrcShape::N5) && - unsigned(DstShape::N6) == unsigned(SrcShape::N6) && - unsigned(DstShape::N7) == unsigned(SrcShape::N7) }; -}; - -template< class DstShape , class SrcShape > -struct ShapeCompatible< DstShape , SrcShape , 2 , true > -{ - enum { value = unsigned(DstShape::scalar_size) == unsigned(SrcShape::scalar_size) && - unsigned(DstShape::N2) == unsigned(SrcShape::N2) && - unsigned(DstShape::N3) == unsigned(SrcShape::N3) && - unsigned(DstShape::N4) == unsigned(SrcShape::N4) && - unsigned(DstShape::N5) == unsigned(SrcShape::N5) && - unsigned(DstShape::N6) == unsigned(SrcShape::N6) && - unsigned(DstShape::N7) == unsigned(SrcShape::N7) }; -}; - -template< class DstShape , class SrcShape > -struct ShapeCompatible< DstShape , SrcShape , 1 , true > -{ - enum { value = unsigned(DstShape::scalar_size) == unsigned(SrcShape::scalar_size) && - unsigned(DstShape::N1) == unsigned(SrcShape::N1) && - unsigned(DstShape::N2) == unsigned(SrcShape::N2) && - unsigned(DstShape::N3) == unsigned(SrcShape::N3) && - unsigned(DstShape::N4) == unsigned(SrcShape::N4) && - unsigned(DstShape::N5) == unsigned(SrcShape::N5) && - unsigned(DstShape::N6) == unsigned(SrcShape::N6) && - unsigned(DstShape::N7) == unsigned(SrcShape::N7) }; -}; - -template< class DstShape , class SrcShape > -struct ShapeCompatible< DstShape , SrcShape , 0 , true > -{ - enum { value = unsigned(DstShape::scalar_size) == unsigned(SrcShape::scalar_size) && - unsigned(DstShape::N0) == unsigned(SrcShape::N0) && - unsigned(DstShape::N1) == unsigned(SrcShape::N1) && - unsigned(DstShape::N2) == unsigned(SrcShape::N2) && - unsigned(DstShape::N3) == unsigned(SrcShape::N3) && - unsigned(DstShape::N4) == unsigned(SrcShape::N4) && - unsigned(DstShape::N5) == unsigned(SrcShape::N5) && - unsigned(DstShape::N6) == unsigned(SrcShape::N6) && - unsigned(DstShape::N7) == unsigned(SrcShape::N7) }; -}; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< unsigned ScalarSize , unsigned Rank , - unsigned s0 , unsigned s1 , unsigned s2 , unsigned s3 , - unsigned s4 , unsigned s5 , unsigned s6 , unsigned s7 , - typename iType > -KOKKOS_INLINE_FUNCTION -size_t dimension( - const Shape & shape , - const iType & r ) -{ - return 0 == r ? shape.N0 : ( - 1 == r ? shape.N1 : ( - 2 == r ? shape.N2 : ( - 3 == r ? shape.N3 : ( - 4 == r ? shape.N4 : ( - 5 == r ? shape.N5 : ( - 6 == r ? shape.N6 : ( - 7 == r ? shape.N7 : 1 ))))))); -} - -template< unsigned ScalarSize , unsigned Rank , - unsigned s0 , unsigned s1 , unsigned s2 , unsigned s3 , - unsigned s4 , unsigned s5 , unsigned s6 , unsigned s7 > -KOKKOS_INLINE_FUNCTION -size_t cardinality_count( - const Shape & shape ) -{ - return size_t(shape.N0) * shape.N1 * shape.N2 * shape.N3 * - shape.N4 * shape.N5 * shape.N6 * shape.N7 ; -} - -//---------------------------------------------------------------------------- - -} /* namespace Impl */ -} /* namespace Kokkos */ - -#endif /* #ifndef KOKKOS_CORESHAPE_HPP */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_Singleton.hpp b/lib/kokkos/core/src/impl/Kokkos_Singleton.hpp deleted file mode 100644 index 86bc94ab0b..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Singleton.hpp +++ /dev/null @@ -1,55 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_SINGLETON_HPP -#define KOKKOS_SINGLETON_HPP - -#include -#include - -namespace Kokkos { namespace Impl { - - -}} // namespace Kokkos::Impl - -#endif // KOKKOS_SINGLETON_HPP diff --git a/lib/kokkos/core/src/impl/Kokkos_StaticAssert.hpp b/lib/kokkos/core/src/impl/Kokkos_StaticAssert.hpp deleted file mode 100644 index 25e2ec9dc1..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_StaticAssert.hpp +++ /dev/null @@ -1,79 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_STATICASSERT_HPP -#define KOKKOS_STATICASSERT_HPP - -namespace Kokkos { -namespace Impl { - -template < bool , class T = void > -struct StaticAssert ; - -template< class T > -struct StaticAssert< true , T > { - typedef T type ; - static const bool value = true ; -}; - -template < class A , class B > -struct StaticAssertSame ; - -template < class A > -struct StaticAssertSame { typedef A type ; }; - -template < class A , class B > -struct StaticAssertAssignable ; - -template < class A > -struct StaticAssertAssignable { typedef A type ; }; - -template < class A > -struct StaticAssertAssignable< const A , A > { typedef const A type ; }; - -} // namespace Impl -} // namespace Kokkos - -#endif /* KOKKOS_STATICASSERT_HPP */ - - diff --git a/lib/kokkos/core/src/impl/Kokkos_Tags.hpp b/lib/kokkos/core/src/impl/Kokkos_Tags.hpp deleted file mode 100644 index 4885d37376..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Tags.hpp +++ /dev/null @@ -1,156 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_TAGS_HPP -#define KOKKOS_TAGS_HPP - -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -//---------------------------------------------------------------------------- - -template -struct Device { - typedef ExecutionSpace execution_space; - typedef MemorySpace memory_space; - typedef Device device_type; -}; -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class C , class Enable = void > -struct is_memory_space : public bool_< false > {}; - -template< class C , class Enable = void > -struct is_execution_space : public bool_< false > {}; - -template< class C , class Enable = void > -struct is_execution_policy : public bool_< false > {}; - -template< class C , class Enable = void > -struct is_array_layout : public Impl::false_type {}; - -template< class C , class Enable = void > -struct is_memory_traits : public Impl::false_type {}; - - -template< class C > -struct is_memory_space< C , typename Impl::enable_if_type< typename C::memory_space >::type > - : public bool_< Impl::is_same< C , typename C::memory_space >::value > {}; - -template< class C > -struct is_execution_space< C , typename Impl::enable_if_type< typename C::execution_space >::type > - : public bool_< Impl::is_same< C , typename C::execution_space >::value > {}; - -template< class C > -struct is_execution_policy< C , typename Impl::enable_if_type< typename C::execution_policy >::type > - : public bool_< Impl::is_same< C , typename C::execution_policy >::value > {}; - -template< class C > -struct is_array_layout< C , typename Impl::enable_if_type< typename C::array_layout >::type > - : public bool_< Impl::is_same< C , typename C::array_layout >::value > {}; - -template< class C > -struct is_memory_traits< C , typename Impl::enable_if_type< typename C::memory_traits >::type > - : public bool_< Impl::is_same< C , typename C::memory_traits >::value > {}; - - -//---------------------------------------------------------------------------- - -template< class C , class Enable = void > -struct is_space : public Impl::false_type {}; - -template< class C > -struct is_space< C - , typename Impl::enable_if<( - Impl::is_same< C , typename C::execution_space >::value || - Impl::is_same< C , typename C::memory_space >::value || - Impl::is_same< C , Device< - typename C::execution_space, - typename C::memory_space> >::value - )>::type - > - : public Impl::true_type -{ - typedef typename C::execution_space execution_space ; - typedef typename C::memory_space memory_space ; - - // The host_memory_space defines a space with host-resident memory. - // If the execution space's memory space is host accessible then use that execution space. - // else use the HostSpace. - typedef - typename Impl::if_c< Impl::is_same< memory_space , HostSpace >::value -#ifdef KOKKOS_HAVE_CUDA - || Impl::is_same< memory_space , CudaUVMSpace>::value - || Impl::is_same< memory_space , CudaHostPinnedSpace>::value -#endif - , memory_space , HostSpace >::type - host_memory_space ; - - // The host_execution_space defines a space which has access to HostSpace. - // If the execution space can access HostSpace then use that execution space. - // else use the DefaultHostExecutionSpace. -#ifdef KOKKOS_HAVE_CUDA - typedef - typename Impl::if_c< Impl::is_same< execution_space , Cuda >::value - , DefaultHostExecutionSpace , execution_space >::type - host_execution_space ; -#else - typedef execution_space host_execution_space; -#endif - - typedef Device host_mirror_space; -}; -} -} - -#endif diff --git a/lib/kokkos/core/src/impl/Kokkos_Timer.hpp b/lib/kokkos/core/src/impl/Kokkos_Timer.hpp deleted file mode 100644 index 80a326f080..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Timer.hpp +++ /dev/null @@ -1,115 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_IMPLWALLTIME_HPP -#define KOKKOS_IMPLWALLTIME_HPP - -#include - -#ifdef _MSC_VER -#undef KOKKOS_USE_LIBRT -#include -#else -#ifdef KOKKOS_USE_LIBRT -#include -#else -#include -#endif -#endif - -namespace Kokkos { -namespace Impl { - -/** \brief Time since construction */ - -class Timer { -private: - #ifdef KOKKOS_USE_LIBRT - struct timespec m_old; - #else - struct timeval m_old ; - #endif - Timer( const Timer & ); - Timer & operator = ( const Timer & ); -public: - - inline - void reset() { - #ifdef KOKKOS_USE_LIBRT - clock_gettime(CLOCK_REALTIME, &m_old); - #else - gettimeofday( & m_old , ((struct timezone *) NULL ) ); - #endif - } - - inline - ~Timer() {} - - inline - Timer() { reset(); } - - inline - double seconds() const - { - #ifdef KOKKOS_USE_LIBRT - struct timespec m_new; - clock_gettime(CLOCK_REALTIME, &m_new); - - return ( (double) ( m_new.tv_sec - m_old.tv_sec ) ) + - ( (double) ( m_new.tv_nsec - m_old.tv_nsec ) * 1.0e-9 ); - #else - struct timeval m_new ; - - ::gettimeofday( & m_new , ((struct timezone *) NULL ) ); - - return ( (double) ( m_new.tv_sec - m_old.tv_sec ) ) + - ( (double) ( m_new.tv_usec - m_old.tv_usec ) * 1.0e-6 ); - #endif - } -}; - -} // namespace Impl -} // namespace Kokkos - -#endif /* #ifndef KOKKOS_IMPLWALLTIME_HPP */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_Traits.hpp b/lib/kokkos/core/src/impl/Kokkos_Traits.hpp deleted file mode 100644 index 52358842f5..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Traits.hpp +++ /dev/null @@ -1,370 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOSTRAITS_HPP -#define KOKKOSTRAITS_HPP - -#include -#include -#include - -namespace Kokkos { -namespace Impl { - -/* C++11 conformal compile-time type traits utilities. - * Prefer to use C++11 when portably available. - */ -//---------------------------------------------------------------------------- -// C++11 Helpers: - -template < class T , T v > -struct integral_constant -{ - // Declaration of 'static const' causes an unresolved linker symbol in debug - // static const T value = v ; - enum { value = T(v) }; - typedef T value_type; - typedef integral_constant type; - KOKKOS_INLINE_FUNCTION operator T() { return v ; } -}; - -typedef integral_constant false_type ; -typedef integral_constant true_type ; - -//---------------------------------------------------------------------------- -// C++11 Type relationships: - -template< class X , class Y > struct is_same : public false_type {}; -template< class X > struct is_same : public true_type {}; - -//---------------------------------------------------------------------------- -// C++11 Type properties: - -template struct is_const : public false_type {}; -template struct is_const : public true_type {}; -template struct is_const : public true_type {}; - -template struct is_array : public false_type {}; -template struct is_array< T[] > : public true_type {}; -template struct is_array< T[N] > : public true_type {}; - -//---------------------------------------------------------------------------- -// C++11 Type transformations: - -template struct remove_const { typedef T type; }; -template struct remove_const { typedef T type; }; -template struct remove_const { typedef T & type; }; - -template struct add_const { typedef const T type; }; -template struct add_const { typedef const T & type; }; -template struct add_const { typedef const T type; }; -template struct add_const { typedef const T & type; }; - -template struct remove_reference { typedef T type ; }; -template struct remove_reference< T & > { typedef T type ; }; -template struct remove_reference< const T & > { typedef const T type ; }; - -template struct remove_extent { typedef T type ; }; -template struct remove_extent { typedef T type ; }; -template struct remove_extent { typedef T type ; }; - -//---------------------------------------------------------------------------- -// C++11 Other type generators: - -template< bool , class T , class F > -struct condition { typedef F type ; }; - -template< class T , class F > -struct condition { typedef T type ; }; - -template< bool , class = void > -struct enable_if ; - -template< class T > -struct enable_if< true , T > { typedef T type ; }; - -//---------------------------------------------------------------------------- - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- -// Other traits - -namespace Kokkos { -namespace Impl { - -//---------------------------------------------------------------------------- - -template< class , class T = void > -struct enable_if_type { typedef T type ; }; - -//---------------------------------------------------------------------------- - -template< bool B > -struct bool_ : public integral_constant {}; - -template< unsigned I > -struct unsigned_ : public integral_constant {}; - -template< int I > -struct int_ : public integral_constant {}; - -typedef bool_ true_; -typedef bool_ false_; -//---------------------------------------------------------------------------- -// if_ - -template < bool Cond , typename TrueType , typename FalseType> -struct if_c -{ - enum { value = Cond }; - - typedef FalseType type; - - - typedef typename remove_const< - typename remove_reference::type >::type value_type ; - - typedef typename add_const::type const_value_type ; - - static KOKKOS_INLINE_FUNCTION - const_value_type & select( const_value_type & v ) { return v ; } - - static KOKKOS_INLINE_FUNCTION - value_type & select( value_type & v ) { return v ; } - - template< class T > - static KOKKOS_INLINE_FUNCTION - value_type & select( const T & ) { value_type * ptr(0); return *ptr ; } - - - template< class T > - static KOKKOS_INLINE_FUNCTION - const_value_type & select( const T & , const_value_type & v ) { return v ; } - - template< class T > - static KOKKOS_INLINE_FUNCTION - value_type & select( const T & , value_type & v ) { return v ; } -}; - -template -struct if_c< true , TrueType , FalseType > -{ - enum { value = true }; - - typedef TrueType type; - - - typedef typename remove_const< - typename remove_reference::type >::type value_type ; - - typedef typename add_const::type const_value_type ; - - static KOKKOS_INLINE_FUNCTION - const_value_type & select( const_value_type & v ) { return v ; } - - static KOKKOS_INLINE_FUNCTION - value_type & select( value_type & v ) { return v ; } - - template< class T > - static KOKKOS_INLINE_FUNCTION - value_type & select( const T & ) { value_type * ptr(0); return *ptr ; } - - - template< class F > - static KOKKOS_INLINE_FUNCTION - const_value_type & select( const_value_type & v , const F & ) { return v ; } - - template< class F > - static KOKKOS_INLINE_FUNCTION - value_type & select( value_type & v , const F & ) { return v ; } -}; - -template< typename TrueType > -struct if_c< false , TrueType , void > -{ - enum { value = false }; - - typedef void type ; - typedef void value_type ; -}; - -template< typename FalseType > -struct if_c< true , void , FalseType > -{ - enum { value = true }; - - typedef void type ; - typedef void value_type ; -}; - -template -struct if_ : public if_c {}; - -//---------------------------------------------------------------------------- - -// Allows aliased types: -template< typename T > -struct is_integral : public integral_constant< bool , - ( - Impl::is_same< T , char >::value || - Impl::is_same< T , unsigned char >::value || - Impl::is_same< T , short int >::value || - Impl::is_same< T , unsigned short int >::value || - Impl::is_same< T , int >::value || - Impl::is_same< T , unsigned int >::value || - Impl::is_same< T , long int >::value || - Impl::is_same< T , unsigned long int >::value || - Impl::is_same< T , long long int >::value || - Impl::is_same< T , unsigned long long int >::value || - - Impl::is_same< T , int8_t >::value || - Impl::is_same< T , int16_t >::value || - Impl::is_same< T , int32_t >::value || - Impl::is_same< T , int64_t >::value || - Impl::is_same< T , uint8_t >::value || - Impl::is_same< T , uint16_t >::value || - Impl::is_same< T , uint32_t >::value || - Impl::is_same< T , uint64_t >::value - )> -{}; - -//---------------------------------------------------------------------------- - - -template < size_t N > -struct is_power_of_two -{ - enum type { value = (N > 0) && !(N & (N-1)) }; -}; - -template < size_t N , bool OK = is_power_of_two::value > -struct power_of_two ; - -template < size_t N > -struct power_of_two -{ - enum type { value = 1+ power_of_two<(N>>1),true>::value }; -}; - -template <> -struct power_of_two<2,true> -{ - enum type { value = 1 }; -}; - -template <> -struct power_of_two<1,true> -{ - enum type { value = 0 }; -}; - -/** \brief If power of two then return power, - * otherwise return ~0u. - */ -static KOKKOS_FORCEINLINE_FUNCTION -unsigned power_of_two_if_valid( const unsigned N ) -{ - unsigned p = ~0u ; - if ( N && ! ( N & ( N - 1 ) ) ) { -#if defined( __CUDA_ARCH__ ) && defined( KOKKOS_HAVE_CUDA ) - p = __ffs(N) - 1 ; -#elif defined( __GNUC__ ) || defined( __GNUG__ ) - p = __builtin_ffs(N) - 1 ; -#elif defined( __INTEL_COMPILER ) - p = _bit_scan_forward(N); -#else - p = 0 ; - for ( unsigned j = 1 ; ! ( N & j ) ; j <<= 1 ) { ++p ; } -#endif - } - return p ; -} - -//---------------------------------------------------------------------------- - -template< typename T , T v , bool NonZero = ( v != T(0) ) > -struct integral_nonzero_constant -{ - // Declaration of 'static const' causes an unresolved linker symbol in debug - // static const T value = v ; - enum { value = T(v) }; - typedef T value_type ; - typedef integral_nonzero_constant type ; - KOKKOS_INLINE_FUNCTION integral_nonzero_constant( const T & ) {} -}; - -template< typename T , T zero > -struct integral_nonzero_constant -{ - const T value ; - typedef T value_type ; - typedef integral_nonzero_constant type ; - KOKKOS_INLINE_FUNCTION integral_nonzero_constant( const T & v ) : value(v) {} -}; - -//---------------------------------------------------------------------------- - -template < class C > struct is_integral_constant : public false_ -{ - typedef void integral_type ; - enum { integral_value = 0 }; -}; - -template < typename T , T v > -struct is_integral_constant< integral_constant > : public true_ -{ - typedef T integral_type ; - enum { integral_value = v }; -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOSTRAITS_HPP */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_ViewDefault.hpp b/lib/kokkos/core/src/impl/Kokkos_ViewDefault.hpp deleted file mode 100644 index 8334af3a3c..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_ViewDefault.hpp +++ /dev/null @@ -1,878 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_VIEWDEFAULT_HPP -#define KOKKOS_VIEWDEFAULT_HPP - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template<> -struct ViewAssignment< ViewDefault , ViewDefault , void > -{ - typedef ViewDefault Specialize ; - - //------------------------------------ - /** \brief Compatible value and shape and LayoutLeft/Right to LayoutStride*/ - - template< class DT , class DL , class DD , class DM , - class ST , class SL , class SD , class SM > - KOKKOS_INLINE_FUNCTION - ViewAssignment( View & dst , - const View & src , - const typename enable_if<( - ViewAssignable< ViewTraits , - ViewTraits >::value - || - ( ViewAssignable< ViewTraits , - ViewTraits >::assignable_value - && - ShapeCompatible< typename ViewTraits::shape_type , - typename ViewTraits::shape_type >::value - && - is_same< typename ViewTraits::array_layout,LayoutStride>::value - && (is_same< typename ViewTraits::array_layout,LayoutLeft>::value || - is_same< typename ViewTraits::array_layout,LayoutRight>::value)) - )>::type * = 0 ) - { - dst.m_offset_map.assign( src.m_offset_map ); - - dst.m_management = src.m_management ; - - dst.m_ptr_on_device = ViewDataManagement< ViewTraits >::create_handle( src.m_ptr_on_device, src.m_tracker ); - - dst.m_tracker = src.m_tracker ; - - } - - - /** \brief Assign 1D Strided View to LayoutLeft or LayoutRight if stride[0]==1 */ - - template< class DT , class DL , class DD , class DM , - class ST , class SD , class SM > - KOKKOS_INLINE_FUNCTION - ViewAssignment( View & dst , - const View & src , - const typename enable_if<( - ( - ViewAssignable< ViewTraits , - ViewTraits >::value - || - ( ViewAssignable< ViewTraits , - ViewTraits >::assignable_value - && - ShapeCompatible< typename ViewTraits::shape_type , - typename ViewTraits::shape_type >::value - ) - ) - && - (View::rank==1) - && (is_same< typename ViewTraits::array_layout,LayoutLeft>::value || - is_same< typename ViewTraits::array_layout,LayoutRight>::value) - )>::type * = 0 ) - { - size_t strides[8]; - src.stride(strides); - if(strides[0]!=1) { - abort("Trying to assign strided 1D View to LayoutRight or LayoutLeft which is not stride-1"); - } - dst.m_offset_map.assign( src.dimension_0(), 0, 0, 0, 0, 0, 0, 0, 0 ); - - dst.m_management = src.m_management ; - - dst.m_ptr_on_device = ViewDataManagement< ViewTraits >::create_handle( src.m_ptr_on_device, src.m_tracker ); - - dst.m_tracker = src.m_tracker ; - - } - - //------------------------------------ - /** \brief Deep copy data from compatible value type, layout, rank, and specialization. - * Check the dimensions and allocation lengths at runtime. - */ - template< class DT , class DL , class DD , class DM , - class ST , class SL , class SD , class SM > - inline static - void deep_copy( const View & dst , - const View & src , - const typename Impl::enable_if<( - Impl::is_same< typename ViewTraits::value_type , - typename ViewTraits::non_const_value_type >::value - && - Impl::is_same< typename ViewTraits::array_layout , - typename ViewTraits::array_layout >::value - && - ( unsigned(ViewTraits::rank) == unsigned(ViewTraits::rank) ) - )>::type * = 0 ) - { - typedef typename ViewTraits::memory_space dst_memory_space ; - typedef typename ViewTraits::memory_space src_memory_space ; - - if ( dst.ptr_on_device() != src.ptr_on_device() ) { - - Impl::assert_shapes_are_equal( dst.m_offset_map , src.m_offset_map ); - - const size_t nbytes = dst.m_offset_map.scalar_size * dst.m_offset_map.capacity(); - - DeepCopy< dst_memory_space , src_memory_space >( dst.ptr_on_device() , src.ptr_on_device() , nbytes ); - } - } -}; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class ExecSpace , class DT , class DL, class DD, class DM, class DS > -struct ViewDefaultConstruct< ExecSpace , Kokkos::View , true > -{ - Kokkos::View * const m_ptr ; - - KOKKOS_FORCEINLINE_FUNCTION - void operator()( const typename ExecSpace::size_type& i ) const - { new(m_ptr+i) Kokkos::View(); } - - ViewDefaultConstruct( Kokkos::View * pointer , size_t capacity ) - : m_ptr( pointer ) - { - Kokkos::RangePolicy< ExecSpace > range( 0 , capacity ); - parallel_for( range , *this ); - ExecSpace::fence(); - } -}; - -template< class SrcDataType , class SrcArg1Type , class SrcArg2Type , class SrcArg3Type - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - , class SubArg4_type , class SubArg5_type , class SubArg6_type , class SubArg7_type - > -struct ViewSubview< View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > - , SubArg0_type , SubArg1_type , SubArg2_type , SubArg3_type - , SubArg4_type , SubArg5_type , SubArg6_type , SubArg7_type > -{ -private: - - typedef View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > SrcViewType ; - - enum { V0 = Impl::is_same< SubArg0_type , void >::value ? 1 : 0 }; - enum { V1 = Impl::is_same< SubArg1_type , void >::value ? 1 : 0 }; - enum { V2 = Impl::is_same< SubArg2_type , void >::value ? 1 : 0 }; - enum { V3 = Impl::is_same< SubArg3_type , void >::value ? 1 : 0 }; - enum { V4 = Impl::is_same< SubArg4_type , void >::value ? 1 : 0 }; - enum { V5 = Impl::is_same< SubArg5_type , void >::value ? 1 : 0 }; - enum { V6 = Impl::is_same< SubArg6_type , void >::value ? 1 : 0 }; - enum { V7 = Impl::is_same< SubArg7_type , void >::value ? 1 : 0 }; - - // The source view rank must be equal to the input argument rank - // Once a void argument is encountered all subsequent arguments must be void. - enum { InputRank = - Impl::StaticAssert<( SrcViewType::rank == - ( V0 ? 0 : ( - V1 ? 1 : ( - V2 ? 2 : ( - V3 ? 3 : ( - V4 ? 4 : ( - V5 ? 5 : ( - V6 ? 6 : ( - V7 ? 7 : 8 ))))))) )) - && - ( SrcViewType::rank == - ( 8 - ( V0 + V1 + V2 + V3 + V4 + V5 + V6 + V7 ) ) ) - >::value ? SrcViewType::rank : 0 }; - - enum { R0 = Impl::ViewOffsetRange< SubArg0_type >::is_range ? 1 : 0 }; - enum { R1 = Impl::ViewOffsetRange< SubArg1_type >::is_range ? 1 : 0 }; - enum { R2 = Impl::ViewOffsetRange< SubArg2_type >::is_range ? 1 : 0 }; - enum { R3 = Impl::ViewOffsetRange< SubArg3_type >::is_range ? 1 : 0 }; - enum { R4 = Impl::ViewOffsetRange< SubArg4_type >::is_range ? 1 : 0 }; - enum { R5 = Impl::ViewOffsetRange< SubArg5_type >::is_range ? 1 : 0 }; - enum { R6 = Impl::ViewOffsetRange< SubArg6_type >::is_range ? 1 : 0 }; - enum { R7 = Impl::ViewOffsetRange< SubArg7_type >::is_range ? 1 : 0 }; - - enum { OutputRank = unsigned(R0) + unsigned(R1) + unsigned(R2) + unsigned(R3) - + unsigned(R4) + unsigned(R5) + unsigned(R6) + unsigned(R7) }; - - // Reverse - enum { R0_rev = 0 == InputRank ? 0u : ( - 1 == InputRank ? unsigned(R0) : ( - 2 == InputRank ? unsigned(R1) : ( - 3 == InputRank ? unsigned(R2) : ( - 4 == InputRank ? unsigned(R3) : ( - 5 == InputRank ? unsigned(R4) : ( - 6 == InputRank ? unsigned(R5) : ( - 7 == InputRank ? unsigned(R6) : unsigned(R7) ))))))) }; - - typedef typename SrcViewType::array_layout SrcViewLayout ; - - // Choose array layout, attempting to preserve original layout if at all possible. - typedef typename Impl::if_c< - ( // Same Layout IF - // OutputRank 0 - ( OutputRank == 0 ) - || - // OutputRank 1 or 2, InputLayout Left, Interval 0 - // because single stride one or second index has a stride. - ( OutputRank <= 2 && R0 && Impl::is_same::value ) - || - // OutputRank 1 or 2, InputLayout Right, Interval [InputRank-1] - // because single stride one or second index has a stride. - ( OutputRank <= 2 && R0_rev && Impl::is_same::value ) - ), SrcViewLayout , Kokkos::LayoutStride >::type OutputViewLayout ; - - // Choose data type as a purely dynamic rank array to accomodate a runtime range. - typedef typename Impl::if_c< OutputRank == 0 , typename SrcViewType::value_type , - typename Impl::if_c< OutputRank == 1 , typename SrcViewType::value_type *, - typename Impl::if_c< OutputRank == 2 , typename SrcViewType::value_type **, - typename Impl::if_c< OutputRank == 3 , typename SrcViewType::value_type ***, - typename Impl::if_c< OutputRank == 4 , typename SrcViewType::value_type ****, - typename Impl::if_c< OutputRank == 5 , typename SrcViewType::value_type *****, - typename Impl::if_c< OutputRank == 6 , typename SrcViewType::value_type ******, - typename Impl::if_c< OutputRank == 7 , typename SrcViewType::value_type *******, - typename SrcViewType::value_type ******** - >::type >::type >::type >::type >::type >::type >::type >::type OutputData ; - - // Choose space. - // If the source view's template arg1 or arg2 is a space then use it, - // otherwise use the source view's execution space. - - typedef typename Impl::if_c< Impl::is_space< SrcArg1Type >::value , SrcArg1Type , - typename Impl::if_c< Impl::is_space< SrcArg2Type >::value , SrcArg2Type , typename SrcViewType::device_type - >::type >::type OutputSpace ; - -public: - - // If keeping the layout then match non-data type arguments - // else keep execution space and memory traits. - typedef typename - Impl::if_c< Impl::is_same< SrcViewLayout , OutputViewLayout >::value - , Kokkos::View< OutputData , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > - , Kokkos::View< OutputData , OutputViewLayout , OutputSpace - , typename SrcViewType::memory_traits - , Impl::ViewDefault > - >::type type ; -}; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -// Construct subview of a Rank 8 view -template< class DstDataType , class DstArg1Type , class DstArg2Type , class DstArg3Type > -template< class SrcDataType , class SrcArg1Type , class SrcArg2Type , class SrcArg3Type - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - , class SubArg4_type , class SubArg5_type , class SubArg6_type , class SubArg7_type - > -KOKKOS_INLINE_FUNCTION -View< DstDataType , DstArg1Type , DstArg2Type , DstArg3Type , Impl::ViewDefault >:: -View( const View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > & src - , const SubArg0_type & arg0 - , const SubArg1_type & arg1 - , const SubArg2_type & arg2 - , const SubArg3_type & arg3 - , const SubArg4_type & arg4 - , const SubArg5_type & arg5 - , const SubArg6_type & arg6 - , const SubArg7_type & arg7 - ) - : m_ptr_on_device( (typename traits::value_type*) NULL) - , m_offset_map() - , m_management() - , m_tracker() -{ - // This constructor can only be used to construct a subview - // from the source view. This type must match the subview type - // deduced from the source view and subview arguments. - - typedef Impl::ViewSubview< View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > - , SubArg0_type , SubArg1_type , SubArg2_type , SubArg3_type - , SubArg4_type , SubArg5_type , SubArg6_type , SubArg7_type > - ViewSubviewDeduction ; - - enum { is_a_valid_subview_constructor = - Impl::StaticAssert< - Impl::is_same< View , typename ViewSubviewDeduction::type >::value - >::value - }; - - if ( is_a_valid_subview_constructor ) { - - typedef Impl::ViewOffsetRange< SubArg0_type > R0 ; - typedef Impl::ViewOffsetRange< SubArg1_type > R1 ; - typedef Impl::ViewOffsetRange< SubArg2_type > R2 ; - typedef Impl::ViewOffsetRange< SubArg3_type > R3 ; - typedef Impl::ViewOffsetRange< SubArg4_type > R4 ; - typedef Impl::ViewOffsetRange< SubArg5_type > R5 ; - typedef Impl::ViewOffsetRange< SubArg6_type > R6 ; - typedef Impl::ViewOffsetRange< SubArg7_type > R7 ; - - // 'assign_subview' returns whether the subview offset_map - // introduces noncontiguity in the view. - const bool introduce_noncontiguity = - m_offset_map.assign_subview( src.m_offset_map - , R0::dimension( src.m_offset_map.N0 , arg0 ) - , R1::dimension( src.m_offset_map.N1 , arg1 ) - , R2::dimension( src.m_offset_map.N2 , arg2 ) - , R3::dimension( src.m_offset_map.N3 , arg3 ) - , R4::dimension( src.m_offset_map.N4 , arg4 ) - , R5::dimension( src.m_offset_map.N5 , arg5 ) - , R6::dimension( src.m_offset_map.N6 , arg6 ) - , R7::dimension( src.m_offset_map.N7 , arg7 ) - ); - - if ( m_offset_map.capacity() ) { - - m_management = src.m_management ; - - if ( introduce_noncontiguity ) m_management.set_noncontiguous(); - - m_ptr_on_device = src.m_ptr_on_device + - src.m_offset_map( R0::begin( arg0 ) - , R1::begin( arg1 ) - , R2::begin( arg2 ) - , R3::begin( arg3 ) - , R4::begin( arg4 ) - , R5::begin( arg5 ) - , R6::begin( arg6 ) - , R7::begin( arg7 ) ); - m_tracker = src.m_tracker ; - } - } -} - -// Construct subview of a Rank 7 view -template< class DstDataType , class DstArg1Type , class DstArg2Type , class DstArg3Type > -template< class SrcDataType , class SrcArg1Type , class SrcArg2Type , class SrcArg3Type - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - , class SubArg4_type , class SubArg5_type , class SubArg6_type - > -KOKKOS_INLINE_FUNCTION -View< DstDataType , DstArg1Type , DstArg2Type , DstArg3Type , Impl::ViewDefault >:: -View( const View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > & src - , const SubArg0_type & arg0 - , const SubArg1_type & arg1 - , const SubArg2_type & arg2 - , const SubArg3_type & arg3 - , const SubArg4_type & arg4 - , const SubArg5_type & arg5 - , const SubArg6_type & arg6 - ) - : m_ptr_on_device( (typename traits::value_type*) NULL) - , m_offset_map() - , m_management() - , m_tracker() -{ - // This constructor can only be used to construct a subview - // from the source view. This type must match the subview type - // deduced from the source view and subview arguments. - - typedef Impl::ViewSubview< View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > - , SubArg0_type , SubArg1_type , SubArg2_type , SubArg3_type - , SubArg4_type , SubArg5_type , SubArg6_type , void > - ViewSubviewDeduction ; - - enum { is_a_valid_subview_constructor = - Impl::StaticAssert< - Impl::is_same< View , typename ViewSubviewDeduction::type >::value - >::value - }; - - if ( is_a_valid_subview_constructor ) { - - typedef Impl::ViewOffsetRange< SubArg0_type > R0 ; - typedef Impl::ViewOffsetRange< SubArg1_type > R1 ; - typedef Impl::ViewOffsetRange< SubArg2_type > R2 ; - typedef Impl::ViewOffsetRange< SubArg3_type > R3 ; - typedef Impl::ViewOffsetRange< SubArg4_type > R4 ; - typedef Impl::ViewOffsetRange< SubArg5_type > R5 ; - typedef Impl::ViewOffsetRange< SubArg6_type > R6 ; - - // 'assign_subview' returns whether the subview offset_map - // introduces noncontiguity in the view. - const bool introduce_noncontiguity = - m_offset_map.assign_subview( src.m_offset_map - , R0::dimension( src.m_offset_map.N0 , arg0 ) - , R1::dimension( src.m_offset_map.N1 , arg1 ) - , R2::dimension( src.m_offset_map.N2 , arg2 ) - , R3::dimension( src.m_offset_map.N3 , arg3 ) - , R4::dimension( src.m_offset_map.N4 , arg4 ) - , R5::dimension( src.m_offset_map.N5 , arg5 ) - , R6::dimension( src.m_offset_map.N6 , arg6 ) - , 0 - ); - - if ( m_offset_map.capacity() ) { - - m_management = src.m_management ; - - if ( introduce_noncontiguity ) m_management.set_noncontiguous(); - - m_ptr_on_device = src.m_ptr_on_device + - src.m_offset_map( R0::begin( arg0 ) - , R1::begin( arg1 ) - , R2::begin( arg2 ) - , R3::begin( arg3 ) - , R4::begin( arg4 ) - , R5::begin( arg5 ) - , R6::begin( arg6 ) - ); - m_tracker = src.m_tracker ; - } - } -} - -// Construct subview of a Rank 6 view -template< class DstDataType , class DstArg1Type , class DstArg2Type , class DstArg3Type > -template< class SrcDataType , class SrcArg1Type , class SrcArg2Type , class SrcArg3Type - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - , class SubArg4_type , class SubArg5_type - > -KOKKOS_INLINE_FUNCTION -View< DstDataType , DstArg1Type , DstArg2Type , DstArg3Type , Impl::ViewDefault >:: -View( const View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > & src - , const SubArg0_type & arg0 - , const SubArg1_type & arg1 - , const SubArg2_type & arg2 - , const SubArg3_type & arg3 - , const SubArg4_type & arg4 - , const SubArg5_type & arg5 - ) - : m_ptr_on_device( (typename traits::value_type*) NULL) - , m_offset_map() - , m_management() - , m_tracker() -{ - // This constructor can only be used to construct a subview - // from the source view. This type must match the subview type - // deduced from the source view and subview arguments. - - typedef Impl::ViewSubview< View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > - , SubArg0_type , SubArg1_type , SubArg2_type , SubArg3_type - , SubArg4_type , SubArg5_type , void , void > - ViewSubviewDeduction ; - - enum { is_a_valid_subview_constructor = - Impl::StaticAssert< - Impl::is_same< View , typename ViewSubviewDeduction::type >::value - >::value - }; - - if ( is_a_valid_subview_constructor ) { - - typedef Impl::ViewOffsetRange< SubArg0_type > R0 ; - typedef Impl::ViewOffsetRange< SubArg1_type > R1 ; - typedef Impl::ViewOffsetRange< SubArg2_type > R2 ; - typedef Impl::ViewOffsetRange< SubArg3_type > R3 ; - typedef Impl::ViewOffsetRange< SubArg4_type > R4 ; - typedef Impl::ViewOffsetRange< SubArg5_type > R5 ; - - // 'assign_subview' returns whether the subview offset_map - // introduces noncontiguity in the view. - const bool introduce_noncontiguity = - m_offset_map.assign_subview( src.m_offset_map - , R0::dimension( src.m_offset_map.N0 , arg0 ) - , R1::dimension( src.m_offset_map.N1 , arg1 ) - , R2::dimension( src.m_offset_map.N2 , arg2 ) - , R3::dimension( src.m_offset_map.N3 , arg3 ) - , R4::dimension( src.m_offset_map.N4 , arg4 ) - , R5::dimension( src.m_offset_map.N5 , arg5 ) - , 0 - , 0 - ); - - if ( m_offset_map.capacity() ) { - - m_management = src.m_management ; - - if ( introduce_noncontiguity ) m_management.set_noncontiguous(); - - m_ptr_on_device = src.m_ptr_on_device + - src.m_offset_map( R0::begin( arg0 ) - , R1::begin( arg1 ) - , R2::begin( arg2 ) - , R3::begin( arg3 ) - , R4::begin( arg4 ) - , R5::begin( arg5 ) - ); - m_tracker = src.m_tracker ; - } - } -} - -// Construct subview of a Rank 5 view -template< class DstDataType , class DstArg1Type , class DstArg2Type , class DstArg3Type > -template< class SrcDataType , class SrcArg1Type , class SrcArg2Type , class SrcArg3Type - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - , class SubArg4_type - > -KOKKOS_INLINE_FUNCTION -View< DstDataType , DstArg1Type , DstArg2Type , DstArg3Type , Impl::ViewDefault >:: -View( const View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > & src - , const SubArg0_type & arg0 - , const SubArg1_type & arg1 - , const SubArg2_type & arg2 - , const SubArg3_type & arg3 - , const SubArg4_type & arg4 - ) - : m_ptr_on_device( (typename traits::value_type*) NULL) - , m_offset_map() - , m_management() - , m_tracker() -{ - // This constructor can only be used to construct a subview - // from the source view. This type must match the subview type - // deduced from the source view and subview arguments. - - typedef Impl::ViewSubview< View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > - , SubArg0_type , SubArg1_type , SubArg2_type , SubArg3_type - , SubArg4_type , void , void , void > - ViewSubviewDeduction ; - - enum { is_a_valid_subview_constructor = - Impl::StaticAssert< - Impl::is_same< View , typename ViewSubviewDeduction::type >::value - >::value - }; - - if ( is_a_valid_subview_constructor ) { - - typedef Impl::ViewOffsetRange< SubArg0_type > R0 ; - typedef Impl::ViewOffsetRange< SubArg1_type > R1 ; - typedef Impl::ViewOffsetRange< SubArg2_type > R2 ; - typedef Impl::ViewOffsetRange< SubArg3_type > R3 ; - typedef Impl::ViewOffsetRange< SubArg4_type > R4 ; - - // 'assign_subview' returns whether the subview offset_map - // introduces noncontiguity in the view. - const bool introduce_noncontiguity = - m_offset_map.assign_subview( src.m_offset_map - , R0::dimension( src.m_offset_map.N0 , arg0 ) - , R1::dimension( src.m_offset_map.N1 , arg1 ) - , R2::dimension( src.m_offset_map.N2 , arg2 ) - , R3::dimension( src.m_offset_map.N3 , arg3 ) - , R4::dimension( src.m_offset_map.N4 , arg4 ) - , 0 - , 0 - , 0 - ); - - if ( m_offset_map.capacity() ) { - - m_management = src.m_management ; - - if ( introduce_noncontiguity ) m_management.set_noncontiguous(); - - m_ptr_on_device = src.m_ptr_on_device + - src.m_offset_map( R0::begin( arg0 ) - , R1::begin( arg1 ) - , R2::begin( arg2 ) - , R3::begin( arg3 ) - , R4::begin( arg4 ) - ); - m_tracker = src.m_tracker ; - } - } -} - -// Construct subview of a Rank 4 view -template< class DstDataType , class DstArg1Type , class DstArg2Type , class DstArg3Type > -template< class SrcDataType , class SrcArg1Type , class SrcArg2Type , class SrcArg3Type - , class SubArg0_type , class SubArg1_type , class SubArg2_type , class SubArg3_type - > -KOKKOS_INLINE_FUNCTION -View< DstDataType , DstArg1Type , DstArg2Type , DstArg3Type , Impl::ViewDefault >:: -View( const View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > & src - , const SubArg0_type & arg0 - , const SubArg1_type & arg1 - , const SubArg2_type & arg2 - , const SubArg3_type & arg3 - ) - : m_ptr_on_device( (typename traits::value_type*) NULL) - , m_offset_map() - , m_management() - , m_tracker() -{ - // This constructor can only be used to construct a subview - // from the source view. This type must match the subview type - // deduced from the source view and subview arguments. - - typedef Impl::ViewSubview< View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > - , SubArg0_type , SubArg1_type , SubArg2_type , SubArg3_type - , void , void , void , void > - ViewSubviewDeduction ; - - enum { is_a_valid_subview_constructor = - Impl::StaticAssert< - Impl::is_same< View , typename ViewSubviewDeduction::type >::value - >::value - }; - - if ( is_a_valid_subview_constructor ) { - - typedef Impl::ViewOffsetRange< SubArg0_type > R0 ; - typedef Impl::ViewOffsetRange< SubArg1_type > R1 ; - typedef Impl::ViewOffsetRange< SubArg2_type > R2 ; - typedef Impl::ViewOffsetRange< SubArg3_type > R3 ; - - // 'assign_subview' returns whether the subview offset_map - // introduces noncontiguity in the view. - const bool introduce_noncontiguity = - m_offset_map.assign_subview( src.m_offset_map - , R0::dimension( src.m_offset_map.N0 , arg0 ) - , R1::dimension( src.m_offset_map.N1 , arg1 ) - , R2::dimension( src.m_offset_map.N2 , arg2 ) - , R3::dimension( src.m_offset_map.N3 , arg3 ) - , 0 - , 0 - , 0 - , 0 - ); - - if ( m_offset_map.capacity() ) { - - m_management = src.m_management ; - - if ( introduce_noncontiguity ) m_management.set_noncontiguous(); - - m_ptr_on_device = src.m_ptr_on_device + - src.m_offset_map( R0::begin( arg0 ) - , R1::begin( arg1 ) - , R2::begin( arg2 ) - , R3::begin( arg3 ) - ); - m_tracker = src.m_tracker ; - } - } -} - -// Construct subview of a Rank 3 view -template< class DstDataType , class DstArg1Type , class DstArg2Type , class DstArg3Type > -template< class SrcDataType , class SrcArg1Type , class SrcArg2Type , class SrcArg3Type - , class SubArg0_type , class SubArg1_type , class SubArg2_type - > -KOKKOS_INLINE_FUNCTION -View< DstDataType , DstArg1Type , DstArg2Type , DstArg3Type , Impl::ViewDefault >:: -View( const View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > & src - , const SubArg0_type & arg0 - , const SubArg1_type & arg1 - , const SubArg2_type & arg2 - ) - : m_ptr_on_device( (typename traits::value_type*) NULL) - , m_offset_map() - , m_management() - , m_tracker() -{ - // This constructor can only be used to construct a subview - // from the source view. This type must match the subview type - // deduced from the source view and subview arguments. - - typedef Impl::ViewSubview< View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > - , SubArg0_type , SubArg1_type , SubArg2_type , void , void , void , void , void > - ViewSubviewDeduction ; - - enum { is_a_valid_subview_constructor = - Impl::StaticAssert< - Impl::is_same< View , typename ViewSubviewDeduction::type >::value - >::value - }; - - if ( is_a_valid_subview_constructor ) { - - typedef Impl::ViewOffsetRange< SubArg0_type > R0 ; - typedef Impl::ViewOffsetRange< SubArg1_type > R1 ; - typedef Impl::ViewOffsetRange< SubArg2_type > R2 ; - - // 'assign_subview' returns whether the subview offset_map - // introduces noncontiguity in the view. - const bool introduce_noncontiguity = - m_offset_map.assign_subview( src.m_offset_map - , R0::dimension( src.m_offset_map.N0 , arg0 ) - , R1::dimension( src.m_offset_map.N1 , arg1 ) - , R2::dimension( src.m_offset_map.N2 , arg2 ) - , 0 , 0 , 0 , 0 , 0); - - if ( m_offset_map.capacity() ) { - - m_management = src.m_management ; - - if ( introduce_noncontiguity ) m_management.set_noncontiguous(); - - m_ptr_on_device = src.m_ptr_on_device + - src.m_offset_map( R0::begin( arg0 ) - , R1::begin( arg1 ) - , R2::begin( arg2 ) - ); - m_tracker = src.m_tracker ; - } - } -} - -// Construct subview of a Rank 2 view -template< class DstDataType , class DstArg1Type , class DstArg2Type , class DstArg3Type > -template< class SrcDataType , class SrcArg1Type , class SrcArg2Type , class SrcArg3Type - , class SubArg0_type , class SubArg1_type - > -KOKKOS_INLINE_FUNCTION -View< DstDataType , DstArg1Type , DstArg2Type , DstArg3Type , Impl::ViewDefault >:: -View( const View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > & src - , const SubArg0_type & arg0 - , const SubArg1_type & arg1 - ) - : m_ptr_on_device( (typename traits::value_type*) NULL) - , m_offset_map() - , m_management() - , m_tracker() -{ - // This constructor can only be used to construct a subview - // from the source view. This type must match the subview type - // deduced from the source view and subview arguments. - - typedef Impl::ViewSubview< View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > - , SubArg0_type , SubArg1_type , void , void , void , void , void , void > - ViewSubviewDeduction ; - - enum { is_a_valid_subview_constructor = - Impl::StaticAssert< - Impl::is_same< View , typename ViewSubviewDeduction::type >::value - >::value - }; - - if ( is_a_valid_subview_constructor ) { - - typedef Impl::ViewOffsetRange< SubArg0_type > R0 ; - typedef Impl::ViewOffsetRange< SubArg1_type > R1 ; - - // 'assign_subview' returns whether the subview offset_map - // introduces noncontiguity in the view. - const bool introduce_noncontiguity = - m_offset_map.assign_subview( src.m_offset_map - , R0::dimension( src.m_offset_map.N0 , arg0 ) - , R1::dimension( src.m_offset_map.N1 , arg1 ) - , 0 , 0 , 0 , 0 , 0 , 0 ); - - if ( m_offset_map.capacity() ) { - - m_management = src.m_management ; - - if ( introduce_noncontiguity ) m_management.set_noncontiguous(); - - m_ptr_on_device = src.m_ptr_on_device + - src.m_offset_map( R0::begin( arg0 ) - , R1::begin( arg1 ) - ); - m_tracker = src.m_tracker ; - } - } -} - -// Construct subview of a Rank 1 view -template< class DstDataType , class DstArg1Type , class DstArg2Type , class DstArg3Type > -template< class SrcDataType , class SrcArg1Type , class SrcArg2Type , class SrcArg3Type - , class SubArg0_type - > -KOKKOS_INLINE_FUNCTION -View< DstDataType , DstArg1Type , DstArg2Type , DstArg3Type , Impl::ViewDefault >:: -View( const View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > & src - , const SubArg0_type & arg0 - ) - : m_ptr_on_device( (typename traits::value_type*) NULL) - , m_offset_map() - , m_management() - , m_tracker() -{ - // This constructor can only be used to construct a subview - // from the source view. This type must match the subview type - // deduced from the source view and subview arguments. - - typedef Impl::ViewSubview< View< SrcDataType , SrcArg1Type , SrcArg2Type , SrcArg3Type , Impl::ViewDefault > - , SubArg0_type , void , void , void , void , void , void , void > - ViewSubviewDeduction ; - - enum { is_a_valid_subview_constructor = - Impl::StaticAssert< - Impl::is_same< View , typename ViewSubviewDeduction::type >::value - >::value - }; - - if ( is_a_valid_subview_constructor ) { - - typedef Impl::ViewOffsetRange< SubArg0_type > R0 ; - - // 'assign_subview' returns whether the subview offset_map - // introduces noncontiguity in the view. - const bool introduce_noncontiguity = - m_offset_map.assign_subview( src.m_offset_map - , R0::dimension( src.m_offset_map.N0 , arg0 ) - , 0 , 0 , 0 , 0 , 0 , 0 , 0 ); - - if ( m_offset_map.capacity() ) { - - m_management = src.m_management ; - - if ( introduce_noncontiguity ) m_management.set_noncontiguous(); - - m_ptr_on_device = src.m_ptr_on_device + - src.m_offset_map( R0::begin( arg0 ) - ); - m_tracker = src.m_tracker ; - } - } -} - -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_VIEWDEFAULT_HPP */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_ViewOffset.hpp b/lib/kokkos/core/src/impl/Kokkos_ViewOffset.hpp deleted file mode 100644 index a5dab382f9..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_ViewOffset.hpp +++ /dev/null @@ -1,1341 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_VIEWOFFSET_HPP -#define KOKKOS_VIEWOFFSET_HPP - -#include -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { namespace Impl { - -template < class ShapeType , class LayoutType , typename Enable = void > -struct ViewOffset ; - -//---------------------------------------------------------------------------- -// LayoutLeft AND ( 1 >= rank OR 0 == rank_dynamic ) : no padding / striding -template < class ShapeType > -struct ViewOffset< ShapeType , LayoutLeft - , typename enable_if<( 1 >= ShapeType::rank - || - 0 == ShapeType::rank_dynamic - )>::type > - : public ShapeType -{ - typedef size_t size_type ; - typedef ShapeType shape_type ; - typedef LayoutLeft array_layout ; - - enum { has_padding = false }; - - template< unsigned R > - KOKKOS_INLINE_FUNCTION - void assign( size_t n ) - { assign_shape_dimension( *this , n ); } - - // Return whether the subview introduced noncontiguity - template< class S , class L > - KOKKOS_INLINE_FUNCTION - typename Impl::enable_if<( 0 == shape_type::rank && - Impl::is_same::value - ), bool >::type - assign_subview( const ViewOffset & - , const size_t n0 - , const size_t n1 - , const size_t n2 - , const size_t n3 - , const size_t n4 - , const size_t n5 - , const size_t n6 - , const size_t n7 - ) - { - return false ; // did not introduce noncontiguity - } - - // This subview must be 1 == rank and 1 == rank_dynamic. - // The source dimension #0 must be non-zero and all other dimensions are zero. - // Return whether the subview introduced noncontiguity - template< class S , class L > - KOKKOS_INLINE_FUNCTION - typename Impl::enable_if<( 1 == shape_type::rank && - 1 == shape_type::rank_dynamic && - 1 <= S::rank && - Impl::is_same::value - ), bool >::type - assign_subview( const ViewOffset & - , const size_t n0 - , const size_t n1 - , const size_t n2 - , const size_t n3 - , const size_t n4 - , const size_t n5 - , const size_t n6 - , const size_t n7 - ) - { - // n1 .. n7 must be zero - shape_type::N0 = n0 ; - return false ; // did not introduce noncontiguity - } - - - KOKKOS_INLINE_FUNCTION - void assign( size_t n0 , size_t n1 , size_t n2 , size_t n3 - , size_t n4 , size_t n5 , size_t n6 , size_t n7 - , size_t = 0 ) - { shape_type::assign( *this , n0, n1, n2, n3, n4, n5, n6, n7 ); } - - template< class ShapeRHS > - KOKKOS_INLINE_FUNCTION - void assign( const ViewOffset< ShapeRHS , LayoutLeft > & rhs - , typename enable_if<( int(ShapeRHS::rank) == int(shape_type::rank) - && - int(ShapeRHS::rank_dynamic) <= int(shape_type::rank_dynamic) - )>::type * = 0 ) - { shape_type::assign( *this , rhs.N0, rhs.N1, rhs.N2, rhs.N3, rhs.N4, rhs.N5, rhs.N6, rhs.N7 ); } - - template< class ShapeRHS > - KOKKOS_INLINE_FUNCTION - void assign( const ViewOffset< ShapeRHS , LayoutRight > & rhs - , typename enable_if<( 1 == int(ShapeRHS::rank) - && - 1 == int(shape_type::rank) - && - 1 == int(shape_type::rank_dynamic) - )>::type * = 0 ) - { shape_type::assign( *this , rhs.N0, rhs.N1, rhs.N2, rhs.N3, rhs.N4, rhs.N5, rhs.N6, rhs.N7 ); } - - KOKKOS_INLINE_FUNCTION - void set_padding() {} - - KOKKOS_INLINE_FUNCTION - size_type cardinality() const - { return size_type(shape_type::N0) * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 * shape_type::N7 ; } - - KOKKOS_INLINE_FUNCTION - size_type capacity() const - { return size_type(shape_type::N0) * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 * shape_type::N7 ; } - - // Stride with [ rank ] value is the total length - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { - s[0] = 1 ; - if ( 0 < shape_type::rank ) { s[1] = shape_type::N0 ; } - if ( 1 < shape_type::rank ) { s[2] = s[1] * shape_type::N1 ; } - if ( 2 < shape_type::rank ) { s[3] = s[2] * shape_type::N2 ; } - if ( 3 < shape_type::rank ) { s[4] = s[3] * shape_type::N3 ; } - if ( 4 < shape_type::rank ) { s[5] = s[4] * shape_type::N4 ; } - if ( 5 < shape_type::rank ) { s[6] = s[5] * shape_type::N5 ; } - if ( 6 < shape_type::rank ) { s[7] = s[6] * shape_type::N6 ; } - if ( 7 < shape_type::rank ) { s[8] = s[7] * shape_type::N7 ; } - } - - KOKKOS_INLINE_FUNCTION size_type stride_0() const { return 1 ; } - KOKKOS_INLINE_FUNCTION size_type stride_1() const { return shape_type::N0 ; } - KOKKOS_INLINE_FUNCTION size_type stride_2() const { return shape_type::N0 * shape_type::N1 ; } - KOKKOS_INLINE_FUNCTION size_type stride_3() const { return shape_type::N0 * shape_type::N1 * shape_type::N2 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_4() const - { return shape_type::N0 * shape_type::N1 * shape_type::N2 * shape_type::N3 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_5() const - { return shape_type::N0 * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_6() const - { return shape_type::N0 * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_7() const - { return shape_type::N0 * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 ; } - - // rank 1 - template< typename I0 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const & i0 ) const { return i0 ; } - - // rank 2 - template < typename I0 , typename I1 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const & i0 , I1 const & i1 ) const - { return i0 + shape_type::N0 * i1 ; } - - //rank 3 - template - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0 - , I1 const& i1 - , I2 const& i2 - ) const - { - return i0 + shape_type::N0 * ( - i1 + shape_type::N1 * i2 ); - } - - //rank 4 - template - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2, I3 const& i3 ) const - { - return i0 + shape_type::N0 * ( - i1 + shape_type::N1 * ( - i2 + shape_type::N2 * i3 )); - } - - //rank 5 - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2, I3 const& i3, I4 const& i4 ) const - { - return i0 + shape_type::N0 * ( - i1 + shape_type::N1 * ( - i2 + shape_type::N2 * ( - i3 + shape_type::N3 * i4 ))); - } - - //rank 6 - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2, I3 const& i3, I4 const& i4, I5 const& i5 ) const - { - return i0 + shape_type::N0 * ( - i1 + shape_type::N1 * ( - i2 + shape_type::N2 * ( - i3 + shape_type::N3 * ( - i4 + shape_type::N4 * i5 )))); - } - - //rank 7 - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5, typename I6 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2, I3 const& i3, I4 const& i4, I5 const& i5, I6 const& i6) const - { - return i0 + shape_type::N0 * ( - i1 + shape_type::N1 * ( - i2 + shape_type::N2 * ( - i3 + shape_type::N3 * ( - i4 + shape_type::N4 * ( - i5 + shape_type::N5 * i6 ))))); - } - - //rank 8 - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5, typename I6, typename I7 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2, I3 const& i3, I4 const& i4, I5 const& i5, I6 const& i6, I7 const& i7) const - { - return i0 + shape_type::N0 * ( - i1 + shape_type::N1 * ( - i2 + shape_type::N2 * ( - i3 + shape_type::N3 * ( - i4 + shape_type::N4 * ( - i5 + shape_type::N5 * ( - i6 + shape_type::N6 * i7 )))))); - } -}; - -//---------------------------------------------------------------------------- -// LayoutLeft AND ( 1 < rank AND 0 < rank_dynamic ) : has padding / striding -template < class ShapeType > -struct ViewOffset< ShapeType , LayoutLeft - , typename enable_if<( 1 < ShapeType::rank - && - 0 < ShapeType::rank_dynamic - )>::type > - : public ShapeType -{ - typedef size_t size_type ; - typedef ShapeType shape_type ; - typedef LayoutLeft array_layout ; - - enum { has_padding = true }; - - size_type S0 ; - - // This subview must be 2 == rank and 2 == rank_dynamic - // due to only having stride #0. - // The source dimension #0 must be non-zero for stride-one leading dimension. - // At most subsequent dimension can be non-zero. - // Return whether the subview introduced noncontiguity. - template< class S , class L > - KOKKOS_INLINE_FUNCTION - typename Impl::enable_if<( 2 == shape_type::rank && - 2 == shape_type::rank_dynamic && - 2 <= S::rank && - Impl::is_same::value - ), bool >::type - assign_subview( const ViewOffset & rhs - , const size_t n0 - , const size_t n1 - , const size_t n2 - , const size_t n3 - , const size_t n4 - , const size_t n5 - , const size_t n6 - , const size_t n7 - ) - { - // N1 = second non-zero dimension - // S0 = stride for second non-zero dimension - shape_type::N0 = n0 ; - shape_type::N1 = 0 ; - S0 = 0 ; - - if ( n1 ) { shape_type::N1 = n1 ; S0 = rhs.stride_1(); } - else if ( 2 < S::rank && n2 ) { shape_type::N1 = n2 ; S0 = rhs.stride_2(); } - else if ( 3 < S::rank && n3 ) { shape_type::N1 = n3 ; S0 = rhs.stride_3(); } - else if ( 4 < S::rank && n4 ) { shape_type::N1 = n4 ; S0 = rhs.stride_4(); } - else if ( 5 < S::rank && n5 ) { shape_type::N1 = n5 ; S0 = rhs.stride_5(); } - else if ( 6 < S::rank && n6 ) { shape_type::N1 = n6 ; S0 = rhs.stride_6(); } - else if ( 7 < S::rank && n7 ) { shape_type::N1 = n7 ; S0 = rhs.stride_7(); } - - // Introduce noncontiguity if change the first dimension - // or took a range of a dimension after the second. - return ( size_t(shape_type::N0) != size_t(rhs.N0) ) || ( 0 == n1 ); - } - - - template< unsigned R > - KOKKOS_INLINE_FUNCTION - void assign( size_t n ) - { assign_shape_dimension( *this , n ); } - - - KOKKOS_INLINE_FUNCTION - void assign( size_t n0 , size_t n1 , size_t n2 , size_t n3 - , size_t n4 , size_t n5 , size_t n6 , size_t n7 - , size_t = 0 ) - { shape_type::assign( *this , n0, n1, n2, n3, n4, n5, n6, n7 ); S0 = shape_type::N0 ; } - - template< class ShapeRHS > - KOKKOS_INLINE_FUNCTION - void assign( const ViewOffset< ShapeRHS , LayoutLeft > & rhs - , typename enable_if<( int(ShapeRHS::rank) == int(shape_type::rank) - && - int(ShapeRHS::rank_dynamic) <= int(shape_type::rank_dynamic) - && - int(ShapeRHS::rank_dynamic) == 0 - )>::type * = 0 ) - { - shape_type::assign( *this , rhs.N0, rhs.N1, rhs.N2, rhs.N3, rhs.N4, rhs.N5, rhs.N6, rhs.N7 ); - S0 = shape_type::N0 ; // No padding when dynamic_rank == 0 - } - - template< class ShapeRHS > - KOKKOS_INLINE_FUNCTION - void assign( const ViewOffset< ShapeRHS , LayoutLeft > & rhs - , typename enable_if<( int(ShapeRHS::rank) == int(shape_type::rank) - && - int(ShapeRHS::rank_dynamic) <= int(shape_type::rank_dynamic) - && - int(ShapeRHS::rank_dynamic) > 0 - )>::type * = 0 ) - { - shape_type::assign( *this , rhs.N0, rhs.N1, rhs.N2, rhs.N3, rhs.N4, rhs.N5, rhs.N6, rhs.N7 ); - S0 = rhs.S0 ; // possibly padding when dynamic rank > 0 - } - - KOKKOS_INLINE_FUNCTION - void set_padding() - { - enum { div = MEMORY_ALIGNMENT / shape_type::scalar_size }; - enum { mod = MEMORY_ALIGNMENT % shape_type::scalar_size }; - enum { align = 0 == mod ? div : 0 }; - - if ( align && MEMORY_ALIGNMENT_THRESHOLD * align < S0 ) { - - const size_type count_mod = S0 % ( div ? div : 1 ); - - if ( count_mod ) { S0 += align - count_mod ; } - } - } - - KOKKOS_INLINE_FUNCTION - size_type cardinality() const - { return size_type(shape_type::N0) * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 * shape_type::N7 ; } - - KOKKOS_INLINE_FUNCTION - size_type capacity() const - { return size_type(S0) * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 * shape_type::N7 ; } - - // Stride with [ rank ] as total length - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { - s[0] = 1 ; - if ( 0 < shape_type::rank ) { s[1] = S0 ; } - if ( 1 < shape_type::rank ) { s[2] = s[1] * shape_type::N1 ; } - if ( 2 < shape_type::rank ) { s[3] = s[2] * shape_type::N2 ; } - if ( 3 < shape_type::rank ) { s[4] = s[3] * shape_type::N3 ; } - if ( 4 < shape_type::rank ) { s[5] = s[4] * shape_type::N4 ; } - if ( 5 < shape_type::rank ) { s[6] = s[5] * shape_type::N5 ; } - if ( 6 < shape_type::rank ) { s[7] = s[6] * shape_type::N6 ; } - if ( 7 < shape_type::rank ) { s[8] = s[7] * shape_type::N6 ; } - } - - KOKKOS_INLINE_FUNCTION size_type stride_0() const { return 1 ; } - KOKKOS_INLINE_FUNCTION size_type stride_1() const { return S0 ; } - KOKKOS_INLINE_FUNCTION size_type stride_2() const { return S0 * shape_type::N1 ; } - KOKKOS_INLINE_FUNCTION size_type stride_3() const { return S0 * shape_type::N1 * shape_type::N2 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_4() const - { return S0 * shape_type::N1 * shape_type::N2 * shape_type::N3 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_5() const - { return S0 * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_6() const - { return S0 * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_7() const - { return S0 * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 ; } - - // rank 2 - template < typename I0 , typename I1 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const & i0 , I1 const & i1) const - { return i0 + S0 * i1 ; } - - //rank 3 - template - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 ) const - { - return i0 + S0 * ( - i1 + shape_type::N1 * i2 ); - } - - //rank 4 - template - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2, I3 const& i3 ) const - { - return i0 + S0 * ( - i1 + shape_type::N1 * ( - i2 + shape_type::N2 * i3 )); - } - - //rank 5 - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2, I3 const& i3, I4 const& i4 ) const - { - return i0 + S0 * ( - i1 + shape_type::N1 * ( - i2 + shape_type::N2 * ( - i3 + shape_type::N3 * i4 ))); - } - - //rank 6 - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2, I3 const& i3, I4 const& i4, I5 const& i5 ) const - { - return i0 + S0 * ( - i1 + shape_type::N1 * ( - i2 + shape_type::N2 * ( - i3 + shape_type::N3 * ( - i4 + shape_type::N4 * i5 )))); - } - - //rank 7 - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5, typename I6 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2, I3 const& i3, I4 const& i4, I5 const& i5, I6 const& i6 ) const - { - return i0 + S0 * ( - i1 + shape_type::N1 * ( - i2 + shape_type::N2 * ( - i3 + shape_type::N3 * ( - i4 + shape_type::N4 * ( - i5 + shape_type::N5 * i6 ))))); - } - - //rank 8 - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5, typename I6, typename I7 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2, I3 const& i3, I4 const& i4, I5 const& i5, I6 const& i6, I7 const& i7 ) const - { - return i0 + S0 * ( - i1 + shape_type::N1 * ( - i2 + shape_type::N2 * ( - i3 + shape_type::N3 * ( - i4 + shape_type::N4 * ( - i5 + shape_type::N5 * ( - i6 + shape_type::N6 * i7 )))))); - } -}; - -//---------------------------------------------------------------------------- -// LayoutRight AND ( 1 >= rank OR 1 >= rank_dynamic ) : no padding / striding -template < class ShapeType > -struct ViewOffset< ShapeType , LayoutRight - , typename enable_if<( 1 >= ShapeType::rank - || - 1 >= ShapeType::rank_dynamic - )>::type > - : public ShapeType -{ - typedef size_t size_type; - typedef ShapeType shape_type; - typedef LayoutRight array_layout ; - - enum { has_padding = false }; - - // This subview must be 1 == rank and 1 == rank_dynamic - // The source view's last dimension must be non-zero - // Return whether the subview introduced noncontiguity - template< class S , class L > - KOKKOS_INLINE_FUNCTION - typename Impl::enable_if<( 0 == shape_type::rank && - Impl::is_same::value - ), bool >::type - assign_subview( const ViewOffset & - , const size_t n0 - , const size_t n1 - , const size_t n2 - , const size_t n3 - , const size_t n4 - , const size_t n5 - , const size_t n6 - , const size_t n7 - ) - { return false ; } - - // This subview must be 1 == rank and 1 == rank_dynamic - // The source view's last dimension must be non-zero - // Return whether the subview introduced noncontiguity - template< class S , class L > - KOKKOS_INLINE_FUNCTION - typename Impl::enable_if<( 1 == shape_type::rank && - 1 == shape_type::rank_dynamic && - 1 <= S::rank && - Impl::is_same::value - ), bool >::type - assign_subview( const ViewOffset & - , const size_t n0 - , const size_t n1 - , const size_t n2 - , const size_t n3 - , const size_t n4 - , const size_t n5 - , const size_t n6 - , const size_t n7 - ) - { - shape_type::N0 = S::rank == 1 ? n0 : ( - S::rank == 2 ? n1 : ( - S::rank == 3 ? n2 : ( - S::rank == 4 ? n3 : ( - S::rank == 5 ? n4 : ( - S::rank == 6 ? n5 : ( - S::rank == 7 ? n6 : n7 )))))); - // should have n0 .. n_(rank-2) equal zero - return false ; - } - - template< unsigned R > - KOKKOS_INLINE_FUNCTION - void assign( size_t n ) - { assign_shape_dimension( *this , n ); } - - KOKKOS_INLINE_FUNCTION - void assign( size_t n0 , size_t n1 , size_t n2 , size_t n3 - , size_t n4 , size_t n5 , size_t n6 , size_t n7 - , size_t = 0 ) - { shape_type::assign( *this , n0, n1, n2, n3, n4, n5, n6, n7 ); } - - template< class ShapeRHS > - KOKKOS_INLINE_FUNCTION - void assign( const ViewOffset< ShapeRHS , LayoutRight > & rhs - , typename enable_if<( int(ShapeRHS::rank) == int(shape_type::rank) - && - int(ShapeRHS::rank_dynamic) <= int(shape_type::rank_dynamic) - )>::type * = 0 ) - { shape_type::assign( *this , rhs.N0, rhs.N1, rhs.N2, rhs.N3, rhs.N4, rhs.N5, rhs.N6, rhs.N7 ); } - - template< class ShapeRHS > - KOKKOS_INLINE_FUNCTION - void assign( const ViewOffset< ShapeRHS , LayoutLeft > & rhs - , typename enable_if<( 1 == int(ShapeRHS::rank) - && - 1 == int(shape_type::rank) - && - 1 == int(shape_type::rank_dynamic) - )>::type * = 0 ) - { shape_type::assign( *this , rhs.N0, rhs.N1, rhs.N2, rhs.N3, rhs.N4, rhs.N5, rhs.N6, rhs.N7 ); } - - KOKKOS_INLINE_FUNCTION - void set_padding() {} - - KOKKOS_INLINE_FUNCTION - size_type cardinality() const - { return size_type(shape_type::N0) * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 * shape_type::N7 ; } - - KOKKOS_INLINE_FUNCTION - size_type capacity() const - { return size_type(shape_type::N0) * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 * shape_type::N7 ; } - - size_type stride_R() const - { - return size_type(shape_type::N1) * shape_type::N2 * shape_type::N3 * - shape_type::N4 * shape_type::N5 * shape_type::N6 * shape_type::N7 ; - }; - - // Stride with [rank] as total length - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { - size_type n = 1 ; - if ( 7 < shape_type::rank ) { s[7] = n ; n *= shape_type::N7 ; } - if ( 6 < shape_type::rank ) { s[6] = n ; n *= shape_type::N6 ; } - if ( 5 < shape_type::rank ) { s[5] = n ; n *= shape_type::N5 ; } - if ( 4 < shape_type::rank ) { s[4] = n ; n *= shape_type::N4 ; } - if ( 3 < shape_type::rank ) { s[3] = n ; n *= shape_type::N3 ; } - if ( 2 < shape_type::rank ) { s[2] = n ; n *= shape_type::N2 ; } - if ( 1 < shape_type::rank ) { s[1] = n ; n *= shape_type::N1 ; } - if ( 0 < shape_type::rank ) { s[0] = n ; } - s[shape_type::rank] = n * shape_type::N0 ; - } - - KOKKOS_INLINE_FUNCTION - size_type stride_7() const { return 1 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_6() const { return shape_type::N7 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_5() const { return shape_type::N7 * shape_type::N6 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_4() const { return shape_type::N7 * shape_type::N6 * shape_type::N5 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_3() const { return shape_type::N7 * shape_type::N6 * shape_type::N5 * shape_type::N4 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_2() const { return shape_type::N7 * shape_type::N6 * shape_type::N5 * shape_type::N4 * shape_type::N3 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_1() const { return shape_type::N7 * shape_type::N6 * shape_type::N5 * shape_type::N4 * shape_type::N3 * shape_type::N2 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_0() const { return shape_type::N7 * shape_type::N6 * shape_type::N5 * shape_type::N4 * shape_type::N3 * shape_type::N2 * shape_type::N1 ; } - - // rank 1 - template - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0) const - { - return i0 ; - } - - // rank 2 - template - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1 ) const - { - return i1 + shape_type::N1 * i0 ; - } - - template - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 ) const - { - return i2 + shape_type::N2 * ( - i1 + shape_type::N1 * ( i0 )); - } - - template - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3 ) const - { - return i3 + shape_type::N3 * ( - i2 + shape_type::N2 * ( - i1 + shape_type::N1 * ( i0 ))); - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4 ) const - { - return i4 + shape_type::N4 * ( - i3 + shape_type::N3 * ( - i2 + shape_type::N2 * ( - i1 + shape_type::N1 * ( i0 )))); - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4, I5 const& i5 ) const - { - return i5 + shape_type::N5 * ( - i4 + shape_type::N4 * ( - i3 + shape_type::N3 * ( - i2 + shape_type::N2 * ( - i1 + shape_type::N1 * ( i0 ))))); - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5, typename I6 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4, I5 const& i5, I6 const& i6 ) const - { - return i6 + shape_type::N6 * ( - i5 + shape_type::N5 * ( - i4 + shape_type::N4 * ( - i3 + shape_type::N3 * ( - i2 + shape_type::N2 * ( - i1 + shape_type::N1 * ( i0 )))))); - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5, typename I6, typename I7 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4, I5 const& i5, I6 const& i6, I7 const& i7 ) const - { - return i7 + shape_type::N7 * ( - i6 + shape_type::N6 * ( - i5 + shape_type::N5 * ( - i4 + shape_type::N4 * ( - i3 + shape_type::N3 * ( - i2 + shape_type::N2 * ( - i1 + shape_type::N1 * ( i0 ))))))); - } -}; - -//---------------------------------------------------------------------------- -// LayoutRight AND ( 1 < rank AND 1 < rank_dynamic ) : has padding / striding -template < class ShapeType > -struct ViewOffset< ShapeType , LayoutRight - , typename enable_if<( 1 < ShapeType::rank - && - 1 < ShapeType::rank_dynamic - )>::type > - : public ShapeType -{ - typedef size_t size_type; - typedef ShapeType shape_type; - typedef LayoutRight array_layout ; - - enum { has_padding = true }; - - size_type SR ; - - // This subview must be 2 == rank and 2 == rank_dynamic - // due to only having stride #(rank-1). - // The source dimension #(rank-1) must be non-zero for stride-one leading dimension. - // At most one prior dimension can be non-zero. - // Return whether the subview introduced noncontiguity. - template< class S , class L > - KOKKOS_INLINE_FUNCTION - typename Impl::enable_if<( 2 == shape_type::rank && - 2 == shape_type::rank_dynamic && - 2 <= S::rank && - Impl::is_same::value - ), bool >::type - assign_subview( const ViewOffset & rhs - , const size_t n0 - , const size_t n1 - , const size_t n2 - , const size_t n3 - , const size_t n4 - , const size_t n5 - , const size_t n6 - , const size_t n7 - ) - { - const size_type nR = S::rank == 2 ? n1 : ( - S::rank == 3 ? n2 : ( - S::rank == 4 ? n3 : ( - S::rank == 5 ? n4 : ( - S::rank == 6 ? n5 : ( - S::rank == 7 ? n6 : n7 ))))); - - // N0 = first non-zero-dimension - // N1 = last non-zero dimension - // SR = stride for second non-zero dimension - shape_type::N0 = 0 ; - shape_type::N1 = nR ; - SR = 0 ; - - if ( n0 ) { shape_type::N0 = n0 ; SR = rhs.stride_0(); } - else if ( 2 < S::rank && n1 ) { shape_type::N0 = n1 ; SR = rhs.stride_1(); } - else if ( 3 < S::rank && n2 ) { shape_type::N0 = n2 ; SR = rhs.stride_2(); } - else if ( 4 < S::rank && n3 ) { shape_type::N0 = n3 ; SR = rhs.stride_3(); } - else if ( 5 < S::rank && n4 ) { shape_type::N0 = n4 ; SR = rhs.stride_4(); } - else if ( 6 < S::rank && n5 ) { shape_type::N0 = n5 ; SR = rhs.stride_5(); } - else if ( 7 < S::rank && n6 ) { shape_type::N0 = n6 ; SR = rhs.stride_6(); } - - // Introduce noncontiguous if change the last dimension - // or take a range of a dimension other than the second-to-last dimension. - - return 2 == S::rank ? ( size_t(shape_type::N1) != size_t(rhs.N1) || 0 == n0 ) : ( - 3 == S::rank ? ( size_t(shape_type::N1) != size_t(rhs.N2) || 0 == n1 ) : ( - 4 == S::rank ? ( size_t(shape_type::N1) != size_t(rhs.N3) || 0 == n2 ) : ( - 5 == S::rank ? ( size_t(shape_type::N1) != size_t(rhs.N4) || 0 == n3 ) : ( - 6 == S::rank ? ( size_t(shape_type::N1) != size_t(rhs.N5) || 0 == n4 ) : ( - 7 == S::rank ? ( size_t(shape_type::N1) != size_t(rhs.N6) || 0 == n5 ) : ( - ( size_t(shape_type::N1) != size_t(rhs.N7) || 0 == n6 ) )))))); - } - - template< unsigned R > - KOKKOS_INLINE_FUNCTION - void assign( size_t n ) - { assign_shape_dimension( *this , n ); } - - KOKKOS_INLINE_FUNCTION - void assign( size_t n0 , size_t n1 , size_t n2 , size_t n3 - , size_t n4 , size_t n5 , size_t n6 , size_t n7 - , size_t = 0 ) - { - shape_type::assign( *this , n0, n1, n2, n3, n4, n5, n6, n7 ); - SR = size_type(shape_type::N1) * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 * shape_type::N7 ; - } - - template< class ShapeRHS > - KOKKOS_INLINE_FUNCTION - void assign( const ViewOffset< ShapeRHS , LayoutRight > & rhs - , typename enable_if<( int(ShapeRHS::rank) == int(shape_type::rank) - && - int(ShapeRHS::rank_dynamic) <= int(shape_type::rank_dynamic) - && - int(ShapeRHS::rank_dynamic) <= 1 - )>::type * = 0 ) - { - shape_type::assign( *this , rhs.N0, rhs.N1, rhs.N2, rhs.N3, rhs.N4, rhs.N5, rhs.N6, rhs.N7 ); - SR = shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 * shape_type::N7 ; - } - - template< class ShapeRHS > - KOKKOS_INLINE_FUNCTION - void assign( const ViewOffset< ShapeRHS , LayoutRight > & rhs - , typename enable_if<( int(ShapeRHS::rank) == int(shape_type::rank) - && - int(ShapeRHS::rank_dynamic) <= int(shape_type::rank_dynamic) - && - int(ShapeRHS::rank_dynamic) > 1 - )>::type * = 0 ) - { - shape_type::assign( *this , rhs.N0, rhs.N1, rhs.N2, rhs.N3, rhs.N4, rhs.N5, rhs.N6, rhs.N7 ); - SR = rhs.SR ; - } - - KOKKOS_INLINE_FUNCTION - void set_padding() - { - enum { div = MEMORY_ALIGNMENT / shape_type::scalar_size }; - enum { mod = MEMORY_ALIGNMENT % shape_type::scalar_size }; - enum { align = 0 == mod ? div : 0 }; - - if ( align && MEMORY_ALIGNMENT_THRESHOLD * align < SR ) { - - const size_type count_mod = SR % ( div ? div : 1 ); - - if ( count_mod ) { SR += align - count_mod ; } - } - } - - KOKKOS_INLINE_FUNCTION - size_type cardinality() const - { return size_type(shape_type::N0) * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 * shape_type::N7 ; } - - KOKKOS_INLINE_FUNCTION - size_type capacity() const { return shape_type::N0 * SR ; } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { - size_type n = 1 ; - if ( 7 < shape_type::rank ) { s[7] = n ; n *= shape_type::N7 ; } - if ( 6 < shape_type::rank ) { s[6] = n ; n *= shape_type::N6 ; } - if ( 5 < shape_type::rank ) { s[5] = n ; n *= shape_type::N5 ; } - if ( 4 < shape_type::rank ) { s[4] = n ; n *= shape_type::N4 ; } - if ( 3 < shape_type::rank ) { s[3] = n ; n *= shape_type::N3 ; } - if ( 2 < shape_type::rank ) { s[2] = n ; n *= shape_type::N2 ; } - if ( 1 < shape_type::rank ) { s[1] = n ; n *= shape_type::N1 ; } - if ( 0 < shape_type::rank ) { s[0] = SR ; } - s[shape_type::rank] = SR * shape_type::N0 ; - } - - KOKKOS_INLINE_FUNCTION - size_type stride_7() const { return 1 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_6() const { return shape_type::N7 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_5() const { return shape_type::N7 * shape_type::N6 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_4() const { return shape_type::N7 * shape_type::N6 * shape_type::N5 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_3() const { return shape_type::N7 * shape_type::N6 * shape_type::N5 * shape_type::N4 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_2() const { return shape_type::N7 * shape_type::N6 * shape_type::N5 * shape_type::N4 * shape_type::N3 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_1() const { return shape_type::N7 * shape_type::N6 * shape_type::N5 * shape_type::N4 * shape_type::N3 * shape_type::N2 ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_0() const { return SR ; } - - // rank 2 - template - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1 ) const - { - return i1 + i0 * SR ; - } - - template - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 ) const - { - return i2 + shape_type::N2 * ( i1 ) + - i0 * SR ; - } - - template - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3 ) const - { - return i3 + shape_type::N3 * ( - i2 + shape_type::N2 * ( i1 )) + - i0 * SR ; - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4 ) const - { - return i4 + shape_type::N4 * ( - i3 + shape_type::N3 * ( - i2 + shape_type::N2 * ( i1 ))) + - i0 * SR ; - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4, I5 const& i5 ) const - { - return i5 + shape_type::N5 * ( - i4 + shape_type::N4 * ( - i3 + shape_type::N3 * ( - i2 + shape_type::N2 * ( i1 )))) + - i0 * SR ; - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5, typename I6 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4, I5 const& i5, I6 const& i6 ) const - { - return i6 + shape_type::N6 * ( - i5 + shape_type::N5 * ( - i4 + shape_type::N4 * ( - i3 + shape_type::N3 * ( - i2 + shape_type::N2 * ( i1 ))))) + - i0 * SR ; - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5, typename I6, typename I7 > - KOKKOS_FORCEINLINE_FUNCTION - size_type operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4, I5 const& i5, I6 const& i6, I7 const& i7 ) const - { - return i7 + shape_type::N7 * ( - i6 + shape_type::N6 * ( - i5 + shape_type::N5 * ( - i4 + shape_type::N4 * ( - i3 + shape_type::N3 * ( - i2 + shape_type::N2 * ( i1 )))))) + - i0 * SR ; - } -}; - -//---------------------------------------------------------------------------- -// LayoutStride : -template < class ShapeType > -struct ViewOffset< ShapeType , LayoutStride - , typename enable_if<( 0 < ShapeType::rank )>::type > - : public ShapeType -{ - typedef size_t size_type; - typedef ShapeType shape_type; - typedef LayoutStride array_layout ; - - size_type S[ shape_type::rank + 1 ]; - - template< class SType , class L > - KOKKOS_INLINE_FUNCTION - bool assign_subview( const ViewOffset & rhs - , const size_type n0 - , const size_type n1 - , const size_type n2 - , const size_type n3 - , const size_type n4 - , const size_type n5 - , const size_type n6 - , const size_type n7 - ) - { - shape_type::assign( *this, 0,0,0,0, 0,0,0,0 ); - - for ( int i = 0 ; i < int(shape_type::rank+1) ; ++i ) { S[i] = 0 ; } - - // preconditions: - // shape_type::rank <= rhs.rank - // shape_type::rank == count of nonzero( rhs_dim[i] ) - size_type dim[8] = { n0 , n1 , n2 , n3 , n4 , n5 , n6 , n7 }; - size_type str[ SType::rank + 1 ]; - - rhs.stride( str ); - - // contract the zero-dimensions - int r = 0 ; - for ( int i = 0 ; i < int(SType::rank) ; ++i ) { - if ( 0 != dim[i] ) { - dim[r] = dim[i] ; - str[r] = str[i] ; - ++r ; - } - } - - if ( int(shape_type::rank) == r ) { - // The shape is non-zero - for ( int i = 0 ; i < int(shape_type::rank) ; ++i ) { - const size_type cap = dim[i] * ( S[i] = str[i] ); - if ( S[ shape_type::rank ] < cap ) S[ shape_type::rank ] = cap ; - } - // set the contracted nonzero dimensions - shape_type::assign( *this, dim[0], dim[1], dim[2], dim[3], dim[4], dim[5], dim[6], dim[7] ); - } - - return true ; // definitely noncontiguous - } - - template< unsigned R > - KOKKOS_INLINE_FUNCTION - void assign( size_t n ) - { assign_shape_dimension( *this , n ); } - - template< class ShapeRHS , class Layout > - KOKKOS_INLINE_FUNCTION - void assign( const ViewOffset & rhs - , typename enable_if<( int(ShapeRHS::rank) == int(shape_type::rank) )>::type * = 0 ) - { - rhs.stride(S); - shape_type::assign( *this, rhs.N0, rhs.N1, rhs.N2, rhs.N3, rhs.N4, rhs.N5, rhs.N6, rhs.N7 ); - } - - KOKKOS_INLINE_FUNCTION - void assign( const LayoutStride & layout ) - { - size_type max = 0 ; - for ( int i = 0 ; i < shape_type::rank ; ++i ) { - S[i] = layout.stride[i] ; - const size_type m = layout.dimension[i] * S[i] ; - if ( max < m ) { max = m ; } - } - S[ shape_type::rank ] = max ; - shape_type::assign( *this, layout.dimension[0], layout.dimension[1], - layout.dimension[2], layout.dimension[3], - layout.dimension[4], layout.dimension[5], - layout.dimension[6], layout.dimension[7] ); - } - - KOKKOS_INLINE_FUNCTION - void assign( size_t s0 , size_t s1 , size_t s2 , size_t s3 - , size_t s4 , size_t s5 , size_t s6 , size_t s7 - , size_t s8 ) - { - const size_t str[9] = { s0, s1, s2, s3, s4, s5, s6, s7, s8 }; - - // Last argument is the total length. - // Total length must be non-zero. - // All strides must be non-zero and less than total length. - bool ok = 0 < str[ shape_type::rank ] ; - - for ( int i = 0 ; ( i < shape_type::rank ) && - ( ok = 0 < str[i] && str[i] < str[ shape_type::rank ] ); ++i ); - - if ( ok ) { - size_t dim[8] = { 1,1,1,1,1,1,1,1 }; - int iorder[9] = { 0,0,0,0,0,0,0,0,0 }; - - // Ordering of strides smallest to largest. - for ( int i = 1 ; i < shape_type::rank ; ++i ) { - int j = i ; - for ( ; 0 < j && str[i] < str[ iorder[j-1] ] ; --j ) { - iorder[j] = iorder[j-1] ; - } - iorder[j] = i ; - } - - // Last argument is the total length. - iorder[ shape_type::rank ] = shape_type::rank ; - - // Determine dimension associated with each stride. - // Guarantees non-overlap by truncating dimension - // if ( 0 != str[ iorder[i+1] ] % str[ iorder[i] ] ) - for ( int i = 0 ; i < shape_type::rank ; ++i ) { - dim[ iorder[i] ] = str[ iorder[i+1] ] / str[ iorder[i] ] ; - } - - // Assign dimensions and strides: - shape_type::assign( *this, dim[0], dim[1], dim[2], dim[3], dim[4], dim[5], dim[6], dim[7] ); - for ( int i = 0 ; i <= shape_type::rank ; ++i ) { S[i] = str[i] ; } - } - else { - shape_type::assign(*this,0,0,0,0,0,0,0,0); - for ( int i = 0 ; i <= shape_type::rank ; ++i ) { S[i] = 0 ; } - } - } - - KOKKOS_INLINE_FUNCTION - void set_padding() {} - - KOKKOS_INLINE_FUNCTION - size_type cardinality() const - { return shape_type::N0 * shape_type::N1 * shape_type::N2 * shape_type::N3 * shape_type::N4 * shape_type::N5 * shape_type::N6 * shape_type::N7 ; } - - KOKKOS_INLINE_FUNCTION - size_type capacity() const { return S[ shape_type::rank ]; } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { for ( int i = 0 ; i <= shape_type::rank ; ++i ) { s[i] = S[i] ; } } - - KOKKOS_INLINE_FUNCTION - size_type stride_0() const { return S[0] ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_1() const { return S[1] ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_2() const { return S[2] ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_3() const { return S[3] ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_4() const { return S[4] ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_5() const { return S[5] ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_6() const { return S[6] ; } - - KOKKOS_INLINE_FUNCTION - size_type stride_7() const { return S[7] ; } - - // rank 1 - template - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if< (std::is_integral::value) && (shape_type::rank==1),size_type>::type - operator()( I0 const& i0) const - { - return i0 * S[0] ; - } - - // rank 2 - template - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if< (std::is_integral::value) && (shape_type::rank==2),size_type>::type - operator()( I0 const& i0, I1 const& i1 ) const - { - return i0 * S[0] + i1 * S[1] ; - } - - template - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if< (std::is_integral::value) && (shape_type::rank==3),size_type>::type - operator()( I0 const& i0, I1 const& i1, I2 const& i2 ) const - { - return i0 * S[0] + i1 * S[1] + i2 * S[2] ; - } - - template - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if< (std::is_integral::value) && (shape_type::rank==4),size_type>::type - operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3 ) const - { - return i0 * S[0] + i1 * S[1] + i2 * S[2] + i3 * S[3] ; - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if< (std::is_integral::value) && (shape_type::rank==5),size_type>::type - operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4 ) const - { - return i0 * S[0] + i1 * S[1] + i2 * S[2] + i3 * S[3] + i4 * S[4] ; - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if< (std::is_integral::value) && (shape_type::rank==6),size_type>::type - operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4, I5 const& i5 ) const - { - return i0 * S[0] + i1 * S[1] + i2 * S[2] + i3 * S[3] + i4 * S[4] + i5 * S[5] ; - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5, typename I6 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if< (std::is_integral::value) && (shape_type::rank==7),size_type>::type - operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4, I5 const& i5, I6 const& i6 ) const - { - return i0 * S[0] + i1 * S[1] + i2 * S[2] + i3 * S[3] + i4 * S[4] + i5 * S[5] + i6 * S[6] ; - } - - template < typename I0, typename I1, typename I2, typename I3 - ,typename I4, typename I5, typename I6, typename I7 > - KOKKOS_FORCEINLINE_FUNCTION - typename std::enable_if< (std::is_integral::value) && (shape_type::rank==8),size_type>::type - operator()( I0 const& i0, I1 const& i1, I2 const& i2 , I3 const& i3, I4 const& i4, I5 const& i5, I6 const& i6, I7 const& i7 ) const - { - return i0 * S[0] + i1 * S[1] + i2 * S[2] + i3 * S[3] + i4 * S[4] + i5 * S[5] + i6 * S[6] + i7 * S[7] ; - } -}; - -//---------------------------------------------------------------------------- - -template< class T > -struct ViewOffsetRange { - - enum { OK_integral_type = Impl::StaticAssert< Impl::is_integral::value >::value }; - - enum { is_range = false }; - - KOKKOS_INLINE_FUNCTION static - size_t dimension( size_t const , T const & ) { return 0 ; } - - KOKKOS_INLINE_FUNCTION static - size_t begin( T const & i ) { return size_t(i) ; } -}; - -template<> -struct ViewOffsetRange { - enum { is_range = false }; -}; - -template<> -struct ViewOffsetRange< Kokkos::ALL > { - enum { is_range = true }; - - KOKKOS_INLINE_FUNCTION static - size_t dimension( size_t const n , ALL const & ) { return n ; } - - KOKKOS_INLINE_FUNCTION static - size_t begin( ALL const & ) { return 0 ; } -}; - -template< typename iType > -struct ViewOffsetRange< std::pair > { - - enum { OK_integral_type = Impl::StaticAssert< Impl::is_integral::value >::value }; - - enum { is_range = true }; - - KOKKOS_INLINE_FUNCTION static - size_t dimension( size_t const n , std::pair const & r ) - { return ( size_t(r.first) < size_t(r.second) && size_t(r.second) <= n ) ? size_t(r.second) - size_t(r.first) : 0 ; } - - KOKKOS_INLINE_FUNCTION static - size_t begin( std::pair const & r ) { return size_t(r.first) ; } -}; - -template< typename iType > -struct ViewOffsetRange< Kokkos::pair > { - - enum { OK_integral_type = Impl::StaticAssert< Impl::is_integral::value >::value }; - - enum { is_range = true }; - - KOKKOS_INLINE_FUNCTION static - size_t dimension( size_t const n , Kokkos::pair const & r ) - { return ( size_t(r.first) < size_t(r.second) && size_t(r.second) <= n ) ? size_t(r.second) - size_t(r.first) : 0 ; } - - KOKKOS_INLINE_FUNCTION static - size_t begin( Kokkos::pair const & r ) { return size_t(r.first) ; } -}; - -}} // namespace Kokkos::Impl - -#endif //KOKKOS_VIEWOFFSET_HPP - diff --git a/lib/kokkos/core/src/impl/Kokkos_ViewSupport.hpp b/lib/kokkos/core/src/impl/Kokkos_ViewSupport.hpp deleted file mode 100644 index 006b35923d..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_ViewSupport.hpp +++ /dev/null @@ -1,518 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_VIEWSUPPORT_HPP -#define KOKKOS_VIEWSUPPORT_HPP - -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -/** \brief Evaluate if LHS = RHS view assignment is allowed. */ -template< class ViewLHS , class ViewRHS > -struct ViewAssignable -{ - // Same memory space. - // Same value type. - // Compatible 'const' qualifier - // Cannot assign managed = unmannaged - enum { assignable_value = - ( is_same< typename ViewLHS::value_type , - typename ViewRHS::value_type >::value - || - is_same< typename ViewLHS::value_type , - typename ViewRHS::const_value_type >::value ) - && - is_same< typename ViewLHS::memory_space , - typename ViewRHS::memory_space >::value - && - ( ! ( ViewLHS::is_managed && ! ViewRHS::is_managed ) ) - }; - - enum { assignable_shape = - // Compatible shape and matching layout: - ( ShapeCompatible< typename ViewLHS::shape_type , - typename ViewRHS::shape_type >::value - && - is_same< typename ViewLHS::array_layout , - typename ViewRHS::array_layout >::value ) - || - // Matching layout, same rank, and LHS dynamic rank - ( is_same< typename ViewLHS::array_layout , - typename ViewRHS::array_layout >::value - && - int(ViewLHS::rank) == int(ViewRHS::rank) - && - int(ViewLHS::rank) == int(ViewLHS::rank_dynamic) ) - || - // Both rank-0, any shape and layout - ( int(ViewLHS::rank) == 0 && int(ViewRHS::rank) == 0 ) - || - // Both rank-1 and LHS is dynamic rank-1, any shape and layout - ( int(ViewLHS::rank) == 1 && int(ViewRHS::rank) == 1 && - int(ViewLHS::rank_dynamic) == 1 ) - }; - - enum { value = assignable_value && assignable_shape }; -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class ExecSpace , class Type , bool Initialize > -struct ViewDefaultConstruct -{ ViewDefaultConstruct( Type * , size_t ) {} }; - - -/** \brief ViewDataHandle provides the type of the 'data handle' which the view - * uses to access data with the [] operator. It also provides - * an allocate function and a function to extract a raw ptr from the - * data handle. ViewDataHandle also defines an enum ReferenceAble which - * specifies whether references/pointers to elements can be taken and a - * 'return_type' which is what the view operators will give back. - * Specialisation of this object allows three things depending - * on ViewTraits and compiler options: - * (i) Use special allocator (e.g. huge pages/small pages and pinned memory) - * (ii) Use special data handle type (e.g. add Cuda Texture Object) - * (iii) Use special access intrinsics (e.g. texture fetch and non-caching loads) - */ -template< class StaticViewTraits , class Enable = void > -struct ViewDataHandle { - - enum { ReturnTypeIsReference = true }; - - typedef typename StaticViewTraits::value_type * handle_type; - typedef typename StaticViewTraits::value_type & return_type; - - KOKKOS_INLINE_FUNCTION - static handle_type create_handle( typename StaticViewTraits::value_type * arg_data_ptr, AllocationTracker const & /*arg_tracker*/ ) - { - return handle_type(arg_data_ptr); - } -}; - -template< class StaticViewTraits , class Enable = void > -class ViewDataManagement : public ViewDataHandle< StaticViewTraits > { -private: - - template< class , class > friend class ViewDataManagement ; - - struct PotentiallyManaged {}; - struct StaticallyUnmanaged {}; - - /* Statically unmanaged if traits or not executing in host-accessible memory space */ - typedef typename - Impl::if_c< StaticViewTraits::is_managed && - Impl::is_same< Kokkos::HostSpace - , Kokkos::Impl::ActiveExecutionMemorySpace >::value - , PotentiallyManaged - , StaticallyUnmanaged - >::type StaticManagementTag ; - - enum { Unmanaged = 0x01 - , Noncontiguous = 0x02 - }; - - enum { DefaultTraits = Impl::is_same< StaticManagementTag , StaticallyUnmanaged >::value ? Unmanaged : 0 }; - - unsigned m_traits ; ///< Runtime traits - - - template< class T > - inline static - unsigned assign( const ViewDataManagement & rhs , const PotentiallyManaged & ) - { return rhs.m_traits | ( rhs.is_managed() && Kokkos::HostSpace::in_parallel() ? unsigned(Unmanaged) : 0u ); } - - template< class T > - KOKKOS_INLINE_FUNCTION static - unsigned assign( const ViewDataManagement & rhs , const StaticallyUnmanaged & ) - { return rhs.m_traits | Unmanaged ; } - -public: - - typedef typename ViewDataHandle< StaticViewTraits >::handle_type handle_type; - - KOKKOS_INLINE_FUNCTION - ViewDataManagement() : m_traits( DefaultTraits ) {} - - KOKKOS_INLINE_FUNCTION - ViewDataManagement( const ViewDataManagement & rhs ) - : m_traits( assign( rhs , StaticManagementTag() ) ) {} - - KOKKOS_INLINE_FUNCTION - ViewDataManagement & operator = ( const ViewDataManagement & rhs ) - { m_traits = assign( rhs , StaticManagementTag() ); return *this ; } - - template< class SVT > - KOKKOS_INLINE_FUNCTION - ViewDataManagement( const ViewDataManagement & rhs ) - : m_traits( assign( rhs , StaticManagementTag() ) ) {} - - template< class SVT > - KOKKOS_INLINE_FUNCTION - ViewDataManagement & operator = ( const ViewDataManagement & rhs ) - { m_traits = assign( rhs , StaticManagementTag() ); return *this ; } - - KOKKOS_INLINE_FUNCTION - bool is_managed() const { return ! ( m_traits & Unmanaged ); } - - KOKKOS_INLINE_FUNCTION - bool is_contiguous() const { return ! ( m_traits & Noncontiguous ); } - - KOKKOS_INLINE_FUNCTION - void set_unmanaged() { m_traits |= Unmanaged ; } - - KOKKOS_INLINE_FUNCTION - void set_noncontiguous() { m_traits |= Noncontiguous ; } - - template< bool Initialize > - static - handle_type allocate( const std::string & label - , const Impl::ViewOffset< typename StaticViewTraits::shape_type, typename StaticViewTraits::array_layout > & offset_map - , AllocationTracker & tracker - ) - { - typedef typename StaticViewTraits::execution_space execution_space ; - typedef typename StaticViewTraits::memory_space memory_space ; - typedef typename StaticViewTraits::value_type value_type ; - - const size_t count = offset_map.capacity(); - - tracker = memory_space::allocate_and_track( label, sizeof(value_type) * count ); - - value_type * ptr = reinterpret_cast(tracker.alloc_ptr()); - - // Default construct within the view's execution space. - (void) ViewDefaultConstruct< execution_space , value_type , Initialize >( ptr , count ); - - return ViewDataHandle< StaticViewTraits >::create_handle(ptr, tracker); - } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class OutputView , class InputView , unsigned Rank = OutputView::Rank > -struct ViewRemap -{ - typedef typename OutputView::size_type size_type ; - - const OutputView output ; - const InputView input ; - const size_type n0 ; - const size_type n1 ; - const size_type n2 ; - const size_type n3 ; - const size_type n4 ; - const size_type n5 ; - const size_type n6 ; - const size_type n7 ; - - ViewRemap( const OutputView & arg_out , const InputView & arg_in ) - : output( arg_out ), input( arg_in ) - , n0( std::min( (size_t)arg_out.dimension_0() , (size_t)arg_in.dimension_0() ) ) - , n1( std::min( (size_t)arg_out.dimension_1() , (size_t)arg_in.dimension_1() ) ) - , n2( std::min( (size_t)arg_out.dimension_2() , (size_t)arg_in.dimension_2() ) ) - , n3( std::min( (size_t)arg_out.dimension_3() , (size_t)arg_in.dimension_3() ) ) - , n4( std::min( (size_t)arg_out.dimension_4() , (size_t)arg_in.dimension_4() ) ) - , n5( std::min( (size_t)arg_out.dimension_5() , (size_t)arg_in.dimension_5() ) ) - , n6( std::min( (size_t)arg_out.dimension_6() , (size_t)arg_in.dimension_6() ) ) - , n7( std::min( (size_t)arg_out.dimension_7() , (size_t)arg_in.dimension_7() ) ) - { - typedef typename OutputView::execution_space execution_space ; - Kokkos::RangePolicy< execution_space > range( 0 , n0 ); - parallel_for( range , *this ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type i0 ) const - { - for ( size_type i1 = 0 ; i1 < n1 ; ++i1 ) { - for ( size_type i2 = 0 ; i2 < n2 ; ++i2 ) { - for ( size_type i3 = 0 ; i3 < n3 ; ++i3 ) { - for ( size_type i4 = 0 ; i4 < n4 ; ++i4 ) { - for ( size_type i5 = 0 ; i5 < n5 ; ++i5 ) { - for ( size_type i6 = 0 ; i6 < n6 ; ++i6 ) { - for ( size_type i7 = 0 ; i7 < n7 ; ++i7 ) { - output.at(i0,i1,i2,i3,i4,i5,i6,i7) = input.at(i0,i1,i2,i3,i4,i5,i6,i7); - }}}}}}} - } -}; - -template< class OutputView , class InputView > -struct ViewRemap< OutputView , InputView , 0 > -{ - typedef typename OutputView::value_type value_type ; - typedef typename OutputView::memory_space dst_space ; - typedef typename InputView ::memory_space src_space ; - - ViewRemap( const OutputView & arg_out , const InputView & arg_in ) - { - DeepCopy< dst_space , src_space >( arg_out.ptr_on_device() , - arg_in.ptr_on_device() , - sizeof(value_type) ); - } -}; - -//---------------------------------------------------------------------------- - -template< class ExecSpace , class Type > -struct ViewDefaultConstruct< ExecSpace , Type , true > -{ - Type * const m_ptr ; - - KOKKOS_FORCEINLINE_FUNCTION - void operator()( const typename ExecSpace::size_type& i ) const - { m_ptr[i] = Type(); } - - ViewDefaultConstruct( Type * pointer , size_t capacity ) - : m_ptr( pointer ) - { - Kokkos::RangePolicy< ExecSpace > range( 0 , capacity ); - parallel_for( range , *this ); - ExecSpace::fence(); - } -}; - -template< class OutputView , unsigned Rank = OutputView::Rank , - class Enabled = void > -struct ViewFill -{ - typedef typename OutputView::const_value_type const_value_type ; - typedef typename OutputView::size_type size_type ; - - const OutputView output ; - const_value_type input ; - - ViewFill( const OutputView & arg_out , const_value_type & arg_in ) - : output( arg_out ), input( arg_in ) - { - typedef typename OutputView::execution_space execution_space ; - Kokkos::RangePolicy< execution_space > range( 0 , output.dimension_0() ); - parallel_for( range , *this ); - execution_space::fence(); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type i0 ) const - { - for ( size_type i1 = 0 ; i1 < output.dimension_1() ; ++i1 ) { - for ( size_type i2 = 0 ; i2 < output.dimension_2() ; ++i2 ) { - for ( size_type i3 = 0 ; i3 < output.dimension_3() ; ++i3 ) { - for ( size_type i4 = 0 ; i4 < output.dimension_4() ; ++i4 ) { - for ( size_type i5 = 0 ; i5 < output.dimension_5() ; ++i5 ) { - for ( size_type i6 = 0 ; i6 < output.dimension_6() ; ++i6 ) { - for ( size_type i7 = 0 ; i7 < output.dimension_7() ; ++i7 ) { - output.at(i0,i1,i2,i3,i4,i5,i6,i7) = input ; - }}}}}}} - } -}; - -template< class OutputView > -struct ViewFill< OutputView , 0 > -{ - typedef typename OutputView::const_value_type const_value_type ; - typedef typename OutputView::memory_space dst_space ; - - ViewFill( const OutputView & arg_out , const_value_type & arg_in ) - { - DeepCopy< dst_space , dst_space >( arg_out.ptr_on_device() , & arg_in , - sizeof(const_value_type) ); - } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -struct ViewAllocateWithoutInitializing { - - const std::string label ; - - ViewAllocateWithoutInitializing() : label() {} - ViewAllocateWithoutInitializing( const std::string & arg_label ) : label( arg_label ) {} - ViewAllocateWithoutInitializing( const char * const arg_label ) : label( arg_label ) {} -}; - -struct ViewAllocate { - - const std::string label ; - - ViewAllocate() : label() {} - ViewAllocate( const std::string & arg_label ) : label( arg_label ) {} - ViewAllocate( const char * const arg_label ) : label( arg_label ) {} -}; - -} - -namespace Kokkos { -namespace Impl { - -template< class Traits , class AllocationProperties , class Enable = void > -struct ViewAllocProp : public Kokkos::Impl::false_type {}; - -template< class Traits > -struct ViewAllocProp< Traits , Kokkos::ViewAllocate - , typename Kokkos::Impl::enable_if<( - Traits::is_managed && ! Kokkos::Impl::is_const< typename Traits::value_type >::value - )>::type > - : public Kokkos::Impl::true_type -{ - typedef size_t size_type ; - typedef const ViewAllocate & property_type ; - - enum { Initialize = true }; - enum { AllowPadding = false }; - - inline - static const std::string & label( property_type p ) { return p.label ; } -}; - -template< class Traits > -struct ViewAllocProp< Traits , std::string - , typename Kokkos::Impl::enable_if<( - Traits::is_managed && ! Kokkos::Impl::is_const< typename Traits::value_type >::value - )>::type > - : public Kokkos::Impl::true_type -{ - typedef size_t size_type ; - typedef const std::string & property_type ; - - enum { Initialize = true }; - enum { AllowPadding = false }; - - inline - static const std::string & label( property_type s ) { return s ; } -}; - -template< class Traits , unsigned N > -struct ViewAllocProp< Traits , char[N] - , typename Kokkos::Impl::enable_if<( - Traits::is_managed && ! Kokkos::Impl::is_const< typename Traits::value_type >::value - )>::type > - : public Kokkos::Impl::true_type -{ -private: - typedef char label_type[N] ; -public: - - typedef size_t size_type ; - typedef const label_type & property_type ; - - enum { Initialize = true }; - enum { AllowPadding = false }; - - inline - static std::string label( property_type s ) { return std::string(s) ; } -}; - -template< class Traits > -struct ViewAllocProp< Traits , Kokkos::ViewAllocateWithoutInitializing - , typename Kokkos::Impl::enable_if<( - Traits::is_managed && ! Kokkos::Impl::is_const< typename Traits::value_type >::value - )>::type > - : public Kokkos::Impl::true_type -{ - typedef size_t size_type ; - typedef const Kokkos::ViewAllocateWithoutInitializing & property_type ; - - enum { Initialize = false }; - enum { AllowPadding = false }; - - inline - static std::string label( property_type s ) { return s.label ; } -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class Traits , class PointerProperties , class Enable = void > -struct ViewRawPointerProp : public Kokkos::Impl::false_type {}; - -template< class Traits , typename T > -struct ViewRawPointerProp< Traits , T , - typename Kokkos::Impl::enable_if<( - Impl::is_same< T , typename Traits::value_type >::value || - Impl::is_same< T , typename Traits::non_const_value_type >::value - )>::type > - : public Kokkos::Impl::true_type -{ - typedef size_t size_type ; -}; - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_VIEWSUPPORT_HPP */ - - diff --git a/lib/kokkos/core/src/impl/Kokkos_ViewTileLeft.hpp b/lib/kokkos/core/src/impl/Kokkos_ViewTileLeft.hpp deleted file mode 100644 index 0bbb781c87..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_ViewTileLeft.hpp +++ /dev/null @@ -1,209 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_VIEWTILELEFT_HPP -#define KOKKOS_VIEWTILELEFT_HPP - -#include - -#if defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - -namespace Kokkos { - -using Kokkos::Experimental::tile_subview ; - -} - -#else - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class T , unsigned N0 , unsigned N1 , class MemorySpace , class MemoryTraits > -struct ViewSpecialize< T , void , LayoutTileLeft , MemorySpace , MemoryTraits > -{ - typedef ViewDefault type ; -}; - -struct ViewTile {}; - -template< class ShapeType , unsigned N0 , unsigned N1 > -struct ViewOffset< ShapeType - , LayoutTileLeft /* Only accept properly shaped tiles */ - , typename Impl::enable_if<( 2 == ShapeType::rank - && - 2 == ShapeType::rank_dynamic - )>::type > - : public ShapeType -{ - enum { SHIFT_0 = Impl::power_of_two::value }; - enum { SHIFT_1 = Impl::power_of_two::value }; - enum { MASK_0 = N0 - 1 }; - enum { MASK_1 = N1 - 1 }; - - typedef size_t size_type ; - typedef ShapeType shape_type ; - typedef LayoutTileLeft array_layout ; - - enum { has_padding = true }; - - size_type tile_N0 ; - - KOKKOS_INLINE_FUNCTION - void assign( const ViewOffset & rhs ) - { - shape_type::N0 = rhs.N0 ; - shape_type::N1 = rhs.N1 ; - tile_N0 = ( rhs.N0 + MASK_0 ) >> SHIFT_0 ; // number of tiles in first dimension - } - - KOKKOS_INLINE_FUNCTION - void assign( size_t n0 , size_t n1 - , int = 0 , int = 0 - , int = 0 , int = 0 - , int = 0 , int = 0 - , int = 0 - ) - { - shape_type::N0 = n0 ; - shape_type::N1 = n1 ; - tile_N0 = ( n0 + MASK_0 ) >> SHIFT_0 ; // number of tiles in first dimension - } - - - KOKKOS_INLINE_FUNCTION - void set_padding() {} - - - template< typename I0 , typename I1 > - KOKKOS_INLINE_FUNCTION - size_type operator()( I0 const & i0 , I1 const & i1 - , int = 0 , int = 0 - , int = 0 , int = 0 - , int = 0 , int = 0 - ) const - { - return /* ( ( Tile offset ) * ( Tile size ) ) */ - ( ( (i0>>SHIFT_0) + tile_N0 * (i1>>SHIFT_1) ) << (SHIFT_0 + SHIFT_1) ) + - /* ( Offset within tile ) */ - ( (i0 & MASK_0) + ((i1 & MASK_1)< - KOKKOS_INLINE_FUNCTION - size_type tile_begin( I0 const & i_tile0 , I1 const & i_tile1 ) const - { - return ( i_tile0 + tile_N0 * i_tile1 ) << ( SHIFT_0 + SHIFT_1 ); - } - - - KOKKOS_INLINE_FUNCTION - size_type capacity() const - { - // ( TileDim0 * ( TileDim1 ) ) * TileSize - return ( tile_N0 * ( ( shape_type::N1 + MASK_1 ) >> SHIFT_1 ) ) << ( SHIFT_0 + SHIFT_1 ); - } -}; - -template<> -struct ViewAssignment< ViewTile , void , void > -{ - // Some compilers have type-matching issues on the integer values when using: - // template< class T , unsigned N0 , unsigned N1 , class A2 , class A3 > - template< class T , unsigned dN0 , unsigned dN1 - , class A2 , class A3 - , unsigned sN0 , unsigned sN1 > - KOKKOS_INLINE_FUNCTION - ViewAssignment( View< T[dN0][dN1], LayoutLeft, A2, A3, Impl::ViewDefault > & dst - , View< T** , LayoutTileLeft, A2, A3, Impl::ViewDefault > const & src - , size_t const i_tile0 - , typename Impl::enable_if< unsigned(dN0) == unsigned(sN0) && - unsigned(dN1) == unsigned(sN1) - , size_t const - >::type i_tile1 - ) - { - // Destination is always contiguous but source may be non-contiguous - // so don't assign the whole view management object. - // Just query and appropriately set the reference-count state. - - if ( ! src.m_management.is_managed() ) dst.m_management.set_unmanaged(); - - dst.m_ptr_on_device = src.m_ptr_on_device + src.m_offset_map.tile_begin(i_tile0,i_tile1); - - dst.m_tracker = src.m_tracker; - } -}; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -namespace Kokkos { - -template< class T , unsigned N0, unsigned N1, class A2, class A3 > -KOKKOS_INLINE_FUNCTION -View< T[N0][N1], LayoutLeft, A2, A3, Impl::ViewDefault > -tile_subview( const View,A2,A3,Impl::ViewDefault> & src - , const size_t i_tile0 - , const size_t i_tile1 - ) -{ - View< T[N0][N1], LayoutLeft, A2, A3, Impl::ViewDefault > dst ; - - (void) Impl::ViewAssignment< Impl::ViewTile , void , void >( dst , src , i_tile0 , i_tile1 ); - - return dst ; -} - -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif - -#endif /* #ifndef KOKKOS_VIEWTILELEFT_HPP */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_Volatile_Load.hpp b/lib/kokkos/core/src/impl/Kokkos_Volatile_Load.hpp deleted file mode 100644 index 420ee63891..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_Volatile_Load.hpp +++ /dev/null @@ -1,242 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#if defined( KOKKOS_ATOMIC_HPP ) && ! defined( KOKKOS_VOLATILE_LOAD ) -#define KOKKOS_VOLATILE_LOAD - -#if defined( __GNUC__ ) /* GNU C */ || \ - defined( __GNUG__ ) /* GNU C++ */ || \ - defined( __clang__ ) - -#define KOKKOS_MAY_ALIAS __attribute__((__may_alias__)) - -#else - -#define KOKKOS_MAY_ALIAS - -#endif - -namespace Kokkos { - -//---------------------------------------------------------------------------- - -template -KOKKOS_FORCEINLINE_FUNCTION -T volatile_load(T const volatile * const src_ptr) -{ - typedef uint64_t KOKKOS_MAY_ALIAS T64; - typedef uint32_t KOKKOS_MAY_ALIAS T32; - typedef uint16_t KOKKOS_MAY_ALIAS T16; - typedef uint8_t KOKKOS_MAY_ALIAS T8; - - enum { - NUM_8 = sizeof(T), - NUM_16 = NUM_8 / 2, - NUM_32 = NUM_8 / 4, - NUM_64 = NUM_8 / 8 - }; - - union { - T const volatile * const ptr; - T64 const volatile * const ptr64; - T32 const volatile * const ptr32; - T16 const volatile * const ptr16; - T8 const volatile * const ptr8; - } src = {src_ptr}; - - T result; - - union { - T * const ptr; - T64 * const ptr64; - T32 * const ptr32; - T16 * const ptr16; - T8 * const ptr8; - } dst = {&result}; - - for (int i=0; i < NUM_64; ++i) { - dst.ptr64[i] = src.ptr64[i]; - } - - if ( NUM_64*2 < NUM_32 ) { - dst.ptr32[NUM_64*2] = src.ptr32[NUM_64*2]; - } - - if ( NUM_32*2 < NUM_16 ) { - dst.ptr16[NUM_32*2] = src.ptr16[NUM_32*2]; - } - - if ( NUM_16*2 < NUM_8 ) { - dst.ptr8[NUM_16*2] = src.ptr8[NUM_16*2]; - } - - return result; -} - -template -KOKKOS_FORCEINLINE_FUNCTION -void volatile_store(T volatile * const dst_ptr, T const volatile * const src_ptr) -{ - typedef uint64_t KOKKOS_MAY_ALIAS T64; - typedef uint32_t KOKKOS_MAY_ALIAS T32; - typedef uint16_t KOKKOS_MAY_ALIAS T16; - typedef uint8_t KOKKOS_MAY_ALIAS T8; - - enum { - NUM_8 = sizeof(T), - NUM_16 = NUM_8 / 2, - NUM_32 = NUM_8 / 4, - NUM_64 = NUM_8 / 8 - }; - - union { - T const volatile * const ptr; - T64 const volatile * const ptr64; - T32 const volatile * const ptr32; - T16 const volatile * const ptr16; - T8 const volatile * const ptr8; - } src = {src_ptr}; - - union { - T volatile * const ptr; - T64 volatile * const ptr64; - T32 volatile * const ptr32; - T16 volatile * const ptr16; - T8 volatile * const ptr8; - } dst = {dst_ptr}; - - for (int i=0; i < NUM_64; ++i) { - dst.ptr64[i] = src.ptr64[i]; - } - - if ( NUM_64*2 < NUM_32 ) { - dst.ptr32[NUM_64*2] = src.ptr32[NUM_64*2]; - } - - if ( NUM_32*2 < NUM_16 ) { - dst.ptr16[NUM_32*2] = src.ptr16[NUM_32*2]; - } - - if ( NUM_16*2 < NUM_8 ) { - dst.ptr8[NUM_16*2] = src.ptr8[NUM_16*2]; - } -} - -template -KOKKOS_FORCEINLINE_FUNCTION -void volatile_store(T volatile * const dst_ptr, T const * const src_ptr) -{ - typedef uint64_t KOKKOS_MAY_ALIAS T64; - typedef uint32_t KOKKOS_MAY_ALIAS T32; - typedef uint16_t KOKKOS_MAY_ALIAS T16; - typedef uint8_t KOKKOS_MAY_ALIAS T8; - - enum { - NUM_8 = sizeof(T), - NUM_16 = NUM_8 / 2, - NUM_32 = NUM_8 / 4, - NUM_64 = NUM_8 / 8 - }; - - union { - T const * const ptr; - T64 const * const ptr64; - T32 const * const ptr32; - T16 const * const ptr16; - T8 const * const ptr8; - } src = {src_ptr}; - - union { - T volatile * const ptr; - T64 volatile * const ptr64; - T32 volatile * const ptr32; - T16 volatile * const ptr16; - T8 volatile * const ptr8; - } dst = {dst_ptr}; - - for (int i=0; i < NUM_64; ++i) { - dst.ptr64[i] = src.ptr64[i]; - } - - if ( NUM_64*2 < NUM_32 ) { - dst.ptr32[NUM_64*2] = src.ptr32[NUM_64*2]; - } - - if ( NUM_32*2 < NUM_16 ) { - dst.ptr16[NUM_32*2] = src.ptr16[NUM_32*2]; - } - - if ( NUM_16*2 < NUM_8 ) { - dst.ptr8[NUM_16*2] = src.ptr8[NUM_16*2]; - } -} - -template -KOKKOS_FORCEINLINE_FUNCTION -void volatile_store(T volatile * dst_ptr, T const volatile & src) -{ volatile_store(dst_ptr, &src); } - -template -KOKKOS_FORCEINLINE_FUNCTION -void volatile_store(T volatile * dst_ptr, T const & src) -{ volatile_store(dst_ptr, &src); } - -template -KOKKOS_FORCEINLINE_FUNCTION -T safe_load(T const * const ptr) -{ -#if !defined( __MIC__ ) - return *ptr; -#else - return volatile_load(ptr); -#endif -} - -} // namespace kokkos - -#undef KOKKOS_MAY_ALIAS - -#endif - - - diff --git a/lib/kokkos/core/src/impl/Kokkos_hwloc.cpp b/lib/kokkos/core/src/impl/Kokkos_hwloc.cpp deleted file mode 100644 index 1d173fb4fb..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_hwloc.cpp +++ /dev/null @@ -1,704 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#define DEBUG_PRINT 0 - -#include -#include - -#include -#include -#include - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace hwloc { - -/* Return 0 if asynchronous, 1 if synchronous and include process. */ -unsigned thread_mapping( const char * const label , - const bool allow_async , - unsigned & thread_count , - unsigned & use_numa_count , - unsigned & use_cores_per_numa , - std::pair threads_coord[] ) -{ - const bool hwloc_avail = Kokkos::hwloc::available(); - const unsigned avail_numa_count = hwloc_avail ? hwloc::get_available_numa_count() : 1 ; - const unsigned avail_cores_per_numa = hwloc_avail ? hwloc::get_available_cores_per_numa() : thread_count ; - const unsigned avail_threads_per_core = hwloc_avail ? hwloc::get_available_threads_per_core() : 1 ; - - // (numa,core) coordinate of the process: - const std::pair proc_coord = Kokkos::hwloc::get_this_thread_coordinate(); - - //------------------------------------------------------------------------ - // Defaults for unspecified inputs: - - if ( ! use_numa_count ) { - // Default to use all NUMA regions - use_numa_count = ! thread_count ? avail_numa_count : ( - thread_count < avail_numa_count ? thread_count : avail_numa_count ); - } - - if ( ! use_cores_per_numa ) { - // Default to use all but one core if asynchronous, all cores if synchronous. - const unsigned threads_per_numa = thread_count / use_numa_count ; - - use_cores_per_numa = ! threads_per_numa ? avail_cores_per_numa - ( allow_async ? 1 : 0 ) : ( - threads_per_numa < avail_cores_per_numa ? threads_per_numa : avail_cores_per_numa ); - } - - if ( ! thread_count ) { - thread_count = use_numa_count * use_cores_per_numa * avail_threads_per_core ; - } - - //------------------------------------------------------------------------ - // Input verification: - - const bool valid_numa = use_numa_count <= avail_numa_count ; - const bool valid_cores = use_cores_per_numa && - use_cores_per_numa <= avail_cores_per_numa ; - const bool valid_threads = thread_count && - thread_count <= use_numa_count * use_cores_per_numa * avail_threads_per_core ; - const bool balanced_numa = ! ( thread_count % use_numa_count ); - const bool balanced_cores = ! ( thread_count % ( use_numa_count * use_cores_per_numa ) ); - - const bool valid_input = valid_numa && valid_cores && valid_threads && balanced_numa && balanced_cores ; - - if ( ! valid_input ) { - - std::ostringstream msg ; - - msg << label << " HWLOC ERROR(s)" ; - - if ( ! valid_threads ) { - msg << " : thread_count(" << thread_count - << ") exceeds capacity(" - << use_numa_count * use_cores_per_numa * avail_threads_per_core - << ")" ; - } - if ( ! valid_numa ) { - msg << " : use_numa_count(" << use_numa_count - << ") exceeds capacity(" << avail_numa_count << ")" ; - } - if ( ! valid_cores ) { - msg << " : use_cores_per_numa(" << use_cores_per_numa - << ") exceeds capacity(" << avail_cores_per_numa << ")" ; - } - if ( ! balanced_numa ) { - msg << " : thread_count(" << thread_count - << ") imbalanced among numa(" << use_numa_count << ")" ; - } - if ( ! balanced_cores ) { - msg << " : thread_count(" << thread_count - << ") imbalanced among cores(" << use_numa_count * use_cores_per_numa << ")" ; - } - - Kokkos::Impl::throw_runtime_exception( msg.str() ); - } - - const unsigned thread_spawn_synchronous = - ( allow_async && - 1 < thread_count && - ( use_numa_count < avail_numa_count || - use_cores_per_numa < avail_cores_per_numa ) ) - ? 0 /* asyncronous */ - : 1 /* synchronous, threads_coord[0] is process core */ ; - - // Determine binding coordinates for to-be-spawned threads so that - // threads may be bound to cores as they are spawned. - - const unsigned threads_per_core = thread_count / ( use_numa_count * use_cores_per_numa ); - - if ( thread_spawn_synchronous ) { - // Working synchronously and include process core as threads_coord[0]. - // Swap the NUMA coordinate of the process core with 0 - // Swap the CORE coordinate of the process core with 0 - for ( unsigned i = 0 , inuma = avail_numa_count - use_numa_count ; inuma < avail_numa_count ; ++inuma ) { - const unsigned numa_coord = 0 == inuma ? proc_coord.first : ( proc_coord.first == inuma ? 0 : inuma ); - for ( unsigned icore = avail_cores_per_numa - use_cores_per_numa ; icore < avail_cores_per_numa ; ++icore ) { - const unsigned core_coord = 0 == icore ? proc_coord.second : ( proc_coord.second == icore ? 0 : icore ); - for ( unsigned ith = 0 ; ith < threads_per_core ; ++ith , ++i ) { - threads_coord[i].first = numa_coord ; - threads_coord[i].second = core_coord ; - } - } - } - } - else if ( use_numa_count < avail_numa_count ) { - // Working asynchronously and omit the process' NUMA region from the pool. - // Swap the NUMA coordinate of the process core with ( ( avail_numa_count - use_numa_count ) - 1 ) - const unsigned numa_coord_swap = ( avail_numa_count - use_numa_count ) - 1 ; - for ( unsigned i = 0 , inuma = avail_numa_count - use_numa_count ; inuma < avail_numa_count ; ++inuma ) { - const unsigned numa_coord = proc_coord.first == inuma ? numa_coord_swap : inuma ; - for ( unsigned icore = avail_cores_per_numa - use_cores_per_numa ; icore < avail_cores_per_numa ; ++icore ) { - const unsigned core_coord = icore ; - for ( unsigned ith = 0 ; ith < threads_per_core ; ++ith , ++i ) { - threads_coord[i].first = numa_coord ; - threads_coord[i].second = core_coord ; - } - } - } - } - else if ( use_cores_per_numa < avail_cores_per_numa ) { - // Working asynchronously and omit the process' core from the pool. - // Swap the CORE coordinate of the process core with ( ( avail_cores_per_numa - use_cores_per_numa ) - 1 ) - const unsigned core_coord_swap = ( avail_cores_per_numa - use_cores_per_numa ) - 1 ; - for ( unsigned i = 0 , inuma = avail_numa_count - use_numa_count ; inuma < avail_numa_count ; ++inuma ) { - const unsigned numa_coord = inuma ; - for ( unsigned icore = avail_cores_per_numa - use_cores_per_numa ; icore < avail_cores_per_numa ; ++icore ) { - const unsigned core_coord = proc_coord.second == icore ? core_coord_swap : icore ; - for ( unsigned ith = 0 ; ith < threads_per_core ; ++ith , ++i ) { - threads_coord[i].first = numa_coord ; - threads_coord[i].second = core_coord ; - } - } - } - } - - return thread_spawn_synchronous ; -} - -} /* namespace hwloc */ -} /* namespace Kokkos */ - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -#if defined( KOKKOS_HAVE_HWLOC ) - -#include -#include -#include - -/*--------------------------------------------------------------------------*/ -/* Third Party Libraries */ - -/* Hardware locality library: http://www.open-mpi.org/projects/hwloc/ */ -#include - -#define REQUIRED_HWLOC_API_VERSION 0x000010300 - -#if HWLOC_API_VERSION < REQUIRED_HWLOC_API_VERSION -#error "Requires http://www.open-mpi.org/projects/hwloc/ Version 1.3 or greater" -#endif - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace hwloc { -namespace { - -#if DEBUG_PRINT - -inline -void print_bitmap( std::ostream & s , const hwloc_const_bitmap_t bitmap ) -{ - s << "{" ; - for ( int i = hwloc_bitmap_first( bitmap ) ; - -1 != i ; i = hwloc_bitmap_next( bitmap , i ) ) { - s << " " << i ; - } - s << " }" ; -} - -#endif - -enum { MAX_CORE = 1024 }; - -std::pair s_core_topology(0,0); -unsigned s_core_capacity(0); -hwloc_topology_t s_hwloc_topology(0); -hwloc_bitmap_t s_hwloc_location(0); -hwloc_bitmap_t s_process_binding(0); -hwloc_bitmap_t s_core[ MAX_CORE ]; - -struct Sentinel { - ~Sentinel(); - Sentinel(); -}; - -bool sentinel() -{ - static Sentinel self ; - - if ( 0 == s_hwloc_topology ) { - std::cerr << "Kokkos::hwloc ERROR : Called after return from main()" << std::endl ; - std::cerr.flush(); - } - - return 0 != s_hwloc_topology ; -} - -Sentinel::~Sentinel() -{ - hwloc_topology_destroy( s_hwloc_topology ); - hwloc_bitmap_free( s_process_binding ); - hwloc_bitmap_free( s_hwloc_location ); - - s_core_topology.first = 0 ; - s_core_topology.second = 0 ; - s_core_capacity = 0 ; - s_hwloc_topology = 0 ; - s_hwloc_location = 0 ; - s_process_binding = 0 ; -} - -Sentinel::Sentinel() -{ -#if defined(__MIC__) - static const bool remove_core_0 = true ; -#else - static const bool remove_core_0 = false ; -#endif - - s_core_topology = std::pair(0,0); - s_core_capacity = 0 ; - s_hwloc_topology = 0 ; - s_hwloc_location = 0 ; - s_process_binding = 0 ; - - for ( unsigned i = 0 ; i < MAX_CORE ; ++i ) s_core[i] = 0 ; - - hwloc_topology_init( & s_hwloc_topology ); - hwloc_topology_load( s_hwloc_topology ); - - s_hwloc_location = hwloc_bitmap_alloc(); - s_process_binding = hwloc_bitmap_alloc(); - - hwloc_get_cpubind( s_hwloc_topology , s_process_binding , HWLOC_CPUBIND_PROCESS ); - - if ( remove_core_0 ) { - - const hwloc_obj_t core = hwloc_get_obj_by_type( s_hwloc_topology , HWLOC_OBJ_CORE , 0 ); - - if ( hwloc_bitmap_intersects( s_process_binding , core->allowed_cpuset ) ) { - - hwloc_bitmap_t s_process_no_core_zero = hwloc_bitmap_alloc(); - - hwloc_bitmap_andnot( s_process_no_core_zero , s_process_binding , core->allowed_cpuset ); - - bool ok = 0 == hwloc_set_cpubind( s_hwloc_topology , - s_process_no_core_zero , - HWLOC_CPUBIND_PROCESS | HWLOC_CPUBIND_STRICT ); - - if ( ok ) { - hwloc_get_cpubind( s_hwloc_topology , s_process_binding , HWLOC_CPUBIND_PROCESS ); - - ok = 0 != hwloc_bitmap_isequal( s_process_binding , s_process_no_core_zero ); - } - - hwloc_bitmap_free( s_process_no_core_zero ); - - if ( ! ok ) { - std::cerr << "WARNING: Kokkos::hwloc attempted and failed to move process off of core #0" << std::endl ; - } - } - } - - // Choose a hwloc object type for the NUMA level, which may not exist. - - hwloc_obj_type_t root_type = HWLOC_OBJ_TYPE_MAX ; - - { - // Object types to search, in order. - static const hwloc_obj_type_t candidate_root_type[] = - { HWLOC_OBJ_NODE /* NUMA region */ - , HWLOC_OBJ_SOCKET /* hardware socket */ - , HWLOC_OBJ_MACHINE /* local machine */ - }; - - enum { CANDIDATE_ROOT_TYPE_COUNT = - sizeof(candidate_root_type) / sizeof(hwloc_obj_type_t) }; - - for ( int k = 0 ; k < CANDIDATE_ROOT_TYPE_COUNT && HWLOC_OBJ_TYPE_MAX == root_type ; ++k ) { - if ( 0 < hwloc_get_nbobjs_by_type( s_hwloc_topology , candidate_root_type[k] ) ) { - root_type = candidate_root_type[k] ; - } - } - } - - // Determine which of these 'root' types are available to this process. - // The process may have been bound (e.g., by MPI) to a subset of these root types. - // Determine current location of the master (calling) process> - - hwloc_bitmap_t proc_cpuset_location = hwloc_bitmap_alloc(); - - hwloc_get_last_cpu_location( s_hwloc_topology , proc_cpuset_location , HWLOC_CPUBIND_THREAD ); - - const unsigned max_root = hwloc_get_nbobjs_by_type( s_hwloc_topology , root_type ); - - unsigned root_base = max_root ; - unsigned root_count = 0 ; - unsigned core_per_root = 0 ; - unsigned pu_per_core = 0 ; - bool symmetric = true ; - - for ( unsigned i = 0 ; i < max_root ; ++i ) { - - const hwloc_obj_t root = hwloc_get_obj_by_type( s_hwloc_topology , root_type , i ); - - if ( hwloc_bitmap_intersects( s_process_binding , root->allowed_cpuset ) ) { - - ++root_count ; - - // Remember which root (NUMA) object the master thread is running on. - // This will be logical NUMA rank #0 for this process. - - if ( hwloc_bitmap_intersects( proc_cpuset_location, root->allowed_cpuset ) ) { - root_base = i ; - } - - // Count available cores: - - const unsigned max_core = - hwloc_get_nbobjs_inside_cpuset_by_type( s_hwloc_topology , - root->allowed_cpuset , - HWLOC_OBJ_CORE ); - - unsigned core_count = 0 ; - - for ( unsigned j = 0 ; j < max_core ; ++j ) { - - const hwloc_obj_t core = - hwloc_get_obj_inside_cpuset_by_type( s_hwloc_topology , - root->allowed_cpuset , - HWLOC_OBJ_CORE , j ); - - // If process' cpuset intersects core's cpuset then process can access this core. - // Must use intersection instead of inclusion because the Intel-Phi - // MPI may bind the process to only one of the core's hyperthreads. - // - // Assumption: if the process can access any hyperthread of the core - // then it has ownership of the entire core. - // This assumes that it would be performance-detrimental - // to spawn more than one MPI process per core and use nested threading. - - if ( hwloc_bitmap_intersects( s_process_binding , core->allowed_cpuset ) ) { - - ++core_count ; - - const unsigned pu_count = - hwloc_get_nbobjs_inside_cpuset_by_type( s_hwloc_topology , - core->allowed_cpuset , - HWLOC_OBJ_PU ); - - if ( pu_per_core == 0 ) pu_per_core = pu_count ; - - // Enforce symmetry by taking the minimum: - - pu_per_core = std::min( pu_per_core , pu_count ); - - if ( pu_count != pu_per_core ) symmetric = false ; - } - } - - if ( 0 == core_per_root ) core_per_root = core_count ; - - // Enforce symmetry by taking the minimum: - - core_per_root = std::min( core_per_root , core_count ); - - if ( core_count != core_per_root ) symmetric = false ; - } - } - - s_core_topology.first = root_count ; - s_core_topology.second = core_per_root ; - s_core_capacity = pu_per_core ; - - // Fill the 's_core' array for fast mapping from a core coordinate to the - // hwloc cpuset object required for thread location querying and binding. - - for ( unsigned i = 0 ; i < max_root ; ++i ) { - - const unsigned root_rank = ( i + root_base ) % max_root ; - - const hwloc_obj_t root = hwloc_get_obj_by_type( s_hwloc_topology , root_type , root_rank ); - - if ( hwloc_bitmap_intersects( s_process_binding , root->allowed_cpuset ) ) { - - const unsigned max_core = - hwloc_get_nbobjs_inside_cpuset_by_type( s_hwloc_topology , - root->allowed_cpuset , - HWLOC_OBJ_CORE ); - - unsigned core_count = 0 ; - - for ( unsigned j = 0 ; j < max_core && core_count < core_per_root ; ++j ) { - - const hwloc_obj_t core = - hwloc_get_obj_inside_cpuset_by_type( s_hwloc_topology , - root->allowed_cpuset , - HWLOC_OBJ_CORE , j ); - - if ( hwloc_bitmap_intersects( s_process_binding , core->allowed_cpuset ) ) { - - s_core[ core_count + core_per_root * i ] = core->allowed_cpuset ; - - ++core_count ; - } - } - } - } - - hwloc_bitmap_free( proc_cpuset_location ); - - if ( ! symmetric ) { - std::cout << "Kokkos::hwloc WARNING: Using a symmetric subset of a non-symmetric core topology." - << std::endl ; - } -} - - -} // namespace - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -bool available() -{ return true ; } - -unsigned get_available_numa_count() -{ sentinel(); return s_core_topology.first ; } - -unsigned get_available_cores_per_numa() -{ sentinel(); return s_core_topology.second ; } - -unsigned get_available_threads_per_core() -{ sentinel(); return s_core_capacity ; } - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -unsigned bind_this_thread( - const unsigned coordinate_count , - std::pair coordinate[] ) -{ - unsigned i = 0 ; - - try { - const std::pair current = get_this_thread_coordinate(); - - // Match one of the requests: - for ( i = 0 ; i < coordinate_count && current != coordinate[i] ; ++i ); - - if ( coordinate_count == i ) { - // Match the first request (typically NUMA): - for ( i = 0 ; i < coordinate_count && current.first != coordinate[i].first ; ++i ); - } - - if ( coordinate_count == i ) { - // Match any unclaimed request: - for ( i = 0 ; i < coordinate_count && ~0u == coordinate[i].first ; ++i ); - } - - if ( coordinate_count == i || ! bind_this_thread( coordinate[i] ) ) { - // Failed to bind: - i = ~0u ; - } - - if ( i < coordinate_count ) { - -#if DEBUG_PRINT - if ( current != coordinate[i] ) { - std::cout << " bind_this_thread: rebinding from (" - << current.first << "," - << current.second - << ") to (" - << coordinate[i].first << "," - << coordinate[i].second - << ")" << std::endl ; - } -#endif - - coordinate[i].first = ~0u ; - coordinate[i].second = ~0u ; - } - } - catch( ... ) { - i = ~0u ; - } - - return i ; -} - - -bool bind_this_thread( const std::pair coord ) -{ - if ( ! sentinel() ) return false ; - -#if DEBUG_PRINT - - std::cout << "Kokkos::bind_this_thread() at " ; - - hwloc_get_last_cpu_location( s_hwloc_topology , - s_hwloc_location , HWLOC_CPUBIND_THREAD ); - - print_bitmap( std::cout , s_hwloc_location ); - - std::cout << " to " ; - - print_bitmap( std::cout , s_core[ coord.second + coord.first * s_core_topology.second ] ); - - std::cout << std::endl ; - -#endif - - // As safe and fast as possible. - // Fast-lookup by caching the coordinate -> hwloc cpuset mapping in 's_core'. - return coord.first < s_core_topology.first && - coord.second < s_core_topology.second && - 0 == hwloc_set_cpubind( s_hwloc_topology , - s_core[ coord.second + coord.first * s_core_topology.second ] , - HWLOC_CPUBIND_THREAD | HWLOC_CPUBIND_STRICT ); -} - -bool unbind_this_thread() -{ - if ( ! sentinel() ) return false ; - -#define HWLOC_DEBUG_PRINT 0 - -#if HWLOC_DEBUG_PRINT - - std::cout << "Kokkos::unbind_this_thread() from " ; - - hwloc_get_cpubind( s_hwloc_topology , s_hwloc_location , HWLOC_CPUBIND_THREAD ); - - print_bitmap( std::cout , s_hwloc_location ); - -#endif - - const bool result = - s_hwloc_topology && - 0 == hwloc_set_cpubind( s_hwloc_topology , - s_process_binding , - HWLOC_CPUBIND_THREAD | HWLOC_CPUBIND_STRICT ); - -#if HWLOC_DEBUG_PRINT - - std::cout << " to " ; - - hwloc_get_cpubind( s_hwloc_topology , s_hwloc_location , HWLOC_CPUBIND_THREAD ); - - print_bitmap( std::cout , s_hwloc_location ); - - std::cout << std::endl ; - -#endif - - return result ; - -#undef HWLOC_DEBUG_PRINT - -} - -//---------------------------------------------------------------------------- - -std::pair get_this_thread_coordinate() -{ - std::pair coord(0u,0u); - - if ( ! sentinel() ) return coord ; - - const unsigned n = s_core_topology.first * s_core_topology.second ; - - // Using the pre-allocated 's_hwloc_location' to avoid memory - // allocation by this thread. This call is NOT thread-safe. - hwloc_get_last_cpu_location( s_hwloc_topology , - s_hwloc_location , HWLOC_CPUBIND_THREAD ); - - unsigned i = 0 ; - - while ( i < n && ! hwloc_bitmap_intersects( s_hwloc_location , s_core[ i ] ) ) ++i ; - - if ( i < n ) { - coord.first = i / s_core_topology.second ; - coord.second = i % s_core_topology.second ; - } - - return coord ; -} - -//---------------------------------------------------------------------------- - -} /* namespace hwloc */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#else /* ! defined( KOKKOS_HAVE_HWLOC ) */ - -namespace Kokkos { -namespace hwloc { - -bool available() { return false ; } - -unsigned get_available_numa_count() { return 1 ; } -unsigned get_available_cores_per_numa() { return 1 ; } -unsigned get_available_threads_per_core() { return 1 ; } - -unsigned bind_this_thread( const unsigned , std::pair[] ) -{ return ~0 ; } - -bool bind_this_thread( const std::pair ) -{ return false ; } - -bool unbind_this_thread() -{ return true ; } - -std::pair get_this_thread_coordinate() -{ return std::pair(0,0); } - -} // namespace hwloc -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif - - diff --git a/lib/kokkos/core/src/impl/Kokkos_spinwait.cpp b/lib/kokkos/core/src/impl/Kokkos_spinwait.cpp deleted file mode 100644 index e16d9c4956..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_spinwait.cpp +++ /dev/null @@ -1,82 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -/*--------------------------------------------------------------------------*/ - -#if ( KOKKOS_ENABLE_ASM ) - #if defined( __arm__ ) || defined( __aarch64__ ) - /* No-operation instruction to idle the thread. */ - #define YIELD asm volatile("nop") - #else - /* Pause instruction to prevent excess processor bus usage */ - #define YIELD asm volatile("pause\n":::"memory") - #endif -#elif defined ( KOKKOS_HAVE_WINTHREAD ) - #include - #define YIELD Sleep(0) -#elif defined ( _WIN32 ) - #define YIELD __asm__ __volatile__("pause\n":::"memory") -#else - #include - #define YIELD sched_yield() -#endif - -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) -void spinwait( volatile int & flag , const int value ) -{ - while ( value == flag ) { - YIELD ; - } -} -#endif - -} /* namespace Impl */ -} /* namespace Kokkos */ - diff --git a/lib/kokkos/core/src/impl/Kokkos_spinwait.hpp b/lib/kokkos/core/src/impl/Kokkos_spinwait.hpp deleted file mode 100644 index cc87771fae..0000000000 --- a/lib/kokkos/core/src/impl/Kokkos_spinwait.hpp +++ /dev/null @@ -1,64 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - - -#ifndef KOKKOS_SPINWAIT_HPP -#define KOKKOS_SPINWAIT_HPP - -#include - -namespace Kokkos { -namespace Impl { - -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) -void spinwait( volatile int & flag , const int value ); -#else -KOKKOS_INLINE_FUNCTION -void spinwait( volatile int & , const int ) {} -#endif - -} /* namespace Impl */ -} /* namespace Kokkos */ - -#endif /* #ifndef KOKKOS_SPINWAIT_HPP */ - diff --git a/lib/kokkos/core/unit_test/Makefile b/lib/kokkos/core/unit_test/Makefile deleted file mode 100644 index b2d3d55066..0000000000 --- a/lib/kokkos/core/unit_test/Makefile +++ /dev/null @@ -1,146 +0,0 @@ -KOKKOS_PATH = ../.. - -GTEST_PATH = ../../TPL/gtest - -vpath %.cpp ${KOKKOS_PATH}/core/unit_test -TEST_HEADERS = $(wildcard $(KOKKOS_PATH)/core/unit_test/*.hpp) - -default: build_all - echo "End Build" - - -include $(KOKKOS_PATH)/Makefile.kokkos - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - CXX = nvcc_wrapper - CXXFLAGS ?= -O3 - LINK = $(CXX) - LDFLAGS ?= -lpthread -else - CXX ?= g++ - CXXFLAGS ?= -O3 - LINK ?= $(CXX) - LDFLAGS ?= -lpthread -endif - -KOKKOS_CXXFLAGS += -I$(GTEST_PATH) -I${KOKKOS_PATH}/core/unit_test - -TEST_TARGETS = -TARGETS = - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - OBJ_CUDA = TestCuda.o UnitTestMain.o gtest-all.o - TARGETS += KokkosCore_UnitTest_Cuda - TEST_TARGETS += test-cuda -endif - -ifeq ($(KOKKOS_INTERNAL_USE_PTHREADS), 1) - OBJ_THREADS = TestThreads.o UnitTestMain.o gtest-all.o - TARGETS += KokkosCore_UnitTest_Threads - TEST_TARGETS += test-threads -endif - -ifeq ($(KOKKOS_INTERNAL_USE_OPENMP), 1) - OBJ_OPENMP = TestOpenMP.o UnitTestMain.o gtest-all.o - TARGETS += KokkosCore_UnitTest_OpenMP - TEST_TARGETS += test-openmp -endif - -ifeq ($(KOKKOS_INTERNAL_USE_SERIAL), 1) - OBJ_SERIAL = TestSerial.o UnitTestMain.o gtest-all.o - TARGETS += KokkosCore_UnitTest_Serial - TEST_TARGETS += test-serial -endif - -ifeq ($(KOKKOS_INTERNAL_USE_QTHREAD), 1) - OBJ_QTHREAD = TestQthread.o UnitTestMain.o gtest-all.o - TARGETS += KokkosCore_UnitTest_Qthread - TEST_TARGETS += test-qthread -endif - -OBJ_HWLOC = TestHWLOC.o UnitTestMain.o gtest-all.o -TARGETS += KokkosCore_UnitTest_HWLOC -TEST_TARGETS += test-hwloc - -OBJ_ALLOCATIONTRACKER = TestAllocationTracker.o UnitTestMain.o gtest-all.o -TARGETS += KokkosCore_UnitTest_AllocationTracker -TEST_TARGETS += test-allocationtracker - -OBJ_DEFAULT = TestDefaultDeviceType.o UnitTestMain.o gtest-all.o -TARGETS += KokkosCore_UnitTest_Default -TEST_TARGETS += test-default - -OBJ_DEFAULTINIT = TestDefaultDeviceTypeInit.o UnitTestMain.o gtest-all.o -TARGETS += KokkosCore_UnitTest_DefaultInit -TEST_TARGETS += test-default-init - - -KokkosCore_UnitTest_Cuda: $(OBJ_CUDA) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_CUDA) $(KOKKOS_LIBS) $(LIB) -o KokkosCore_UnitTest_Cuda - -KokkosCore_UnitTest_Threads: $(OBJ_THREADS) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_THREADS) $(KOKKOS_LIBS) $(LIB) -o KokkosCore_UnitTest_Threads - -KokkosCore_UnitTest_OpenMP: $(OBJ_OPENMP) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_OPENMP) $(KOKKOS_LIBS) $(LIB) -o KokkosCore_UnitTest_OpenMP - -KokkosCore_UnitTest_Serial: $(OBJ_SERIAL) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_SERIAL) $(KOKKOS_LIBS) $(LIB) -o KokkosCore_UnitTest_Serial - -KokkosCore_UnitTest_Qthread: $(OBJ_QTHREAD) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_QTHREAD) $(KOKKOS_LIBS) $(LIB) -o KokkosCore_UnitTest_Qthread - -KokkosCore_UnitTest_HWLOC: $(OBJ_HWLOC) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_HWLOC) $(KOKKOS_LIBS) $(LIB) -o KokkosCore_UnitTest_HWLOC - -KokkosCore_UnitTest_AllocationTracker: $(OBJ_ALLOCATIONTRACKER) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_ALLOCATIONTRACKER) $(KOKKOS_LIBS) $(LIB) -o KokkosCore_UnitTest_AllocationTracker - -KokkosCore_UnitTest_Default: $(OBJ_DEFAULT) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_DEFAULT) $(KOKKOS_LIBS) $(LIB) -o KokkosCore_UnitTest_Default - -KokkosCore_UnitTest_DefaultInit: $(OBJ_DEFAULTINIT) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_DEFAULTINIT) $(KOKKOS_LIBS) $(LIB) -o KokkosCore_UnitTest_DefaultInit - -test-cuda: KokkosCore_UnitTest_Cuda - ./KokkosCore_UnitTest_Cuda - -test-threads: KokkosCore_UnitTest_Threads - ./KokkosCore_UnitTest_Threads - -test-openmp: KokkosCore_UnitTest_OpenMP - ./KokkosCore_UnitTest_OpenMP - -test-serial: KokkosCore_UnitTest_Serial - ./KokkosCore_UnitTest_Serial - -test-qthread: KokkosCore_UnitTest_Qthread - ./KokkosCore_UnitTest_Qthread - -test-hwloc: KokkosCore_UnitTest_HWLOC - ./KokkosCore_UnitTest_HWLOC - -test-allocationtracker: KokkosCore_UnitTest_AllocationTracker - ./KokkosCore_UnitTest_AllocationTracker - -test-default: KokkosCore_UnitTest_Default - ./KokkosCore_UnitTest_Default - -test-default-init: KokkosCore_UnitTest_DefaultInit - ./KokkosCore_UnitTest_DefaultInit - -build_all: $(TARGETS) - -test: $(TEST_TARGETS) - -clean: kokkos-clean - rm -f *.o $(TARGETS) - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) $(TEST_HEADERS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< - -gtest-all.o:$(GTEST_PATH)/gtest/gtest-all.cc - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $(GTEST_PATH)/gtest/gtest-all.cc - diff --git a/lib/kokkos/core/unit_test/TestAggregate.hpp b/lib/kokkos/core/unit_test/TestAggregate.hpp deleted file mode 100644 index b16e17b4cf..0000000000 --- a/lib/kokkos/core/unit_test/TestAggregate.hpp +++ /dev/null @@ -1,753 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef TEST_AGGREGATE_HPP -#define TEST_AGGREGATE_HPP - -#include - -#include -#include -#include - -/*--------------------------------------------------------------------------*/ - -#if ! defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - -namespace Test { - -struct EmbedArray {}; - -struct ArrayProxyContiguous {}; -struct ArrayProxyStrided {}; - -template< typename T , unsigned N = 0 , class Proxy = void > -struct Array ; - -template< typename T > -struct Array -{ -public: - typedef T value_type ; - - enum { StaticLength = 0 }; - T * const value ; - const unsigned count ; - - KOKKOS_INLINE_FUNCTION - Array( T * v , unsigned n ) : value(v), count(n) {} - - template< class Proxy > - KOKKOS_INLINE_FUNCTION - Array & operator = ( const Array & rhs ) { return *this ; } -}; - -template< typename T , unsigned N > -struct Array -{ -public: - typedef T value_type ; - - enum { StaticLength = N }; - T * const value ; - - KOKKOS_INLINE_FUNCTION - Array( T * v , unsigned ) : value(v) {} - - template< class Proxy > - KOKKOS_INLINE_FUNCTION - Array & operator = ( const Array & rhs ) { return *this ; } -}; - -template< typename T , unsigned N > -struct Array -{ -public: - typedef T value_type ; - - enum { StaticLength = N }; - T * const value ; - const unsigned stride ; - - KOKKOS_INLINE_FUNCTION - Array( T * v , unsigned , unsigned s ) : value(v), stride(s) {} - - template< class Proxy > - KOKKOS_INLINE_FUNCTION - Array & operator = ( const Array & rhs ) { return *this ; } -}; - -template< typename T > -struct Array -{ -public: - typedef T value_type ; - - enum { StaticLength = 0 }; - T * const value ; - const unsigned count ; - const unsigned stride ; - - KOKKOS_INLINE_FUNCTION - Array( T * v , unsigned n , unsigned s ) : value(v), count(n), stride(s) {} - - template< class Proxy > - KOKKOS_INLINE_FUNCTION - Array & operator = ( const Array & rhs ) { return *this ; } -}; - -template< typename T > -struct Array -{ -public: - typedef T value_type ; - - enum { StaticLength = 0 }; - T * value ; - const unsigned count ; - - KOKKOS_INLINE_FUNCTION - Array() : value(0) , count(0) {} - - template< unsigned N , class Proxy > - KOKKOS_INLINE_FUNCTION - Array( const Array & rhs ) : value(rhs.value), count(N) {} -}; - -template< typename T , unsigned N > -struct Array -{ -public: - typedef T value_type ; - - enum { StaticLength = N }; - T value[N] ; - - template< class Proxy > - KOKKOS_INLINE_FUNCTION - Array & operator = ( const Array & ) { return *this ; } -}; - -} // namespace Test - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { -namespace Impl { - -template< typename T , unsigned N > -struct AnalyzeShape< Test::Array< T , N > > - : public ShapeInsert< typename AnalyzeShape< T >::shape , N >::type -{ -private: - typedef AnalyzeShape< T > nested ; -public: - - typedef Test::EmbedArray specialize ; - - typedef typename ShapeInsert< typename nested::shape , N >::type shape ; - - typedef typename nested::array_intrinsic_type array_intrinsic_type[ N ]; - typedef Test::Array< T , N > value_type ; - typedef Test::Array< T , N > type ; - - typedef const array_intrinsic_type const_array_intrinsic_type ; - typedef const value_type const_value_type ; - typedef const type const_type ; - - typedef typename nested::non_const_array_intrinsic_type non_const_array_intrinsic_type[ N ]; - typedef Test::Array< typename nested::non_const_value_type , N > non_const_value_type ; - typedef Test::Array< typename nested::non_const_value_type , N > non_const_type ; -}; - -template< typename T > -struct AnalyzeShape< Test::Array< T , 0 > > - : public ShapeInsert< typename AnalyzeShape< T >::shape , 0 >::type -{ -private: - typedef AnalyzeShape< T > nested ; -public: - - typedef Test::EmbedArray specialize ; - - typedef typename ShapeInsert< typename nested::shape , 0 >::type shape ; - - typedef typename nested::array_intrinsic_type * array_intrinsic_type ; - typedef Test::Array< T , 0 > value_type ; - typedef Test::Array< T , 0 > type ; - - typedef const array_intrinsic_type const_array_intrinsic_type ; - typedef const value_type const_value_type ; - typedef const type const_type ; - - typedef typename nested::non_const_array_intrinsic_type * non_const_array_intrinsic_type ; - typedef Test::Array< typename nested::non_const_value_type , 0 > non_const_value_type ; - typedef Test::Array< typename nested::non_const_value_type , 0 > non_const_type ; -}; - -/*--------------------------------------------------------------------------*/ - -template< class ValueType , class MemorySpace , class MemoryTraits > -struct ViewSpecialize< ValueType - , Test::EmbedArray - , LayoutLeft - , MemorySpace - , MemoryTraits > -{ typedef Test::EmbedArray type ; }; - -template< class ValueType , class MemorySpace , class MemoryTraits > -struct ViewSpecialize< ValueType - , Test::EmbedArray - , LayoutRight - , MemorySpace - , MemoryTraits > -{ typedef Test::EmbedArray type ; }; - -/*--------------------------------------------------------------------------*/ - -template<> -struct ViewAssignment< Test::EmbedArray , Test::EmbedArray , void > -{ - //------------------------------------ - /** \brief Compatible value and shape */ - - template< class DT , class DL , class DD , class DM , - class ST , class SL , class SD , class SM > - KOKKOS_INLINE_FUNCTION - ViewAssignment( View & dst - , const View & src - , const typename enable_if<( - ViewAssignable< ViewTraits , - ViewTraits >::value - )>::type * = 0 - ) - { - dst.m_offset_map.assign( src.m_offset_map ); - - dst.m_ptr_on_device = src.m_ptr_on_device ; - - dst.m_tracker = src.m_tracker; - } -}; - -template<> -struct ViewAssignment< ViewDefault , Test::EmbedArray , void > -{ - //------------------------------------ - /** \brief Compatible value and shape */ - - template< class ST , class SL , class SD , class SM > - KOKKOS_INLINE_FUNCTION - ViewAssignment( typename View::array_type & dst - , const View & src - ) - { - dst.m_offset_map.assign( src.m_offset_map ); - - dst.m_ptr_on_device = src.m_ptr_on_device ; - - dst.m_tracker = src.m_tracker; - } -}; - - -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Kokkos { - -template< class DataType , - class Arg1Type , - class Arg2Type , - class Arg3Type > -class View< DataType , Arg1Type , Arg2Type , Arg3Type , Test::EmbedArray > - : public ViewTraits< DataType , Arg1Type , Arg2Type, Arg3Type > -{ -public: - - typedef ViewTraits< DataType , Arg1Type , Arg2Type, Arg3Type > traits ; - -private: - - // Assignment of compatible views requirement: - template< class , class , class , class , class > friend class View ; - - // Assignment of compatible subview requirement: - template< class , class , class > friend struct Impl::ViewAssignment ; - - typedef Impl::ViewOffset< typename traits::shape_type , - typename traits::array_layout > offset_map_type ; - - typedef Impl::ViewDataManagement< traits > view_data_management ; - - // traits::value_type = Test::Array< T , N > - - typename traits::value_type::value_type * m_ptr_on_device ; - offset_map_type m_offset_map ; - view_data_management m_management ; - Impl::AllocationTracker m_tracker ; - -public: - - typedef View< typename traits::array_intrinsic_type , - typename traits::array_layout , - typename traits::execution_space , - typename traits::memory_traits > array_type ; - - typedef View< typename traits::non_const_data_type , - typename traits::array_layout , - typename traits::execution_space , - typename traits::memory_traits > non_const_type ; - - typedef View< typename traits::const_data_type , - typename traits::array_layout , - typename traits::execution_space , - typename traits::memory_traits > const_type ; - - typedef View< typename traits::non_const_data_type , - typename traits::array_layout , - typename traits::host_mirror_space , - void > HostMirror ; - - //------------------------------------ - // Shape - - enum { Rank = traits::rank - 1 }; - - KOKKOS_INLINE_FUNCTION typename traits::shape_type shape() const { return m_offset_map ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_0() const { return m_offset_map.N0 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_1() const { return m_offset_map.N1 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_2() const { return m_offset_map.N2 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_3() const { return m_offset_map.N3 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_4() const { return m_offset_map.N4 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_5() const { return m_offset_map.N5 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_6() const { return m_offset_map.N6 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type dimension_7() const { return m_offset_map.N7 ; } - KOKKOS_INLINE_FUNCTION typename traits::size_type size() const - { - return m_offset_map.N0 - * m_offset_map.N1 - * m_offset_map.N2 - * m_offset_map.N3 - * m_offset_map.N4 - * m_offset_map.N5 - * m_offset_map.N6 - * m_offset_map.N7 - ; - } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - typename traits::size_type dimension( const iType & i ) const - { return Impl::dimension( m_offset_map , i ); } - - //------------------------------------ - // Destructor, constructors, assignment operators: - - KOKKOS_INLINE_FUNCTION - ~View() {} - - KOKKOS_INLINE_FUNCTION - View() - : m_ptr_on_device(0) - , m_offset_map() - , m_management() - , m_tracker() - { m_offset_map.assing(0,0,0,0,0,0,0,0); } - - KOKKOS_INLINE_FUNCTION - View( const View & rhs ) - : m_ptr_on_device(0) - , m_offset_map() - , m_management() - , m_tracker() - { - (void) Impl::ViewAssignment< - typename traits::specialize , - typename traits::specialize >( *this , rhs ); - } - - KOKKOS_INLINE_FUNCTION - View & operator = ( const View & rhs ) - { - (void) Impl::ViewAssignment< - typename traits::specialize , - typename traits::specialize >( *this , rhs ); - return *this ; - } - - //------------------------------------ - // Construct or assign compatible view: - - template< class RT , class RL , class RD , class RM , class RS > - KOKKOS_INLINE_FUNCTION - View( const View & rhs ) - : m_ptr_on_device(0) - , m_offset_map() - , m_management() - , m_tracker() - { - (void) Impl::ViewAssignment< - typename traits::specialize , RS >( *this , rhs ); - } - - template< class RT , class RL , class RD , class RM , class RS > - KOKKOS_INLINE_FUNCTION - View & operator = ( const View & rhs ) - { - (void) Impl::ViewAssignment< - typename traits::specialize , RS >( *this , rhs ); - return *this ; - } - - //------------------------------------ - // Allocation of a managed view with possible alignment padding. - - template< class AllocationProperties > - explicit inline - View( const AllocationProperties & prop , - const typename Impl::ViewAllocProp< traits , AllocationProperties >::size_type n0 = 0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 ) - : m_ptr_on_device(0) - , m_offset_map() - , m_management() - , m_tracker() - { - typedef Impl::ViewAllocProp< traits , AllocationProperties > Alloc ; - - typedef typename traits::memory_space memory_space ; - typedef typename traits::value_type::value_type scalar_type ; - - m_offset_map.assign( n0, n1, n2, n3, n4, n5, n6, n7 ); - m_offset_map.set_padding(); - - m_tracker = memory_space::allocate_and_track( Alloc::label( prop ), sizeof(scalar_type) * m_offset_map.capacity() ); - - m_ptr_on_device = reinterpret_cast(m_tracker.alloc_ptr()); - - (void) Impl::ViewDefaultConstruct< typename traits::execution_space , scalar_type , Alloc::Initialize >( m_ptr_on_device , m_offset_map.capacity() ); - } - - //------------------------------------ - // Assign an unmanaged View from pointer, can be called in functors. - // No alignment padding is performed. - - typedef Impl::if_c< ! traits::is_managed , - typename traits::value_type::value_type * , - Impl::ViewError::user_pointer_constructor_requires_unmanaged > - if_user_pointer_constructor ; - - View( typename if_user_pointer_constructor::type ptr , - const size_t n0 = 0 , - const size_t n1 = 0 , - const size_t n2 = 0 , - const size_t n3 = 0 , - const size_t n4 = 0 , - const size_t n5 = 0 , - const size_t n6 = 0 , - const size_t n7 = 0 ) - : m_ptr_on_device(0) - , m_offset_map() - , m_management() - , m_tracker() - { - m_offset_map.assign( n0, n1, n2, n3, n4, n5, n6, n7 ); - m_ptr_on_device = if_user_pointer_constructor::select( ptr ); - m_management.set_unmanaged(); - } - - //------------------------------------ - // Assign unmanaged View to portion of Device shared memory - - typedef Impl::if_c< ! traits::is_managed , - typename traits::execution_space , - Impl::ViewError::device_shmem_constructor_requires_unmanaged > - if_device_shmem_constructor ; - - explicit KOKKOS_INLINE_FUNCTION - View( typename if_device_shmem_constructor::type & dev , - const unsigned n0 = 0 , - const unsigned n1 = 0 , - const unsigned n2 = 0 , - const unsigned n3 = 0 , - const unsigned n4 = 0 , - const unsigned n5 = 0 , - const unsigned n6 = 0 , - const unsigned n7 = 0 ) - : m_ptr_on_device(0) - , m_offset_map() - , m_management() - , m_tracker() - { - typedef typename traits::value_type::value_type scalar_type ; - - enum { align = 8 }; - enum { mask = align - 1 }; - - typedef Impl::if_c< ! traits::is_managed , - scalar_type * , - Impl::ViewError::device_shmem_constructor_requires_unmanaged > - if_device_shmem_pointer ; - - m_offset_map.assign( n0, n1, n2, n3, n4, n5, n6, n7 ); - - // Select the first argument: - m_ptr_on_device = if_device_shmem_pointer::select( - (scalar_type *) dev.get_shmem( unsigned( sizeof(scalar_type) * m_offset_map.capacity() + unsigned(mask) ) & ~unsigned(mask) ) ); - } - - static inline - unsigned shmem_size( const unsigned n0 = 0 , - const unsigned n1 = 0 , - const unsigned n2 = 0 , - const unsigned n3 = 0 , - const unsigned n4 = 0 , - const unsigned n5 = 0 , - const unsigned n6 = 0 , - const unsigned n7 = 0 ) - { - enum { align = 8 }; - enum { mask = align - 1 }; - - typedef typename traits::value_type::value_type scalar_type ; - - offset_map_type offset_map ; - - offset_map.assign( n0, n1, n2, n3, n4, n5, n6, n7 ); - - return unsigned( sizeof(scalar_type) * offset_map.capacity() + unsigned(mask) ) & ~unsigned(mask) ; - } - - //------------------------------------ - // Is not allocated - - KOKKOS_INLINE_FUNCTION - bool is_null() const { return 0 == m_ptr_on_device ; } - - //------------------------------------ - // LayoutLeft, rank 2: - - typedef Test::Array< typename traits::value_type::value_type , - traits::value_type::StaticLength , - Test::ArrayProxyStrided > LeftValue ; - - template< typename iType0 > - KOKKOS_INLINE_FUNCTION - typename Impl::ViewEnableArrayOper< LeftValue , traits, LayoutLeft, 2, iType0 >::type - operator[] ( const iType0 & i0 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_2( m_offset_map, i0, 0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , m_ptr_on_device ); - - return LeftValue( m_ptr_on_device + i0 , m_offset_map.N1 , m_offset_map.S0 ); - } - - template< typename iType0 > - KOKKOS_INLINE_FUNCTION - typename Impl::ViewEnableArrayOper< LeftValue , traits, LayoutLeft, 2, iType0 >::type - operator() ( const iType0 & i0 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_2( m_offset_map, i0, 0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , m_ptr_on_device ); - - return LeftValue( m_ptr_on_device + i0 , m_offset_map.N1 , m_offset_map.S0 ); - } - - template< typename iType0 > - KOKKOS_INLINE_FUNCTION - typename Impl::ViewEnableArrayOper< LeftValue , traits, LayoutLeft, 2, iType0 >::type - at( const iType0 & i0 , const int , const int , const int , - const int , const int , const int , const int ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_2( m_offset_map, i0, 0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , m_ptr_on_device ); - - return LeftValue( m_ptr_on_device + i0 , m_offset_map.N1 , m_offset_map.S0 ); - } - - //------------------------------------ - // LayoutRight, rank 2: - - typedef Test::Array< typename traits::value_type::value_type , - traits::value_type::StaticLength , - Test::ArrayProxyContiguous > RightValue ; - - template< typename iType0 > - KOKKOS_INLINE_FUNCTION - typename Impl::ViewEnableArrayOper< RightValue , traits, LayoutRight, 2, iType0 >::type - operator[] ( const iType0 & i0 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_2( m_offset_map, i0, 0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , m_ptr_on_device ); - - return RightValue( m_ptr_on_device + i0 , m_offset_map.N1 ); - } - - template< typename iType0 > - KOKKOS_INLINE_FUNCTION - typename Impl::ViewEnableArrayOper< RightValue , traits, LayoutRight, 2, iType0 >::type - operator() ( const iType0 & i0 ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_2( m_offset_map, i0, 0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , m_ptr_on_device ); - - return RightValue( m_ptr_on_device + i0 , m_offset_map.N1 ); - } - - template< typename iType0 > - KOKKOS_INLINE_FUNCTION - typename Impl::ViewEnableArrayOper< RightValue , traits, LayoutRight, 2, iType0 >::type - at( const iType0 & i0 , const int , const int , const int , - const int , const int , const int , const int ) const - { - KOKKOS_ASSERT_SHAPE_BOUNDS_2( m_offset_map, i0, 0 ); - KOKKOS_RESTRICT_EXECUTION_TO_DATA( typename traits::memory_space , m_ptr_on_device ); - - return RightValue( m_ptr_on_device + i0 , m_offset_map.N1 ); - } - - //------------------------------------ - // Access to the underlying contiguous storage of this view specialization. - // These methods are specific to specialization of a view. - - KOKKOS_INLINE_FUNCTION - typename traits::value_type::value_type * ptr_on_device() const { return m_ptr_on_device ; } - - // Stride of physical storage, dimensioned to at least Rank - template< typename iType > - KOKKOS_INLINE_FUNCTION - void stride( iType * const s ) const - { m_offset_map.stride( s ); } - - // Count of contiguously allocated data members including padding. - KOKKOS_INLINE_FUNCTION - typename traits::size_type capacity() const - { return m_offset_map.capacity(); } -}; - -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -namespace Test { - -template< class DeviceType > -int TestViewAggregate() -{ - typedef Kokkos::View< Test::Array * , DeviceType > a32_type ; - typedef typename a32_type::array_type a32_base_type ; - - typedef Kokkos::View< Test::Array * , DeviceType > a0_type ; - typedef typename a0_type::array_type a0_base_type ; - - a32_type a32("a32",100); - a32_base_type a32_base ; - - a0_type a0("a0",100,32); - a0_base_type a0_base ; - - a32_base = a32 ; - a0_base = a0 ; - - - return 0 ; -} - -} - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -#else /* #if ! defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) */ - -namespace Test { - -template< class DeviceType > -int TestViewAggregate() -{ -/* - typedef Kokkos::ViewTraits< Kokkos::Array ** , DeviceType > a32_traits ; - typedef Kokkos::ViewTraits< typename a32_traits::array_scalar_type , DeviceType > flat_traits ; - - static_assert( std::is_same< typename a32_traits::specialize , Kokkos::Array<> >::value , "" ); - static_assert( a32_traits::rank == 2 , "" ); - static_assert( a32_traits::rank_dynamic == 2 , "" ); - - static_assert( std::is_same< typename flat_traits::specialize , void >::value , "" ); - static_assert( flat_traits::rank == 3 , "" ); - static_assert( flat_traits::rank_dynamic == 2 , "" ); - static_assert( flat_traits::dimension::N2 == 32 , "" ); - - - - - typedef Kokkos::View< Kokkos::Array ** , DeviceType > a32_type ; - typedef typename a32_type::array_type a32_flat_type ; - - - static_assert( a32_type::Rank == 2 , "" ); - static_assert( a32_flat_type::Rank == 3 , "" ); -*/ - - return 0 ; -} - -} - -#endif /* #if ! defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) */ - -/*--------------------------------------------------------------------------*/ -/*--------------------------------------------------------------------------*/ - -#endif /* #ifndef TEST_AGGREGATE_HPP */ diff --git a/lib/kokkos/core/unit_test/TestAggregateReduction.hpp b/lib/kokkos/core/unit_test/TestAggregateReduction.hpp deleted file mode 100644 index 9c2a4735aa..0000000000 --- a/lib/kokkos/core/unit_test/TestAggregateReduction.hpp +++ /dev/null @@ -1,195 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef TEST_AGGREGATE_REDUCTION_HPP -#define TEST_AGGREGATE_REDUCTION_HPP - -#include - -#include -#include -#include - -namespace Test { - -template< typename T , unsigned N > -struct StaticArray { - T value[N] ; - - KOKKOS_INLINE_FUNCTION - StaticArray() - { for ( unsigned i = 0 ; i < N ; ++i ) value[i] = T(); } - - KOKKOS_INLINE_FUNCTION - StaticArray( const StaticArray & rhs ) - { for ( unsigned i = 0 ; i < N ; ++i ) value[i] = rhs.value[i]; } - - KOKKOS_INLINE_FUNCTION - operator T () { return value[0]; } - - KOKKOS_INLINE_FUNCTION - StaticArray & operator = ( const T & rhs ) - { - for ( unsigned i = 0 ; i < N ; ++i ) value[i] = rhs ; - return *this ; - } - - KOKKOS_INLINE_FUNCTION - StaticArray & operator = ( const StaticArray & rhs ) - { - for ( unsigned i = 0 ; i < N ; ++i ) value[i] = rhs.value[i] ; - return *this ; - } - - KOKKOS_INLINE_FUNCTION - StaticArray operator * ( const StaticArray & rhs ) - { - StaticArray tmp ; - for ( unsigned i = 0 ; i < N ; ++i ) tmp.value[i] = value[i] * rhs.value[i] ; - return tmp ; - } - - KOKKOS_INLINE_FUNCTION - StaticArray operator + ( const StaticArray & rhs ) - { - StaticArray tmp ; - for ( unsigned i = 0 ; i < N ; ++i ) tmp.value[i] = value[i] + rhs.value[i] ; - return tmp ; - } - - KOKKOS_INLINE_FUNCTION - StaticArray & operator += ( const StaticArray & rhs ) - { - for ( unsigned i = 0 ; i < N ; ++i ) value[i] += rhs.value[i] ; - return *this ; - } - - KOKKOS_INLINE_FUNCTION - void operator += ( const volatile StaticArray & rhs ) volatile - { - for ( unsigned i = 0 ; i < N ; ++i ) value[i] += rhs.value[i] ; - } -}; - -template< typename T , class Space > -struct DOT { - typedef T value_type ; - typedef Space execution_space ; - - Kokkos::View< value_type * , Space > a ; - Kokkos::View< value_type * , Space > b ; - - DOT( const Kokkos::View< value_type * , Space > arg_a - , const Kokkos::View< value_type * , Space > arg_b - ) - : a( arg_a ), b( arg_b ) {} - - KOKKOS_INLINE_FUNCTION - void operator()( const int i , value_type & update ) const - { - update += a(i) * b(i); - } -}; - -template< typename T , class Space > -struct FILL { - typedef T value_type ; - typedef Space execution_space ; - - Kokkos::View< value_type * , Space > a ; - Kokkos::View< value_type * , Space > b ; - - FILL( const Kokkos::View< value_type * , Space > & arg_a - , const Kokkos::View< value_type * , Space > & arg_b - ) - : a( arg_a ), b( arg_b ) {} - - KOKKOS_INLINE_FUNCTION - void operator()( const int i ) const - { - a(i) = i % 2 ? i + 1 : 1 ; - b(i) = i % 2 ? 1 : i + 1 ; - } -}; - -template< class Space > -void TestViewAggregateReduction() -{ - -#if ! defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - - const int count = 2 ; - const long result = count % 2 ? ( count * ( ( count + 1 ) / 2 ) ) - : ( ( count / 2 ) * ( count + 1 ) ); - - Kokkos::View< long * , Space > a("a",count); - Kokkos::View< long * , Space > b("b",count); - Kokkos::View< StaticArray * , Space > a4("a4",count); - Kokkos::View< StaticArray * , Space > b4("b4",count); - Kokkos::View< StaticArray * , Space > a10("a10",count); - Kokkos::View< StaticArray * , Space > b10("b10",count); - - Kokkos::parallel_for( count , FILL(a,b) ); - Kokkos::parallel_for( count , FILL< StaticArray , Space >(a4,b4) ); - Kokkos::parallel_for( count , FILL< StaticArray , Space >(a10,b10) ); - - long r = 0; - StaticArray r4 ; - StaticArray r10 ; - - Kokkos::parallel_reduce( count , DOT(a,b) , r ); - Kokkos::parallel_reduce( count , DOT< StaticArray , Space >(a4,b4) , r4 ); - Kokkos::parallel_reduce( count , DOT< StaticArray , Space >(a10,b10) , r10 ); - - ASSERT_EQ( result , r ); - for ( int i = 0 ; i < 10 ; ++i ) { ASSERT_EQ( result , r10.value[i] ); } - for ( int i = 0 ; i < 4 ; ++i ) { ASSERT_EQ( result , r4.value[i] ); } - -#endif - -} - -} - -#endif /* #ifndef TEST_AGGREGATE_REDUCTION_HPP */ - diff --git a/lib/kokkos/core/unit_test/TestAllocationTracker.cpp b/lib/kokkos/core/unit_test/TestAllocationTracker.cpp deleted file mode 100644 index 371b0ac758..0000000000 --- a/lib/kokkos/core/unit_test/TestAllocationTracker.cpp +++ /dev/null @@ -1,145 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include - -#include - -#include -#include - -namespace Test { - -class alocation_tracker : public ::testing::Test { -protected: - static void SetUpTestCase() - { - Kokkos::initialize(); - } - - static void TearDownTestCase() - { - Kokkos::finalize(); - } -}; - -TEST_F( alocation_tracker, simple) -{ - using namespace Kokkos::Impl; - - { - AllocationTracker tracker; - EXPECT_FALSE( tracker.is_valid() ); - } - - // test ref count and label - { - int size = 100; - std::vector trackers(size); - - trackers[0] = AllocationTracker( MallocAllocator(), 128,"Test"); - - for (int i=0; i trackers(num_allocs); - - for (int i=0; i ref_trackers(ref_count); - for (unsigned j=0; j("Forced Leak", 4096*10); -#endif -} - -TEST_F( alocation_tracker, disable_reference_counting) -{ - using namespace Kokkos::Impl; - // test ref count and label - { - int size = 100; - std::vector trackers(size); - - trackers[0] = AllocationTracker( MallocAllocator(), 128,"Test"); - - for (int i=1; i - -namespace TestAtomic { - -// Struct for testing arbitrary size atomics - -template -struct SuperScalar { - double val[N]; - - KOKKOS_INLINE_FUNCTION - SuperScalar() { - for(int i=0; i -std::ostream& operator<<(std::ostream& os, const SuperScalar& dt) -{ - os << "{ "; - for(int i=0;i -struct ZeroFunctor { - typedef DEVICE_TYPE execution_space; - typedef typename Kokkos::View type; - typedef typename Kokkos::View::HostMirror h_type; - type data; - KOKKOS_INLINE_FUNCTION - void operator()(int) const { - data() = 0; - } -}; - -//--------------------------------------------------- -//--------------atomic_fetch_add--------------------- -//--------------------------------------------------- - -template -struct AddFunctor{ - typedef DEVICE_TYPE execution_space; - typedef Kokkos::View type; - type data; - - KOKKOS_INLINE_FUNCTION - void operator()(int) const { - Kokkos::atomic_fetch_add(&data(),(T)1); - } -}; - -template -T AddLoop(int loop) { - struct ZeroFunctor f_zero; - typename ZeroFunctor::type data("Data"); - typename ZeroFunctor::h_type h_data("HData"); - f_zero.data = data; - Kokkos::parallel_for(1,f_zero); - execution_space::fence(); - - struct AddFunctor f_add; - f_add.data = data; - Kokkos::parallel_for(loop,f_add); - execution_space::fence(); - - Kokkos::deep_copy(h_data,data); - T val = h_data(); - return val; -} - -template -T AddLoopSerial(int loop) { - T* data = new T[1]; - data[0] = 0; - - for(int i=0;i -struct CASFunctor{ - typedef DEVICE_TYPE execution_space; - typedef Kokkos::View type; - type data; - - KOKKOS_INLINE_FUNCTION - void operator()(int) const { - T old = data(); - T newval, assumed; - do { - assumed = old; - newval = assumed + (T)1; - old = Kokkos::atomic_compare_exchange(&data(), assumed, newval); - } - while( old != assumed ); - } -}; - -template -T CASLoop(int loop) { - struct ZeroFunctor f_zero; - typename ZeroFunctor::type data("Data"); - typename ZeroFunctor::h_type h_data("HData"); - f_zero.data = data; - Kokkos::parallel_for(1,f_zero); - execution_space::fence(); - - struct CASFunctor f_cas; - f_cas.data = data; - Kokkos::parallel_for(loop,f_cas); - execution_space::fence(); - - Kokkos::deep_copy(h_data,data); - T val = h_data(); - - return val; -} - -template -T CASLoopSerial(int loop) { - T* data = new T[1]; - data[0] = 0; - - for(int i=0;i -struct ExchFunctor{ - typedef DEVICE_TYPE execution_space; - typedef Kokkos::View type; - type data, data2; - - KOKKOS_INLINE_FUNCTION - void operator()(int i) const { - T old = Kokkos::atomic_exchange(&data(),(T)i); - Kokkos::atomic_fetch_add(&data2(),old); - } -}; - -template -T ExchLoop(int loop) { - struct ZeroFunctor f_zero; - typename ZeroFunctor::type data("Data"); - typename ZeroFunctor::h_type h_data("HData"); - f_zero.data = data; - Kokkos::parallel_for(1,f_zero); - execution_space::fence(); - - typename ZeroFunctor::type data2("Data"); - typename ZeroFunctor::h_type h_data2("HData"); - f_zero.data = data2; - Kokkos::parallel_for(1,f_zero); - execution_space::fence(); - - struct ExchFunctor f_exch; - f_exch.data = data; - f_exch.data2 = data2; - Kokkos::parallel_for(loop,f_exch); - execution_space::fence(); - - Kokkos::deep_copy(h_data,data); - Kokkos::deep_copy(h_data2,data2); - T val = h_data() + h_data2(); - - return val; -} - -template -T ExchLoopSerial(int loop) { - T* data = new T[1]; - T* data2 = new T[1]; - data[0] = 0; - data2[0] = 0; - for(int i=0;i -T LoopVariant(int loop, int test) { - switch (test) { - case 1: return AddLoop(loop); - case 2: return CASLoop(loop); - case 3: return ExchLoop(loop); - } - return 0; -} - -template -T LoopVariantSerial(int loop, int test) { - switch (test) { - case 1: return AddLoopSerial(loop); - case 2: return CASLoopSerial(loop); - case 3: return ExchLoopSerial(loop); - } - return 0; -} - -template -bool Loop(int loop, int test) -{ - T res = LoopVariant(loop,test); - T resSerial = LoopVariantSerial(loop,test); - - bool passed = true; - - if ( resSerial != res ) { - passed = false; - - std::cout << "Loop<" - << typeid(T).name() - << ">( test = " - << test << " FAILED : " - << resSerial << " != " << res - << std::endl ; - } - - - return passed ; -} - -} - diff --git a/lib/kokkos/core/unit_test/TestCXX11.hpp b/lib/kokkos/core/unit_test/TestCXX11.hpp deleted file mode 100644 index f48c76de50..0000000000 --- a/lib/kokkos/core/unit_test/TestCXX11.hpp +++ /dev/null @@ -1,319 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ -#include - -namespace TestCXX11 { - -template -struct FunctorAddTest{ - typedef Kokkos::View view_type; - view_type a_, b_; - typedef DeviceType execution_space; - FunctorAddTest(view_type & a, view_type &b):a_(a),b_(b) {} - void operator() (const int& i) const { - b_(i,0) = a_(i,1) + a_(i,2); - b_(i,1) = a_(i,0) - a_(i,3); - b_(i,2) = a_(i,4) + a_(i,0); - b_(i,3) = a_(i,2) - a_(i,1); - b_(i,4) = a_(i,3) + a_(i,4); - } - - typedef typename Kokkos::TeamPolicy< execution_space >::member_type team_member ; - void operator() (const team_member & dev) const { - int i = dev.league_rank()*dev.team_size() + dev.team_rank(); - b_(i,0) = a_(i,1) + a_(i,2); - b_(i,1) = a_(i,0) - a_(i,3); - b_(i,2) = a_(i,4) + a_(i,0); - b_(i,3) = a_(i,2) - a_(i,1); - b_(i,4) = a_(i,3) + a_(i,4); - } -}; - -template -double AddTestFunctor() { - - typedef Kokkos::TeamPolicy policy_type ; - - Kokkos::View a("A",100,5); - Kokkos::View b("B",100,5); - typename Kokkos::View::HostMirror h_a = Kokkos::create_mirror_view(a); - typename Kokkos::View::HostMirror h_b = Kokkos::create_mirror_view(b); - - for(int i=0;i<100;i++) { - for(int j=0;j<5;j++) - h_a(i,j) = 0.1*i/(1.1*j+1.0) + 0.5*j; - } - Kokkos::deep_copy(a,h_a); - - if(PWRTest==false) - Kokkos::parallel_for(100,FunctorAddTest(a,b)); - else - Kokkos::parallel_for(policy_type(25,4),FunctorAddTest(a,b)); - Kokkos::deep_copy(h_b,b); - - double result = 0; - for(int i=0;i<100;i++) { - for(int j=0;j<5;j++) - result += h_b(i,j); - } - - return result; -} - - - -#if defined (KOKKOS_HAVE_CXX11_DISPATCH_LAMBDA) -template -double AddTestLambda() { - - typedef Kokkos::TeamPolicy policy_type ; - - Kokkos::View a("A",100,5); - Kokkos::View b("B",100,5); - typename Kokkos::View::HostMirror h_a = Kokkos::create_mirror_view(a); - typename Kokkos::View::HostMirror h_b = Kokkos::create_mirror_view(b); - - for(int i=0;i<100;i++) { - for(int j=0;j<5;j++) - h_a(i,j) = 0.1*i/(1.1*j+1.0) + 0.5*j; - } - Kokkos::deep_copy(a,h_a); - - if(PWRTest==false) { - Kokkos::parallel_for(100,[=](const int& i) { - b(i,0) = a(i,1) + a(i,2); - b(i,1) = a(i,0) - a(i,3); - b(i,2) = a(i,4) + a(i,0); - b(i,3) = a(i,2) - a(i,1); - b(i,4) = a(i,3) + a(i,4); - }); - } else { - typedef typename policy_type::member_type team_member ; - Kokkos::parallel_for(policy_type(25,4),[=](const team_member & dev) { - int i = dev.league_rank()*dev.team_size() + dev.team_rank(); - b(i,0) = a(i,1) + a(i,2); - b(i,1) = a(i,0) - a(i,3); - b(i,2) = a(i,4) + a(i,0); - b(i,3) = a(i,2) - a(i,1); - b(i,4) = a(i,3) + a(i,4); - }); - } - Kokkos::deep_copy(h_b,b); - - double result = 0; - for(int i=0;i<100;i++) { - for(int j=0;j<5;j++) - result += h_b(i,j); - } - - return result; -} - -#else -template -double AddTestLambda() { - return AddTestFunctor(); -} -#endif - - -template -struct FunctorReduceTest{ - typedef Kokkos::View view_type; - view_type a_; - typedef DeviceType execution_space; - typedef double value_type; - FunctorReduceTest(view_type & a):a_(a) {} - - KOKKOS_INLINE_FUNCTION - void operator() (const int& i, value_type& sum) const { - sum += a_(i,1) + a_(i,2); - sum += a_(i,0) - a_(i,3); - sum += a_(i,4) + a_(i,0); - sum += a_(i,2) - a_(i,1); - sum += a_(i,3) + a_(i,4); - } - - typedef typename Kokkos::TeamPolicy< execution_space >::member_type team_member ; - - KOKKOS_INLINE_FUNCTION - void operator() (const team_member & dev, value_type& sum) const { - int i = dev.league_rank()*dev.team_size() + dev.team_rank(); - sum += a_(i,1) + a_(i,2); - sum += a_(i,0) - a_(i,3); - sum += a_(i,4) + a_(i,0); - sum += a_(i,2) - a_(i,1); - sum += a_(i,3) + a_(i,4); - } - KOKKOS_INLINE_FUNCTION - void init(value_type& update) const {update = 0.0;} - KOKKOS_INLINE_FUNCTION - void join(volatile value_type& update, volatile value_type const& input) const {update += input;} -}; - -template -double ReduceTestFunctor() { - - typedef Kokkos::TeamPolicy policy_type ; - typedef Kokkos::View view_type ; - typedef Kokkos::View unmanaged_result ; - - view_type a("A",100,5); - typename view_type::HostMirror h_a = Kokkos::create_mirror_view(a); - - for(int i=0;i<100;i++) { - for(int j=0;j<5;j++) - h_a(i,j) = 0.1*i/(1.1*j+1.0) + 0.5*j; - } - Kokkos::deep_copy(a,h_a); - - double result = 0.0; - if(PWRTest==false) - Kokkos::parallel_reduce(100,FunctorReduceTest(a), unmanaged_result( & result )); - else - Kokkos::parallel_reduce(policy_type(25,4),FunctorReduceTest(a), unmanaged_result( & result )); - - return result; -} - -#if defined (KOKKOS_HAVE_CXX11_DISPATCH_LAMBDA) -template -double ReduceTestLambda() { - - typedef Kokkos::TeamPolicy policy_type ; - typedef Kokkos::View view_type ; - typedef Kokkos::View unmanaged_result ; - - view_type a("A",100,5); - typename view_type::HostMirror h_a = Kokkos::create_mirror_view(a); - - for(int i=0;i<100;i++) { - for(int j=0;j<5;j++) - h_a(i,j) = 0.1*i/(1.1*j+1.0) + 0.5*j; - } - Kokkos::deep_copy(a,h_a); - - double result = 0.0; - - if(PWRTest==false) { - Kokkos::parallel_reduce(100,[=](const int& i, double& sum) { - sum += a(i,1) + a(i,2); - sum += a(i,0) - a(i,3); - sum += a(i,4) + a(i,0); - sum += a(i,2) - a(i,1); - sum += a(i,3) + a(i,4); - }, unmanaged_result( & result ) ); - } else { - typedef typename policy_type::member_type team_member ; - Kokkos::parallel_reduce(policy_type(25,4),[=](const team_member & dev, double& sum) { - int i = dev.league_rank()*dev.team_size() + dev.team_rank(); - sum += a(i,1) + a(i,2); - sum += a(i,0) - a(i,3); - sum += a(i,4) + a(i,0); - sum += a(i,2) - a(i,1); - sum += a(i,3) + a(i,4); - }, unmanaged_result( & result ) ); - } - - return result; -} - -#else -template -double ReduceTestLambda() { - return ReduceTestFunctor(); -} -#endif - -template -double TestVariantLambda(int test) { - switch (test) { - case 1: return AddTestLambda(); - case 2: return AddTestLambda(); - case 3: return ReduceTestLambda(); - case 4: return ReduceTestLambda(); - } - return 0; -} - - -template -double TestVariantFunctor(int test) { - switch (test) { - case 1: return AddTestFunctor(); - case 2: return AddTestFunctor(); - case 3: return ReduceTestFunctor(); - case 4: return ReduceTestFunctor(); - } - return 0; -} - -template -bool Test(int test) { - -#ifdef KOKKOS_HAVE_CXX11_DISPATCH_LAMBDA - double res_functor = TestVariantFunctor(test); - double res_lambda = TestVariantLambda(test); - - char testnames[5][256] = {" " - ,"AddTest","AddTest TeamPolicy" - ,"ReduceTest","ReduceTest TeamPolicy" - }; - bool passed = true; - - if ( res_functor != res_lambda ) { - passed = false; - - std::cout << "CXX11 ( test = '" - << testnames[test] << "' FAILED : " - << res_functor << " != " << res_lambda - << std::endl ; - } - - return passed ; -#else - return true; -#endif -} - -} diff --git a/lib/kokkos/core/unit_test/TestCXX11Deduction.hpp b/lib/kokkos/core/unit_test/TestCXX11Deduction.hpp deleted file mode 100644 index 359e17a44f..0000000000 --- a/lib/kokkos/core/unit_test/TestCXX11Deduction.hpp +++ /dev/null @@ -1,94 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ -#include - -#ifndef TESTCXX11DEDUCTION_HPP -#define TESTCXX11DEDUCTION_HPP - -namespace TestCXX11 { - -struct TestReductionDeductionTagA {}; -struct TestReductionDeductionTagB {}; - -template < class ExecSpace > -struct TestReductionDeductionFunctor { - - // KOKKOS_INLINE_FUNCTION - // void operator()( long i , long & value ) const - // { value += i + 1 ; } - - KOKKOS_INLINE_FUNCTION - void operator()( TestReductionDeductionTagA , long i , long & value ) const - { value += ( 2 * i + 1 ) + ( 2 * i + 2 ); } - - KOKKOS_INLINE_FUNCTION - void operator()( const TestReductionDeductionTagB & , const long i , long & value ) const - { value += ( 3 * i + 1 ) + ( 3 * i + 2 ) + ( 3 * i + 3 ) ; } - -}; - -template< class ExecSpace > -void test_reduction_deduction() -{ - typedef TestReductionDeductionFunctor< ExecSpace > Functor ; - - const long N = 50 ; - // const long answer = N % 2 ? ( N * ((N+1)/2 )) : ( (N/2) * (N+1) ); - const long answerA = N % 2 ? ( (2*N) * (((2*N)+1)/2 )) : ( ((2*N)/2) * ((2*N)+1) ); - const long answerB = N % 2 ? ( (3*N) * (((3*N)+1)/2 )) : ( ((3*N)/2) * ((3*N)+1) ); - long result = 0 ; - - // Kokkos::parallel_reduce( Kokkos::RangePolicy(0,N) , Functor() , result ); - // ASSERT_EQ( answer , result ); - - Kokkos::parallel_reduce( Kokkos::RangePolicy(0,N) , Functor() , result ); - ASSERT_EQ( answerA , result ); - - Kokkos::parallel_reduce( Kokkos::RangePolicy(0,N) , Functor() , result ); - ASSERT_EQ( answerB , result ); -} - -} - -#endif - diff --git a/lib/kokkos/core/unit_test/TestCompilerMacros.hpp b/lib/kokkos/core/unit_test/TestCompilerMacros.hpp deleted file mode 100644 index dfa2250c04..0000000000 --- a/lib/kokkos/core/unit_test/TestCompilerMacros.hpp +++ /dev/null @@ -1,93 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#define KOKKOS_PRAGMA_UNROLL(a) - -namespace TestCompilerMacros { - -template -struct AddFunctor { - typedef DEVICE_TYPE execution_space; - typedef typename Kokkos::View type; - type a,b; - int length; - - AddFunctor(type a_, type b_):a(a_),b(b_),length(a.dimension_1()) {} - - KOKKOS_INLINE_FUNCTION - void operator()(int i) const { -#ifdef KOKKOS_HAVE_PRAGMA_UNROLL - #pragma unroll -#endif -#ifdef KOKKOS_HAVE_PRAGMA_IVDEP - #pragma ivdep -#endif -#ifdef KOKKOS_HAVE_PRAGMA_VECTOR - #pragma vector always -#endif -#ifdef KOKKOS_HAVE_PRAGMA_LOOPCOUNT - #pragma loop count(128) -#endif -#ifdef KOKKOS_HAVE_PRAGMA_SIMD - #pragma simd -#endif - for(int j=0;j -bool Test() { - typedef typename Kokkos::View type; - type a("A",1024,128); - type b("B",1024,128); - - AddFunctor f(a,b); - Kokkos::parallel_for(1024,f); - DeviceType::fence(); - return true; -} - -} diff --git a/lib/kokkos/core/unit_test/TestCuda.cpp b/lib/kokkos/core/unit_test/TestCuda.cpp deleted file mode 100644 index 17c757f2b9..0000000000 --- a/lib/kokkos/core/unit_test/TestCuda.cpp +++ /dev/null @@ -1,491 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#include - -//---------------------------------------------------------------------------- - -#include -#include - -//---------------------------------------------------------------------------- - -#include -#include - -#include -#include - -#include -#include - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -class cuda : public ::testing::Test { -protected: - static void SetUpTestCase() - { - Kokkos::Cuda::print_configuration( std::cout ); - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice(0) ); - } - static void TearDownTestCase() - { - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); - } -}; - -//---------------------------------------------------------------------------- - -namespace Test { - -__global__ -void test_abort() -{ - Kokkos::Impl::VerifyExecutionCanAccessMemorySpace< - Kokkos::CudaSpace , - Kokkos::HostSpace >::verify(); -} - -__global__ -void test_cuda_spaces_int_value( int * ptr ) -{ - if ( *ptr == 42 ) { *ptr = 2 * 42 ; } -} - - -TEST_F( cuda , compiler_macros ) -{ - ASSERT_TRUE( ( TestCompilerMacros::Test< Kokkos::Cuda >() ) ); -} - -TEST_F( cuda , memory_space ) -{ - TestMemorySpace< Kokkos::Cuda >(); -} - -TEST_F( cuda, spaces ) -{ - if ( Kokkos::CudaUVMSpace::available() ) { - - Kokkos::Impl::AllocationTracker tracker = Kokkos::CudaUVMSpace::allocate_and_track("uvm_ptr",sizeof(int)); - - int * uvm_ptr = (int*) tracker.alloc_ptr(); - - *uvm_ptr = 42 ; - - Kokkos::Cuda::fence(); - test_cuda_spaces_int_value<<<1,1>>>(uvm_ptr); - Kokkos::Cuda::fence(); - - EXPECT_EQ( *uvm_ptr, int(2*42) ); - - } -} - -//---------------------------------------------------------------------------- - -TEST_F( cuda , impl_shared_alloc ) -{ - test_shared_alloc< Kokkos::CudaSpace , Kokkos::HostSpace::execution_space >(); - test_shared_alloc< Kokkos::CudaUVMSpace , Kokkos::HostSpace::execution_space >(); - test_shared_alloc< Kokkos::CudaHostPinnedSpace , Kokkos::HostSpace::execution_space >(); -} - -TEST_F( cuda , impl_view_mapping ) -{ - test_view_mapping< Kokkos::Cuda >(); - test_view_mapping_subview< Kokkos::Cuda >(); - test_view_mapping_operator< Kokkos::Cuda >(); - TestViewMappingAtomic< Kokkos::Cuda >::run(); -} - -template< class MemSpace > -struct TestViewCudaTexture { - - enum { N = 1000 }; - - using V = Kokkos::Experimental::View ; - using T = Kokkos::Experimental::View ; - - V m_base ; - T m_tex ; - - struct TagInit {}; - struct TagTest {}; - - KOKKOS_INLINE_FUNCTION - void operator()( const TagInit & , const int i ) const { m_base[i] = i + 1 ; } - - KOKKOS_INLINE_FUNCTION - void operator()( const TagTest & , const int i , long & error_count ) const - { if ( m_tex[i] != i + 1 ) ++error_count ; } - - TestViewCudaTexture() - : m_base("base",N) - , m_tex( m_base ) - {} - - static void run() - { - EXPECT_TRUE( ( std::is_same< typename V::reference_type - , double & - >::value ) ); - - EXPECT_TRUE( ( std::is_same< typename T::reference_type - , const double - >::value ) ); - - EXPECT_TRUE( V::reference_type_is_lvalue_reference ); // An ordinary view - EXPECT_FALSE( T::reference_type_is_lvalue_reference ); // Texture fetch returns by value - - TestViewCudaTexture self ; - Kokkos::parallel_for( Kokkos::RangePolicy< Kokkos::Cuda , TagInit >(0,N) , self ); - long error_count = -1 ; - Kokkos::parallel_reduce( Kokkos::RangePolicy< Kokkos::Cuda , TagTest >(0,N) , self , error_count ); - EXPECT_EQ( error_count , 0 ); - } -}; - - -TEST_F( cuda , impl_view_texture ) -{ - TestViewCudaTexture< Kokkos::CudaSpace >::run(); - TestViewCudaTexture< Kokkos::CudaUVMSpace >::run(); -} - -template< class MemSpace , class ExecSpace > -struct TestViewCudaAccessible { - - enum { N = 1000 }; - - using V = Kokkos::Experimental::View ; - - V m_base ; - - struct TagInit {}; - struct TagTest {}; - - KOKKOS_INLINE_FUNCTION - void operator()( const TagInit & , const int i ) const { m_base[i] = i + 1 ; } - - KOKKOS_INLINE_FUNCTION - void operator()( const TagTest & , const int i , long & error_count ) const - { if ( m_base[i] != i + 1 ) ++error_count ; } - - TestViewCudaAccessible() - : m_base("base",N) - {} - - static void run() - { - TestViewCudaAccessible self ; - Kokkos::parallel_for( Kokkos::RangePolicy< typename MemSpace::execution_space , TagInit >(0,N) , self ); - MemSpace::execution_space::fence(); - // Next access is a different execution space, must complete prior kernel. - long error_count = -1 ; - Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace , TagTest >(0,N) , self , error_count ); - EXPECT_EQ( error_count , 0 ); - } -}; - - -TEST_F( cuda , impl_view_accessible ) -{ - TestViewCudaAccessible< Kokkos::CudaSpace , Kokkos::Cuda >::run(); - - TestViewCudaAccessible< Kokkos::CudaUVMSpace , Kokkos::Cuda >::run(); - TestViewCudaAccessible< Kokkos::CudaUVMSpace , Kokkos::HostSpace::execution_space >::run(); - - TestViewCudaAccessible< Kokkos::CudaHostPinnedSpace , Kokkos::Cuda >::run(); - TestViewCudaAccessible< Kokkos::CudaHostPinnedSpace , Kokkos::HostSpace::execution_space >::run(); -} - -//---------------------------------------------------------------------------- - -TEST_F( cuda, view_impl ) -{ - // test_abort<<<32,32>>>(); // Aborts the kernel with CUDA version 4.1 or greater - - test_view_impl< Kokkos::Cuda >(); -} - -TEST_F( cuda, view_api ) -{ - typedef Kokkos::View< const int * , Kokkos::Cuda , Kokkos::MemoryTraits< Kokkos::RandomAccess > > view_texture_managed ; - typedef Kokkos::View< const int * , Kokkos::Cuda , Kokkos::MemoryTraits< Kokkos::RandomAccess | Kokkos::Unmanaged > > view_texture_unmanaged ; - - TestViewAPI< double , Kokkos::Cuda >(); - -#if 0 - Kokkos::View x("x"); - Kokkos::View y("y"); - // *x = 10 ; - // x() = 10 ; - // y[0] = 10 ; - // y(0) = 10 ; -#endif -} - -TEST_F( cuda, view_subview_auto_1d_left ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutLeft,Kokkos::Cuda >(); -} - -TEST_F( cuda, view_subview_auto_1d_right ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutRight,Kokkos::Cuda >(); -} - -TEST_F( cuda, view_subview_auto_1d_stride ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutStride,Kokkos::Cuda >(); -} - -TEST_F( cuda, view_subview_assign_strided ) { - TestViewSubview::test_1d_strided_assignment< Kokkos::Cuda >(); -} - -TEST_F( cuda, view_subview_left_0 ) { - TestViewSubview::test_left_0< Kokkos::CudaUVMSpace >(); -} - -TEST_F( cuda, view_subview_left_1 ) { - TestViewSubview::test_left_1< Kokkos::CudaUVMSpace >(); -} - -TEST_F( cuda, view_subview_left_2 ) { - TestViewSubview::test_left_2< Kokkos::CudaUVMSpace >(); -} - -TEST_F( cuda, view_subview_left_3 ) { - TestViewSubview::test_left_3< Kokkos::CudaUVMSpace >(); -} - -TEST_F( cuda, view_subview_right_0 ) { - TestViewSubview::test_right_0< Kokkos::CudaUVMSpace >(); -} - -TEST_F( cuda, view_subview_right_1 ) { - TestViewSubview::test_right_1< Kokkos::CudaUVMSpace >(); -} - -TEST_F( cuda, view_subview_right_3 ) { - TestViewSubview::test_right_3< Kokkos::CudaUVMSpace >(); -} - - - - -TEST_F( cuda, range_tag ) -{ - TestRange< Kokkos::Cuda >::test_for(1000); - TestRange< Kokkos::Cuda >::test_reduce(1000); - TestRange< Kokkos::Cuda >::test_scan(1000); -} - -TEST_F( cuda, team_tag ) -{ - TestTeamPolicy< Kokkos::Cuda >::test_for(1000); - TestTeamPolicy< Kokkos::Cuda >::test_reduce(1000); -} - -TEST_F( cuda, reduce ) -{ - TestReduce< long , Kokkos::Cuda >( 10000000 ); - TestReduce< double , Kokkos::Cuda >( 1000000 ); -} - -TEST_F( cuda, reduce_team ) -{ - TestReduceTeam< long , Kokkos::Cuda >( 10000000 ); - TestReduceTeam< double , Kokkos::Cuda >( 1000000 ); -} - -TEST_F( cuda, shared_team ) -{ - TestSharedTeam< Kokkos::Cuda >(); -} - -TEST_F( cuda, reduce_dynamic ) -{ - TestReduceDynamic< long , Kokkos::Cuda >( 10000000 ); - TestReduceDynamic< double , Kokkos::Cuda >( 1000000 ); -} - -TEST_F( cuda, reduce_dynamic_view ) -{ - TestReduceDynamicView< long , Kokkos::Cuda >( 10000000 ); - TestReduceDynamicView< double , Kokkos::Cuda >( 1000000 ); -} - -TEST_F( cuda, atomic ) -{ - const int loop_count = 1e3 ; - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(100,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,3) ) ); -} - -//---------------------------------------------------------------------------- - -TEST_F( cuda, tile_layout) -{ - TestTile::test< Kokkos::Cuda , 1 , 1 >( 1 , 1 ); - TestTile::test< Kokkos::Cuda , 1 , 1 >( 2 , 3 ); - TestTile::test< Kokkos::Cuda , 1 , 1 >( 9 , 10 ); - - TestTile::test< Kokkos::Cuda , 2 , 2 >( 1 , 1 ); - TestTile::test< Kokkos::Cuda , 2 , 2 >( 2 , 3 ); - TestTile::test< Kokkos::Cuda , 2 , 2 >( 4 , 4 ); - TestTile::test< Kokkos::Cuda , 2 , 2 >( 9 , 9 ); - - TestTile::test< Kokkos::Cuda , 2 , 4 >( 9 , 9 ); - TestTile::test< Kokkos::Cuda , 4 , 4 >( 9 , 9 ); - - TestTile::test< Kokkos::Cuda , 4 , 4 >( 1 , 1 ); - TestTile::test< Kokkos::Cuda , 4 , 4 >( 4 , 4 ); - TestTile::test< Kokkos::Cuda , 4 , 4 >( 9 , 9 ); - TestTile::test< Kokkos::Cuda , 4 , 4 >( 9 , 11 ); - - TestTile::test< Kokkos::Cuda , 8 , 8 >( 1 , 1 ); - TestTile::test< Kokkos::Cuda , 8 , 8 >( 4 , 4 ); - TestTile::test< Kokkos::Cuda , 8 , 8 >( 9 , 9 ); - TestTile::test< Kokkos::Cuda , 8 , 8 >( 9 , 11 ); -} - -TEST_F( cuda , view_aggregate ) -{ - TestViewAggregate< Kokkos::Cuda >(); - TestViewAggregateReduction< Kokkos::Cuda >(); -} - - -TEST_F( cuda , scan ) -{ - TestScan< Kokkos::Cuda >::test_range( 1 , 1000 ); - TestScan< Kokkos::Cuda >( 1000000 ); - TestScan< Kokkos::Cuda >( 10000000 ); - Kokkos::Cuda::fence(); -} - -TEST_F( cuda , team_scan ) -{ - TestScanTeam< Kokkos::Cuda >( 10 ); - TestScanTeam< Kokkos::Cuda >( 10000 ); -} - -} - -//---------------------------------------------------------------------------- - -TEST_F( cuda , template_meta_functions ) -{ - TestTemplateMetaFunctions(); -} - -//---------------------------------------------------------------------------- - -namespace Test { - -TEST_F( cuda , reduction_deduction ) -{ - TestCXX11::test_reduction_deduction< Kokkos::Cuda >(); -} - -TEST_F( cuda , team_vector ) -{ - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Cuda >(0) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Cuda >(1) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Cuda >(2) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Cuda >(3) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Cuda >(4) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Cuda >(5) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Cuda >(6) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Cuda >(7) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Cuda >(8) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Cuda >(9) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Cuda >(10) ) ); -} - -} - diff --git a/lib/kokkos/core/unit_test/TestDefaultDeviceType.cpp b/lib/kokkos/core/unit_test/TestDefaultDeviceType.cpp deleted file mode 100644 index 73e5bf85ae..0000000000 --- a/lib/kokkos/core/unit_test/TestDefaultDeviceType.cpp +++ /dev/null @@ -1,248 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#if !defined(KOKKOS_HAVE_CUDA) || defined(__CUDACC__) -//---------------------------------------------------------------------------- - -#include -#include - -#include - -#include -#include -#include -#include -#include -#include -#include - -namespace Test { - -class defaultdevicetype : public ::testing::Test { -protected: - static void SetUpTestCase() - { - Kokkos::initialize(); - } - - static void TearDownTestCase() - { - Kokkos::finalize(); - } -}; - - -TEST_F( defaultdevicetype, view_impl) { - test_view_impl< Kokkos::DefaultExecutionSpace >(); -} - -TEST_F( defaultdevicetype, view_api) { - TestViewAPI< double , Kokkos::DefaultExecutionSpace >(); -} - -TEST_F( defaultdevicetype, long_reduce) { - TestReduce< long , Kokkos::DefaultExecutionSpace >( 100000 ); -} - -TEST_F( defaultdevicetype, double_reduce) { - TestReduce< double , Kokkos::DefaultExecutionSpace >( 100000 ); -} - -TEST_F( defaultdevicetype, long_reduce_dynamic ) { - TestReduceDynamic< long , Kokkos::DefaultExecutionSpace >( 100000 ); -} - -TEST_F( defaultdevicetype, double_reduce_dynamic ) { - TestReduceDynamic< double , Kokkos::DefaultExecutionSpace >( 100000 ); -} - -TEST_F( defaultdevicetype, long_reduce_dynamic_view ) { - TestReduceDynamicView< long , Kokkos::DefaultExecutionSpace >( 100000 ); -} - - -TEST_F( defaultdevicetype , atomics ) -{ - const int loop_count = 1e4 ; - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(100,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,3) ) ); -} - -/*TEST_F( defaultdevicetype , view_remap ) -{ - enum { N0 = 3 , N1 = 2 , N2 = 8 , N3 = 9 }; - - typedef Kokkos::View< double*[N1][N2][N3] , - Kokkos::LayoutRight , - Kokkos::DefaultExecutionSpace > output_type ; - - typedef Kokkos::View< int**[N2][N3] , - Kokkos::LayoutLeft , - Kokkos::DefaultExecutionSpace > input_type ; - - typedef Kokkos::View< int*[N0][N2][N3] , - Kokkos::LayoutLeft , - Kokkos::DefaultExecutionSpace > diff_type ; - - output_type output( "output" , N0 ); - input_type input ( "input" , N0 , N1 ); - diff_type diff ( "diff" , N0 ); - - int value = 0 ; - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i0 = 0 ; i0 < N0 ; ++i0 ) { - input(i0,i1,i2,i3) = ++value ; - }}}} - - // Kokkos::deep_copy( diff , input ); // throw with incompatible shape - Kokkos::deep_copy( output , input ); - - value = 0 ; - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i0 = 0 ; i0 < N0 ; ++i0 ) { - ++value ; - ASSERT_EQ( value , ((int) output(i0,i1,i2,i3) ) ); - }}}} -}*/ - -//---------------------------------------------------------------------------- - - -TEST_F( defaultdevicetype , view_aggregate ) -{ - TestViewAggregate< Kokkos::DefaultExecutionSpace >(); -} - -//---------------------------------------------------------------------------- - -TEST_F( defaultdevicetype , scan ) -{ - TestScan< Kokkos::DefaultExecutionSpace >::test_range( 1 , 1000 ); - TestScan< Kokkos::DefaultExecutionSpace >( 1000000 ); - TestScan< Kokkos::DefaultExecutionSpace >( 10000000 ); - Kokkos::DefaultExecutionSpace::fence(); -} - - -TEST_F( defaultdevicetype , team_scan ) -{ - TestScanTeam< Kokkos::DefaultExecutionSpace >( 10 ); - TestScanTeam< Kokkos::DefaultExecutionSpace >( 10000 ); -} - -//---------------------------------------------------------------------------- - -TEST_F( defaultdevicetype , compiler_macros ) -{ - ASSERT_TRUE( ( TestCompilerMacros::Test< Kokkos::DefaultExecutionSpace >() ) ); -} - - -//---------------------------------------------------------------------------- -TEST_F( defaultdevicetype , cxx11 ) -{ - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::DefaultExecutionSpace >(1) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::DefaultExecutionSpace >(2) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::DefaultExecutionSpace >(3) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::DefaultExecutionSpace >(4) ) ); -} - -TEST_F( defaultdevicetype , team_vector ) -{ - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::DefaultExecutionSpace >(0) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::DefaultExecutionSpace >(1) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::DefaultExecutionSpace >(2) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::DefaultExecutionSpace >(3) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::DefaultExecutionSpace >(4) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::DefaultExecutionSpace >(5) ) ); -} - -TEST_F( defaultdevicetype , malloc ) -{ - int* data = (int*) Kokkos::kokkos_malloc(100*sizeof(int)); - ASSERT_NO_THROW(data = (int*) Kokkos::kokkos_realloc(data,120*sizeof(int))); - Kokkos::kokkos_free(data); - - int* data2 = (int*) Kokkos::kokkos_malloc(0); - ASSERT_TRUE(data2==NULL); - Kokkos::kokkos_free(data); -} - -} // namespace test - -#endif diff --git a/lib/kokkos/core/unit_test/TestDefaultDeviceTypeInit.cpp b/lib/kokkos/core/unit_test/TestDefaultDeviceTypeInit.cpp deleted file mode 100644 index a1e3f8fb0a..0000000000 --- a/lib/kokkos/core/unit_test/TestDefaultDeviceTypeInit.cpp +++ /dev/null @@ -1,390 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#ifdef KOKKOS_HAVE_OPENMP -#include -#endif - -#if !defined(KOKKOS_HAVE_CUDA) || defined(__CUDACC__) -//---------------------------------------------------------------------------- - -namespace Test { - -namespace Impl { - - char** init_kokkos_args(bool do_threads,bool do_numa,bool do_device,bool do_other, int& nargs, Kokkos::InitArguments& init_args) { - nargs = (do_threads?1:0) + - (do_numa?1:0) + - (do_device?1:0) + - (do_other?4:0); - char** args_kokkos = new char*[nargs]; - for(int i = 0; i < nargs; i++) - args_kokkos[i] = new char[20]; - - int threads_idx = do_other?1:0; - int numa_idx = (do_other?3:0) + (do_threads?1:0); - int device_idx = (do_other?3:0) + (do_threads?1:0) + (do_numa?1:0); - - - if(do_threads) { - int nthreads = 3; - -#ifdef KOKKOS_HAVE_OPENMP - if(omp_get_max_threads() < 3) - nthreads = omp_get_max_threads(); -#endif - - if(Kokkos::hwloc::available()) { - if(Kokkos::hwloc::get_available_threads_per_core()<3) - nthreads = Kokkos::hwloc::get_available_threads_per_core() - * Kokkos::hwloc::get_available_numa_count(); - } - -#ifdef KOKKOS_HAVE_SERIAL - if(Kokkos::Impl::is_same::value || - Kokkos::Impl::is_same::value ) { - nthreads = 1; - } -#endif - init_args.num_threads = nthreads; - sprintf(args_kokkos[threads_idx],"--threads=%i",nthreads); - } - - if(do_numa) { - int numa = 1; - if(Kokkos::hwloc::available()) - numa = Kokkos::hwloc::get_available_numa_count(); -#ifdef KOKKOS_HAVE_SERIAL - if(Kokkos::Impl::is_same::value || - Kokkos::Impl::is_same::value ) { - numa = 1; - } -#endif - - init_args.num_numa = numa; - sprintf(args_kokkos[numa_idx],"--numa=%i",numa); - } - - if(do_device) { - - init_args.device_id = 0; - sprintf(args_kokkos[device_idx],"--device=%i",0); - } - - if(do_other) { - sprintf(args_kokkos[0],"--dummyarg=1"); - sprintf(args_kokkos[threads_idx+(do_threads?1:0)],"--dummy2arg"); - sprintf(args_kokkos[threads_idx+(do_threads?1:0)+1],"dummy3arg"); - sprintf(args_kokkos[device_idx+(do_device?1:0)],"dummy4arg=1"); - } - - - return args_kokkos; - } - - Kokkos::InitArguments init_initstruct(bool do_threads, bool do_numa, bool do_device) { - Kokkos::InitArguments args; - - if(do_threads) { - int nthreads = 3; - -#ifdef KOKKOS_HAVE_OPENMP - if(omp_get_max_threads() < 3) - nthreads = omp_get_max_threads(); -#endif - - if(Kokkos::hwloc::available()) { - if(Kokkos::hwloc::get_available_threads_per_core()<3) - nthreads = Kokkos::hwloc::get_available_threads_per_core() - * Kokkos::hwloc::get_available_numa_count(); - } -#ifdef KOKKOS_HAVE_SERIAL - if(Kokkos::Impl::is_same::value || - Kokkos::Impl::is_same::value ) { - nthreads = 1; - } -#endif - - args.num_threads = nthreads; - } - - if(do_numa) { - int numa = 1; - if(Kokkos::hwloc::available()) - numa = Kokkos::hwloc::get_available_numa_count(); -#ifdef KOKKOS_HAVE_SERIAL - if(Kokkos::Impl::is_same::value || - Kokkos::Impl::is_same::value ) { - numa = 1; - } -#endif - args.num_numa = numa; - } - - if(do_device) { - args.device_id = 0; - } - - return args; - } - - void check_correct_initialization(const Kokkos::InitArguments& argstruct) { - ASSERT_EQ( Kokkos::DefaultExecutionSpace::is_initialized(), 1); - ASSERT_EQ( Kokkos::HostSpace::execution_space::is_initialized(), 1); - - //Figure out the number of threads the HostSpace ExecutionSpace should have initialized to - int expected_nthreads = argstruct.num_threads; - if(expected_nthreads<1) { - if(Kokkos::hwloc::available()) { - expected_nthreads = Kokkos::hwloc::get_available_numa_count() - * Kokkos::hwloc::get_available_cores_per_numa() - * Kokkos::hwloc::get_available_threads_per_core(); - } else { - #ifdef KOKKOS_HAVE_OPENMP - if(Kokkos::Impl::is_same::value) { - expected_nthreads = omp_get_max_threads(); - } else - #endif - expected_nthreads = 1; - - } - #ifdef KOKKOS_HAVE_SERIAL - if(Kokkos::Impl::is_same::value || - Kokkos::Impl::is_same::value ) - expected_nthreads = 1; - #endif - } - - int expected_numa = argstruct.num_numa; - if(expected_numa<1) { - if(Kokkos::hwloc::available()) { - expected_numa = Kokkos::hwloc::get_available_numa_count(); - } else { - expected_numa = 1; - } - #ifdef KOKKOS_HAVE_SERIAL - if(Kokkos::Impl::is_same::value || - Kokkos::Impl::is_same::value ) - expected_numa = 1; - #endif - } - ASSERT_EQ(Kokkos::HostSpace::execution_space::thread_pool_size(),expected_nthreads); - -#ifdef KOKKOS_HAVE_CUDA - if(Kokkos::Impl::is_same::value) { - int device; - cudaGetDevice( &device ); - int expected_device = argstruct.device_id; - if(argstruct.device_id<0) { - expected_device = 0; - } - ASSERT_EQ(expected_device,device); - } -#endif - } - - //ToDo: Add check whether correct number of threads are actually started - void test_no_arguments() { - Kokkos::initialize(); - check_correct_initialization(Kokkos::InitArguments()); - Kokkos::finalize(); - } - - void test_commandline_args(int nargs, char** args, const Kokkos::InitArguments& argstruct) { - Kokkos::initialize(nargs,args); - check_correct_initialization(argstruct); - Kokkos::finalize(); - } - - void test_initstruct_args(const Kokkos::InitArguments& args) { - Kokkos::initialize(args); - check_correct_initialization(args); - Kokkos::finalize(); - } -} - -class defaultdevicetypeinit : public ::testing::Test { -protected: - static void SetUpTestCase() - { - } - - static void TearDownTestCase() - { - } -}; - - -TEST_F( defaultdevicetypeinit, no_args) { - Impl::test_no_arguments(); -} - -TEST_F( defaultdevicetypeinit, commandline_args_empty) { - Kokkos::InitArguments argstruct; - int nargs = 0; - char** args = Impl::init_kokkos_args(false,false,false,false,nargs, argstruct); - Impl::test_commandline_args(nargs,args,argstruct); - for(int i = 0; i < nargs; i++) - delete [] args[i]; - delete [] args; -} - -TEST_F( defaultdevicetypeinit, commandline_args_other) { - Kokkos::InitArguments argstruct; - int nargs = 0; - char** args = Impl::init_kokkos_args(false,false,false,true,nargs, argstruct); - Impl::test_commandline_args(nargs,args,argstruct); - for(int i = 0; i < nargs; i++) - delete [] args[i]; - delete [] args; -} - -TEST_F( defaultdevicetypeinit, commandline_args_nthreads) { - Kokkos::InitArguments argstruct; - int nargs = 0; - char** args = Impl::init_kokkos_args(true,false,false,false,nargs, argstruct); - Impl::test_commandline_args(nargs,args,argstruct); - for(int i = 0; i < nargs; i++) - delete [] args[i]; - delete [] args; -} - -TEST_F( defaultdevicetypeinit, commandline_args_nthreads_numa) { - Kokkos::InitArguments argstruct; - int nargs = 0; - char** args = Impl::init_kokkos_args(true,true,false,false,nargs, argstruct); - Impl::test_commandline_args(nargs,args,argstruct); - for(int i = 0; i < nargs; i++) - delete [] args[i]; - delete [] args; -} - -TEST_F( defaultdevicetypeinit, commandline_args_nthreads_numa_device) { - Kokkos::InitArguments argstruct; - int nargs = 0; - char** args = Impl::init_kokkos_args(true,true,true,false,nargs, argstruct); - Impl::test_commandline_args(nargs,args,argstruct); - for(int i = 0; i < nargs; i++) - delete [] args[i]; - delete [] args; -} - -TEST_F( defaultdevicetypeinit, commandline_args_nthreads_device) { - Kokkos::InitArguments argstruct; - int nargs = 0; - char** args = Impl::init_kokkos_args(true,false,true,false,nargs, argstruct); - Impl::test_commandline_args(nargs,args,argstruct); - for(int i = 0; i < nargs; i++) - delete [] args[i]; - delete [] args; -} - -TEST_F( defaultdevicetypeinit, commandline_args_numa_device) { - Kokkos::InitArguments argstruct; - int nargs = 0; - char** args = Impl::init_kokkos_args(false,true,true,false,nargs, argstruct); - Impl::test_commandline_args(nargs,args,argstruct); - for(int i = 0; i < nargs; i++) - delete [] args[i]; - delete [] args; -} - -TEST_F( defaultdevicetypeinit, commandline_args_device) { - Kokkos::InitArguments argstruct; - int nargs = 0; - char** args = Impl::init_kokkos_args(false,false,true,false,nargs, argstruct); - Impl::test_commandline_args(nargs,args,argstruct); - for(int i = 0; i < nargs; i++) - delete [] args[i]; - delete [] args; -} - -TEST_F( defaultdevicetypeinit, commandline_args_nthreads_numa_device_other) { - Kokkos::InitArguments argstruct; - int nargs = 0; - char** args = Impl::init_kokkos_args(true,true,true,true,nargs, argstruct); - Impl::test_commandline_args(nargs,args,argstruct); - for(int i = 0; i < nargs; i++) - delete [] args[i]; - delete [] args; -} - -TEST_F( defaultdevicetypeinit, initstruct_default) { - Kokkos::InitArguments args; - Impl::test_initstruct_args(args); -} - -TEST_F( defaultdevicetypeinit, initstruct_nthreads) { - Kokkos::InitArguments args = Impl::init_initstruct(true,false,false); - Impl::test_initstruct_args(args); -} - -TEST_F( defaultdevicetypeinit, initstruct_nthreads_numa) { - Kokkos::InitArguments args = Impl::init_initstruct(true,true,false); - Impl::test_initstruct_args(args); -} - -TEST_F( defaultdevicetypeinit, initstruct_device) { - Kokkos::InitArguments args = Impl::init_initstruct(false,false,true); - Impl::test_initstruct_args(args); -} - -TEST_F( defaultdevicetypeinit, initstruct_nthreads_device) { - Kokkos::InitArguments args = Impl::init_initstruct(true,false,true); - Impl::test_initstruct_args(args); -} - - -TEST_F( defaultdevicetypeinit, initstruct_nthreads_numa_device) { - Kokkos::InitArguments args = Impl::init_initstruct(true,true,true); - Impl::test_initstruct_args(args); -} - - - -} // namespace test - -#endif diff --git a/lib/kokkos/core/unit_test/TestHWLOC.cpp b/lib/kokkos/core/unit_test/TestHWLOC.cpp deleted file mode 100644 index 1637dec5de..0000000000 --- a/lib/kokkos/core/unit_test/TestHWLOC.cpp +++ /dev/null @@ -1,69 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include - -namespace Test { - -class hwloc : public ::testing::Test { -protected: - static void SetUpTestCase() - {} - - static void TearDownTestCase() - {} -}; - -TEST_F( hwloc, query) -{ - std::cout << " NUMA[" << Kokkos::hwloc::get_available_numa_count() << "]" - << " CORE[" << Kokkos::hwloc::get_available_cores_per_numa() << "]" - << " PU[" << Kokkos::hwloc::get_available_threads_per_core() << "]" - << std::endl ; -} - -} - diff --git a/lib/kokkos/core/unit_test/TestMemorySpaceTracking.hpp b/lib/kokkos/core/unit_test/TestMemorySpaceTracking.hpp deleted file mode 100644 index 80ffcc2afd..0000000000 --- a/lib/kokkos/core/unit_test/TestMemorySpaceTracking.hpp +++ /dev/null @@ -1,100 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include - -/*--------------------------------------------------------------------------*/ - -namespace { - -template -class TestMemorySpace { -public: - - typedef typename Arg1::memory_space MemorySpace; - TestMemorySpace() { run_test(); } - - void run_test() - { - -#if ! defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - - Kokkos::View invalid; - ASSERT_EQ(0u, invalid.tracker().ref_count() ); - - { - Kokkos::View a("A",10); - - ASSERT_EQ(1u, a.tracker().ref_count() ); - - { - Kokkos::View b = a; - ASSERT_EQ(2u, b.tracker().ref_count() ); - - Kokkos::View D("D",10); - ASSERT_EQ(1u, D.tracker().ref_count() ); - - { - Kokkos::View E("E",10); - ASSERT_EQ(1u, E.tracker().ref_count() ); - } - - ASSERT_EQ(2u, b.tracker().ref_count() ); - } - ASSERT_EQ(1u, a.tracker().ref_count() ); - } - -#endif - - } -}; - -} - -/*--------------------------------------------------------------------------*/ - - - diff --git a/lib/kokkos/core/unit_test/TestOpenMP.cpp b/lib/kokkos/core/unit_test/TestOpenMP.cpp deleted file mode 100644 index 7f3a245675..0000000000 --- a/lib/kokkos/core/unit_test/TestOpenMP.cpp +++ /dev/null @@ -1,373 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -//---------------------------------------------------------------------------- - -#include -#include - -#include -#include - -#include -#include - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -namespace Test { - -class openmp : public ::testing::Test { -protected: - static void SetUpTestCase() - { - const unsigned numa_count = Kokkos::hwloc::get_available_numa_count(); - const unsigned cores_per_numa = Kokkos::hwloc::get_available_cores_per_numa(); - const unsigned threads_per_core = Kokkos::hwloc::get_available_threads_per_core(); - - const unsigned threads_count = std::max( 1u , numa_count ) * - std::max( 2u , ( cores_per_numa * threads_per_core ) / 2 ); - - Kokkos::OpenMP::initialize( threads_count ); - Kokkos::OpenMP::print_configuration( std::cout , true ); - } - - static void TearDownTestCase() - { - Kokkos::OpenMP::finalize(); - - omp_set_num_threads(1); - - ASSERT_EQ( 1 , omp_get_max_threads() ); - } -}; - - -TEST_F( openmp , impl_shared_alloc ) { - test_shared_alloc< Kokkos::HostSpace , Kokkos::OpenMP >(); -} - -TEST_F( openmp , impl_view_mapping ) { - test_view_mapping< Kokkos::OpenMP >(); - test_view_mapping_subview< Kokkos::OpenMP >(); - test_view_mapping_operator< Kokkos::OpenMP >(); - TestViewMappingAtomic< Kokkos::OpenMP >::run(); -} - -TEST_F( openmp, view_impl) { - test_view_impl< Kokkos::OpenMP >(); -} - -TEST_F( openmp, view_api) { - TestViewAPI< double , Kokkos::OpenMP >(); -} - - -TEST_F( openmp, view_subview_auto_1d_left ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutLeft,Kokkos::OpenMP >(); -} - -TEST_F( openmp, view_subview_auto_1d_right ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutRight,Kokkos::OpenMP >(); -} - -TEST_F( openmp, view_subview_auto_1d_stride ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutStride,Kokkos::OpenMP >(); -} - -TEST_F( openmp, view_subview_assign_strided ) { - TestViewSubview::test_1d_strided_assignment< Kokkos::OpenMP >(); -} - -TEST_F( openmp, view_subview_left_0 ) { - TestViewSubview::test_left_0< Kokkos::OpenMP >(); -} - -TEST_F( openmp, view_subview_left_1 ) { - TestViewSubview::test_left_1< Kokkos::OpenMP >(); -} - -TEST_F( openmp, view_subview_left_2 ) { - TestViewSubview::test_left_2< Kokkos::OpenMP >(); -} - -TEST_F( openmp, view_subview_left_3 ) { - TestViewSubview::test_left_3< Kokkos::OpenMP >(); -} - -TEST_F( openmp, view_subview_right_0 ) { - TestViewSubview::test_right_0< Kokkos::OpenMP >(); -} - -TEST_F( openmp, view_subview_right_1 ) { - TestViewSubview::test_right_1< Kokkos::OpenMP >(); -} - -TEST_F( openmp, view_subview_right_3 ) { - TestViewSubview::test_right_3< Kokkos::OpenMP >(); -} - - - -TEST_F( openmp , range_tag ) -{ - TestRange< Kokkos::OpenMP >::test_for(1000); - TestRange< Kokkos::OpenMP >::test_reduce(1000); - TestRange< Kokkos::OpenMP >::test_scan(1000); -} - -TEST_F( openmp , team_tag ) -{ - TestTeamPolicy< Kokkos::OpenMP >::test_for(1000); - TestTeamPolicy< Kokkos::OpenMP >::test_reduce(1000); -} - -TEST_F( openmp, long_reduce) { - TestReduce< long , Kokkos::OpenMP >( 1000000 ); -} - -TEST_F( openmp, double_reduce) { - TestReduce< double , Kokkos::OpenMP >( 1000000 ); -} - -TEST_F( openmp, long_reduce_dynamic ) { - TestReduceDynamic< long , Kokkos::OpenMP >( 1000000 ); -} - -TEST_F( openmp, double_reduce_dynamic ) { - TestReduceDynamic< double , Kokkos::OpenMP >( 1000000 ); -} - -TEST_F( openmp, long_reduce_dynamic_view ) { - TestReduceDynamicView< long , Kokkos::OpenMP >( 1000000 ); -} - -TEST_F( openmp, team_long_reduce) { - TestReduceTeam< long , Kokkos::OpenMP >( 100000 ); -} - -TEST_F( openmp, team_double_reduce) { - TestReduceTeam< double , Kokkos::OpenMP >( 100000 ); -} - -TEST_F( openmp, team_shared_request) { - TestSharedTeam< Kokkos::OpenMP >(); -} - - -TEST_F( openmp , atomics ) -{ - const int loop_count = 1e4 ; - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(100,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,3) ) ); - -#if defined( KOKKOS_ENABLE_ASM ) - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::OpenMP>(100,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::OpenMP>(100,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::OpenMP>(100,3) ) ); -#endif -} - -TEST_F( openmp , view_remap ) -{ - enum { N0 = 3 , N1 = 2 , N2 = 8 , N3 = 9 }; - - typedef Kokkos::View< double*[N1][N2][N3] , - Kokkos::LayoutRight , - Kokkos::OpenMP > output_type ; - - typedef Kokkos::View< int**[N2][N3] , - Kokkos::LayoutLeft , - Kokkos::OpenMP > input_type ; - - typedef Kokkos::View< int*[N0][N2][N3] , - Kokkos::LayoutLeft , - Kokkos::OpenMP > diff_type ; - - output_type output( "output" , N0 ); - input_type input ( "input" , N0 , N1 ); - diff_type diff ( "diff" , N0 ); - - int value = 0 ; - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i0 = 0 ; i0 < N0 ; ++i0 ) { - input(i0,i1,i2,i3) = ++value ; - }}}} - - // Kokkos::deep_copy( diff , input ); // throw with incompatible shape - Kokkos::deep_copy( output , input ); - - value = 0 ; - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i0 = 0 ; i0 < N0 ; ++i0 ) { - ++value ; - ASSERT_EQ( value , ((int) output(i0,i1,i2,i3) ) ); - }}}} -} - -//---------------------------------------------------------------------------- - - -TEST_F( openmp , view_aggregate ) -{ - TestViewAggregate< Kokkos::OpenMP >(); - TestViewAggregateReduction< Kokkos::OpenMP >(); -} - -//---------------------------------------------------------------------------- - -TEST_F( openmp , scan ) -{ - TestScan< Kokkos::OpenMP >::test_range( 1 , 1000 ); - TestScan< Kokkos::OpenMP >( 1000000 ); - TestScan< Kokkos::OpenMP >( 10000000 ); - Kokkos::OpenMP::fence(); -} - - -TEST_F( openmp , team_scan ) -{ - TestScanTeam< Kokkos::OpenMP >( 10000 ); - TestScanTeam< Kokkos::OpenMP >( 10000 ); -} - -//---------------------------------------------------------------------------- - -TEST_F( openmp , compiler_macros ) -{ - ASSERT_TRUE( ( TestCompilerMacros::Test< Kokkos::OpenMP >() ) ); -} - -//---------------------------------------------------------------------------- - -TEST_F( openmp , memory_space ) -{ - TestMemorySpace< Kokkos::OpenMP >(); -} - -//---------------------------------------------------------------------------- - -TEST_F( openmp , template_meta_functions ) -{ - TestTemplateMetaFunctions(); -} - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_OPENMP ) -TEST_F( openmp , cxx11 ) -{ - if ( Kokkos::Impl::is_same< Kokkos::DefaultExecutionSpace , Kokkos::OpenMP >::value ) { - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::OpenMP >(1) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::OpenMP >(2) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::OpenMP >(3) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::OpenMP >(4) ) ); - } -} -#endif - -TEST_F( openmp , reduction_deduction ) -{ - TestCXX11::test_reduction_deduction< Kokkos::OpenMP >(); -} - -TEST_F( openmp , team_vector ) -{ - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::OpenMP >(0) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::OpenMP >(1) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::OpenMP >(2) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::OpenMP >(3) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::OpenMP >(4) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::OpenMP >(5) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::OpenMP >(6) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::OpenMP >(7) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::OpenMP >(8) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::OpenMP >(9) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::OpenMP >(10) ) ); -} -} // namespace test - diff --git a/lib/kokkos/core/unit_test/TestQthread.cpp b/lib/kokkos/core/unit_test/TestQthread.cpp deleted file mode 100644 index ff40536230..0000000000 --- a/lib/kokkos/core/unit_test/TestQthread.cpp +++ /dev/null @@ -1,280 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include - -#include - -//---------------------------------------------------------------------------- - -#include -#include - -#include - -#include -#include -#include -#include -#include -#include -#include -// #include - -namespace Test { - -class qthread : public ::testing::Test { -protected: - static void SetUpTestCase() - { - const unsigned numa_count = Kokkos::hwloc::get_available_numa_count(); - const unsigned cores_per_numa = Kokkos::hwloc::get_available_cores_per_numa(); - const unsigned threads_per_core = Kokkos::hwloc::get_available_threads_per_core(); - - int threads_count = std::max( 1u , numa_count ) - * std::max( 2u , ( cores_per_numa * threads_per_core ) / 2 ); - Kokkos::Qthread::initialize( threads_count ); - Kokkos::Qthread::print_configuration( std::cout , true ); - } - - static void TearDownTestCase() - { - Kokkos::Qthread::finalize(); - } -}; - -TEST_F( qthread , compiler_macros ) -{ - ASSERT_TRUE( ( TestCompilerMacros::Test< Kokkos::Qthread >() ) ); -} - -TEST_F( qthread, view_impl) { - test_view_impl< Kokkos::Qthread >(); -} - -TEST_F( qthread, view_api) { - TestViewAPI< double , Kokkos::Qthread >(); -} - -TEST_F( qthread , range_tag ) -{ - TestRange< Kokkos::Qthread >::test_for(1000); - TestRange< Kokkos::Qthread >::test_reduce(1000); - TestRange< Kokkos::Qthread >::test_scan(1000); -} - -TEST_F( qthread , team_tag ) -{ - TestTeamPolicy< Kokkos::Qthread >::test_for( 1000 ); - TestTeamPolicy< Kokkos::Qthread >::test_reduce( 1000 ); -} - -TEST_F( qthread, long_reduce) { - TestReduce< long , Kokkos::Qthread >( 1000000 ); -} - -TEST_F( qthread, double_reduce) { - TestReduce< double , Kokkos::Qthread >( 1000000 ); -} - -TEST_F( qthread, long_reduce_dynamic ) { - TestReduceDynamic< long , Kokkos::Qthread >( 1000000 ); -} - -TEST_F( qthread, double_reduce_dynamic ) { - TestReduceDynamic< double , Kokkos::Qthread >( 1000000 ); -} - -TEST_F( qthread, long_reduce_dynamic_view ) { - TestReduceDynamicView< long , Kokkos::Qthread >( 1000000 ); -} - -TEST_F( qthread, team_long_reduce) { - TestReduceTeam< long , Kokkos::Qthread >( 1000000 ); -} - -TEST_F( qthread, team_double_reduce) { - TestReduceTeam< double , Kokkos::Qthread >( 1000000 ); -} - - -TEST_F( qthread , atomics ) -{ - const int loop_count = 1e4 ; - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(100,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,3) ) ); - -#if defined( KOKKOS_ENABLE_ASM ) - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::Qthread>(100,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::Qthread>(100,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::Qthread>(100,3) ) ); -#endif - -} - -TEST_F( qthread , view_remap ) -{ - enum { N0 = 3 , N1 = 2 , N2 = 8 , N3 = 9 }; - - typedef Kokkos::View< double*[N1][N2][N3] , - Kokkos::LayoutRight , - Kokkos::Qthread > output_type ; - - typedef Kokkos::View< int**[N2][N3] , - Kokkos::LayoutLeft , - Kokkos::Qthread > input_type ; - - typedef Kokkos::View< int*[N0][N2][N3] , - Kokkos::LayoutLeft , - Kokkos::Qthread > diff_type ; - - output_type output( "output" , N0 ); - input_type input ( "input" , N0 , N1 ); - diff_type diff ( "diff" , N0 ); - - int value = 0 ; - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i0 = 0 ; i0 < N0 ; ++i0 ) { - input(i0,i1,i2,i3) = ++value ; - }}}} - - // Kokkos::deep_copy( diff , input ); // throw with incompatible shape - Kokkos::deep_copy( output , input ); - - value = 0 ; - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i0 = 0 ; i0 < N0 ; ++i0 ) { - ++value ; - ASSERT_EQ( value , ((int) output(i0,i1,i2,i3) ) ); - }}}} -} - -//---------------------------------------------------------------------------- - -TEST_F( qthread , view_aggregate ) -{ - TestViewAggregate< Kokkos::Qthread >(); -} - -//---------------------------------------------------------------------------- - -TEST_F( qthread , scan ) -{ - TestScan< Kokkos::Qthread >::test_range( 1 , 1000 ); - TestScan< Kokkos::Qthread >( 1000000 ); - TestScan< Kokkos::Qthread >( 10000000 ); - Kokkos::Qthread::fence(); -} - -TEST_F( qthread, team_shared ) { - TestSharedTeam< Kokkos::Qthread >(); -} - -TEST_F( qthread , team_scan ) -{ - TestScanTeam< Kokkos::Qthread >( 10 ); - TestScanTeam< Kokkos::Qthread >( 10000 ); -} - -#if 0 /* disable */ -TEST_F( qthread , team_vector ) -{ - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Qthread >(0) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Qthread >(1) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Qthread >(2) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Qthread >(3) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Qthread >(4) ) ); -} -#endif - -//---------------------------------------------------------------------------- - -TEST_F( qthread , task_policy ) -{ - TestTaskPolicy::test_task_dep< Kokkos::Qthread >( 10 ); - for ( long i = 0 ; i < 25 ; ++i ) TestTaskPolicy::test_fib< Kokkos::Qthread >(i); - for ( long i = 0 ; i < 35 ; ++i ) TestTaskPolicy::test_fib2< Kokkos::Qthread >(i); -} - -TEST_F( qthread , task_team ) -{ - TestTaskPolicy::test_task_team< Kokkos::Qthread >(1000); -} - -//---------------------------------------------------------------------------- - -} // namespace test - diff --git a/lib/kokkos/core/unit_test/TestRange.hpp b/lib/kokkos/core/unit_test/TestRange.hpp deleted file mode 100644 index 1af5313272..0000000000 --- a/lib/kokkos/core/unit_test/TestRange.hpp +++ /dev/null @@ -1,171 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -/*--------------------------------------------------------------------------*/ - -namespace Test { -namespace { - -template< class ExecSpace > -struct TestRange { - - typedef int value_type ; ///< typedef required for the parallel_reduce - - typedef Kokkos::View view_type ; - - view_type m_flags ; - - struct VerifyInitTag {}; - struct ResetTag {}; - struct VerifyResetTag {}; - - TestRange( const size_t N ) - : m_flags( Kokkos::ViewAllocateWithoutInitializing("flags"), N ) - {} - - static void test_for( const size_t N ) - { - TestRange functor(N); - - typename view_type::HostMirror host_flags = Kokkos::create_mirror_view( functor.m_flags ); - - Kokkos::parallel_for( Kokkos::RangePolicy(0,N) , functor ); - Kokkos::parallel_for( Kokkos::RangePolicy(0,N) , functor ); - - Kokkos::deep_copy( host_flags , functor.m_flags ); - - size_t error_count = 0 ; - for ( size_t i = 0 ; i < N ; ++i ) { - if ( int(i) != host_flags(i) ) ++error_count ; - } - ASSERT_EQ( error_count , size_t(0) ); - - Kokkos::parallel_for( Kokkos::RangePolicy(0,N) , functor ); - Kokkos::parallel_for( std::string("TestKernelFor") , Kokkos::RangePolicy(0,N) , functor ); - - Kokkos::deep_copy( host_flags , functor.m_flags ); - - error_count = 0 ; - for ( size_t i = 0 ; i < N ; ++i ) { - if ( int(2*i) != host_flags(i) ) ++error_count ; - } - ASSERT_EQ( error_count , size_t(0) ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const int i ) const - { m_flags(i) = i ; } - - KOKKOS_INLINE_FUNCTION - void operator()( const VerifyInitTag & , const int i ) const - { if ( i != m_flags(i) ) { printf("TestRange::test_for error at %d != %d\n",i,m_flags(i)); } } - - KOKKOS_INLINE_FUNCTION - void operator()( const ResetTag & , const int i ) const - { m_flags(i) = 2 * m_flags(i); } - - KOKKOS_INLINE_FUNCTION - void operator()( const VerifyResetTag & , const int i ) const - { if ( 2 * i != m_flags(i) ) { printf("TestRange::test_for error at %d != %d\n",i,m_flags(i)); } } - - //---------------------------------------- - - struct OffsetTag {}; - - static void test_reduce( const size_t N ) - { - TestRange functor(N); - int total = 0 ; - - Kokkos::parallel_for( Kokkos::RangePolicy(0,N) , functor ); - - Kokkos::parallel_reduce( "TestKernelReduce" , Kokkos::RangePolicy(0,N) , functor , total ); - // sum( 0 .. N-1 ) - ASSERT_EQ( size_t((N-1)*(N)/2) , size_t(total) ); - - Kokkos::parallel_reduce( Kokkos::RangePolicy(0,N) , functor , total ); - // sum( 1 .. N ) - ASSERT_EQ( size_t((N)*(N+1)/2) , size_t(total) ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const int i , value_type & update ) const - { update += m_flags(i); } - - KOKKOS_INLINE_FUNCTION - void operator()( const OffsetTag & , const int i , value_type & update ) const - { update += 1 + m_flags(i); } - - //---------------------------------------- - - static void test_scan( const size_t N ) - { - TestRange functor(N); - - Kokkos::parallel_for( Kokkos::RangePolicy(0,N) , functor ); - - Kokkos::parallel_scan( "TestKernelScan" , Kokkos::RangePolicy(0,N) , functor ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const OffsetTag & , const int i , value_type & update , bool final ) const - { - update += m_flags(i); - - if ( final ) { - if ( update != (i*(i+1))/2 ) { - printf("TestRange::test_scan error %d : %d != %d\n",i,(i*(i+1))/2,m_flags(i)); - } - } - } -}; - -} /* namespace */ -} /* namespace Test */ - -/*--------------------------------------------------------------------------*/ - diff --git a/lib/kokkos/core/unit_test/TestReduce.hpp b/lib/kokkos/core/unit_test/TestReduce.hpp deleted file mode 100644 index f8a15d6c01..0000000000 --- a/lib/kokkos/core/unit_test/TestReduce.hpp +++ /dev/null @@ -1,384 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include - -#include - -/*--------------------------------------------------------------------------*/ - -namespace Test { - -template< typename ScalarType , class DeviceType > -class ReduceFunctor -{ -public: - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type ; - - struct value_type { - ScalarType value[3] ; - }; - - const size_type nwork ; - - ReduceFunctor( const size_type & arg_nwork ) : nwork( arg_nwork ) {} - - ReduceFunctor( const ReduceFunctor & rhs ) - : nwork( rhs.nwork ) {} - -/* - KOKKOS_INLINE_FUNCTION - void init( value_type & dst ) const - { - dst.value[0] = 0 ; - dst.value[1] = 0 ; - dst.value[2] = 0 ; - } -*/ - - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & dst , - const volatile value_type & src ) const - { - dst.value[0] += src.value[0] ; - dst.value[1] += src.value[1] ; - dst.value[2] += src.value[2] ; - } - - KOKKOS_INLINE_FUNCTION - void operator()( size_type iwork , value_type & dst ) const - { - dst.value[0] += 1 ; - dst.value[1] += iwork + 1 ; - dst.value[2] += nwork - iwork ; - } -}; - -template< class DeviceType > -class ReduceFunctorFinal : public ReduceFunctor< long , DeviceType > { -public: - - typedef typename ReduceFunctor< long , DeviceType >::value_type value_type ; - - ReduceFunctorFinal( const size_t n ) - : ReduceFunctor(n) - {} - - KOKKOS_INLINE_FUNCTION - void final( value_type & dst ) const - { - dst.value[0] = - dst.value[0] ; - dst.value[1] = - dst.value[1] ; - dst.value[2] = - dst.value[2] ; - } -}; - -template< typename ScalarType , class DeviceType > -class RuntimeReduceFunctor -{ -public: - // Required for functor: - typedef DeviceType execution_space ; - typedef ScalarType value_type[] ; - const unsigned value_count ; - - - // Unit test details: - - typedef typename execution_space::size_type size_type ; - - const size_type nwork ; - - RuntimeReduceFunctor( const size_type arg_nwork , - const size_type arg_count ) - : value_count( arg_count ) - , nwork( arg_nwork ) {} - -/* - KOKKOS_INLINE_FUNCTION - void init( value_type dst ) const - { - for ( unsigned i = 0 ; i < value_count ; ++i ) dst[i] = 0 ; - } -*/ - - KOKKOS_INLINE_FUNCTION - void join( volatile ScalarType dst[] , - const volatile ScalarType src[] ) const - { - for ( unsigned i = 0 ; i < value_count ; ++i ) dst[i] += src[i] ; - } - - KOKKOS_INLINE_FUNCTION - void operator()( size_type iwork , ScalarType dst[] ) const - { - const size_type tmp[3] = { 1 , iwork + 1 , nwork - iwork }; - - for ( size_type i = 0 ; i < value_count ; ++i ) { - dst[i] += tmp[ i % 3 ]; - } - } -}; - -template< class DeviceType > -class RuntimeReduceFunctorFinal : public RuntimeReduceFunctor< long , DeviceType > { -public: - - typedef RuntimeReduceFunctor< long , DeviceType > base_type ; - typedef typename base_type::value_type value_type ; - typedef long scalar_type ; - - RuntimeReduceFunctorFinal( const size_t theNwork , const size_t count ) : base_type(theNwork,count) {} - - KOKKOS_INLINE_FUNCTION - void final( value_type dst ) const - { - for ( unsigned i = 0 ; i < base_type::value_count ; ++i ) { - dst[i] = - dst[i] ; - } - } -}; -} // namespace Test - -namespace { - -template< typename ScalarType , class DeviceType > -class TestReduce -{ -public: - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type ; - - //------------------------------------ - - TestReduce( const size_type & nwork ) - { - run_test(nwork); - run_test_final(nwork); - } - - void run_test( const size_type & nwork ) - { - typedef Test::ReduceFunctor< ScalarType , execution_space > functor_type ; - typedef typename functor_type::value_type value_type ; - - enum { Count = 3 }; - enum { Repeat = 100 }; - - value_type result[ Repeat ]; - - const unsigned long nw = nwork ; - const unsigned long nsum = nw % 2 ? nw * (( nw + 1 )/2 ) - : (nw/2) * ( nw + 1 ); - - for ( unsigned i = 0 ; i < Repeat ; ++i ) { - Kokkos::parallel_reduce( nwork , functor_type(nwork) , result[i] ); - } - - for ( unsigned i = 0 ; i < Repeat ; ++i ) { - for ( unsigned j = 0 ; j < Count ; ++j ) { - const unsigned long correct = 0 == j % 3 ? nw : nsum ; - ASSERT_EQ( (ScalarType) correct , result[i].value[j] ); - } - } - } - - void run_test_final( const size_type & nwork ) - { - typedef Test::ReduceFunctorFinal< execution_space > functor_type ; - typedef typename functor_type::value_type value_type ; - - enum { Count = 3 }; - enum { Repeat = 100 }; - - value_type result[ Repeat ]; - - const unsigned long nw = nwork ; - const unsigned long nsum = nw % 2 ? nw * (( nw + 1 )/2 ) - : (nw/2) * ( nw + 1 ); - - for ( unsigned i = 0 ; i < Repeat ; ++i ) { - if(i%2==0) - Kokkos::parallel_reduce( nwork , functor_type(nwork) , result[i] ); - else - Kokkos::parallel_reduce( "Reduce", nwork , functor_type(nwork) , result[i] ); - } - - for ( unsigned i = 0 ; i < Repeat ; ++i ) { - for ( unsigned j = 0 ; j < Count ; ++j ) { - const unsigned long correct = 0 == j % 3 ? nw : nsum ; - ASSERT_EQ( (ScalarType) correct , - result[i].value[j] ); - } - } - } -}; - -template< typename ScalarType , class DeviceType > -class TestReduceDynamic -{ -public: - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type ; - - //------------------------------------ - - TestReduceDynamic( const size_type nwork ) - { - run_test_dynamic(nwork); - run_test_dynamic_final(nwork); - } - - void run_test_dynamic( const size_type nwork ) - { - typedef Test::RuntimeReduceFunctor< ScalarType , execution_space > functor_type ; - - enum { Count = 3 }; - enum { Repeat = 100 }; - - ScalarType result[ Repeat ][ Count ] ; - - const unsigned long nw = nwork ; - const unsigned long nsum = nw % 2 ? nw * (( nw + 1 )/2 ) - : (nw/2) * ( nw + 1 ); - - for ( unsigned i = 0 ; i < Repeat ; ++i ) { - if(i%2==0) - Kokkos::parallel_reduce( nwork , functor_type(nwork,Count) , result[i] ); - else - Kokkos::parallel_reduce( "Reduce", nwork , functor_type(nwork,Count) , result[i] ); - } - - for ( unsigned i = 0 ; i < Repeat ; ++i ) { - for ( unsigned j = 0 ; j < Count ; ++j ) { - const unsigned long correct = 0 == j % 3 ? nw : nsum ; - ASSERT_EQ( (ScalarType) correct , result[i][j] ); - } - } - } - - void run_test_dynamic_final( const size_type nwork ) - { - typedef Test::RuntimeReduceFunctorFinal< execution_space > functor_type ; - - enum { Count = 3 }; - enum { Repeat = 100 }; - - typename functor_type::scalar_type result[ Repeat ][ Count ] ; - - const unsigned long nw = nwork ; - const unsigned long nsum = nw % 2 ? nw * (( nw + 1 )/2 ) - : (nw/2) * ( nw + 1 ); - - for ( unsigned i = 0 ; i < Repeat ; ++i ) { - if(i%2==0) - Kokkos::parallel_reduce( nwork , functor_type(nwork,Count) , result[i] ); - else - Kokkos::parallel_reduce( "TestKernelReduce" , nwork , functor_type(nwork,Count) , result[i] ); - - } - - for ( unsigned i = 0 ; i < Repeat ; ++i ) { - for ( unsigned j = 0 ; j < Count ; ++j ) { - const unsigned long correct = 0 == j % 3 ? nw : nsum ; - ASSERT_EQ( (ScalarType) correct , - result[i][j] ); - } - } - } -}; - -template< typename ScalarType , class DeviceType > -class TestReduceDynamicView -{ -public: - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type ; - - //------------------------------------ - - TestReduceDynamicView( const size_type nwork ) - { - run_test_dynamic_view(nwork); - } - - void run_test_dynamic_view( const size_type nwork ) - { - typedef Test::RuntimeReduceFunctor< ScalarType , execution_space > functor_type ; - - typedef Kokkos::View< ScalarType* , DeviceType > result_type ; - typedef typename result_type::HostMirror result_host_type ; - - const unsigned CountLimit = 23 ; - - const unsigned long nw = nwork ; - const unsigned long nsum = nw % 2 ? nw * (( nw + 1 )/2 ) - : (nw/2) * ( nw + 1 ); - - for ( unsigned count = 0 ; count < CountLimit ; ++count ) { - - result_type result("result",count); - result_host_type host_result = Kokkos::create_mirror( result ); - - // Test result to host pointer: - - std::string str("TestKernelReduce"); - if(count%2==0) - Kokkos::parallel_reduce( nw , functor_type(nw,count) , host_result.ptr_on_device() ); - else - Kokkos::parallel_reduce( str , nw , functor_type(nw,count) , host_result.ptr_on_device() ); - - for ( unsigned j = 0 ; j < count ; ++j ) { - const unsigned long correct = 0 == j % 3 ? nw : nsum ; - ASSERT_EQ( host_result(j), (ScalarType) correct ); - host_result(j) = 0 ; - } - } - } -}; - -} - -/*--------------------------------------------------------------------------*/ - diff --git a/lib/kokkos/core/unit_test/TestScan.hpp b/lib/kokkos/core/unit_test/TestScan.hpp deleted file mode 100644 index eb5e833a1d..0000000000 --- a/lib/kokkos/core/unit_test/TestScan.hpp +++ /dev/null @@ -1,97 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -/*--------------------------------------------------------------------------*/ - -#include - -namespace Test { - -template< class Device , class WorkSpec = size_t > -struct TestScan { - - typedef Device execution_space ; - typedef long int value_type ; - - KOKKOS_INLINE_FUNCTION - void operator()( const int iwork , value_type & update , const bool final_pass ) const - { - const value_type n = iwork + 1 ; - const value_type imbalance = ( (1000 <= n) && (0 == n % 1000) ) ? 1000 : 0 ; - - // Insert an artificial load imbalance - - for ( value_type i = 0 ; i < imbalance ; ++i ) { ++update ; } - - update += n - imbalance ; - - if ( final_pass ) { - const value_type answer = n & 1 ? ( n * ( ( n + 1 ) / 2 ) ) : ( ( n / 2 ) * ( n + 1 ) ); - - if ( answer != update ) { - printf("TestScan(%d,%ld) != %ld\n",iwork,update,answer); - } - } - } - - KOKKOS_INLINE_FUNCTION - void init( value_type & update ) const { update = 0 ; } - - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & update , - volatile const value_type & input ) const - { update += input ; } - - TestScan( const WorkSpec & N ) - { parallel_scan( N , *this ); } - - static void test_range( const WorkSpec & begin , const WorkSpec & end ) - { - for ( WorkSpec i = begin ; i < end ; ++i ) { - (void) TestScan( i ); - } - } -}; - -} - diff --git a/lib/kokkos/core/unit_test/TestSerial.cpp b/lib/kokkos/core/unit_test/TestSerial.cpp deleted file mode 100644 index 4514492e4d..0000000000 --- a/lib/kokkos/core/unit_test/TestSerial.cpp +++ /dev/null @@ -1,407 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#include -#include - -#include - -//---------------------------------------------------------------------------- - -#include -#include - -#include - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -namespace Test { - -class serial : public ::testing::Test { -protected: - static void SetUpTestCase() - { - Kokkos::HostSpace::execution_space::initialize(); - } - static void TearDownTestCase() - { - Kokkos::HostSpace::execution_space::finalize(); - } -}; - -TEST_F( serial , impl_shared_alloc ) { - test_shared_alloc< Kokkos::HostSpace , Kokkos::Serial >(); -} - -TEST_F( serial , impl_view_mapping ) { - test_view_mapping< Kokkos::Serial >(); - test_view_mapping_subview< Kokkos::Serial >(); - test_view_mapping_operator< Kokkos::Serial >(); - TestViewMappingAtomic< Kokkos::Serial >::run(); -} - -TEST_F( serial, view_impl) { - test_view_impl< Kokkos::Serial >(); -} - -TEST_F( serial, view_api) { - TestViewAPI< double , Kokkos::Serial >(); -} - -TEST_F( serial , view_nested_view ) -{ - ::Test::view_nested_view< Kokkos::Serial >(); -} - -TEST_F( serial, view_subview_auto_1d_left ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutLeft,Kokkos::Serial >(); -} - -TEST_F( serial, view_subview_auto_1d_right ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutRight,Kokkos::Serial >(); -} - -TEST_F( serial, view_subview_auto_1d_stride ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutStride,Kokkos::Serial >(); -} - -TEST_F( serial, view_subview_assign_strided ) { - TestViewSubview::test_1d_strided_assignment< Kokkos::Serial >(); -} - -TEST_F( serial, view_subview_left_0 ) { - TestViewSubview::test_left_0< Kokkos::Serial >(); -} - -TEST_F( serial, view_subview_left_1 ) { - TestViewSubview::test_left_1< Kokkos::Serial >(); -} - -TEST_F( serial, view_subview_left_2 ) { - TestViewSubview::test_left_2< Kokkos::Serial >(); -} - -TEST_F( serial, view_subview_left_3 ) { - TestViewSubview::test_left_3< Kokkos::Serial >(); -} - -TEST_F( serial, view_subview_right_0 ) { - TestViewSubview::test_right_0< Kokkos::Serial >(); -} - -TEST_F( serial, view_subview_right_1 ) { - TestViewSubview::test_right_1< Kokkos::Serial >(); -} - -TEST_F( serial, view_subview_right_3 ) { - TestViewSubview::test_right_3< Kokkos::Serial >(); -} - -TEST_F( serial , range_tag ) -{ - TestRange< Kokkos::Serial >::test_for(1000); - TestRange< Kokkos::Serial >::test_reduce(1000); - TestRange< Kokkos::Serial >::test_scan(1000); -} - -TEST_F( serial , team_tag ) -{ - TestTeamPolicy< Kokkos::Serial >::test_for( 1000 ); - TestTeamPolicy< Kokkos::Serial >::test_reduce( 1000 ); -} - -TEST_F( serial, long_reduce) { - TestReduce< long , Kokkos::Serial >( 1000000 ); -} - -TEST_F( serial, double_reduce) { - TestReduce< double , Kokkos::Serial >( 1000000 ); -} - -TEST_F( serial, long_reduce_dynamic ) { - TestReduceDynamic< long , Kokkos::Serial >( 1000000 ); -} - -TEST_F( serial, double_reduce_dynamic ) { - TestReduceDynamic< double , Kokkos::Serial >( 1000000 ); -} - -TEST_F( serial, long_reduce_dynamic_view ) { - TestReduceDynamicView< long , Kokkos::Serial >( 1000000 ); -} - -TEST_F( serial , scan ) -{ - TestScan< Kokkos::Serial >::test_range( 1 , 1000 ); - TestScan< Kokkos::Serial >( 10 ); - TestScan< Kokkos::Serial >( 10000 ); -} - -TEST_F( serial , team_long_reduce) { - TestReduceTeam< long , Kokkos::Serial >( 100000 ); -} - -TEST_F( serial , team_double_reduce) { - TestReduceTeam< double , Kokkos::Serial >( 100000 ); -} - -TEST_F( serial , team_shared_request) { - TestSharedTeam< Kokkos::Serial >(); -} - -TEST_F( serial , team_scan ) -{ - TestScanTeam< Kokkos::Serial >( 10 ); - TestScanTeam< Kokkos::Serial >( 10000 ); -} - - -TEST_F( serial , view_remap ) -{ - enum { N0 = 3 , N1 = 2 , N2 = 8 , N3 = 9 }; - - typedef Kokkos::View< double*[N1][N2][N3] , - Kokkos::LayoutRight , - Kokkos::Serial > output_type ; - - typedef Kokkos::View< int**[N2][N3] , - Kokkos::LayoutLeft , - Kokkos::Serial > input_type ; - - typedef Kokkos::View< int*[N0][N2][N3] , - Kokkos::LayoutLeft , - Kokkos::Serial > diff_type ; - - output_type output( "output" , N0 ); - input_type input ( "input" , N0 , N1 ); - diff_type diff ( "diff" , N0 ); - - int value = 0 ; - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i0 = 0 ; i0 < N0 ; ++i0 ) { - input(i0,i1,i2,i3) = ++value ; - }}}} - - // Kokkos::deep_copy( diff , input ); // throw with incompatible shape - Kokkos::deep_copy( output , input ); - - value = 0 ; - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i0 = 0 ; i0 < N0 ; ++i0 ) { - ++value ; - ASSERT_EQ( value , ((int) output(i0,i1,i2,i3) ) ); - }}}} -} - -//---------------------------------------------------------------------------- - -TEST_F( serial , view_aggregate ) -{ - TestViewAggregate< Kokkos::Serial >(); - TestViewAggregateReduction< Kokkos::Serial >(); -} - -//---------------------------------------------------------------------------- - -TEST_F( serial , atomics ) -{ - const int loop_count = 1e6 ; - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(100,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::Serial>(100,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::Serial>(100,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::Serial>(100,3) ) ); -} - -//---------------------------------------------------------------------------- - -TEST_F( serial, tile_layout ) -{ - TestTile::test< Kokkos::Serial , 1 , 1 >( 1 , 1 ); - TestTile::test< Kokkos::Serial , 1 , 1 >( 2 , 3 ); - TestTile::test< Kokkos::Serial , 1 , 1 >( 9 , 10 ); - - TestTile::test< Kokkos::Serial , 2 , 2 >( 1 , 1 ); - TestTile::test< Kokkos::Serial , 2 , 2 >( 2 , 3 ); - TestTile::test< Kokkos::Serial , 2 , 2 >( 4 , 4 ); - TestTile::test< Kokkos::Serial , 2 , 2 >( 9 , 9 ); - - TestTile::test< Kokkos::Serial , 2 , 4 >( 9 , 9 ); - TestTile::test< Kokkos::Serial , 4 , 2 >( 9 , 9 ); - - TestTile::test< Kokkos::Serial , 4 , 4 >( 1 , 1 ); - TestTile::test< Kokkos::Serial , 4 , 4 >( 4 , 4 ); - TestTile::test< Kokkos::Serial , 4 , 4 >( 9 , 9 ); - TestTile::test< Kokkos::Serial , 4 , 4 >( 9 , 11 ); - - TestTile::test< Kokkos::Serial , 8 , 8 >( 1 , 1 ); - TestTile::test< Kokkos::Serial , 8 , 8 >( 4 , 4 ); - TestTile::test< Kokkos::Serial , 8 , 8 >( 9 , 9 ); - TestTile::test< Kokkos::Serial , 8 , 8 >( 9 , 11 ); -} - -//---------------------------------------------------------------------------- - -TEST_F( serial , compiler_macros ) -{ - ASSERT_TRUE( ( TestCompilerMacros::Test< Kokkos::Serial >() ) ); -} - -//---------------------------------------------------------------------------- - -TEST_F( serial , memory_space ) -{ - TestMemorySpace< Kokkos::Serial >(); -} - -//---------------------------------------------------------------------------- - -TEST_F( serial , task_policy ) -{ - TestTaskPolicy::test_task_dep< Kokkos::Serial >( 10 ); - // TestTaskPolicy::test_norm2< Kokkos::Serial >( 1000 ); - // for ( long i = 0 ; i < 30 ; ++i ) TestTaskPolicy::test_fib< Kokkos::Serial >(i); - // for ( long i = 0 ; i < 40 ; ++i ) TestTaskPolicy::test_fib2< Kokkos::Serial >(i); - for ( long i = 0 ; i < 20 ; ++i ) TestTaskPolicy::test_fib< Kokkos::Serial >(i); - for ( long i = 0 ; i < 25 ; ++i ) TestTaskPolicy::test_fib2< Kokkos::Serial >(i); -} - -TEST_F( serial , task_team ) -{ - TestTaskPolicy::test_task_team< Kokkos::Serial >(1000); -} - -//---------------------------------------------------------------------------- - -TEST_F( serial , template_meta_functions ) -{ - TestTemplateMetaFunctions(); -} - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_SERIAL ) -TEST_F( serial , cxx11 ) -{ - if ( Kokkos::Impl::is_same< Kokkos::DefaultExecutionSpace , Kokkos::Serial >::value ) { - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::Serial >(1) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::Serial >(2) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::Serial >(3) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::Serial >(4) ) ); - } -} -#endif - -TEST_F( serial , reduction_deduction ) -{ - TestCXX11::test_reduction_deduction< Kokkos::Serial >(); -} - -TEST_F( serial , team_vector ) -{ - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Serial >(0) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Serial >(1) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Serial >(2) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Serial >(3) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Serial >(4) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Serial >(5) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Serial >(6) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Serial >(7) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Serial >(8) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Serial >(9) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Serial >(10) ) ); -} - -} // namespace test - diff --git a/lib/kokkos/core/unit_test/TestSharedAlloc.hpp b/lib/kokkos/core/unit_test/TestSharedAlloc.hpp deleted file mode 100644 index 060f5f4605..0000000000 --- a/lib/kokkos/core/unit_test/TestSharedAlloc.hpp +++ /dev/null @@ -1,204 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include -#include - -#include - -/*--------------------------------------------------------------------------*/ - -namespace Test { - -struct SharedAllocDestroy { - - volatile int * count ; - - SharedAllocDestroy() = default ; - SharedAllocDestroy( int * arg ) : count( arg ) {} - - void destroy_shared_allocation() - { - Kokkos::atomic_fetch_add( count , 1 ); - } - -}; - -template< class MemorySpace , class ExecutionSpace > -void test_shared_alloc() -{ -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - - typedef const Kokkos::Experimental::Impl::SharedAllocationHeader Header ; - typedef Kokkos::Experimental::Impl::SharedAllocationTracker Tracker ; - typedef Kokkos::Experimental::Impl::SharedAllocationRecord< void , void > RecordBase ; - typedef Kokkos::Experimental::Impl::SharedAllocationRecord< MemorySpace , void > RecordMemS ; - typedef Kokkos::Experimental::Impl::SharedAllocationRecord< MemorySpace , SharedAllocDestroy > RecordFull ; - - static_assert( sizeof(Tracker) == sizeof(int*), "SharedAllocationTracker has wrong size!" ); - - MemorySpace s ; - - const size_t N = 1200 ; - const size_t size = 8 ; - - RecordMemS * rarray[ N ]; - Header * harray[ N ]; - - RecordMemS ** const r = rarray ; - Header ** const h = harray ; - - Kokkos::RangePolicy< ExecutionSpace > range(0,N); - - //---------------------------------------- - { - Kokkos::parallel_for( range , [=]( size_t i ){ - char name[64] ; - sprintf(name,"test_%.2d",int(i)); - - r[i] = RecordMemS::allocate( s , name , size * ( i + 1 ) ); - h[i] = Header::get_header( r[i]->data() ); - - ASSERT_EQ( r[i]->use_count() , 0 ); - - for ( size_t j = 0 ; j < ( i / 10 ) + 1 ; ++j ) RecordBase::increment( r[i] ); - - ASSERT_EQ( r[i]->use_count() , ( i / 10 ) + 1 ); - ASSERT_EQ( r[i] , RecordMemS::get_record( r[i]->data() ) ); - }); - - // Sanity check for the whole set of allocation records to which this record belongs. - RecordBase::is_sane( r[0] ); - // RecordMemS::print_records( std::cout , s , true ); - - Kokkos::parallel_for( range , [=]( size_t i ){ - while ( 0 != ( r[i] = static_cast< RecordMemS *>( RecordBase::decrement( r[i] ) ) ) ) { - if ( r[i]->use_count() == 1 ) RecordBase::is_sane( r[i] ); - } - }); - } - //---------------------------------------- - { - int destroy_count = 0 ; - SharedAllocDestroy counter( & destroy_count ); - - Kokkos::parallel_for( range , [=]( size_t i ){ - char name[64] ; - sprintf(name,"test_%.2d",int(i)); - - RecordFull * rec = RecordFull::allocate( s , name , size * ( i + 1 ) ); - - rec->m_destroy = counter ; - - r[i] = rec ; - h[i] = Header::get_header( r[i]->data() ); - - ASSERT_EQ( r[i]->use_count() , 0 ); - - for ( size_t j = 0 ; j < ( i / 10 ) + 1 ; ++j ) RecordBase::increment( r[i] ); - - ASSERT_EQ( r[i]->use_count() , ( i / 10 ) + 1 ); - ASSERT_EQ( r[i] , RecordMemS::get_record( r[i]->data() ) ); - }); - - RecordBase::is_sane( r[0] ); - - Kokkos::parallel_for( range , [=]( size_t i ){ - while ( 0 != ( r[i] = static_cast< RecordMemS *>( RecordBase::decrement( r[i] ) ) ) ) { - if ( r[i]->use_count() == 1 ) RecordBase::is_sane( r[i] ); - } - }); - - ASSERT_EQ( destroy_count , int(N) ); - } - - //---------------------------------------- - { - int destroy_count = 0 ; - - { - RecordFull * rec = RecordFull::allocate( s , "test" , size ); - - // ... Construction of the allocated { rec->data() , rec->size() } - - // Copy destruction function object into the allocation record - rec->m_destroy = SharedAllocDestroy( & destroy_count ); - - // Start tracking, increments the use count from 0 to 1 - Tracker track( rec ); - - ASSERT_EQ( rec->use_count() , 1 ); - - // Verify construction / destruction increment - for ( size_t i = 0 ; i < N ; ++i ) { - ASSERT_EQ( rec->use_count() , 1 ); - { - Tracker local_tracker( rec ); - ASSERT_EQ( rec->use_count() , 2 ); - } - ASSERT_EQ( rec->use_count() , 1 ); - } - - Kokkos::parallel_for( range , [=]( size_t i ){ - Tracker local_tracker( rec ); - ASSERT_GT( rec->use_count() , 1 ); - }); - - ASSERT_EQ( rec->use_count() , 1 ); - - // Destruction of 'track' object deallocates the 'rec' and invokes the destroy function object. - } - - ASSERT_EQ( destroy_count , 1 ); - } - -#endif /* #if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) */ - -} - - -} - diff --git a/lib/kokkos/core/unit_test/TestTaskPolicy.hpp b/lib/kokkos/core/unit_test/TestTaskPolicy.hpp deleted file mode 100644 index fa09e9a0c1..0000000000 --- a/lib/kokkos/core/unit_test/TestTaskPolicy.hpp +++ /dev/null @@ -1,490 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - - -#ifndef KOKKOS_UNITTEST_TASKPOLICY_HPP -#define KOKKOS_UNITTEST_TASKPOLICY_HPP - -#include -#include -#include -#include - -namespace TestTaskPolicy { - -//---------------------------------------------------------------------------- - -template< class ExecSpace > -struct FibChild { - - typedef long value_type ; - - Kokkos::Experimental::TaskPolicy policy ; - const value_type n ; - int has_nested ; - - FibChild( const Kokkos::Experimental::TaskPolicy & arg_policy - , const value_type arg_n ) - : policy(arg_policy,2) /* default dependence capacity = 2 */ - , n( arg_n ), has_nested(0) {} - - inline - void apply( value_type & result ) - { - if ( n < 2 ) { - - has_nested = -1 ; - - result = n ; - } - else { - if ( has_nested == 0 ) { - // Spawn new children and respawn myself to sum their results: - has_nested = 2 ; - - Kokkos::Experimental::respawn - ( policy - , this - , Kokkos::Experimental::spawn( policy , FibChild(policy,n-1) ) - , Kokkos::Experimental::spawn( policy , FibChild(policy,n-2) ) - ); - - } - else if ( has_nested == 2 ) { - - has_nested = -1 ; - - const Kokkos::Experimental::Future fib_1 = policy.get_dependence(this,0); - const Kokkos::Experimental::Future fib_2 = policy.get_dependence(this,1); - - result = fib_1.get() + fib_2.get(); - } - else { - fprintf(stderr,"FibChild(%ld) execution error\n",(long)n); - fflush(stderr); - } - } - } -}; - -template< class ExecSpace > -struct FibChild2 { - - typedef long value_type ; - - Kokkos::Experimental::TaskPolicy policy ; - const value_type n ; - int has_nested ; - - FibChild2( const Kokkos::Experimental::TaskPolicy & arg_policy - , const value_type arg_n ) - : policy(arg_policy,2) /* default dependence capacity = 2 */ - , n( arg_n ), has_nested(0) {} - - inline - void apply( value_type & result ) - { - if ( 0 == has_nested ) { - if ( n < 2 ) { - - has_nested = -1 ; - - result = n ; - } - else if ( n < 4 ) { - // Spawn new children and respawn myself to sum their results: - // result = Fib(n-1) + Fib(n-2) - has_nested = 2 ; - // Kokkos::respawn implements the following steps: - policy.clear_dependence( this ); - policy.add_dependence( this , Kokkos::Experimental::spawn( policy , FibChild2(policy,n-1) ) ); - policy.add_dependence( this , Kokkos::Experimental::spawn( policy , FibChild2(policy,n-2) ) ); - policy.respawn( this ); - } - else { - // Spawn new children and respawn myself to sum their results: - // result = Fib(n-1) + Fib(n-2) - // result = ( Fib(n-2) + Fib(n-3) ) + ( Fib(n-3) + Fib(n-4) ) - // result = ( ( Fib(n-3) + Fib(n-4) ) + Fib(n-3) ) + ( Fib(n-3) + Fib(n-4) ) - // result = 3 * Fib(n-3) + 2 * Fib(n-4) - has_nested = 4 ; - // Kokkos::Experimental::respawn implements the following steps: - policy.clear_dependence( this ); - policy.add_dependence( this , Kokkos::Experimental::spawn( policy , FibChild2(policy,n-3) ) ); - policy.add_dependence( this , Kokkos::Experimental::spawn( policy , FibChild2(policy,n-4) ) ); - policy.respawn( this ); - } - } - else if ( 2 == has_nested || 4 == has_nested ) { - const Kokkos::Experimental::Future fib_a = policy.get_dependence(this,0); - const Kokkos::Experimental::Future fib_b = policy.get_dependence(this,1); - - result = ( has_nested == 2 ) ? fib_a.get() + fib_b.get() - : 3 * fib_a.get() + 2 * fib_b.get() ; - - has_nested = -1 ; - } - else { - fprintf(stderr,"FibChild2(%ld) execution error\n",(long)n); - fflush(stderr); - } - } -}; - -namespace { - -long eval_fib( long n ) -{ - if ( n < 2 ) return n ; - - std::vector fib(n+1); - - fib[0] = 0 ; - fib[1] = 1 ; - - for ( long i = 2 ; i <= n ; ++i ) { fib[i] = fib[i-2] + fib[i-1]; } - - return fib[n]; -} - -} - -template< class ExecSpace > -void test_fib( long n ) -{ - Kokkos::Experimental::TaskPolicy policy(2); - - Kokkos::Experimental::Future f = Kokkos::Experimental::spawn( policy , FibChild(policy,n) ); - - Kokkos::Experimental::wait( policy ); - - if ( f.get() != eval_fib(n) ) { - std::cout << "Fib(" << n << ") = " << f.get(); - std::cout << " != " << eval_fib(n); - std::cout << std::endl ; - } -} - -template< class ExecSpace > -void test_fib2( long n ) -{ - Kokkos::Experimental::TaskPolicy policy(2); // default dependence capacity - - Kokkos::Experimental::Future f = Kokkos::Experimental::spawn( policy , FibChild2(policy,n) ); - - Kokkos::Experimental::wait( policy ); - - if ( f.get() != eval_fib(n) ) { - std::cout << "Fib2(" << n << ") = " << f.get(); - std::cout << " != " << eval_fib(n); - std::cout << std::endl ; - } -} - -//---------------------------------------------------------------------------- - -template< class ExecSpace > -struct Norm2 { - - typedef double value_type ; - - const double * const m_x ; - - Norm2( const double * x ) : m_x(x) {} - - inline - void init( double & val ) const { val = 0 ; } - - inline - void operator()( int i , double & val ) const { val += m_x[i] * m_x[i] ; } - - void apply( double & dst ) const { dst = std::sqrt( dst ); } -}; - -template< class ExecSpace > -void test_norm2( const int n ) -{ - Kokkos::Experimental::TaskPolicy< ExecSpace > policy ; - - double * const x = new double[n]; - - for ( int i = 0 ; i < n ; ++i ) x[i] = 1 ; - - Kokkos::RangePolicy r(0,n); - - Kokkos::Experimental::Future f = Kokkos::Experimental::spawn_reduce( policy , r , Norm2(x) ); - - Kokkos::Experimental::wait( policy ); - -#if defined(PRINT) - std::cout << "Norm2: " << f.get() << std::endl ; -#endif - - delete[] x ; -} - -//---------------------------------------------------------------------------- - -template< class Space > -struct TaskDep { - - typedef int value_type ; - typedef Kokkos::Experimental::TaskPolicy< Space > policy_type ; - - const policy_type policy ; - const int input ; - - TaskDep( const policy_type & arg_p , const int arg_i ) - : policy( arg_p ), input( arg_i ) {} - - void apply( int & val ) - { - val = input ; - const int num = policy.get_dependence( this ); - - for ( int i = 0 ; i < num ; ++i ) { - Kokkos::Experimental::Future f = policy.get_dependence( this , i ); - val += f.get(); - } - } -}; - - -template< class Space > -void test_task_dep( const int n ) -{ - enum { NTEST = 64 }; - - Kokkos::Experimental::TaskPolicy< Space > policy ; - - Kokkos::Experimental::Future f[ NTEST ]; - - for ( int i = 0 ; i < NTEST ; ++i ) { - // Create task in the "constructing" state with capacity for 'n+1' dependences - f[i] = policy.create( TaskDep(policy,0) , n + 1 ); - - if ( f[i].get_task_state() != Kokkos::Experimental::TASK_STATE_CONSTRUCTING ) { - Kokkos::Impl::throw_runtime_exception("get_task_state() != Kokkos::Experimental::TASK_STATE_CONSTRUCTING"); - } - - // Only use 'n' dependences - - for ( int j = 0 ; j < n ; ++j ) { - - Kokkos::Experimental::Future nested = policy.create( TaskDep(policy,j+1) ); - - policy.spawn( nested ); - - // Add dependence to a "constructing" task - policy.add_dependence( f[i] , nested ); - } - - // Spawn task from the "constructing" to the "waiting" state - policy.spawn( f[i] ); - } - - const int answer = n % 2 ? n * ( ( n + 1 ) / 2 ) : ( n / 2 ) * ( n + 1 ); - - Kokkos::Experimental::wait( policy ); - - int error = 0 ; - for ( int i = 0 ; i < NTEST ; ++i ) { - if ( f[i].get_task_state() != Kokkos::Experimental::TASK_STATE_COMPLETE ) { - Kokkos::Impl::throw_runtime_exception("get_task_state() != Kokkos::Experimental::TASK_STATE_COMPLETE"); - } - if ( answer != f[i].get() && 0 == error ) { - std::cout << "test_task_dep(" << n << ") ERROR at[" << i << "]" - << " answer(" << answer << ") != result(" << f[i].get() << ")" << std::endl ; - } - } -} - -//---------------------------------------------------------------------------- - -template< class ExecSpace > -struct TaskTeam { - - enum { SPAN = 8 }; - - typedef void value_type ; - typedef Kokkos::Experimental::TaskPolicy policy_type ; - typedef Kokkos::Experimental::Future future_type ; - typedef Kokkos::View view_type ; - - policy_type policy ; - future_type future ; - - view_type result ; - const long nvalue ; - - TaskTeam( const policy_type & arg_policy - , const view_type & arg_result - , const long arg_nvalue ) - : policy(arg_policy) - , future() - , result( arg_result ) - , nvalue( arg_nvalue ) - {} - - inline - void apply( const typename policy_type::member_type & member ) - { - const long end = nvalue + 1 ; - const long begin = 0 < end - SPAN ? end - SPAN : 0 ; - - if ( 0 < begin && future.get_task_state() == Kokkos::Experimental::TASK_STATE_NULL ) { - if ( member.team_rank() == 0 ) { - future = policy.spawn( policy.create_team( TaskTeam( policy , result , begin - 1 ) ) ); - policy.clear_dependence( this ); - policy.add_dependence( this , future ); - policy.respawn( this ); - } - return ; - } - - Kokkos::parallel_for( Kokkos::TeamThreadRange(member,begin,end) - , [&]( int i ) { result[i] = i + 1 ; } - ); - } -}; - -template< class ExecSpace > -struct TaskTeamValue { - - enum { SPAN = 8 }; - - typedef long value_type ; - typedef Kokkos::Experimental::TaskPolicy policy_type ; - typedef Kokkos::Experimental::Future future_type ; - typedef Kokkos::View view_type ; - - policy_type policy ; - future_type future ; - - view_type result ; - const long nvalue ; - - TaskTeamValue( const policy_type & arg_policy - , const view_type & arg_result - , const long arg_nvalue ) - : policy(arg_policy) - , future() - , result( arg_result ) - , nvalue( arg_nvalue ) - {} - - inline - void apply( const typename policy_type::member_type & member , value_type & final ) - { - const long end = nvalue + 1 ; - const long begin = 0 < end - SPAN ? end - SPAN : 0 ; - - if ( 0 < begin && future.get_task_state() == Kokkos::Experimental::TASK_STATE_NULL ) { - if ( member.team_rank() == 0 ) { - future = policy.spawn( policy.create_team( TaskTeamValue( policy , result , begin - 1 ) ) ); - policy.clear_dependence( this ); - policy.add_dependence( this , future ); - policy.respawn( this ); - } - return ; - } - - Kokkos::parallel_for( Kokkos::TeamThreadRange(member,begin,end) - , [&]( int i ) { result[i] = i + 1 ; } - ); - - if ( member.team_rank() == 0 ) { - final = result[nvalue] ; - } - - Kokkos::memory_fence(); - } -}; - -template< class ExecSpace > -void test_task_team( long n ) -{ - typedef TaskTeam< ExecSpace > task_type ; - typedef TaskTeamValue< ExecSpace > task_value_type ; - typedef typename task_type::view_type view_type ; - typedef typename task_type::policy_type policy_type ; - - typedef typename task_type::future_type future_type ; - typedef typename task_value_type::future_type future_value_type ; - - policy_type policy ; - view_type result("result",n+1); - - future_type f = policy.spawn( policy.create_team( task_type( policy , result , n ) ) ); - - Kokkos::Experimental::wait( policy ); - - for ( long i = 0 ; i <= n ; ++i ) { - const long answer = i + 1 ; - if ( result(i) != answer ) { - std::cerr << "test_task_team void ERROR result(" << i << ") = " << result(i) << " != " << answer << std::endl ; - } - } - - future_value_type fv = policy.spawn( policy.create_team( task_value_type( policy , result , n ) ) ); - - Kokkos::Experimental::wait( policy ); - - if ( fv.get() != n + 1 ) { - std::cerr << "test_task_team value ERROR future = " << fv.get() << " != " << n + 1 << std::endl ; - } - for ( long i = 0 ; i <= n ; ++i ) { - const long answer = i + 1 ; - if ( result(i) != answer ) { - std::cerr << "test_task_team value ERROR result(" << i << ") = " << result(i) << " != " << answer << std::endl ; - } - } -} - -//---------------------------------------------------------------------------- - -} // namespace TestTaskPolicy - -#endif /* #ifndef KOKKOS_UNITTEST_TASKPOLICY_HPP */ - - diff --git a/lib/kokkos/core/unit_test/TestTeam.hpp b/lib/kokkos/core/unit_test/TestTeam.hpp deleted file mode 100644 index 4849f18dfb..0000000000 --- a/lib/kokkos/core/unit_test/TestTeam.hpp +++ /dev/null @@ -1,466 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include - -#include - -/*--------------------------------------------------------------------------*/ - -namespace Test { -namespace { - -template< class ExecSpace > -struct TestTeamPolicy { - - typedef typename Kokkos::TeamPolicy< ExecSpace >::member_type team_member ; - typedef Kokkos::View view_type ; - - view_type m_flags ; - - TestTeamPolicy( const size_t league_size ) - : m_flags( Kokkos::ViewAllocateWithoutInitializing("flags") - , Kokkos::TeamPolicy< ExecSpace >::team_size_max( *this ) - , league_size ) - {} - - struct VerifyInitTag {}; - - KOKKOS_INLINE_FUNCTION - void operator()( const team_member & member ) const - { - const int tid = member.team_rank() + member.team_size() * member.league_rank(); - - m_flags( member.team_rank() , member.league_rank() ) = tid ; - } - - KOKKOS_INLINE_FUNCTION - void operator()( const VerifyInitTag & , const team_member & member ) const - { - const int tid = member.team_rank() + member.team_size() * member.league_rank(); - - if ( tid != m_flags( member.team_rank() , member.league_rank() ) ) { - printf("TestTeamPolicy member(%d,%d) error %d != %d\n" - , member.league_rank() , member.team_rank() - , tid , m_flags( member.team_rank() , member.league_rank() ) ); - } - } - - static void test_for( const size_t league_size ) - { - TestTeamPolicy functor( league_size ); - - const int team_size = Kokkos::TeamPolicy< ExecSpace >::team_size_max( functor ); - - Kokkos::parallel_for( Kokkos::TeamPolicy< ExecSpace >( league_size , team_size ) , functor ); - Kokkos::parallel_for( Kokkos::TeamPolicy< ExecSpace , VerifyInitTag >( league_size , team_size ) , functor ); - } - - struct ReduceTag {}; - - typedef long value_type ; - - KOKKOS_INLINE_FUNCTION - void operator()( const team_member & member , value_type & update ) const - { - update += member.team_rank() + member.team_size() * member.league_rank(); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const ReduceTag & , const team_member & member , value_type & update ) const - { - update += 1 + member.team_rank() + member.team_size() * member.league_rank(); - } - - static void test_reduce( const size_t league_size ) - { - TestTeamPolicy functor( league_size ); - - const int team_size = Kokkos::TeamPolicy< ExecSpace >::team_size_max( functor ); - const long N = team_size * league_size ; - - long total = 0 ; - - Kokkos::parallel_reduce( Kokkos::TeamPolicy< ExecSpace >( league_size , team_size ) , functor , total ); - ASSERT_EQ( size_t((N-1)*(N))/2 , size_t(total) ); - - Kokkos::parallel_reduce( Kokkos::TeamPolicy< ExecSpace , ReduceTag >( league_size , team_size ) , functor , total ); - ASSERT_EQ( (size_t(N)*size_t(N+1))/2 , size_t(total) ); - } -}; - -} -} - -/*--------------------------------------------------------------------------*/ - -namespace Test { - -template< typename ScalarType , class DeviceType > -class ReduceTeamFunctor -{ -public: - typedef DeviceType execution_space ; - typedef Kokkos::TeamPolicy< execution_space > policy_type ; - typedef typename execution_space::size_type size_type ; - - struct value_type { - ScalarType value[3] ; - }; - - const size_type nwork ; - - ReduceTeamFunctor( const size_type & arg_nwork ) : nwork( arg_nwork ) {} - - ReduceTeamFunctor( const ReduceTeamFunctor & rhs ) - : nwork( rhs.nwork ) {} - - KOKKOS_INLINE_FUNCTION - void init( value_type & dst ) const - { - dst.value[0] = 0 ; - dst.value[1] = 0 ; - dst.value[2] = 0 ; - } - - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & dst , - const volatile value_type & src ) const - { - dst.value[0] += src.value[0] ; - dst.value[1] += src.value[1] ; - dst.value[2] += src.value[2] ; - } - - KOKKOS_INLINE_FUNCTION - void operator()( const typename policy_type::member_type ind , value_type & dst ) const - { - const int thread_rank = ind.team_rank() + ind.team_size() * ind.league_rank(); - const int thread_size = ind.team_size() * ind.league_size(); - const int chunk = ( nwork + thread_size - 1 ) / thread_size ; - - size_type iwork = chunk * thread_rank ; - const size_type iwork_end = iwork + chunk < nwork ? iwork + chunk : nwork ; - - for ( ; iwork < iwork_end ; ++iwork ) { - dst.value[0] += 1 ; - dst.value[1] += iwork + 1 ; - dst.value[2] += nwork - iwork ; - } - } -}; - -} // namespace Test - -namespace { - -template< typename ScalarType , class DeviceType > -class TestReduceTeam -{ -public: - typedef DeviceType execution_space ; - typedef Kokkos::TeamPolicy< execution_space > policy_type ; - typedef typename execution_space::size_type size_type ; - - //------------------------------------ - - TestReduceTeam( const size_type & nwork ) - { - run_test(nwork); - } - - void run_test( const size_type & nwork ) - { - typedef Test::ReduceTeamFunctor< ScalarType , execution_space > functor_type ; - typedef typename functor_type::value_type value_type ; - typedef Kokkos::View< value_type, Kokkos::HostSpace, Kokkos::MemoryUnmanaged > result_type ; - - enum { Count = 3 }; - enum { Repeat = 100 }; - - value_type result[ Repeat ]; - - const unsigned long nw = nwork ; - const unsigned long nsum = nw % 2 ? nw * (( nw + 1 )/2 ) - : (nw/2) * ( nw + 1 ); - - const unsigned team_size = policy_type::team_size_recommended( functor_type(nwork) ); - const unsigned league_size = ( nwork + team_size - 1 ) / team_size ; - - policy_type team_exec( league_size , team_size ); - - for ( unsigned i = 0 ; i < Repeat ; ++i ) { - result_type tmp( & result[i] ); - Kokkos::parallel_reduce( team_exec , functor_type(nwork) , tmp ); - } - - execution_space::fence(); - - for ( unsigned i = 0 ; i < Repeat ; ++i ) { - for ( unsigned j = 0 ; j < Count ; ++j ) { - const unsigned long correct = 0 == j % 3 ? nw : nsum ; - ASSERT_EQ( (ScalarType) correct , result[i].value[j] ); - } - } - } -}; - -} - -/*--------------------------------------------------------------------------*/ - -namespace Test { - -template< class DeviceType > -class ScanTeamFunctor -{ -public: - typedef DeviceType execution_space ; - typedef Kokkos::TeamPolicy< execution_space > policy_type ; - - typedef long int value_type ; - Kokkos::View< value_type , execution_space > accum ; - Kokkos::View< value_type , execution_space > total ; - - ScanTeamFunctor() : accum("accum"), total("total") {} - - KOKKOS_INLINE_FUNCTION - void init( value_type & error ) const { error = 0 ; } - - KOKKOS_INLINE_FUNCTION - void join( value_type volatile & error , - value_type volatile const & input ) const - { if ( input ) error = 1 ; } - - struct JoinMax { - typedef long int value_type ; - KOKKOS_INLINE_FUNCTION - void join( value_type volatile & dst - , value_type volatile const & input ) const - { if ( dst < input ) dst = input ; } - }; - - KOKKOS_INLINE_FUNCTION - void operator()( const typename policy_type::member_type ind , value_type & error ) const - { - if ( 0 == ind.league_rank() && 0 == ind.team_rank() ) { - const long int thread_count = ind.league_size() * ind.team_size(); - total() = ( thread_count * ( thread_count + 1 ) ) / 2 ; - } - - // Team max: - const int long m = ind.team_reduce( (long int) ( ind.league_rank() + ind.team_rank() ) , JoinMax() ); - - if ( m != ind.league_rank() + ( ind.team_size() - 1 ) ) { - printf("ScanTeamFunctor[%d.%d of %d.%d] reduce_max_answer(%ld) != reduce_max(%ld)\n" - , ind.league_rank(), ind.team_rank() - , ind.league_size(), ind.team_size() - , (long int)(ind.league_rank() + ( ind.team_size() - 1 )) , m ); - } - - // Scan: - const long int answer = - ( ind.league_rank() + 1 ) * ind.team_rank() + - ( ind.team_rank() * ( ind.team_rank() + 1 ) ) / 2 ; - - const long int result = - ind.team_scan( ind.league_rank() + 1 + ind.team_rank() + 1 ); - - const long int result2 = - ind.team_scan( ind.league_rank() + 1 + ind.team_rank() + 1 ); - - if ( answer != result || answer != result2 ) { - printf("ScanTeamFunctor[%d.%d of %d.%d] answer(%ld) != scan_first(%ld) or scan_second(%ld)\n", - ind.league_rank(), ind.team_rank(), - ind.league_size(), ind.team_size(), - answer,result,result2); - error = 1 ; - } - - const long int thread_rank = ind.team_rank() + - ind.team_size() * ind.league_rank(); - ind.team_scan( 1 + thread_rank , accum.ptr_on_device() ); - } -}; - -template< class DeviceType > -class TestScanTeam -{ -public: - typedef DeviceType execution_space ; - typedef long int value_type ; - - typedef Kokkos::TeamPolicy< execution_space > policy_type ; - typedef Test::ScanTeamFunctor functor_type ; - - //------------------------------------ - - TestScanTeam( const size_t nteam ) - { - run_test(nteam); - } - - void run_test( const size_t nteam ) - { - typedef Kokkos::View< long int , Kokkos::HostSpace , Kokkos::MemoryUnmanaged > result_type ; - - const unsigned REPEAT = 100000 ; - const unsigned Repeat = ( REPEAT + nteam - 1 ) / nteam ; - - functor_type functor ; - - policy_type team_exec( nteam , policy_type::team_size_max( functor ) ); - - for ( unsigned i = 0 ; i < Repeat ; ++i ) { - long int accum = 0 ; - long int total = 0 ; - long int error = 0 ; - Kokkos::deep_copy( functor.accum , total ); - Kokkos::parallel_reduce( team_exec , functor , result_type( & error ) ); - DeviceType::fence(); - Kokkos::deep_copy( accum , functor.accum ); - Kokkos::deep_copy( total , functor.total ); - - ASSERT_EQ( error , 0 ); - ASSERT_EQ( total , accum ); - } - - execution_space::fence(); - } -}; - -} // namespace Test - -/*--------------------------------------------------------------------------*/ - -namespace Test { - -template< class ExecSpace > -struct SharedTeamFunctor { - - typedef ExecSpace execution_space ; - typedef int value_type ; - typedef Kokkos::TeamPolicy< execution_space > policy_type ; - - enum { SHARED_COUNT = 1000 }; - - typedef typename ExecSpace::scratch_memory_space shmem_space ; - - // tbd: MemoryUnmanaged should be the default for shared memory space - typedef Kokkos::View shared_int_array_type ; - - // Tell how much shared memory will be required by this functor: - inline - unsigned team_shmem_size( int /* team_size */ ) const - { - return shared_int_array_type::shmem_size( SHARED_COUNT ) + - shared_int_array_type::shmem_size( SHARED_COUNT ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const typename policy_type::member_type & ind , value_type & update ) const - { - const shared_int_array_type shared_A( ind.team_shmem() , SHARED_COUNT ); - const shared_int_array_type shared_B( ind.team_shmem() , SHARED_COUNT ); - - if ((shared_A.ptr_on_device () == NULL && SHARED_COUNT > 0) || - (shared_B.ptr_on_device () == NULL && SHARED_COUNT > 0)) { - printf ("Failed to allocate shared memory of size %lu\n", - static_cast (SHARED_COUNT)); - ++update; // failure to allocate is an error - } - else { - for ( int i = ind.team_rank() ; i < SHARED_COUNT ; i += ind.team_size() ) { - shared_A[i] = i + ind.league_rank(); - shared_B[i] = 2 * i + ind.league_rank(); - } - - ind.team_barrier(); - - if ( ind.team_rank() + 1 == ind.team_size() ) { - for ( int i = 0 ; i < SHARED_COUNT ; ++i ) { - if ( shared_A[i] != i + ind.league_rank() ) { - ++update ; - } - if ( shared_B[i] != 2 * i + ind.league_rank() ) { - ++update ; - } - } - } - } - } -}; - -} - -namespace { - -template< class ExecSpace > -struct TestSharedTeam { - - TestSharedTeam() - { run(); } - - void run() - { - typedef Test::SharedTeamFunctor Functor ; - typedef Kokkos::View< typename Functor::value_type , Kokkos::HostSpace , Kokkos::MemoryUnmanaged > result_type ; - - const size_t team_size = Kokkos::TeamPolicy< ExecSpace >::team_size_max( Functor() ); - - Kokkos::TeamPolicy< ExecSpace > team_exec( 8192 / team_size , team_size ); - - typename Functor::value_type error_count = 0 ; - - Kokkos::parallel_reduce( team_exec , Functor() , result_type( & error_count ) ); - - ASSERT_EQ( error_count , 0 ); - } -}; - -} - -/*--------------------------------------------------------------------------*/ diff --git a/lib/kokkos/core/unit_test/TestTeamVector.hpp b/lib/kokkos/core/unit_test/TestTeamVector.hpp deleted file mode 100644 index 48187f0368..0000000000 --- a/lib/kokkos/core/unit_test/TestTeamVector.hpp +++ /dev/null @@ -1,646 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include -#include - -namespace TestTeamVector { - -struct my_complex { - double re,im; - int dummy; - KOKKOS_INLINE_FUNCTION - my_complex() { - re = 0.0; - im = 0.0; - dummy = 0; - } - KOKKOS_INLINE_FUNCTION - my_complex(const my_complex& src) { - re = src.re; - im = src.im; - dummy = src.dummy; - } - - KOKKOS_INLINE_FUNCTION - my_complex(const volatile my_complex& src) { - re = src.re; - im = src.im; - dummy = src.dummy; - } - - KOKKOS_INLINE_FUNCTION - my_complex(const double& val) { - re = val; - im = 0.0; - dummy = 0; - } - KOKKOS_INLINE_FUNCTION - my_complex& operator += (const my_complex& src) { - re += src.re; - im += src.im; - dummy += src.dummy; - return *this; - } - - KOKKOS_INLINE_FUNCTION - void operator += (const volatile my_complex& src) volatile { - re += src.re; - im += src.im; - dummy += src.dummy; - } - KOKKOS_INLINE_FUNCTION - my_complex& operator *= (const my_complex& src) { - double re_tmp = re*src.re - im*src.im; - double im_tmp = re * src.im + im * src.re; - re = re_tmp; - im = im_tmp; - dummy *= src.dummy; - return *this; - } - KOKKOS_INLINE_FUNCTION - void operator *= (const volatile my_complex& src) volatile { - double re_tmp = re*src.re - im*src.im; - double im_tmp = re * src.im + im * src.re; - re = re_tmp; - im = im_tmp; - dummy *= src.dummy; - } - KOKKOS_INLINE_FUNCTION - bool operator == (const my_complex& src) { - return (re == src.re) && (im == src.im) && ( dummy == src.dummy ); - } - KOKKOS_INLINE_FUNCTION - bool operator != (const my_complex& src) { - return (re != src.re) || (im != src.im) || ( dummy != src.dummy ); - } - KOKKOS_INLINE_FUNCTION - bool operator != (const double& val) { - return (re != val) || - (im != 0) || (dummy != 0); - } - KOKKOS_INLINE_FUNCTION - my_complex& operator= (const int& val) { - re = val; - im = 0.0; - dummy = 0; - return *this; - } - KOKKOS_INLINE_FUNCTION - my_complex& operator= (const double& val) { - re = val; - im = 0.0; - dummy = 0; - return *this; - } - KOKKOS_INLINE_FUNCTION - operator double() { - return re; - } -}; - -template -struct functor_team_for { - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_team_for(Kokkos::View flag_):flag(flag_) {} - - unsigned team_shmem_size(int team_size) const {return team_size*13*sizeof(Scalar)+8;} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team) const { - - typedef typename ExecutionSpace::scratch_memory_space shmem_space ; - typedef Kokkos::View shared_int; - typedef typename shared_int::size_type size_type; - - const size_type shmemSize = team.team_size () * 13; - shared_int values = shared_int (team.team_shmem (), shmemSize); - - if (values.ptr_on_device () == NULL || values.dimension_0 () < shmemSize) { - printf ("FAILED to allocate shared memory of size %u\n", - static_cast (shmemSize)); - } - else { - - // Initialize shared memory - values(team.team_rank ()) = 0; - - // Accumulate value into per thread shared memory - // This is non blocking - Kokkos::parallel_for(Kokkos::TeamThreadRange(team,131),[&] (int i) { - values(team.team_rank ()) += i - team.league_rank () + team.league_size () + team.team_size (); - }); - // Wait for all memory to be written - team.team_barrier (); - // One thread per team executes the comparison - Kokkos::single(Kokkos::PerTeam(team),[&]() { - Scalar test = 0; - Scalar value = 0; - for (int i = 0; i < 131; ++i) { - test += i - team.league_rank () + team.league_size () + team.team_size (); - } - for (int i = 0; i < team.team_size (); ++i) { - value += values(i); - } - if (test != value) { - printf ("FAILED team_parallel_for %i %i %f %f\n", - team.league_rank (), team.team_rank (), - static_cast (test), static_cast (value)); - flag() = 1; - } - }); - } - } -}; - -template -struct functor_team_reduce { - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_team_reduce(Kokkos::View flag_):flag(flag_) {} - - unsigned team_shmem_size(int team_size) const {return team_size*13*sizeof(Scalar)+8;} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team) const { - - Scalar value = Scalar(); - Kokkos::parallel_reduce(Kokkos::TeamThreadRange(team,131),[&] (int i, Scalar& val) { - val += i - team.league_rank () + team.league_size () + team.team_size (); - },value); - - team.team_barrier (); - Kokkos::single(Kokkos::PerTeam(team),[&]() { - Scalar test = 0; - for (int i = 0; i < 131; ++i) { - test += i - team.league_rank () + team.league_size () + team.team_size (); - } - if (test != value) { - if(team.league_rank() == 0) - printf ("FAILED team_parallel_reduce %i %i %f %f %lu\n", - team.league_rank (), team.team_rank (), - static_cast (test), static_cast (value),sizeof(Scalar)); - flag() = 1; - } - }); - } -}; - -template -struct functor_team_reduce_join { - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_team_reduce_join(Kokkos::View flag_):flag(flag_) {} - - unsigned team_shmem_size(int team_size) const {return team_size*13*sizeof(Scalar)+8;} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team) const { - - Scalar value = 0; - - Kokkos::parallel_reduce(Kokkos::TeamThreadRange(team,131) - , [&] (int i, Scalar& val) { - val += i - team.league_rank () + team.league_size () + team.team_size (); - } - , [&] (volatile Scalar& val, const volatile Scalar& src) {val+=src;} - , value - ); - - team.team_barrier (); - Kokkos::single(Kokkos::PerTeam(team),[&]() { - Scalar test = 0; - for (int i = 0; i < 131; ++i) { - test += i - team.league_rank () + team.league_size () + team.team_size (); - } - if (test != value) { - printf ("FAILED team_vector_parallel_reduce_join %i %i %f %f\n", - team.league_rank (), team.team_rank (), - static_cast (test), static_cast (value)); - flag() = 1; - } - }); - } -}; - -template -struct functor_team_vector_for { - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_team_vector_for(Kokkos::View flag_):flag(flag_) {} - - unsigned team_shmem_size(int team_size) const {return team_size*13*sizeof(Scalar)+8;} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team) const { - - typedef typename ExecutionSpace::scratch_memory_space shmem_space ; - typedef Kokkos::View shared_int; - typedef typename shared_int::size_type size_type; - - const size_type shmemSize = team.team_size () * 13; - shared_int values = shared_int (team.team_shmem (), shmemSize); - - if (values.ptr_on_device () == NULL || values.dimension_0 () < shmemSize) { - printf ("FAILED to allocate shared memory of size %u\n", - static_cast (shmemSize)); - } - else { - Kokkos::single(Kokkos::PerThread(team),[&] () { - values(team.team_rank ()) = 0; - }); - - Kokkos::parallel_for(Kokkos::TeamThreadRange(team,131),[&] (int i) { - Kokkos::single(Kokkos::PerThread(team),[&] () { - values(team.team_rank ()) += i - team.league_rank () + team.league_size () + team.team_size (); - }); - }); - - team.team_barrier (); - Kokkos::single(Kokkos::PerTeam(team),[&]() { - Scalar test = 0; - Scalar value = 0; - for (int i = 0; i < 131; ++i) { - test += i - team.league_rank () + team.league_size () + team.team_size (); - } - for (int i = 0; i < team.team_size (); ++i) { - value += values(i); - } - if (test != value) { - printf ("FAILED team_vector_parallel_for %i %i %f %f\n", - team.league_rank (), team.team_rank (), - static_cast (test), static_cast (value)); - flag() = 1; - } - }); - } - } -}; - -template -struct functor_team_vector_reduce { - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_team_vector_reduce(Kokkos::View flag_):flag(flag_) {} - - unsigned team_shmem_size(int team_size) const {return team_size*13*sizeof(Scalar)+8;} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team) const { - - Scalar value = Scalar(); - Kokkos::parallel_reduce(Kokkos::TeamThreadRange(team,131),[&] (int i, Scalar& val) { - val += i - team.league_rank () + team.league_size () + team.team_size (); - },value); - - team.team_barrier (); - Kokkos::single(Kokkos::PerTeam(team),[&]() { - Scalar test = 0; - for (int i = 0; i < 131; ++i) { - test += i - team.league_rank () + team.league_size () + team.team_size (); - } - if (test != value) { - if(team.league_rank() == 0) - printf ("FAILED team_vector_parallel_reduce %i %i %f %f %lu\n", - team.league_rank (), team.team_rank (), - static_cast (test), static_cast (value),sizeof(Scalar)); - flag() = 1; - } - }); - } -}; - -template -struct functor_team_vector_reduce_join { - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_team_vector_reduce_join(Kokkos::View flag_):flag(flag_) {} - - unsigned team_shmem_size(int team_size) const {return team_size*13*sizeof(Scalar)+8;} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team) const { - - Scalar value = 0; - Kokkos::parallel_reduce(Kokkos::TeamThreadRange(team,131) - , [&] (int i, Scalar& val) { - val += i - team.league_rank () + team.league_size () + team.team_size (); - } - , [&] (volatile Scalar& val, const volatile Scalar& src) {val+=src;} - , value - ); - - team.team_barrier (); - Kokkos::single(Kokkos::PerTeam(team),[&]() { - Scalar test = 0; - for (int i = 0; i < 131; ++i) { - test += i - team.league_rank () + team.league_size () + team.team_size (); - } - if (test != value) { - printf ("FAILED team_vector_parallel_reduce_join %i %i %f %f\n", - team.league_rank (), team.team_rank (), - static_cast (test), static_cast (value)); - flag() = 1; - } - }); - } -}; - -template -struct functor_vec_single { - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_vec_single(Kokkos::View flag_):flag(flag_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team) const { - - // Warning: this test case intentionally violates permissable semantics - // It is not valid to get references to members of the enclosing region - // inside a parallel_for and write to it. - Scalar value = 0; - - Kokkos::parallel_for(Kokkos::ThreadVectorRange(team,13),[&] (int i) { - value = i; // This write is violating Kokkos semantics for nested parallelism - }); - - Kokkos::single(Kokkos::PerThread(team),[&] (Scalar& val) { - val = 1; - },value); - - Scalar value2 = 0; - Kokkos::parallel_reduce(Kokkos::ThreadVectorRange(team,13), [&] (int i, Scalar& val) { - val += value; - },value2); - - if(value2!=(value*13)) { - printf("FAILED vector_single broadcast %i %i %f %f\n",team.league_rank(),team.team_rank(),(double) value2,(double) value); - flag()=1; - } - } -}; - -template -struct functor_vec_for { - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_vec_for(Kokkos::View flag_):flag(flag_) {} - - unsigned team_shmem_size(int team_size) const {return team_size*13*sizeof(Scalar)+8;} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team) const { - - typedef typename ExecutionSpace::scratch_memory_space shmem_space ; - typedef Kokkos::View shared_int; - shared_int values = shared_int(team.team_shmem(),team.team_size()*13); - - if (values.ptr_on_device () == NULL || - values.dimension_0() < (unsigned) team.team_size() * 13) { - printf ("FAILED to allocate memory of size %i\n", - static_cast (team.team_size () * 13)); - flag() = 1; - } - else { - Kokkos::parallel_for(Kokkos::ThreadVectorRange(team,13), [&] (int i) { - values(13*team.team_rank() + i) = i - team.team_rank() - team.league_rank() + team.league_size() + team.team_size(); - }); - - Kokkos::single(Kokkos::PerThread(team),[&] () { - Scalar test = 0; - Scalar value = 0; - for (int i = 0; i < 13; ++i) { - test += i - team.team_rank() - team.league_rank() + team.league_size() + team.team_size(); - value += values(13*team.team_rank() + i); - } - if (test != value) { - printf ("FAILED vector_par_for %i %i %f %f\n", - team.league_rank (), team.team_rank (), - static_cast (test), static_cast (value)); - flag() = 1; - } - }); - } - } -}; - -template -struct functor_vec_red { - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_vec_red(Kokkos::View flag_):flag(flag_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team) const { - Scalar value = 0; - - Kokkos::parallel_reduce(Kokkos::ThreadVectorRange(team,13),[&] (int i, Scalar& val) { - val += i; - }, value); - - Kokkos::single(Kokkos::PerThread(team),[&] () { - Scalar test = 0; - for(int i = 0; i < 13; i++) { - test+=i; - } - if(test!=value) { - printf("FAILED vector_par_reduce %i %i %f %f\n",team.league_rank(),team.team_rank(),(double) test,(double) value); - flag()=1; - } - }); - } -}; - -template -struct functor_vec_red_join { - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_vec_red_join(Kokkos::View flag_):flag(flag_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team) const { - Scalar value = 1; - - Kokkos::parallel_reduce(Kokkos::ThreadVectorRange(team,13) - , [&] (int i, Scalar& val) { val *= i; } - , [&] (Scalar& val, const Scalar& src) {val*=src;} - , value - ); - - Kokkos::single(Kokkos::PerThread(team),[&] () { - Scalar test = 1; - for(int i = 0; i < 13; i++) { - test*=i; - } - if(test!=value) { - printf("FAILED vector_par_reduce_join %i %i %f %f\n",team.league_rank(),team.team_rank(),(double) test,(double) value); - flag()=1; - } - }); - } -}; - -template -struct functor_vec_scan { - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_vec_scan(Kokkos::View flag_):flag(flag_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team) const { - Kokkos::parallel_scan(Kokkos::ThreadVectorRange(team,13),[&] (int i, Scalar& val, bool final) { - val += i; - if(final) { - Scalar test = 0; - for(int k = 0; k <= i; k++) { - test+=k; - } - if(test!=val) { - printf("FAILED vector_par_scan %i %i %f %f\n",team.league_rank(),team.team_rank(),(double) test,(double) val); - flag()=1; - } - } - }); - } -}; - -template -struct functor_reduce { - typedef double value_type; - typedef Kokkos::TeamPolicy policy_type; - typedef ExecutionSpace execution_space; - - Kokkos::View flag; - functor_reduce(Kokkos::View flag_):flag(flag_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (typename policy_type::member_type team, double& sum) const { - sum += team.league_rank() * 100 + team.thread_rank(); - } -}; - -template -bool test_scalar(int nteams, int team_size, int test) { - Kokkos::View d_flag("flag"); - typename Kokkos::View::HostMirror h_flag("h_flag"); - h_flag() = 0 ; - Kokkos::deep_copy(d_flag,h_flag); - - if(test==0) - Kokkos::parallel_for( std::string("A") , Kokkos::TeamPolicy(nteams,team_size,8), - functor_vec_red(d_flag)); - if(test==1) - Kokkos::parallel_for( Kokkos::TeamPolicy(nteams,team_size,8), - functor_vec_red_join(d_flag)); - if(test==2) - Kokkos::parallel_for( Kokkos::TeamPolicy(nteams,team_size,8), - functor_vec_scan(d_flag)); - if(test==3) - Kokkos::parallel_for( Kokkos::TeamPolicy(nteams,team_size,8), - functor_vec_for(d_flag)); - if(test==4) - Kokkos::parallel_for( "B" , Kokkos::TeamPolicy(nteams,team_size,8), - functor_vec_single(d_flag)); - if(test==5) - Kokkos::parallel_for( Kokkos::TeamPolicy(nteams,team_size), - functor_team_for(d_flag)); - if(test==6) - Kokkos::parallel_for( Kokkos::TeamPolicy(nteams,team_size), - functor_team_reduce(d_flag)); - if(test==7) - Kokkos::parallel_for( Kokkos::TeamPolicy(nteams,team_size), - functor_team_reduce_join(d_flag)); - if(test==8) - Kokkos::parallel_for( Kokkos::TeamPolicy(nteams,team_size,8), - functor_team_vector_for(d_flag)); - if(test==9) - Kokkos::parallel_for( Kokkos::TeamPolicy(nteams,team_size,8), - functor_team_vector_reduce(d_flag)); - if(test==10) - Kokkos::parallel_for( Kokkos::TeamPolicy(nteams,team_size,8), - functor_team_vector_reduce_join(d_flag)); - - Kokkos::deep_copy(h_flag,d_flag); - - return (h_flag() == 0); -} - -template -bool Test(int test) { - bool passed = true; - passed = passed && test_scalar(317,33,test); - passed = passed && test_scalar(317,33,test); - passed = passed && test_scalar(317,33,test); - passed = passed && test_scalar(317,33,test); - passed = passed && test_scalar(317,33,test); - return passed; -} - -} - diff --git a/lib/kokkos/core/unit_test/TestTemplateMetaFunctions.hpp b/lib/kokkos/core/unit_test/TestTemplateMetaFunctions.hpp deleted file mode 100644 index 4f136bc64b..0000000000 --- a/lib/kokkos/core/unit_test/TestTemplateMetaFunctions.hpp +++ /dev/null @@ -1,219 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#define KOKKOS_PRAGMA_UNROLL(a) - -namespace { - -template -struct SumPlain { - typedef ExecutionSpace execution_space; - typedef typename Kokkos::View type; - type view; - SumPlain(type view_):view(view_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (int i, Scalar& val) { - val += Scalar(); - } -}; - -template -struct SumInitJoinFinalValueType { - typedef ExecutionSpace execution_space; - typedef typename Kokkos::View type; - type view; - typedef Scalar value_type; - SumInitJoinFinalValueType(type view_):view(view_) {} - - KOKKOS_INLINE_FUNCTION - void init(value_type& val) const { - val = value_type(); - } - - KOKKOS_INLINE_FUNCTION - void join(volatile value_type& val, volatile value_type& src) const { - val += src; - } - - KOKKOS_INLINE_FUNCTION - void operator() (int i, value_type& val) const { - val += value_type(); - } - -}; - -template -struct SumInitJoinFinalValueType2 { - typedef ExecutionSpace execution_space; - typedef typename Kokkos::View type; - type view; - typedef Scalar value_type; - SumInitJoinFinalValueType2(type view_):view(view_) {} - - KOKKOS_INLINE_FUNCTION - void init(volatile value_type& val) const { - val = value_type(); - } - - KOKKOS_INLINE_FUNCTION - void join(volatile value_type& val, const volatile value_type& src) const { - val += src; - } - - KOKKOS_INLINE_FUNCTION - void operator() (int i, value_type& val) const { - val += value_type(); - } - -}; - -template -struct SumInitJoinFinalValueTypeArray { - typedef ExecutionSpace execution_space; - typedef typename Kokkos::View type; - type view; - typedef Scalar value_type[]; - int n; - SumInitJoinFinalValueTypeArray(type view_, int n_):view(view_),n(n_) {} - - KOKKOS_INLINE_FUNCTION - void init(value_type val) const { - for(int k=0;k -struct SumWrongInitJoinFinalValueType { - typedef ExecutionSpace execution_space; - typedef typename Kokkos::View type; - type view; - typedef Scalar value_type; - SumWrongInitJoinFinalValueType(type view_):view(view_) {} - - KOKKOS_INLINE_FUNCTION - void init(double& val) const { - val = double(); - } - - KOKKOS_INLINE_FUNCTION - void join(volatile value_type& val, const value_type& src) const { - val += src; - } - - KOKKOS_INLINE_FUNCTION - void operator() (int i, value_type& val) const { - val += value_type(); - } - -}; - -template -void TestTemplateMetaFunctions() { - typedef typename Kokkos::View type; - type a("A",100); -/* #ifdef KOKKOS_HAVE_CXX11 - int sum_plain_has_init_arg = Kokkos::Impl::FunctorHasInit, Scalar& >::value; - ASSERT_EQ(sum_plain_has_init_arg,0); - int sum_initjoinfinalvaluetype_has_init_arg = Kokkos::Impl::FunctorHasInit, Scalar >::value; - ASSERT_EQ(sum_initjoinfinalvaluetype_has_init_arg,1); - int sum_initjoinfinalvaluetype_has_init_arg2 = Kokkos::Impl::FunctorHasInit, Scalar >::value; - ASSERT_EQ(sum_initjoinfinalvaluetype_has_init_arg2,1); - int sum_wronginitjoinfinalvaluetype_has_init_arg = Kokkos::Impl::FunctorHasInit, Scalar >::value; - ASSERT_EQ(sum_wronginitjoinfinalvaluetype_has_init_arg,0); - - //int sum_initjoinfinalvaluetypearray_has_init_arg = Kokkos::Impl::FunctorHasInit, Scalar[] >::value; - //ASSERT_EQ(sum_initjoinfinalvaluetypearray_has_init_arg,1); - - #else - - int sum_plain_has_init_arg = Kokkos::Impl::FunctorHasInit, Scalar& >::value; - ASSERT_EQ(sum_plain_has_init_arg,0); - int sum_initjoinfinalvaluetype_has_init_arg = Kokkos::Impl::FunctorHasInit, Scalar& >::value; - ASSERT_EQ(sum_initjoinfinalvaluetype_has_init_arg,1); - int sum_wronginitjoinfinalvaluetype_has_init_arg = Kokkos::Impl::FunctorHasInit, Scalar& >::value; - ASSERT_EQ(sum_wronginitjoinfinalvaluetype_has_init_arg,1); - - #endif - - //printf("Values Init: %i %i %i\n",sum_plain_has_init_arg,sum_initjoinfinalvaluetype_has_init_arg,sum_wronginitjoinfinalvaluetype_has_init_arg); - -#ifdef KOKKOS_HAVE_CXX11 - int sum_plain_has_join_arg = Kokkos::Impl::FunctorHasJoin, Scalar >::value; - ASSERT_EQ(sum_plain_has_join_arg,0); - int sum_initjoinfinalvaluetype_has_join_arg = Kokkos::Impl::FunctorHasJoin, Scalar >::value; - ASSERT_EQ(sum_initjoinfinalvaluetype_has_join_arg,1); - int sum_initjoinfinalvaluetype_has_join_arg2 = Kokkos::Impl::FunctorHasJoin, Scalar >::value; - ASSERT_EQ(sum_initjoinfinalvaluetype_has_join_arg2,1); - int sum_wronginitjoinfinalvaluetype_has_join_arg = Kokkos::Impl::FunctorHasJoin, Scalar >::value; - ASSERT_EQ(sum_wronginitjoinfinalvaluetype_has_join_arg,0); -#else - int sum_plain_has_join_arg = Kokkos::Impl::FunctorHasJoin, Scalar& >::value; - ASSERT_EQ(sum_plain_has_join_arg,0); - int sum_initjoinfinalvaluetype_has_join_arg = Kokkos::Impl::FunctorHasJoin, Scalar& >::value; - ASSERT_EQ(sum_initjoinfinalvaluetype_has_join_arg,1); - int sum_initjoinfinalvaluetype_has_join_arg2 = Kokkos::Impl::FunctorHasJoin, Scalar& >::value; - ASSERT_EQ(sum_initjoinfinalvaluetype_has_join_arg2,1); - int sum_wronginitjoinfinalvaluetype_has_join_arg = Kokkos::Impl::FunctorHasJoin, Scalar& >::value; - ASSERT_EQ(sum_wronginitjoinfinalvaluetype_has_join_arg,1); -#endif*/ - //printf("Values Join: %i %i %i\n",sum_plain_has_join_arg,sum_initjoinfinalvaluetype_has_join_arg,sum_wronginitjoinfinalvaluetype_has_join_arg); -} - -} diff --git a/lib/kokkos/core/unit_test/TestThreads.cpp b/lib/kokkos/core/unit_test/TestThreads.cpp deleted file mode 100644 index b254aacaf8..0000000000 --- a/lib/kokkos/core/unit_test/TestThreads.cpp +++ /dev/null @@ -1,436 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -#if defined( KOKKOS_HAVE_PTHREAD ) - -#include - -#include - -//---------------------------------------------------------------------------- - -#include -#include - -#include - -#include -#include -#include - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#include - -namespace Test { - -class threads : public ::testing::Test { -protected: - static void SetUpTestCase() - { - // Finalize without initialize is a no-op: - Kokkos::Threads::finalize(); - - const unsigned numa_count = Kokkos::hwloc::get_available_numa_count(); - const unsigned cores_per_numa = Kokkos::hwloc::get_available_cores_per_numa(); - const unsigned threads_per_core = Kokkos::hwloc::get_available_threads_per_core(); - - unsigned threads_count = 0 ; - - // Initialize and finalize with no threads: - Kokkos::Threads::initialize( 1u ); - Kokkos::Threads::finalize(); - - threads_count = std::max( 1u , numa_count ) - * std::max( 2u , cores_per_numa * threads_per_core ); - - Kokkos::Threads::initialize( threads_count ); - Kokkos::Threads::finalize(); - - - threads_count = std::max( 1u , numa_count * 2 ) - * std::max( 2u , ( cores_per_numa * threads_per_core ) / 2 ); - - Kokkos::Threads::initialize( threads_count ); - Kokkos::Threads::finalize(); - - // Quick attempt to verify thread start/terminate don't have race condition: - threads_count = std::max( 1u , numa_count ) - * std::max( 2u , ( cores_per_numa * threads_per_core ) / 2 ); - for ( unsigned i = 0 ; i < 10 ; ++i ) { - Kokkos::Threads::initialize( threads_count ); - Kokkos::Threads::sleep(); - Kokkos::Threads::wake(); - Kokkos::Threads::finalize(); - } - - Kokkos::Threads::initialize( threads_count ); - Kokkos::Threads::print_configuration( std::cout , true /* detailed */ ); - } - - static void TearDownTestCase() - { - Kokkos::Threads::finalize(); - } -}; - -TEST_F( threads , init ) { - ; -} - -TEST_F( threads , impl_shared_alloc ) { - test_shared_alloc< Kokkos::HostSpace , Kokkos::Threads >(); -} - -TEST_F( threads , impl_view_mapping ) { - test_view_mapping< Kokkos::Threads >(); - test_view_mapping_subview< Kokkos::Threads >(); - test_view_mapping_operator< Kokkos::Threads >(); - TestViewMappingAtomic< Kokkos::Threads >::run(); -} - - -TEST_F( threads, view_impl) { - test_view_impl< Kokkos::Threads >(); -} - -TEST_F( threads, view_api) { - TestViewAPI< double , Kokkos::Threads >(); -} - -TEST_F( threads, view_subview_auto_1d_left ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutLeft,Kokkos::Threads >(); -} - -TEST_F( threads, view_subview_auto_1d_right ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutRight,Kokkos::Threads >(); -} - -TEST_F( threads, view_subview_auto_1d_stride ) { - TestViewSubview::test_auto_1d< Kokkos::LayoutStride,Kokkos::Threads >(); -} - -TEST_F( threads, view_subview_assign_strided ) { - TestViewSubview::test_1d_strided_assignment< Kokkos::Threads >(); -} - -TEST_F( threads, view_subview_left_0 ) { - TestViewSubview::test_left_0< Kokkos::Threads >(); -} - -TEST_F( threads, view_subview_left_1 ) { - TestViewSubview::test_left_1< Kokkos::Threads >(); -} - -TEST_F( threads, view_subview_left_2 ) { - TestViewSubview::test_left_2< Kokkos::Threads >(); -} - -TEST_F( threads, view_subview_left_3 ) { - TestViewSubview::test_left_3< Kokkos::Threads >(); -} - -TEST_F( threads, view_subview_right_0 ) { - TestViewSubview::test_right_0< Kokkos::Threads >(); -} - -TEST_F( threads, view_subview_right_1 ) { - TestViewSubview::test_right_1< Kokkos::Threads >(); -} - -TEST_F( threads, view_subview_right_3 ) { - TestViewSubview::test_right_3< Kokkos::Threads >(); -} - - -TEST_F( threads, view_aggregate ) { - TestViewAggregate< Kokkos::Threads >(); - TestViewAggregateReduction< Kokkos::Threads >(); -} - -TEST_F( threads , range_tag ) -{ - TestRange< Kokkos::Threads >::test_for(1000); - TestRange< Kokkos::Threads >::test_reduce(1000); - TestRange< Kokkos::Threads >::test_scan(1000); -} - -TEST_F( threads , team_tag ) -{ - TestTeamPolicy< Kokkos::Threads >::test_for(1000); - TestTeamPolicy< Kokkos::Threads >::test_reduce(1000); -} - -TEST_F( threads, long_reduce) { - TestReduce< long , Kokkos::Threads >( 1000000 ); -} - -TEST_F( threads, double_reduce) { - TestReduce< double , Kokkos::Threads >( 1000000 ); -} - -TEST_F( threads, team_long_reduce) { - TestReduceTeam< long , Kokkos::Threads >( 100000 ); -} - -TEST_F( threads, team_double_reduce) { - TestReduceTeam< double , Kokkos::Threads >( 100000 ); -} - -TEST_F( threads, long_reduce_dynamic ) { - TestReduceDynamic< long , Kokkos::Threads >( 1000000 ); -} - -TEST_F( threads, double_reduce_dynamic ) { - TestReduceDynamic< double , Kokkos::Threads >( 1000000 ); -} - -TEST_F( threads, long_reduce_dynamic_view ) { - TestReduceDynamicView< long , Kokkos::Threads >( 1000000 ); -} - -TEST_F( threads, team_shared_request) { - TestSharedTeam< Kokkos::Threads >(); -} - -TEST_F( threads , view_remap ) -{ - enum { N0 = 3 , N1 = 2 , N2 = 8 , N3 = 9 }; - - typedef Kokkos::View< double*[N1][N2][N3] , - Kokkos::LayoutRight , - Kokkos::Threads > output_type ; - - typedef Kokkos::View< int**[N2][N3] , - Kokkos::LayoutLeft , - Kokkos::Threads > input_type ; - - typedef Kokkos::View< int*[N0][N2][N3] , - Kokkos::LayoutLeft , - Kokkos::Threads > diff_type ; - - output_type output( "output" , N0 ); - input_type input ( "input" , N0 , N1 ); - diff_type diff ( "diff" , N0 ); - - int value = 0 ; - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i0 = 0 ; i0 < N0 ; ++i0 ) { - input(i0,i1,i2,i3) = ++value ; - }}}} - - // Kokkos::deep_copy( diff , input ); // throw with incompatible shape - Kokkos::deep_copy( output , input ); - - value = 0 ; - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i0 = 0 ; i0 < N0 ; ++i0 ) { - ++value ; - ASSERT_EQ( value , ((int) output(i0,i1,i2,i3) ) ); - }}}} -} - -//---------------------------------------------------------------------------- - -TEST_F( threads , atomics ) -{ - const int loop_count = 1e6 ; - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(loop_count,3) ) ); - - ASSERT_TRUE( ( TestAtomic::Loop(100,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop(100,3) ) ); - -#if defined( KOKKOS_ENABLE_ASM ) - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::Threads>(100,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::Threads>(100,2) ) ); - ASSERT_TRUE( ( TestAtomic::Loop ,Kokkos::Threads>(100,3) ) ); -#endif - - ASSERT_TRUE( ( TestAtomic::Loop, Kokkos::Threads>(loop_count,1) ) ); - ASSERT_TRUE( ( TestAtomic::Loop, Kokkos::Threads>(loop_count,2) ) ); -} - -//---------------------------------------------------------------------------- - -#if 0 -TEST_F( threads , scan_small ) -{ - typedef TestScan< Kokkos::Threads , Kokkos::Impl::ThreadsExecUseScanSmall > TestScanFunctor ; - for ( int i = 0 ; i < 1000 ; ++i ) { - TestScanFunctor( 10 ); - TestScanFunctor( 10000 ); - } - TestScanFunctor( 1000000 ); - TestScanFunctor( 10000000 ); - - Kokkos::Threads::fence(); -} -#endif - -TEST_F( threads , scan ) -{ - TestScan< Kokkos::Threads >::test_range( 1 , 1000 ); - TestScan< Kokkos::Threads >( 1000000 ); - TestScan< Kokkos::Threads >( 10000000 ); - Kokkos::Threads::fence(); -} - -//---------------------------------------------------------------------------- - -TEST_F( threads , team_scan ) -{ - TestScanTeam< Kokkos::Threads >( 10 ); - TestScanTeam< Kokkos::Threads >( 10000 ); -} - -//---------------------------------------------------------------------------- - -TEST_F( threads , compiler_macros ) -{ - ASSERT_TRUE( ( TestCompilerMacros::Test< Kokkos::Threads >() ) ); -} - -TEST_F( threads , memory_space ) -{ - TestMemorySpace< Kokkos::Threads >(); -} - -//---------------------------------------------------------------------------- - -TEST_F( threads , template_meta_functions ) -{ - TestTemplateMetaFunctions(); -} - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_THREADS ) -TEST_F( threads , cxx11 ) -{ - if ( Kokkos::Impl::is_same< Kokkos::DefaultExecutionSpace , Kokkos::Threads >::value ) { - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::Threads >(1) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::Threads >(2) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::Threads >(3) ) ); - ASSERT_TRUE( ( TestCXX11::Test< Kokkos::Threads >(4) ) ); - } -} - -TEST_F( threads , reduction_deduction ) -{ - TestCXX11::test_reduction_deduction< Kokkos::Threads >(); -} -#endif /* #if defined( KOKKOS_HAVE_DEFAULT_DEVICE_TYPE_THREADS ) */ - -TEST_F( threads , team_vector ) -{ - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Threads >(0) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Threads >(1) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Threads >(2) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Threads >(3) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Threads >(4) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Threads >(5) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Threads >(6) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Threads >(7) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Threads >(8) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Threads >(9) ) ); - ASSERT_TRUE( ( TestTeamVector::Test< Kokkos::Threads >(10) ) ); -} - -TEST_F( threads , task_policy ) -{ - TestTaskPolicy::test_task_dep< Kokkos::Threads >( 10 ); - for ( long i = 0 ; i < 25 ; ++i ) TestTaskPolicy::test_fib< Kokkos::Threads >(i); - for ( long i = 0 ; i < 35 ; ++i ) TestTaskPolicy::test_fib2< Kokkos::Threads >(i); -} - -TEST_F( threads , task_team ) -{ - TestTaskPolicy::test_task_team< Kokkos::Threads >(1000); -} - -} // namespace Test - -#endif /* #if defined( KOKKOS_HAVE_PTHREAD ) */ diff --git a/lib/kokkos/core/unit_test/TestTile.hpp b/lib/kokkos/core/unit_test/TestTile.hpp deleted file mode 100644 index dfb2bd81b3..0000000000 --- a/lib/kokkos/core/unit_test/TestTile.hpp +++ /dev/null @@ -1,153 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#ifndef TEST_TILE_HPP -#define TEST_TILE_HPP - -#include - -namespace TestTile { - -template < typename Device , typename TileLayout> -struct ReduceTileErrors -{ - typedef Device execution_space ; - - typedef Kokkos::View< ptrdiff_t**, TileLayout, Device> array_type; - typedef Kokkos::View< ptrdiff_t[ TileLayout::N0 ][ TileLayout::N1 ], Kokkos::LayoutLeft , Device > tile_type ; - - array_type m_array ; - - typedef ptrdiff_t value_type; - - ReduceTileErrors( array_type a ) - : m_array(a) - {} - - - KOKKOS_INLINE_FUNCTION - static void init( value_type & errors ) - { - errors = 0; - } - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & errors , - const volatile value_type & src_errors ) - { - errors += src_errors; - } - - // Initialize - KOKKOS_INLINE_FUNCTION - void operator()( size_t iwork ) const - { - const size_t i = iwork % m_array.dimension_0(); - const size_t j = iwork / m_array.dimension_0(); - if ( j < m_array.dimension_1() ) { - m_array(i,j) = & m_array(i,j) - & m_array(0,0); - -// printf("m_array(%d,%d) = %d\n",int(i),int(j),int(m_array(i,j))); - - } - } - - // Verify: - KOKKOS_INLINE_FUNCTION - void operator()( size_t iwork , value_type & errors ) const - { - const size_t tile_dim0 = ( m_array.dimension_0() + TileLayout::N0 - 1 ) / TileLayout::N0 ; - const size_t tile_dim1 = ( m_array.dimension_1() + TileLayout::N1 - 1 ) / TileLayout::N1 ; - - const size_t itile = iwork % tile_dim0 ; - const size_t jtile = iwork / tile_dim0 ; - - if ( jtile < tile_dim1 ) { - - tile_type tile = Kokkos::tile_subview( m_array , itile , jtile ); - - if ( tile(0,0) != ptrdiff_t(( itile + jtile * tile_dim0 ) * TileLayout::N0 * TileLayout::N1 ) ) { - ++errors ; - } - else { - - for ( size_t j = 0 ; j < size_t(TileLayout::N1) ; ++j ) { - for ( size_t i = 0 ; i < size_t(TileLayout::N0) ; ++i ) { - const size_t iglobal = i + itile * TileLayout::N0 ; - const size_t jglobal = j + jtile * TileLayout::N1 ; - - if ( iglobal < m_array.dimension_0() && jglobal < m_array.dimension_1() ) { - if ( tile(i,j) != ptrdiff_t( tile(0,0) + i + j * TileLayout::N0 ) ) ++errors ; - -// printf("tile(%d,%d)(%d,%d) = %d\n",int(itile),int(jtile),int(i),int(j),int(tile(i,j))); - - } - } - } - } - } - } -}; - -template< class Space , unsigned N0 , unsigned N1 > -void test( const size_t dim0 , const size_t dim1 ) -{ - typedef Kokkos::LayoutTileLeft array_layout ; - typedef ReduceTileErrors< Space , array_layout > functor_type ; - - const size_t tile_dim0 = ( dim0 + N0 - 1 ) / N0 ; - const size_t tile_dim1 = ( dim1 + N1 - 1 ) / N1 ; - - typename functor_type::array_type array("",dim0,dim1); - - Kokkos::parallel_for( Kokkos::RangePolicy(0,dim0*dim1) , functor_type( array ) ); - - ptrdiff_t error = 0 ; - - Kokkos::parallel_reduce( Kokkos::RangePolicy(0,tile_dim0*tile_dim1) , functor_type( array ) , error ); - - EXPECT_EQ( error , ptrdiff_t(0) ); -} - -} /* namespace TestTile */ - -#endif //TEST_TILE_HPP - diff --git a/lib/kokkos/core/unit_test/TestViewAPI.hpp b/lib/kokkos/core/unit_test/TestViewAPI.hpp deleted file mode 100644 index 1aeab1e41c..0000000000 --- a/lib/kokkos/core/unit_test/TestViewAPI.hpp +++ /dev/null @@ -1,1370 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include -#include -#include - -/*--------------------------------------------------------------------------*/ - -#if defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - -namespace Test { - -template< typename T, class DeviceType > -class TestViewAPI { -public: - TestViewAPI() {} -}; - -} - -#else - -/*--------------------------------------------------------------------------*/ - -namespace Test { - -template< class T , class L , class D , class M , class S > -size_t allocation_count( const Kokkos::View & view ) -{ - const size_t card = Kokkos::Impl::cardinality_count( view.shape() ); - const size_t alloc = view.capacity(); - - return card <= alloc ? alloc : 0 ; -} - -/*--------------------------------------------------------------------------*/ - -template< typename T, class DeviceType> -struct TestViewOperator -{ - typedef DeviceType execution_space ; - - static const unsigned N = 100 ; - static const unsigned D = 3 ; - - typedef Kokkos::View< T*[D] , execution_space > view_type ; - - const view_type v1 ; - const view_type v2 ; - - TestViewOperator() - : v1( "v1" , N ) - , v2( "v2" , N ) - {} - - static void testit() - { - Kokkos::parallel_for( N , TestViewOperator() ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned i ) const - { - const unsigned X = 0 ; - const unsigned Y = 1 ; - const unsigned Z = 2 ; - - v2(i,X) = v1(i,X); - v2(i,Y) = v1(i,Y); - v2(i,Z) = v1(i,Z); - } -}; - -/*--------------------------------------------------------------------------*/ - -template< class DataType > -struct rank { -private: - typedef typename Kokkos::Impl::AnalyzeShape::shape shape ; -public: - static const unsigned value = shape::rank ; -}; - -template< class DataType , - class DeviceType , - unsigned Rank = rank< DataType >::value > -struct TestViewOperator_LeftAndRight ; - -template< class DataType , class DeviceType > -struct TestViewOperator_LeftAndRight< DataType , DeviceType , 8 > -{ - typedef DeviceType execution_space ; - typedef typename execution_space::memory_space memory_space ; - typedef typename execution_space::size_type size_type ; - - typedef int value_type ; - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & input ) - { update |= input ; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } - - - typedef Kokkos:: - View< DataType, Kokkos::LayoutLeft, execution_space > left_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutRight, execution_space > right_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutStride, execution_space > stride_view ; - - typedef typename left_view ::shape_type left_shape ; - typedef typename right_view::shape_type right_shape ; - - left_shape lsh ; - right_shape rsh ; - left_view left ; - right_view right ; - stride_view left_stride ; - stride_view right_stride ; - long left_alloc ; - long right_alloc ; - - TestViewOperator_LeftAndRight() - : lsh() - , rsh() - , left( "left" ) - , right( "right" ) - , left_stride( left ) - , right_stride( right ) - , left_alloc( allocation_count( left ) ) - , right_alloc( allocation_count( right ) ) - {} - - static void testit() - { - TestViewOperator_LeftAndRight driver ; - - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.lsh ) <= driver.left_alloc ); - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.rsh ) <= driver.right_alloc ); - - int error_flag = 0 ; - - Kokkos::parallel_reduce( 1 , driver , error_flag ); - - ASSERT_EQ( error_flag , 0 ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type , value_type & update ) const - { - long offset ; - - offset = -1 ; - for ( unsigned i7 = 0 ; i7 < unsigned(lsh.N7) ; ++i7 ) - for ( unsigned i6 = 0 ; i6 < unsigned(lsh.N6) ; ++i6 ) - for ( unsigned i5 = 0 ; i5 < unsigned(lsh.N5) ; ++i5 ) - for ( unsigned i4 = 0 ; i4 < unsigned(lsh.N4) ; ++i4 ) - for ( unsigned i3 = 0 ; i3 < unsigned(lsh.N3) ; ++i3 ) - for ( unsigned i2 = 0 ; i2 < unsigned(lsh.N2) ; ++i2 ) - for ( unsigned i1 = 0 ; i1 < unsigned(lsh.N1) ; ++i1 ) - for ( unsigned i0 = 0 ; i0 < unsigned(lsh.N0) ; ++i0 ) - { - const long j = & left( i0, i1, i2, i3, i4, i5, i6, i7 ) - - & left( 0, 0, 0, 0, 0, 0, 0, 0 ); - if ( j <= offset || left_alloc <= j ) { update |= 1 ; } - offset = j ; - - if ( & left(i0,i1,i2,i3,i4,i5,i6,i7) != - & left_stride(i0,i1,i2,i3,i4,i5,i6,i7) ) { - update |= 4 ; - } - } - - offset = -1 ; - for ( unsigned i0 = 0 ; i0 < unsigned(rsh.N0) ; ++i0 ) - for ( unsigned i1 = 0 ; i1 < unsigned(rsh.N1) ; ++i1 ) - for ( unsigned i2 = 0 ; i2 < unsigned(rsh.N2) ; ++i2 ) - for ( unsigned i3 = 0 ; i3 < unsigned(rsh.N3) ; ++i3 ) - for ( unsigned i4 = 0 ; i4 < unsigned(rsh.N4) ; ++i4 ) - for ( unsigned i5 = 0 ; i5 < unsigned(rsh.N5) ; ++i5 ) - for ( unsigned i6 = 0 ; i6 < unsigned(rsh.N6) ; ++i6 ) - for ( unsigned i7 = 0 ; i7 < unsigned(rsh.N7) ; ++i7 ) - { - const long j = & right( i0, i1, i2, i3, i4, i5, i6, i7 ) - - & right( 0, 0, 0, 0, 0, 0, 0, 0 ); - if ( j <= offset || right_alloc <= j ) { update |= 2 ; } - offset = j ; - - if ( & right(i0,i1,i2,i3,i4,i5,i6,i7) != - & right_stride(i0,i1,i2,i3,i4,i5,i6,i7) ) { - update |= 8 ; - } - } - } -}; - -template< class DataType , class DeviceType > -struct TestViewOperator_LeftAndRight< DataType , DeviceType , 7 > -{ - typedef DeviceType execution_space ; - typedef typename execution_space::memory_space memory_space ; - typedef typename execution_space::size_type size_type ; - - typedef int value_type ; - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & input ) - { update |= input ; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } - - - typedef Kokkos:: - View< DataType, Kokkos::LayoutLeft, execution_space > left_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutRight, execution_space > right_view ; - - typedef typename left_view ::shape_type left_shape ; - typedef typename right_view::shape_type right_shape ; - - left_shape lsh ; - right_shape rsh ; - left_view left ; - right_view right ; - long left_alloc ; - long right_alloc ; - - TestViewOperator_LeftAndRight() - : lsh() - , rsh() - , left( "left" ) - , right( "right" ) - , left_alloc( allocation_count( left ) ) - , right_alloc( allocation_count( right ) ) - {} - - static void testit() - { - TestViewOperator_LeftAndRight driver ; - - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.lsh ) <= driver.left_alloc ); - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.rsh ) <= driver.right_alloc ); - - int error_flag = 0 ; - - Kokkos::parallel_reduce( 1 , driver , error_flag ); - - ASSERT_EQ( error_flag , 0 ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type , value_type & update ) const - { - long offset ; - - offset = -1 ; - for ( unsigned i6 = 0 ; i6 < unsigned(lsh.N6) ; ++i6 ) - for ( unsigned i5 = 0 ; i5 < unsigned(lsh.N5) ; ++i5 ) - for ( unsigned i4 = 0 ; i4 < unsigned(lsh.N4) ; ++i4 ) - for ( unsigned i3 = 0 ; i3 < unsigned(lsh.N3) ; ++i3 ) - for ( unsigned i2 = 0 ; i2 < unsigned(lsh.N2) ; ++i2 ) - for ( unsigned i1 = 0 ; i1 < unsigned(lsh.N1) ; ++i1 ) - for ( unsigned i0 = 0 ; i0 < unsigned(lsh.N0) ; ++i0 ) - { - const long j = & left( i0, i1, i2, i3, i4, i5, i6 ) - - & left( 0, 0, 0, 0, 0, 0, 0 ); - if ( j <= offset || left_alloc <= j ) { update |= 1 ; } - offset = j ; - } - - offset = -1 ; - for ( unsigned i0 = 0 ; i0 < unsigned(rsh.N0) ; ++i0 ) - for ( unsigned i1 = 0 ; i1 < unsigned(rsh.N1) ; ++i1 ) - for ( unsigned i2 = 0 ; i2 < unsigned(rsh.N2) ; ++i2 ) - for ( unsigned i3 = 0 ; i3 < unsigned(rsh.N3) ; ++i3 ) - for ( unsigned i4 = 0 ; i4 < unsigned(rsh.N4) ; ++i4 ) - for ( unsigned i5 = 0 ; i5 < unsigned(rsh.N5) ; ++i5 ) - for ( unsigned i6 = 0 ; i6 < unsigned(rsh.N6) ; ++i6 ) - { - const long j = & right( i0, i1, i2, i3, i4, i5, i6 ) - - & right( 0, 0, 0, 0, 0, 0, 0 ); - if ( j <= offset || right_alloc <= j ) { update |= 2 ; } - offset = j ; - } - } -}; - -template< class DataType , class DeviceType > -struct TestViewOperator_LeftAndRight< DataType , DeviceType , 6 > -{ - typedef DeviceType execution_space ; - typedef typename execution_space::memory_space memory_space ; - typedef typename execution_space::size_type size_type ; - - typedef int value_type ; - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & input ) - { update |= input ; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } - - - typedef Kokkos:: - View< DataType, Kokkos::LayoutLeft, execution_space > left_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutRight, execution_space > right_view ; - - typedef typename left_view ::shape_type left_shape ; - typedef typename right_view::shape_type right_shape ; - - left_shape lsh ; - right_shape rsh ; - left_view left ; - right_view right ; - long left_alloc ; - long right_alloc ; - - TestViewOperator_LeftAndRight() - : lsh() - , rsh() - , left( "left" ) - , right( "right" ) - , left_alloc( allocation_count( left ) ) - , right_alloc( allocation_count( right ) ) - {} - - static void testit() - { - TestViewOperator_LeftAndRight driver ; - - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.lsh ) <= driver.left_alloc ); - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.rsh ) <= driver.right_alloc ); - - int error_flag = 0 ; - - Kokkos::parallel_reduce( 1 , driver , error_flag ); - - ASSERT_EQ( error_flag , 0 ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type , value_type & update ) const - { - long offset ; - - offset = -1 ; - for ( unsigned i5 = 0 ; i5 < unsigned(lsh.N5) ; ++i5 ) - for ( unsigned i4 = 0 ; i4 < unsigned(lsh.N4) ; ++i4 ) - for ( unsigned i3 = 0 ; i3 < unsigned(lsh.N3) ; ++i3 ) - for ( unsigned i2 = 0 ; i2 < unsigned(lsh.N2) ; ++i2 ) - for ( unsigned i1 = 0 ; i1 < unsigned(lsh.N1) ; ++i1 ) - for ( unsigned i0 = 0 ; i0 < unsigned(lsh.N0) ; ++i0 ) - { - const long j = & left( i0, i1, i2, i3, i4, i5 ) - - & left( 0, 0, 0, 0, 0, 0 ); - if ( j <= offset || left_alloc <= j ) { update |= 1 ; } - offset = j ; - } - - offset = -1 ; - for ( unsigned i0 = 0 ; i0 < unsigned(rsh.N0) ; ++i0 ) - for ( unsigned i1 = 0 ; i1 < unsigned(rsh.N1) ; ++i1 ) - for ( unsigned i2 = 0 ; i2 < unsigned(rsh.N2) ; ++i2 ) - for ( unsigned i3 = 0 ; i3 < unsigned(rsh.N3) ; ++i3 ) - for ( unsigned i4 = 0 ; i4 < unsigned(rsh.N4) ; ++i4 ) - for ( unsigned i5 = 0 ; i5 < unsigned(rsh.N5) ; ++i5 ) - { - const long j = & right( i0, i1, i2, i3, i4, i5 ) - - & right( 0, 0, 0, 0, 0, 0 ); - if ( j <= offset || right_alloc <= j ) { update |= 2 ; } - offset = j ; - } - } -}; - -template< class DataType , class DeviceType > -struct TestViewOperator_LeftAndRight< DataType , DeviceType , 5 > -{ - typedef DeviceType execution_space ; - typedef typename execution_space::memory_space memory_space ; - typedef typename execution_space::size_type size_type ; - - typedef int value_type ; - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & input ) - { update |= input ; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } - - - typedef Kokkos:: - View< DataType, Kokkos::LayoutLeft, execution_space > left_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutRight, execution_space > right_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutStride, execution_space > stride_view ; - - typedef typename left_view ::shape_type left_shape ; - typedef typename right_view::shape_type right_shape ; - - left_shape lsh ; - right_shape rsh ; - left_view left ; - right_view right ; - stride_view left_stride ; - stride_view right_stride ; - long left_alloc ; - long right_alloc ; - - TestViewOperator_LeftAndRight() - : lsh() - , rsh() - , left( "left" ) - , right( "right" ) - , left_stride( left ) - , right_stride( right ) - , left_alloc( allocation_count( left ) ) - , right_alloc( allocation_count( right ) ) - {} - - static void testit() - { - TestViewOperator_LeftAndRight driver ; - - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.lsh ) <= driver.left_alloc ); - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.rsh ) <= driver.right_alloc ); - - int error_flag = 0 ; - - Kokkos::parallel_reduce( 1 , driver , error_flag ); - - ASSERT_EQ( error_flag , 0 ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type , value_type & update ) const - { - long offset ; - - offset = -1 ; - for ( unsigned i4 = 0 ; i4 < unsigned(lsh.N4) ; ++i4 ) - for ( unsigned i3 = 0 ; i3 < unsigned(lsh.N3) ; ++i3 ) - for ( unsigned i2 = 0 ; i2 < unsigned(lsh.N2) ; ++i2 ) - for ( unsigned i1 = 0 ; i1 < unsigned(lsh.N1) ; ++i1 ) - for ( unsigned i0 = 0 ; i0 < unsigned(lsh.N0) ; ++i0 ) - { - const long j = & left( i0, i1, i2, i3, i4 ) - - & left( 0, 0, 0, 0, 0 ); - if ( j <= offset || left_alloc <= j ) { update |= 1 ; } - offset = j ; - - if ( & left( i0, i1, i2, i3, i4 ) != - & left_stride( i0, i1, i2, i3, i4 ) ) { update |= 4 ; } - } - - offset = -1 ; - for ( unsigned i0 = 0 ; i0 < unsigned(rsh.N0) ; ++i0 ) - for ( unsigned i1 = 0 ; i1 < unsigned(rsh.N1) ; ++i1 ) - for ( unsigned i2 = 0 ; i2 < unsigned(rsh.N2) ; ++i2 ) - for ( unsigned i3 = 0 ; i3 < unsigned(rsh.N3) ; ++i3 ) - for ( unsigned i4 = 0 ; i4 < unsigned(rsh.N4) ; ++i4 ) - { - const long j = & right( i0, i1, i2, i3, i4 ) - - & right( 0, 0, 0, 0, 0 ); - if ( j <= offset || right_alloc <= j ) { update |= 2 ; } - offset = j ; - - if ( & right( i0, i1, i2, i3, i4 ) != - & right_stride( i0, i1, i2, i3, i4 ) ) { update |= 8 ; } - } - } -}; - -template< class DataType , class DeviceType > -struct TestViewOperator_LeftAndRight< DataType , DeviceType , 4 > -{ - typedef DeviceType execution_space ; - typedef typename execution_space::memory_space memory_space ; - typedef typename execution_space::size_type size_type ; - - typedef int value_type ; - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & input ) - { update |= input ; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } - - - typedef Kokkos:: - View< DataType, Kokkos::LayoutLeft, execution_space > left_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutRight, execution_space > right_view ; - - typedef typename left_view ::shape_type left_shape ; - typedef typename right_view::shape_type right_shape ; - - left_shape lsh ; - right_shape rsh ; - left_view left ; - right_view right ; - long left_alloc ; - long right_alloc ; - - TestViewOperator_LeftAndRight() - : lsh() - , rsh() - , left( "left" ) - , right( "right" ) - , left_alloc( allocation_count( left ) ) - , right_alloc( allocation_count( right ) ) - {} - - static void testit() - { - TestViewOperator_LeftAndRight driver ; - - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.lsh ) <= driver.left_alloc ); - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.rsh ) <= driver.right_alloc ); - - int error_flag = 0 ; - - Kokkos::parallel_reduce( 1 , driver , error_flag ); - - ASSERT_EQ( error_flag , 0 ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type , value_type & update ) const - { - long offset ; - - offset = -1 ; - for ( unsigned i3 = 0 ; i3 < unsigned(lsh.N3) ; ++i3 ) - for ( unsigned i2 = 0 ; i2 < unsigned(lsh.N2) ; ++i2 ) - for ( unsigned i1 = 0 ; i1 < unsigned(lsh.N1) ; ++i1 ) - for ( unsigned i0 = 0 ; i0 < unsigned(lsh.N0) ; ++i0 ) - { - const long j = & left( i0, i1, i2, i3 ) - - & left( 0, 0, 0, 0 ); - if ( j <= offset || left_alloc <= j ) { update |= 1 ; } - offset = j ; - } - - offset = -1 ; - for ( unsigned i0 = 0 ; i0 < unsigned(rsh.N0) ; ++i0 ) - for ( unsigned i1 = 0 ; i1 < unsigned(rsh.N1) ; ++i1 ) - for ( unsigned i2 = 0 ; i2 < unsigned(rsh.N2) ; ++i2 ) - for ( unsigned i3 = 0 ; i3 < unsigned(rsh.N3) ; ++i3 ) - { - const long j = & right( i0, i1, i2, i3 ) - - & right( 0, 0, 0, 0 ); - if ( j <= offset || right_alloc <= j ) { update |= 2 ; } - offset = j ; - } - } -}; - -template< class DataType , class DeviceType > -struct TestViewOperator_LeftAndRight< DataType , DeviceType , 3 > -{ - typedef DeviceType execution_space ; - typedef typename execution_space::memory_space memory_space ; - typedef typename execution_space::size_type size_type ; - - typedef int value_type ; - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & input ) - { update |= input ; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } - - - typedef Kokkos:: - View< DataType, Kokkos::LayoutLeft, execution_space > left_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutRight, execution_space > right_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutStride, execution_space > stride_view ; - - typedef typename left_view ::shape_type left_shape ; - typedef typename right_view::shape_type right_shape ; - - left_shape lsh ; - right_shape rsh ; - left_view left ; - right_view right ; - stride_view left_stride ; - stride_view right_stride ; - long left_alloc ; - long right_alloc ; - - TestViewOperator_LeftAndRight() - : lsh() - , rsh() - , left( std::string("left") ) - , right( std::string("right") ) - , left_stride( left ) - , right_stride( right ) - , left_alloc( allocation_count( left ) ) - , right_alloc( allocation_count( right ) ) - {} - - static void testit() - { - TestViewOperator_LeftAndRight driver ; - - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.lsh ) <= driver.left_alloc ); - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.rsh ) <= driver.right_alloc ); - - int error_flag = 0 ; - - Kokkos::parallel_reduce( 1 , driver , error_flag ); - - ASSERT_EQ( error_flag , 0 ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type , value_type & update ) const - { - long offset ; - - offset = -1 ; - for ( unsigned i2 = 0 ; i2 < unsigned(lsh.N2) ; ++i2 ) - for ( unsigned i1 = 0 ; i1 < unsigned(lsh.N1) ; ++i1 ) - for ( unsigned i0 = 0 ; i0 < unsigned(lsh.N0) ; ++i0 ) - { - const long j = & left( i0, i1, i2 ) - - & left( 0, 0, 0 ); - if ( j <= offset || left_alloc <= j ) { update |= 1 ; } - offset = j ; - - if ( & left(i0,i1,i2) != & left_stride(i0,i1,i2) ) { update |= 4 ; } - } - - offset = -1 ; - for ( unsigned i0 = 0 ; i0 < unsigned(rsh.N0) ; ++i0 ) - for ( unsigned i1 = 0 ; i1 < unsigned(rsh.N1) ; ++i1 ) - for ( unsigned i2 = 0 ; i2 < unsigned(rsh.N2) ; ++i2 ) - { - const long j = & right( i0, i1, i2 ) - - & right( 0, 0, 0 ); - if ( j <= offset || right_alloc <= j ) { update |= 2 ; } - offset = j ; - - if ( & right(i0,i1,i2) != & right_stride(i0,i1,i2) ) { update |= 8 ; } - } - - for ( unsigned i0 = 0 ; i0 < unsigned(lsh.N0) ; ++i0 ) - for ( unsigned i1 = 0 ; i1 < unsigned(lsh.N1) ; ++i1 ) - for ( unsigned i2 = 0 ; i2 < unsigned(lsh.N2) ; ++i2 ) - { - if ( & left(i0,i1,i2) != & left.at(i0,i1,i2,0,0,0,0,0) ) { update |= 3 ; } - if ( & right(i0,i1,i2) != & right.at(i0,i1,i2,0,0,0,0,0) ) { update |= 3 ; } - } - } -}; - -template< class DataType , class DeviceType > -struct TestViewOperator_LeftAndRight< DataType , DeviceType , 2 > -{ - typedef DeviceType execution_space ; - typedef typename execution_space::memory_space memory_space ; - typedef typename execution_space::size_type size_type ; - - typedef int value_type ; - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & input ) - { update |= input ; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } - - - typedef Kokkos:: - View< DataType, Kokkos::LayoutLeft, execution_space > left_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutRight, execution_space > right_view ; - - typedef typename left_view ::shape_type left_shape ; - typedef typename right_view::shape_type right_shape ; - - left_shape lsh ; - right_shape rsh ; - left_view left ; - right_view right ; - long left_alloc ; - long right_alloc ; - - TestViewOperator_LeftAndRight() - : lsh() - , rsh() - , left( Kokkos::ViewAllocate("left") ) - , right( Kokkos::ViewAllocate("right") ) - , left_alloc( allocation_count( left ) ) - , right_alloc( allocation_count( right ) ) - {} - - static void testit() - { - TestViewOperator_LeftAndRight driver ; - - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.lsh ) <= driver.left_alloc ); - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.rsh ) <= driver.right_alloc ); - - int error_flag = 0 ; - - Kokkos::parallel_reduce( 1 , driver , error_flag ); - - ASSERT_EQ( error_flag , 0 ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type , value_type & update ) const - { - long offset ; - - offset = -1 ; - for ( unsigned i1 = 0 ; i1 < unsigned(lsh.N1) ; ++i1 ) - for ( unsigned i0 = 0 ; i0 < unsigned(lsh.N0) ; ++i0 ) - { - const long j = & left( i0, i1 ) - - & left( 0, 0 ); - if ( j <= offset || left_alloc <= j ) { update |= 1 ; } - offset = j ; - } - - offset = -1 ; - for ( unsigned i0 = 0 ; i0 < unsigned(rsh.N0) ; ++i0 ) - for ( unsigned i1 = 0 ; i1 < unsigned(rsh.N1) ; ++i1 ) - { - const long j = & right( i0, i1 ) - - & right( 0, 0 ); - if ( j <= offset || right_alloc <= j ) { update |= 2 ; } - offset = j ; - } - - for ( unsigned i0 = 0 ; i0 < unsigned(lsh.N0) ; ++i0 ) - for ( unsigned i1 = 0 ; i1 < unsigned(lsh.N1) ; ++i1 ) - { - if ( & left(i0,i1) != & left.at(i0,i1,0,0,0,0,0,0) ) { update |= 3 ; } - if ( & right(i0,i1) != & right.at(i0,i1,0,0,0,0,0,0) ) { update |= 3 ; } - } - } -}; - -template< class DataType , class DeviceType > -struct TestViewOperator_LeftAndRight< DataType , DeviceType , 1 > -{ - typedef DeviceType execution_space ; - typedef typename execution_space::memory_space memory_space ; - typedef typename execution_space::size_type size_type ; - - typedef int value_type ; - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & input ) - { update |= input ; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } - - - typedef Kokkos:: - View< DataType, Kokkos::LayoutLeft, execution_space > left_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutRight, execution_space > right_view ; - - typedef Kokkos:: - View< DataType, Kokkos::LayoutStride, execution_space > stride_view ; - - typedef typename left_view ::shape_type left_shape ; - typedef typename right_view::shape_type right_shape ; - - left_shape lsh ; - right_shape rsh ; - left_view left ; - right_view right ; - stride_view left_stride ; - stride_view right_stride ; - long left_alloc ; - long right_alloc ; - - TestViewOperator_LeftAndRight() - : lsh() - , rsh() - , left( Kokkos::ViewAllocate() ) - , right( Kokkos::ViewAllocate() ) - , left_stride( left ) - , right_stride( right ) - , left_alloc( allocation_count( left ) ) - , right_alloc( allocation_count( right ) ) - {} - - static void testit() - { - TestViewOperator_LeftAndRight driver ; - - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.lsh ) <= driver.left_alloc ); - ASSERT_TRUE( (long) Kokkos::Impl::cardinality_count( driver.rsh ) <= driver.right_alloc ); - - int error_flag = 0 ; - - Kokkos::parallel_reduce( 1 , driver , error_flag ); - - ASSERT_EQ( error_flag , 0 ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type , value_type & update ) const - { - for ( unsigned i0 = 0 ; i0 < unsigned(lsh.N0) ; ++i0 ) - { - if ( & left(i0) != & left.at(i0,0,0,0,0,0,0,0) ) { update |= 3 ; } - if ( & right(i0) != & right.at(i0,0,0,0,0,0,0,0) ) { update |= 3 ; } - if ( & left(i0) != & left_stride(i0) ) { update |= 4 ; } - if ( & right(i0) != & right_stride(i0) ) { update |= 8 ; } - } - } -}; - -/*--------------------------------------------------------------------------*/ - -template< typename T, class DeviceType > -class TestViewAPI -{ -public: - typedef DeviceType device ; - - enum { N0 = 1000 , - N1 = 3 , - N2 = 5 , - N3 = 7 }; - - typedef Kokkos::View< T , device > dView0 ; - typedef Kokkos::View< T* , device > dView1 ; - typedef Kokkos::View< T*[N1] , device > dView2 ; - typedef Kokkos::View< T*[N1][N2] , device > dView3 ; - typedef Kokkos::View< T*[N1][N2][N3] , device > dView4 ; - typedef Kokkos::View< const T*[N1][N2][N3] , device > const_dView4 ; - - typedef Kokkos::View< T****, device, Kokkos::MemoryUnmanaged > dView4_unmanaged ; - - typedef typename dView0::host_mirror_space host ; - - TestViewAPI() - { - run_test_mirror(); - run_test(); - run_test_scalar(); - run_test_const(); - run_test_subview(); - run_test_subview_strided(); - run_test_vector(); - - TestViewOperator< T , device >::testit(); - TestViewOperator_LeftAndRight< int[2][3][4][2][3][4][2][3] , device >::testit(); - TestViewOperator_LeftAndRight< int[2][3][4][2][3][4][2] , device >::testit(); - TestViewOperator_LeftAndRight< int[2][3][4][2][3][4] , device >::testit(); - TestViewOperator_LeftAndRight< int[2][3][4][2][3] , device >::testit(); - TestViewOperator_LeftAndRight< int[2][3][4][2] , device >::testit(); - TestViewOperator_LeftAndRight< int[2][3][4] , device >::testit(); - TestViewOperator_LeftAndRight< int[2][3] , device >::testit(); - TestViewOperator_LeftAndRight< int[2] , device >::testit(); - } - - static void run_test_mirror() - { - typedef Kokkos::View< int , host > view_type ; - typedef typename view_type::HostMirror mirror_type ; - view_type a("a"); - mirror_type am = Kokkos::create_mirror_view(a); - mirror_type ax = Kokkos::create_mirror(a); - ASSERT_EQ( & a() , & am() ); - } - - static void run_test_scalar() - { - typedef typename dView0::HostMirror hView0 ; - - dView0 dx , dy ; - hView0 hx , hy ; - - dx = dView0( "dx" ); - dy = dView0( "dy" ); - - hx = Kokkos::create_mirror( dx ); - hy = Kokkos::create_mirror( dy ); - - hx = 1 ; - - Kokkos::deep_copy( dx , hx ); - Kokkos::deep_copy( dy , dx ); - Kokkos::deep_copy( hy , dy ); - - ASSERT_EQ( hx(), hy() ); - } - - static void run_test() - { - // mfh 14 Feb 2014: This test doesn't actually create instances of - // these types. In order to avoid "declared but unused typedef" - // warnings, we declare empty instances of these types, with the - // usual "(void)" marker to avoid compiler warnings for unused - // variables. - - typedef typename dView0::HostMirror hView0 ; - typedef typename dView1::HostMirror hView1 ; - typedef typename dView2::HostMirror hView2 ; - typedef typename dView3::HostMirror hView3 ; - typedef typename dView4::HostMirror hView4 ; - - { - hView0 thing; - (void) thing; - } - { - hView1 thing; - (void) thing; - } - { - hView2 thing; - (void) thing; - } - { - hView3 thing; - (void) thing; - } - { - hView4 thing; - (void) thing; - } - - dView4 dx , dy , dz ; - hView4 hx , hy , hz ; - - ASSERT_TRUE( dx.is_null() ); - ASSERT_TRUE( dy.is_null() ); - ASSERT_TRUE( dz.is_null() ); - ASSERT_TRUE( hx.is_null() ); - ASSERT_TRUE( hy.is_null() ); - ASSERT_TRUE( hz.is_null() ); - ASSERT_EQ( dx.dimension_0() , 0u ); - ASSERT_EQ( dy.dimension_0() , 0u ); - ASSERT_EQ( dz.dimension_0() , 0u ); - ASSERT_EQ( hx.dimension_0() , 0u ); - ASSERT_EQ( hy.dimension_0() , 0u ); - ASSERT_EQ( hz.dimension_0() , 0u ); - ASSERT_EQ( dx.dimension_1() , unsigned(N1) ); - ASSERT_EQ( dy.dimension_1() , unsigned(N1) ); - ASSERT_EQ( dz.dimension_1() , unsigned(N1) ); - ASSERT_EQ( hx.dimension_1() , unsigned(N1) ); - ASSERT_EQ( hy.dimension_1() , unsigned(N1) ); - ASSERT_EQ( hz.dimension_1() , unsigned(N1) ); - - dx = dView4( "dx" , N0 ); - dy = dView4( "dy" , N0 ); - - - - dView4_unmanaged unmanaged_dx = dx; - dView4_unmanaged unmanaged_from_ptr_dx = dView4_unmanaged(dx.ptr_on_device(), - dx.dimension_0(), - dx.dimension_1(), - dx.dimension_2(), - dx.dimension_3()); - - { - // Destruction of this view should be harmless - const_dView4 unmanaged_from_ptr_const_dx( dx.ptr_on_device() , - dx.dimension_0() , - dx.dimension_1() , - dx.dimension_2() , - dx.dimension_3() ); - } - - const_dView4 const_dx = dx ; - - - ASSERT_FALSE( dx.is_null() ); - ASSERT_FALSE( const_dx.is_null() ); - ASSERT_FALSE( unmanaged_dx.is_null() ); - ASSERT_FALSE( unmanaged_from_ptr_dx.is_null() ); - ASSERT_FALSE( dy.is_null() ); - ASSERT_NE( dx , dy ); - - ASSERT_EQ( dx.dimension_0() , unsigned(N0) ); - ASSERT_EQ( dx.dimension_1() , unsigned(N1) ); - ASSERT_EQ( dx.dimension_2() , unsigned(N2) ); - ASSERT_EQ( dx.dimension_3() , unsigned(N3) ); - - ASSERT_EQ( dy.dimension_0() , unsigned(N0) ); - ASSERT_EQ( dy.dimension_1() , unsigned(N1) ); - ASSERT_EQ( dy.dimension_2() , unsigned(N2) ); - ASSERT_EQ( dy.dimension_3() , unsigned(N3) ); - - ASSERT_EQ( unmanaged_from_ptr_dx.capacity(),unsigned(N0)*unsigned(N1)*unsigned(N2)*unsigned(N3) ); - - hx = Kokkos::create_mirror( dx ); - hy = Kokkos::create_mirror( dy ); - - // T v1 = hx() ; // Generates compile error as intended - // T v2 = hx(0,0) ; // Generates compile error as intended - // hx(0,0) = v2 ; // Generates compile error as intended - - // Testing with asynchronous deep copy with respect to device - { - size_t count = 0 ; - for ( size_t ip = 0 ; ip < N0 ; ++ip ) { - for ( size_t i1 = 0 ; i1 < hx.dimension_1() ; ++i1 ) { - for ( size_t i2 = 0 ; i2 < hx.dimension_2() ; ++i2 ) { - for ( size_t i3 = 0 ; i3 < hx.dimension_3() ; ++i3 ) { - hx(ip,i1,i2,i3) = ++count ; - }}}} - - Kokkos::deep_copy(typename hView4::execution_space(), dx , hx ); - Kokkos::deep_copy(typename hView4::execution_space(), dy , dx ); - Kokkos::deep_copy(typename hView4::execution_space(), hy , dy ); - - for ( size_t ip = 0 ; ip < N0 ; ++ip ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - { ASSERT_EQ( hx(ip,i1,i2,i3) , hy(ip,i1,i2,i3) ); } - }}}} - - Kokkos::deep_copy(typename hView4::execution_space(), dx , T(0) ); - Kokkos::deep_copy(typename hView4::execution_space(), hx , dx ); - - for ( size_t ip = 0 ; ip < N0 ; ++ip ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - { ASSERT_EQ( hx(ip,i1,i2,i3) , T(0) ); } - }}}} - } - // Testing with asynchronous deep copy with respect to host - { - size_t count = 0 ; - for ( size_t ip = 0 ; ip < N0 ; ++ip ) { - for ( size_t i1 = 0 ; i1 < hx.dimension_1() ; ++i1 ) { - for ( size_t i2 = 0 ; i2 < hx.dimension_2() ; ++i2 ) { - for ( size_t i3 = 0 ; i3 < hx.dimension_3() ; ++i3 ) { - hx(ip,i1,i2,i3) = ++count ; - }}}} - - Kokkos::deep_copy(typename dView4::execution_space(), dx , hx ); - Kokkos::deep_copy(typename dView4::execution_space(), dy , dx ); - Kokkos::deep_copy(typename dView4::execution_space(), hy , dy ); - - for ( size_t ip = 0 ; ip < N0 ; ++ip ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - { ASSERT_EQ( hx(ip,i1,i2,i3) , hy(ip,i1,i2,i3) ); } - }}}} - - Kokkos::deep_copy(typename dView4::execution_space(), dx , T(0) ); - Kokkos::deep_copy(typename dView4::execution_space(), hx , dx ); - - for ( size_t ip = 0 ; ip < N0 ; ++ip ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - { ASSERT_EQ( hx(ip,i1,i2,i3) , T(0) ); } - }}}} - } - - // Testing with synchronous deep copy - { - size_t count = 0 ; - for ( size_t ip = 0 ; ip < N0 ; ++ip ) { - for ( size_t i1 = 0 ; i1 < hx.dimension_1() ; ++i1 ) { - for ( size_t i2 = 0 ; i2 < hx.dimension_2() ; ++i2 ) { - for ( size_t i3 = 0 ; i3 < hx.dimension_3() ; ++i3 ) { - hx(ip,i1,i2,i3) = ++count ; - }}}} - - Kokkos::deep_copy( dx , hx ); - Kokkos::deep_copy( dy , dx ); - Kokkos::deep_copy( hy , dy ); - - for ( size_t ip = 0 ; ip < N0 ; ++ip ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - { ASSERT_EQ( hx(ip,i1,i2,i3) , hy(ip,i1,i2,i3) ); } - }}}} - - Kokkos::deep_copy( dx , T(0) ); - Kokkos::deep_copy( hx , dx ); - - for ( size_t ip = 0 ; ip < N0 ; ++ip ) { - for ( size_t i1 = 0 ; i1 < N1 ; ++i1 ) { - for ( size_t i2 = 0 ; i2 < N2 ; ++i2 ) { - for ( size_t i3 = 0 ; i3 < N3 ; ++i3 ) { - { ASSERT_EQ( hx(ip,i1,i2,i3) , T(0) ); } - }}}} - } - dz = dx ; ASSERT_EQ( dx, dz); ASSERT_NE( dy, dz); - dz = dy ; ASSERT_EQ( dy, dz); ASSERT_NE( dx, dz); - - dx = dView4(); - ASSERT_TRUE( dx.is_null() ); - ASSERT_FALSE( dy.is_null() ); - ASSERT_FALSE( dz.is_null() ); - dy = dView4(); - ASSERT_TRUE( dx.is_null() ); - ASSERT_TRUE( dy.is_null() ); - ASSERT_FALSE( dz.is_null() ); - dz = dView4(); - ASSERT_TRUE( dx.is_null() ); - ASSERT_TRUE( dy.is_null() ); - ASSERT_TRUE( dz.is_null() ); - } - - typedef T DataType[2] ; - - static void - check_auto_conversion_to_const( - const Kokkos::View< const DataType , device > & arg_const , - const Kokkos::View< DataType , device > & arg ) - { - ASSERT_TRUE( arg_const == arg ); - } - - static void run_test_const() - { - typedef Kokkos::View< DataType , device > typeX ; - typedef Kokkos::View< const DataType , device > const_typeX ; - typedef Kokkos::View< const DataType , device , Kokkos::MemoryRandomAccess > const_typeR ; - typeX x( "X" ); - const_typeX xc = x ; - const_typeR xr = x ; - - ASSERT_TRUE( xc == x ); - ASSERT_TRUE( x == xc ); - ASSERT_TRUE( x.ptr_on_device() == xr.ptr_on_device() ); - - // typeX xf = xc ; // setting non-const from const must not compile - - check_auto_conversion_to_const( x , x ); - } - - static void run_test_subview() - { - typedef Kokkos::View< const T , device > sView ; - - dView0 d0( "d0" ); - dView1 d1( "d1" , N0 ); - dView2 d2( "d2" , N0 ); - dView3 d3( "d3" , N0 ); - dView4 d4( "d4" , N0 ); - - sView s0 = d0 ; - sView s1 = Kokkos::subview( d1 , 1 ); - sView s2 = Kokkos::subview( d2 , 1 , 1 ); - sView s3 = Kokkos::subview( d3 , 1 , 1 , 1 ); - sView s4 = Kokkos::subview( d4 , 1 , 1 , 1 , 1 ); - } - - static void run_test_subview_strided() - { - typedef Kokkos::View< int **** , Kokkos::LayoutLeft , host > view_left_4 ; - typedef Kokkos::View< int **** , Kokkos::LayoutRight , host > view_right_4 ; - typedef Kokkos::View< int ** , Kokkos::LayoutLeft , host > view_left_2 ; - typedef Kokkos::View< int ** , Kokkos::LayoutRight , host > view_right_2 ; - - typedef Kokkos::View< int * , Kokkos::LayoutStride , host > view_stride_1 ; - typedef Kokkos::View< int ** , Kokkos::LayoutStride , host > view_stride_2 ; - - view_left_2 xl2("xl2", 100 , 200 ); - view_right_2 xr2("xr2", 100 , 200 ); - view_stride_1 yl1 = Kokkos::subview( xl2 , 0 , Kokkos::ALL() ); - view_stride_1 yl2 = Kokkos::subview( xl2 , 1 , Kokkos::ALL() ); - view_stride_1 yr1 = Kokkos::subview( xr2 , 0 , Kokkos::ALL() ); - view_stride_1 yr2 = Kokkos::subview( xr2 , 1 , Kokkos::ALL() ); - - ASSERT_EQ( yl1.dimension_0() , xl2.dimension_1() ); - ASSERT_EQ( yl2.dimension_0() , xl2.dimension_1() ); - ASSERT_EQ( yr1.dimension_0() , xr2.dimension_1() ); - ASSERT_EQ( yr2.dimension_0() , xr2.dimension_1() ); - - ASSERT_EQ( & yl1(0) - & xl2(0,0) , 0 ); - ASSERT_EQ( & yl2(0) - & xl2(1,0) , 0 ); - ASSERT_EQ( & yr1(0) - & xr2(0,0) , 0 ); - ASSERT_EQ( & yr2(0) - & xr2(1,0) , 0 ); - - view_left_4 xl4( "xl4" , 10 , 20 , 30 , 40 ); - view_right_4 xr4( "xr4" , 10 , 20 , 30 , 40 ); - - view_stride_2 yl4 = Kokkos::subview( xl4 , 1 , Kokkos::ALL() , 2 , Kokkos::ALL() ); - view_stride_2 yr4 = Kokkos::subview( xr4 , 1 , Kokkos::ALL() , 2 , Kokkos::ALL() ); - - ASSERT_EQ( yl4.dimension_0() , xl4.dimension_1() ); - ASSERT_EQ( yl4.dimension_1() , xl4.dimension_3() ); - ASSERT_EQ( yr4.dimension_0() , xr4.dimension_1() ); - ASSERT_EQ( yr4.dimension_1() , xr4.dimension_3() ); - - ASSERT_EQ( & yl4(4,4) - & xl4(1,4,2,4) , 0 ); - ASSERT_EQ( & yr4(4,4) - & xr4(1,4,2,4) , 0 ); - } - - static void run_test_vector() - { - static const unsigned Length = 1000 , Count = 8 ; - - typedef Kokkos::View< T* , Kokkos::LayoutLeft , host > vector_type ; - typedef Kokkos::View< T** , Kokkos::LayoutLeft , host > multivector_type ; - - typedef Kokkos::View< T* , Kokkos::LayoutRight , host > vector_right_type ; - typedef Kokkos::View< T** , Kokkos::LayoutRight , host > multivector_right_type ; - - typedef Kokkos::View< const T* , Kokkos::LayoutRight, host > const_vector_right_type ; - typedef Kokkos::View< const T* , Kokkos::LayoutLeft , host > const_vector_type ; - typedef Kokkos::View< const T** , Kokkos::LayoutLeft , host > const_multivector_type ; - - multivector_type mv = multivector_type( "mv" , Length , Count ); - multivector_right_type mv_right = multivector_right_type( "mv" , Length , Count ); - - vector_type v1 = Kokkos::subview( mv , Kokkos::ALL() , 0 ); - vector_type v2 = Kokkos::subview( mv , Kokkos::ALL() , 1 ); - vector_type v3 = Kokkos::subview( mv , Kokkos::ALL() , 2 ); - - vector_type rv1 = Kokkos::subview( mv_right , 0 , Kokkos::ALL() ); - vector_type rv2 = Kokkos::subview( mv_right , 1 , Kokkos::ALL() ); - vector_type rv3 = Kokkos::subview( mv_right , 2 , Kokkos::ALL() ); - - multivector_type mv1 = Kokkos::subview( mv , std::make_pair( 1 , 998 ) , - std::make_pair( 2 , 5 ) ); - - multivector_right_type mvr1 = - Kokkos::subview( mv_right , - std::make_pair( 1 , 998 ) , - std::make_pair( 2 , 5 ) ); - - const_vector_type cv1 = Kokkos::subview( mv , Kokkos::ALL(), 0 ); - const_vector_type cv2 = Kokkos::subview( mv , Kokkos::ALL(), 1 ); - const_vector_type cv3 = Kokkos::subview( mv , Kokkos::ALL(), 2 ); - - vector_right_type vr1 = Kokkos::subview( mv , Kokkos::ALL() , 0 ); - vector_right_type vr2 = Kokkos::subview( mv , Kokkos::ALL() , 1 ); - vector_right_type vr3 = Kokkos::subview( mv , Kokkos::ALL() , 2 ); - - const_vector_right_type cvr1 = Kokkos::subview( mv , Kokkos::ALL() , 0 ); - const_vector_right_type cvr2 = Kokkos::subview( mv , Kokkos::ALL() , 1 ); - const_vector_right_type cvr3 = Kokkos::subview( mv , Kokkos::ALL() , 2 ); - - ASSERT_TRUE( & v1[0] == & v1(0) ); - ASSERT_TRUE( & v1[0] == & mv(0,0) ); - ASSERT_TRUE( & v2[0] == & mv(0,1) ); - ASSERT_TRUE( & v3[0] == & mv(0,2) ); - - ASSERT_TRUE( & cv1[0] == & mv(0,0) ); - ASSERT_TRUE( & cv2[0] == & mv(0,1) ); - ASSERT_TRUE( & cv3[0] == & mv(0,2) ); - - ASSERT_TRUE( & vr1[0] == & mv(0,0) ); - ASSERT_TRUE( & vr2[0] == & mv(0,1) ); - ASSERT_TRUE( & vr3[0] == & mv(0,2) ); - - ASSERT_TRUE( & cvr1[0] == & mv(0,0) ); - ASSERT_TRUE( & cvr2[0] == & mv(0,1) ); - ASSERT_TRUE( & cvr3[0] == & mv(0,2) ); - - ASSERT_TRUE( & mv1(0,0) == & mv( 1 , 2 ) ); - ASSERT_TRUE( & mv1(1,1) == & mv( 2 , 3 ) ); - ASSERT_TRUE( & mv1(3,2) == & mv( 4 , 4 ) ); - ASSERT_TRUE( & mvr1(0,0) == & mv_right( 1 , 2 ) ); - ASSERT_TRUE( & mvr1(1,1) == & mv_right( 2 , 3 ) ); - ASSERT_TRUE( & mvr1(3,2) == & mv_right( 4 , 4 ) ); - - const_vector_type c_cv1( v1 ); - typename vector_type::const_type c_cv2( v2 ); - typename const_vector_type::const_type c_ccv2( v2 ); - - const_multivector_type cmv( mv ); - typename multivector_type::const_type cmvX( cmv ); - typename const_multivector_type::const_type ccmvX( cmv ); - } -}; - -} // namespace Test - -#endif - -/*--------------------------------------------------------------------------*/ - diff --git a/lib/kokkos/core/unit_test/TestViewImpl.hpp b/lib/kokkos/core/unit_test/TestViewImpl.hpp deleted file mode 100644 index c51588777b..0000000000 --- a/lib/kokkos/core/unit_test/TestViewImpl.hpp +++ /dev/null @@ -1,289 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include -#include - -#include - -/*--------------------------------------------------------------------------*/ - -#if defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - -namespace Test { - -template < class Device > -void test_view_impl() {} - -} - -#else - -/*--------------------------------------------------------------------------*/ - -namespace Test { - -struct DummyMemorySpace -{ - typedef DummyMemorySpace memory_space ; - typedef unsigned size_type ; -}; - -/*--------------------------------------------------------------------------*/ - -template< class Type > -struct DefineShape { - typedef typename Kokkos::Impl::AnalyzeShape::shape type ; -}; - -template< class Type > -struct ExtractValueType { - typedef typename Kokkos::Impl::AnalyzeShape::value_type type ; -}; - -template< class Type > -struct ArrayType { typedef Type type ; }; - -template < class Device > -void test_view_impl() -{ - //typedef typename Device::memory_space memory_space ; // unused - - typedef ArrayType< int[100] >::type type_01 ; - typedef ArrayType< int* >::type type_11 ; - typedef ArrayType< int[5][6][700] >::type type_03 ; - typedef ArrayType< double*[8][9][900] >::type type_14 ; - typedef ArrayType< long** >::type type_22 ; - typedef ArrayType< short **[5][6][7] >::type type_25 ; - typedef ArrayType< const short **[5][6][7] >::type const_type_25 ; - typedef ArrayType< short***[5][6][7] >::type type_36 ; - typedef ArrayType< const short***[5][6][7] >::type const_type_36 ; - - // mfh 14 Feb 2014: With gcc 4.8.2 -Wall, this emits a warning: - // - // typedef ‘ok_const_25’ locally defined but not used [-Wunused-local-typedefs] - // - // It's unfortunate that this is the case, because the typedef is - // being used for a compile-time check! We deal with this by - // declaring an instance of ok_const_25, and marking it with - // "(void)" so that instance doesn't emit an "unused variable" - // warning. - // - // typedef typename Kokkos::Impl::StaticAssertSame< - // typename Kokkos::Impl::AnalyzeShape::const_type , - // typename Kokkos::Impl::AnalyzeShape::type - // > ok_const_25 ; - - typedef typename Kokkos::Impl::StaticAssertSame< - typename Kokkos::Impl::AnalyzeShape::const_type, - typename Kokkos::Impl::AnalyzeShape::type - > ok_const_25 ; - - typedef typename Kokkos::Impl::StaticAssertSame< - typename Kokkos::Impl::AnalyzeShape::const_type, - typename Kokkos::Impl::AnalyzeShape::type - > ok_const_36 ; - { - ok_const_25 thing_25 ; - ok_const_36 thing_36 ; - (void) thing_25 ; // silence warning for unused variable - (void) thing_36 ; // silence warning for unused variable - } - - ASSERT_TRUE( ( Kokkos::Impl::is_same< ExtractValueType::type , int >::value ) ); - ASSERT_TRUE( ( Kokkos::Impl::is_same< ExtractValueType::type , double >::value ) ); - ASSERT_TRUE( ( Kokkos::Impl::is_same< ExtractValueType::type , long >::value ) ); - ASSERT_TRUE( ( Kokkos::Impl::is_same< ExtractValueType::type , short >::value ) ); - - ASSERT_FALSE( ( Kokkos::Impl::is_same< ExtractValueType::type , int >::value ) ); - - typedef typename DefineShape< type_01 >::type shape_01_type ; - typedef typename DefineShape< type_11 >::type shape_11_type ; - typedef typename DefineShape< type_03 >::type shape_03_type ; - typedef typename DefineShape< type_14 >::type shape_14_type ; - typedef typename DefineShape< type_22 >::type shape_22_type ; - typedef typename DefineShape< type_36 >::type shape_36_type ; - - ASSERT_TRUE( ( Kokkos::Impl::StaticAssert< shape_36_type::rank == 6 >::value ) ); - ASSERT_TRUE( ( Kokkos::Impl::StaticAssert< shape_03_type::rank == 3 >::value ) ); - - shape_01_type shape_01 ; shape_01_type::assign( shape_01 ); - shape_11_type shape_11 ; shape_11_type::assign( shape_11, 1000 ); - shape_03_type shape_03 ; shape_03_type::assign( shape_03 ); - shape_14_type shape_14 ; shape_14_type::assign( shape_14 , 0 ); - shape_22_type shape_22 ; shape_22_type::assign( shape_22 , 0 , 0 ); - shape_36_type shape_36 ; shape_36_type::assign( shape_36 , 10 , 20 , 30 ); - - ASSERT_TRUE( shape_01.rank_dynamic == 0u ); - ASSERT_TRUE( shape_01.rank == 1u ); - ASSERT_TRUE( shape_01.N0 == 100u ); - - ASSERT_TRUE( shape_11.rank_dynamic == 1u ); - ASSERT_TRUE( shape_11.rank == 1u ); - ASSERT_TRUE( shape_11.N0 == 1000u ); - - ASSERT_TRUE( shape_03.rank_dynamic == 0u ); - ASSERT_TRUE( shape_03.rank == 3u ); - ASSERT_TRUE( shape_03.N0 == 5u ); - ASSERT_TRUE( shape_03.N1 == 6u ); - ASSERT_TRUE( shape_03.N2 == 700u ); - - ASSERT_TRUE( shape_14.rank_dynamic == 1u ); - ASSERT_TRUE( shape_14.rank == 4u ); - ASSERT_TRUE( shape_14.N0 == 0u ); - ASSERT_TRUE( shape_14.N1 == 8u ); - ASSERT_TRUE( shape_14.N2 == 9u ); - ASSERT_TRUE( shape_14.N3 == 900u ); - - ASSERT_TRUE( shape_22.rank_dynamic == 2u ); - ASSERT_TRUE( shape_22.rank == 2u ); - ASSERT_TRUE( shape_22.N0 == 0u ); - ASSERT_TRUE( shape_22.N1 == 0u ); - - ASSERT_TRUE( shape_36.rank_dynamic == 3u ); - ASSERT_TRUE( shape_36.rank == 6u ); - ASSERT_TRUE( shape_36.N0 == 10u ); - ASSERT_TRUE( shape_36.N1 == 20u ); - ASSERT_TRUE( shape_36.N2 == 30u ); - ASSERT_TRUE( shape_36.N3 == 5u ); - ASSERT_TRUE( shape_36.N4 == 6u ); - ASSERT_TRUE( shape_36.N5 == 7u ); - - - ASSERT_TRUE( shape_01 == shape_01 ); - ASSERT_TRUE( shape_11 == shape_11 ); - ASSERT_TRUE( shape_36 == shape_36 ); - ASSERT_TRUE( shape_01 != shape_36 ); - ASSERT_TRUE( shape_22 != shape_36 ); - - //------------------------------------------------------------------------ - - typedef Kokkos::Impl::ViewOffset< shape_01_type , Kokkos::LayoutLeft > shape_01_left_offset ; - typedef Kokkos::Impl::ViewOffset< shape_11_type , Kokkos::LayoutLeft > shape_11_left_offset ; - typedef Kokkos::Impl::ViewOffset< shape_03_type , Kokkos::LayoutLeft > shape_03_left_offset ; - typedef Kokkos::Impl::ViewOffset< shape_14_type , Kokkos::LayoutLeft > shape_14_left_offset ; - typedef Kokkos::Impl::ViewOffset< shape_22_type , Kokkos::LayoutLeft > shape_22_left_offset ; - typedef Kokkos::Impl::ViewOffset< shape_36_type , Kokkos::LayoutLeft > shape_36_left_offset ; - - typedef Kokkos::Impl::ViewOffset< shape_01_type , Kokkos::LayoutRight > shape_01_right_offset ; - typedef Kokkos::Impl::ViewOffset< shape_11_type , Kokkos::LayoutRight > shape_11_right_offset ; - typedef Kokkos::Impl::ViewOffset< shape_03_type , Kokkos::LayoutRight > shape_03_right_offset ; - typedef Kokkos::Impl::ViewOffset< shape_14_type , Kokkos::LayoutRight > shape_14_right_offset ; - typedef Kokkos::Impl::ViewOffset< shape_22_type , Kokkos::LayoutRight > shape_22_right_offset ; - typedef Kokkos::Impl::ViewOffset< shape_36_type , Kokkos::LayoutRight > shape_36_right_offset ; - - ASSERT_TRUE( ! shape_01_left_offset::has_padding ); - ASSERT_TRUE( ! shape_11_left_offset::has_padding ); - ASSERT_TRUE( ! shape_03_left_offset::has_padding ); - ASSERT_TRUE( shape_14_left_offset::has_padding ); - ASSERT_TRUE( shape_22_left_offset::has_padding ); - ASSERT_TRUE( shape_36_left_offset::has_padding ); - - ASSERT_TRUE( ! shape_01_right_offset::has_padding ); - ASSERT_TRUE( ! shape_11_right_offset::has_padding ); - ASSERT_TRUE( ! shape_03_right_offset::has_padding ); - ASSERT_TRUE( ! shape_14_right_offset::has_padding ); - ASSERT_TRUE( shape_22_right_offset::has_padding ); - ASSERT_TRUE( shape_36_right_offset::has_padding ); - - //------------------------------------------------------------------------ - - typedef Kokkos::Impl::ViewOffset< shape_01_type , Kokkos::LayoutStride > shape_01_stride_offset ; - typedef Kokkos::Impl::ViewOffset< shape_36_type , Kokkos::LayoutStride > shape_36_stride_offset ; - - { - shape_01_stride_offset stride_offset_01 ; - - stride_offset_01.assign( 1, stride_offset_01.N0, 0,0,0,0,0,0,0 ); - - ASSERT_EQ( int(stride_offset_01.S[0]) , int(1) ); - ASSERT_EQ( int(stride_offset_01.S[1]) , int(stride_offset_01.N0) ); - } - - { - shape_36_stride_offset stride_offset_36 ; - - size_t str[7] ; - str[5] = 1 ; - str[4] = str[5] * stride_offset_36.N5 ; - str[3] = str[4] * stride_offset_36.N4 ; - str[2] = str[3] * stride_offset_36.N3 ; - str[1] = str[2] * 100 ; - str[0] = str[1] * 200 ; - str[6] = str[0] * 300 ; - - stride_offset_36.assign( str[0] , str[1] , str[2] , str[3] , str[4] , str[5] , str[6] , 0 , 0 ); - - ASSERT_EQ( size_t(stride_offset_36.S[6]) , size_t(str[6]) ); - ASSERT_EQ( size_t(stride_offset_36.N2) , size_t(100) ); - ASSERT_EQ( size_t(stride_offset_36.N1) , size_t(200) ); - ASSERT_EQ( size_t(stride_offset_36.N0) , size_t(300) ); - } - - //------------------------------------------------------------------------ - - { - const int rank = 6 ; - const int order[] = { 5 , 3 , 1 , 0 , 2 , 4 }; - const unsigned dim[] = { 2 , 3 , 5 , 7 , 11 , 13 }; - Kokkos::LayoutStride stride_6 = Kokkos::LayoutStride::order_dimensions( rank , order , dim ); - size_t n = 1 ; - for ( int i = 0 ; i < rank ; ++i ) { - ASSERT_EQ( size_t(dim[i]) , size_t( stride_6.dimension[i] ) ); - ASSERT_EQ( size_t(n) , size_t( stride_6.stride[ order[i] ] ) ); - n *= dim[order[i]] ; - } - } - - //------------------------------------------------------------------------ -} - -} /* namespace Test */ - -#endif - -/*--------------------------------------------------------------------------*/ - diff --git a/lib/kokkos/core/unit_test/TestViewMapping.hpp b/lib/kokkos/core/unit_test/TestViewMapping.hpp deleted file mode 100644 index e380984107..0000000000 --- a/lib/kokkos/core/unit_test/TestViewMapping.hpp +++ /dev/null @@ -1,1080 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include -#include - -#include - -/*--------------------------------------------------------------------------*/ - -namespace Test { - -template< class RangeType > -void test_view_range( const size_t N , const RangeType & range , const size_t begin , const size_t dim ) -{ - typedef Kokkos::Experimental::Impl::ViewOffsetRange< RangeType > query ; - - ASSERT_EQ( query::begin( range ) , begin ); - ASSERT_EQ( query::dimension( N , range ) , dim ); - ASSERT_EQ( query::is_range , dim != 0 ); -} - - -template< class ExecSpace > -void test_view_mapping() -{ - typedef Kokkos::Experimental::Impl::ViewDimension<> dim_0 ; - typedef Kokkos::Experimental::Impl::ViewDimension<2> dim_s2 ; - typedef Kokkos::Experimental::Impl::ViewDimension<2,3> dim_s2_s3 ; - typedef Kokkos::Experimental::Impl::ViewDimension<2,3,4> dim_s2_s3_s4 ; - - typedef Kokkos::Experimental::Impl::ViewDimension<0> dim_s0 ; - typedef Kokkos::Experimental::Impl::ViewDimension<0,3> dim_s0_s3 ; - typedef Kokkos::Experimental::Impl::ViewDimension<0,3,4> dim_s0_s3_s4 ; - - typedef Kokkos::Experimental::Impl::ViewDimension<0,0> dim_s0_s0 ; - typedef Kokkos::Experimental::Impl::ViewDimension<0,0,4> dim_s0_s0_s4 ; - - typedef Kokkos::Experimental::Impl::ViewDimension<0,0,0> dim_s0_s0_s0 ; - typedef Kokkos::Experimental::Impl::ViewDimension<0,0,0,0> dim_s0_s0_s0_s0 ; - typedef Kokkos::Experimental::Impl::ViewDimension<0,0,0,0,0> dim_s0_s0_s0_s0_s0 ; - typedef Kokkos::Experimental::Impl::ViewDimension<0,0,0,0,0,0> dim_s0_s0_s0_s0_s0_s0 ; - typedef Kokkos::Experimental::Impl::ViewDimension<0,0,0,0,0,0,0> dim_s0_s0_s0_s0_s0_s0_s0 ; - typedef Kokkos::Experimental::Impl::ViewDimension<0,0,0,0,0,0,0,0> dim_s0_s0_s0_s0_s0_s0_s0_s0 ; - - // Fully static dimensions should not be larger than an int - ASSERT_LE( sizeof(dim_0) , sizeof(int) ); - ASSERT_LE( sizeof(dim_s2) , sizeof(int) ); - ASSERT_LE( sizeof(dim_s2_s3) , sizeof(int) ); - ASSERT_LE( sizeof(dim_s2_s3_s4) , sizeof(int) ); - - // Rank 1 is size_t - ASSERT_EQ( sizeof(dim_s0) , sizeof(size_t) ); - ASSERT_EQ( sizeof(dim_s0_s3) , sizeof(size_t) ); - ASSERT_EQ( sizeof(dim_s0_s3_s4) , sizeof(size_t) ); - - // Allow for padding - ASSERT_LE( sizeof(dim_s0_s0) , 2 * sizeof(size_t) ); - ASSERT_LE( sizeof(dim_s0_s0_s4) , 2 * sizeof(size_t) ); - - ASSERT_LE( sizeof(dim_s0_s0_s0) , 4 * sizeof(size_t) ); - ASSERT_EQ( sizeof(dim_s0_s0_s0_s0) , 4 * sizeof(unsigned) ); - ASSERT_LE( sizeof(dim_s0_s0_s0_s0_s0) , 6 * sizeof(unsigned) ); - ASSERT_EQ( sizeof(dim_s0_s0_s0_s0_s0_s0) , 6 * sizeof(unsigned) ); - ASSERT_LE( sizeof(dim_s0_s0_s0_s0_s0_s0_s0) , 8 * sizeof(unsigned) ); - ASSERT_EQ( sizeof(dim_s0_s0_s0_s0_s0_s0_s0_s0) , 8 * sizeof(unsigned) ); - - ASSERT_EQ( int(dim_0::rank) , int(0) ); - ASSERT_EQ( int(dim_0::rank_dynamic) , int(0) ); - - ASSERT_EQ( int(dim_s2::rank) , int(1) ); - ASSERT_EQ( int(dim_s2::rank_dynamic) , int(0) ); - - ASSERT_EQ( int(dim_s2_s3::rank) , int(2) ); - ASSERT_EQ( int(dim_s2_s3::rank_dynamic) , int(0) ); - - ASSERT_EQ( int(dim_s2_s3_s4::rank) , int(3) ); - ASSERT_EQ( int(dim_s2_s3_s4::rank_dynamic) , int(0) ); - - ASSERT_EQ( int(dim_s0::rank) , int(1) ); - ASSERT_EQ( int(dim_s0::rank_dynamic) , int(1) ); - - ASSERT_EQ( int(dim_s0_s3::rank) , int(2) ); - ASSERT_EQ( int(dim_s0_s3::rank_dynamic) , int(1) ); - - ASSERT_EQ( int(dim_s0_s3_s4::rank) , int(3) ); - ASSERT_EQ( int(dim_s0_s3_s4::rank_dynamic) , int(1) ); - - ASSERT_EQ( int(dim_s0_s0_s4::rank) , int(3) ); - ASSERT_EQ( int(dim_s0_s0_s4::rank_dynamic) , int(2) ); - - ASSERT_EQ( int(dim_s0_s0_s0::rank) , int(3) ); - ASSERT_EQ( int(dim_s0_s0_s0::rank_dynamic) , int(3) ); - - ASSERT_EQ( int(dim_s0_s0_s0_s0::rank) , int(4) ); - ASSERT_EQ( int(dim_s0_s0_s0_s0::rank_dynamic) , int(4) ); - - ASSERT_EQ( int(dim_s0_s0_s0_s0_s0::rank) , int(5) ); - ASSERT_EQ( int(dim_s0_s0_s0_s0_s0::rank_dynamic) , int(5) ); - - ASSERT_EQ( int(dim_s0_s0_s0_s0_s0_s0::rank) , int(6) ); - ASSERT_EQ( int(dim_s0_s0_s0_s0_s0_s0::rank_dynamic) , int(6) ); - - ASSERT_EQ( int(dim_s0_s0_s0_s0_s0_s0_s0::rank) , int(7) ); - ASSERT_EQ( int(dim_s0_s0_s0_s0_s0_s0_s0::rank_dynamic) , int(7) ); - - ASSERT_EQ( int(dim_s0_s0_s0_s0_s0_s0_s0_s0::rank) , int(8) ); - ASSERT_EQ( int(dim_s0_s0_s0_s0_s0_s0_s0_s0::rank_dynamic) , int(8) ); - - dim_s0 d1( 2, 3, 4, 5, 6, 7, 8, 9 ); - dim_s0_s0 d2( 2, 3, 4, 5, 6, 7, 8, 9 ); - dim_s0_s0_s0 d3( 2, 3, 4, 5, 6, 7, 8, 9 ); - dim_s0_s0_s0_s0 d4( 2, 3, 4, 5, 6, 7, 8, 9 ); - - ASSERT_EQ( d1.N0 , 2 ); - ASSERT_EQ( d2.N0 , 2 ); - ASSERT_EQ( d3.N0 , 2 ); - ASSERT_EQ( d4.N0 , 2 ); - - ASSERT_EQ( d1.N1 , 1 ); - ASSERT_EQ( d2.N1 , 3 ); - ASSERT_EQ( d3.N1 , 3 ); - ASSERT_EQ( d4.N1 , 3 ); - - ASSERT_EQ( d1.N2 , 1 ); - ASSERT_EQ( d2.N2 , 1 ); - ASSERT_EQ( d3.N2 , 4 ); - ASSERT_EQ( d4.N2 , 4 ); - - ASSERT_EQ( d1.N3 , 1 ); - ASSERT_EQ( d2.N3 , 1 ); - ASSERT_EQ( d3.N3 , 1 ); - ASSERT_EQ( d4.N3 , 5 ); - - //---------------------------------------- - - typedef Kokkos::Experimental::Impl::ViewOffset< dim_s0_s0_s0 , Kokkos::LayoutStride > stride_s0_s0_s0 ; - - //---------------------------------------- - // Static dimension - { - typedef Kokkos::Experimental::Impl::ViewOffset< dim_s2_s3_s4 , Kokkos::LayoutLeft > left_s2_s3_s4 ; - - ASSERT_EQ( sizeof(left_s2_s3_s4) , sizeof(dim_s2_s3_s4) ); - - left_s2_s3_s4 off3 ; - - stride_s0_s0_s0 stride3( off3 ); - - ASSERT_EQ( off3.stride_0() , 1 ); - ASSERT_EQ( off3.stride_1() , 2 ); - ASSERT_EQ( off3.stride_2() , 6 ); - ASSERT_EQ( off3.span() , 24 ); - - ASSERT_EQ( off3.stride_0() , stride3.stride_0() ); - ASSERT_EQ( off3.stride_1() , stride3.stride_1() ); - ASSERT_EQ( off3.stride_2() , stride3.stride_2() ); - ASSERT_EQ( off3.span() , stride3.span() ); - - int offset = 0 ; - - for ( int k = 0 ; k < 4 ; ++k ){ - for ( int j = 0 ; j < 3 ; ++j ){ - for ( int i = 0 ; i < 2 ; ++i , ++offset ){ - ASSERT_EQ( off3(i,j,k) , offset ); - ASSERT_EQ( stride3(i,j,k) , off3(i,j,k) ); - }}} - } - - //---------------------------------------- - // Small dimension is unpadded - { - typedef Kokkos::Experimental::Impl::ViewOffset< dim_s0_s0_s4 , Kokkos::LayoutLeft > left_s0_s0_s4 ; - - left_s0_s0_s4 dyn_off3( std::integral_constant(), 2, 3, 0, 0, 0, 0, 0, 0 ); - - stride_s0_s0_s0 stride3( dyn_off3 ); - - ASSERT_EQ( dyn_off3.m_dim.rank , 3 ); - ASSERT_EQ( dyn_off3.m_dim.N0 , 2 ); - ASSERT_EQ( dyn_off3.m_dim.N1 , 3 ); - ASSERT_EQ( dyn_off3.m_dim.N2 , 4 ); - ASSERT_EQ( dyn_off3.m_dim.N3 , 1 ); - ASSERT_EQ( dyn_off3.size() , 2 * 3 * 4 ); - - ASSERT_EQ( stride3.m_dim.rank , 3 ); - ASSERT_EQ( stride3.m_dim.N0 , 2 ); - ASSERT_EQ( stride3.m_dim.N1 , 3 ); - ASSERT_EQ( stride3.m_dim.N2 , 4 ); - ASSERT_EQ( stride3.m_dim.N3 , 1 ); - ASSERT_EQ( stride3.size() , 2 * 3 * 4 ); - - int offset = 0 ; - - for ( int k = 0 ; k < 4 ; ++k ){ - for ( int j = 0 ; j < 3 ; ++j ){ - for ( int i = 0 ; i < 2 ; ++i , ++offset ){ - ASSERT_EQ( offset , dyn_off3(i,j,k) ); - ASSERT_EQ( stride3(i,j,k) , dyn_off3(i,j,k) ); - }}} - - ASSERT_EQ( dyn_off3.span() , offset ); - ASSERT_EQ( stride3.span() , dyn_off3.span() ); - } - - // Large dimension is likely padded - { - constexpr int N0 = 2000 ; - constexpr int N1 = 300 ; - - typedef Kokkos::Experimental::Impl::ViewOffset< dim_s0_s0_s4 , Kokkos::LayoutLeft > left_s0_s0_s4 ; - - left_s0_s0_s4 dyn_off3( std::integral_constant(), N0, N1, 0, 0, 0, 0, 0, 0 ); - - stride_s0_s0_s0 stride3( dyn_off3 ); - - ASSERT_EQ( dyn_off3.m_dim.rank , 3 ); - ASSERT_EQ( dyn_off3.m_dim.N0 , N0 ); - ASSERT_EQ( dyn_off3.m_dim.N1 , N1 ); - ASSERT_EQ( dyn_off3.m_dim.N2 , 4 ); - ASSERT_EQ( dyn_off3.m_dim.N3 , 1 ); - ASSERT_EQ( dyn_off3.size() , N0 * N1 * 4 ); - - ASSERT_EQ( stride3.m_dim.rank , 3 ); - ASSERT_EQ( stride3.m_dim.N0 , N0 ); - ASSERT_EQ( stride3.m_dim.N1 , N1 ); - ASSERT_EQ( stride3.m_dim.N2 , 4 ); - ASSERT_EQ( stride3.m_dim.N3 , 1 ); - ASSERT_EQ( stride3.size() , N0 * N1 * 4 ); - ASSERT_EQ( stride3.span() , dyn_off3.span() ); - - int offset = 0 ; - - for ( int k = 0 ; k < 4 ; ++k ){ - for ( int j = 0 ; j < N1 ; ++j ){ - for ( int i = 0 ; i < N0 ; ++i ){ - ASSERT_LE( offset , dyn_off3(i,j,k) ); - ASSERT_EQ( stride3(i,j,k) , dyn_off3(i,j,k) ); - offset = dyn_off3(i,j,k) + 1 ; - }}} - - ASSERT_LE( offset , dyn_off3.span() ); - } - - //---------------------------------------- - // Static dimension - { - typedef Kokkos::Experimental::Impl::ViewOffset< dim_s2_s3_s4 , Kokkos::LayoutRight > right_s2_s3_s4 ; - - ASSERT_EQ( sizeof(right_s2_s3_s4) , sizeof(dim_s2_s3_s4) ); - - right_s2_s3_s4 off3 ; - - stride_s0_s0_s0 stride3( off3 ); - - ASSERT_EQ( off3.stride_0() , 12 ); - ASSERT_EQ( off3.stride_1() , 4 ); - ASSERT_EQ( off3.stride_2() , 1 ); - - ASSERT_EQ( off3.dimension_0() , stride3.dimension_0() ); - ASSERT_EQ( off3.dimension_1() , stride3.dimension_1() ); - ASSERT_EQ( off3.dimension_2() , stride3.dimension_2() ); - ASSERT_EQ( off3.stride_0() , stride3.stride_0() ); - ASSERT_EQ( off3.stride_1() , stride3.stride_1() ); - ASSERT_EQ( off3.stride_2() , stride3.stride_2() ); - ASSERT_EQ( off3.span() , stride3.span() ); - - int offset = 0 ; - - for ( int i = 0 ; i < 2 ; ++i ){ - for ( int j = 0 ; j < 3 ; ++j ){ - for ( int k = 0 ; k < 4 ; ++k , ++offset ){ - ASSERT_EQ( off3(i,j,k) , offset ); - ASSERT_EQ( off3(i,j,k) , stride3(i,j,k) ); - }}} - - ASSERT_EQ( off3.span() , offset ); - } - - //---------------------------------------- - // Small dimension is unpadded - { - typedef Kokkos::Experimental::Impl::ViewOffset< dim_s0_s0_s4 , Kokkos::LayoutRight > right_s0_s0_s4 ; - - right_s0_s0_s4 dyn_off3( std::integral_constant(), 2, 3, 0, 0, 0, 0, 0, 0 ); - - stride_s0_s0_s0 stride3( dyn_off3 ); - - ASSERT_EQ( dyn_off3.m_dim.rank , 3 ); - ASSERT_EQ( dyn_off3.m_dim.N0 , 2 ); - ASSERT_EQ( dyn_off3.m_dim.N1 , 3 ); - ASSERT_EQ( dyn_off3.m_dim.N2 , 4 ); - ASSERT_EQ( dyn_off3.m_dim.N3 , 1 ); - ASSERT_EQ( dyn_off3.size() , 2 * 3 * 4 ); - - ASSERT_EQ( dyn_off3.dimension_0() , stride3.dimension_0() ); - ASSERT_EQ( dyn_off3.dimension_1() , stride3.dimension_1() ); - ASSERT_EQ( dyn_off3.dimension_2() , stride3.dimension_2() ); - ASSERT_EQ( dyn_off3.stride_0() , stride3.stride_0() ); - ASSERT_EQ( dyn_off3.stride_1() , stride3.stride_1() ); - ASSERT_EQ( dyn_off3.stride_2() , stride3.stride_2() ); - ASSERT_EQ( dyn_off3.span() , stride3.span() ); - - int offset = 0 ; - - for ( int i = 0 ; i < 2 ; ++i ){ - for ( int j = 0 ; j < 3 ; ++j ){ - for ( int k = 0 ; k < 4 ; ++k , ++offset ){ - ASSERT_EQ( offset , dyn_off3(i,j,k) ); - ASSERT_EQ( dyn_off3(i,j,k) , stride3(i,j,k) ); - }}} - - ASSERT_EQ( dyn_off3.span() , offset ); - } - - // Large dimension is likely padded - { - constexpr int N0 = 2000 ; - constexpr int N1 = 300 ; - - typedef Kokkos::Experimental::Impl::ViewOffset< dim_s0_s0_s4 , Kokkos::LayoutRight > right_s0_s0_s4 ; - - right_s0_s0_s4 dyn_off3( std::integral_constant(), N0, N1, 0, 0, 0, 0, 0, 0 ); - - stride_s0_s0_s0 stride3( dyn_off3 ); - - ASSERT_EQ( dyn_off3.m_dim.rank , 3 ); - ASSERT_EQ( dyn_off3.m_dim.N0 , N0 ); - ASSERT_EQ( dyn_off3.m_dim.N1 , N1 ); - ASSERT_EQ( dyn_off3.m_dim.N2 , 4 ); - ASSERT_EQ( dyn_off3.m_dim.N3 , 1 ); - ASSERT_EQ( dyn_off3.size() , N0 * N1 * 4 ); - - ASSERT_EQ( dyn_off3.dimension_0() , stride3.dimension_0() ); - ASSERT_EQ( dyn_off3.dimension_1() , stride3.dimension_1() ); - ASSERT_EQ( dyn_off3.dimension_2() , stride3.dimension_2() ); - ASSERT_EQ( dyn_off3.stride_0() , stride3.stride_0() ); - ASSERT_EQ( dyn_off3.stride_1() , stride3.stride_1() ); - ASSERT_EQ( dyn_off3.stride_2() , stride3.stride_2() ); - ASSERT_EQ( dyn_off3.span() , stride3.span() ); - - int offset = 0 ; - - for ( int i = 0 ; i < N0 ; ++i ){ - for ( int j = 0 ; j < N1 ; ++j ){ - for ( int k = 0 ; k < 4 ; ++k ){ - ASSERT_LE( offset , dyn_off3(i,j,k) ); - ASSERT_EQ( dyn_off3(i,j,k) , stride3(i,j,k) ); - offset = dyn_off3(i,j,k) + 1 ; - }}} - - ASSERT_LE( offset , dyn_off3.span() ); - } - - //---------------------------------------- - // Subview - { - constexpr int N0 = 2000 ; - constexpr int N1 = 300 ; - - constexpr int sub_N0 = 1000 ; - constexpr int sub_N1 = 200 ; - constexpr int sub_N2 = 4 ; - - typedef Kokkos::Experimental::Impl::ViewOffset< dim_s0_s0_s4 , Kokkos::LayoutLeft > left_s0_s0_s4 ; - - left_s0_s0_s4 dyn_off3( std::integral_constant(), N0, N1, 0, 0, 0, 0, 0, 0 ); - - stride_s0_s0_s0 stride3( dyn_off3 , sub_N0 , sub_N1 , sub_N2 , 0 , 0 , 0 , 0 , 0 ); - - ASSERT_EQ( stride3.dimension_0() , sub_N0 ); - ASSERT_EQ( stride3.dimension_1() , sub_N1 ); - ASSERT_EQ( stride3.dimension_2() , sub_N2 ); - ASSERT_EQ( stride3.size() , sub_N0 * sub_N1 * sub_N2 ); - - ASSERT_EQ( dyn_off3.stride_0() , stride3.stride_0() ); - ASSERT_EQ( dyn_off3.stride_1() , stride3.stride_1() ); - ASSERT_EQ( dyn_off3.stride_2() , stride3.stride_2() ); - ASSERT_GE( dyn_off3.span() , stride3.span() ); - - for ( int k = 0 ; k < sub_N2 ; ++k ){ - for ( int j = 0 ; j < sub_N1 ; ++j ){ - for ( int i = 0 ; i < sub_N0 ; ++i ){ - ASSERT_EQ( stride3(i,j,k) , dyn_off3(i,j,k) ); - }}} - } - - { - constexpr int N0 = 2000 ; - constexpr int N1 = 300 ; - - constexpr int sub_N0 = 1000 ; - constexpr int sub_N1 = 200 ; - constexpr int sub_N2 = 4 ; - - typedef Kokkos::Experimental::Impl::ViewOffset< dim_s0_s0_s4 , Kokkos::LayoutRight > right_s0_s0_s4 ; - - right_s0_s0_s4 dyn_off3( std::integral_constant(), N0, N1, 0, 0, 0, 0, 0, 0 ); - - stride_s0_s0_s0 stride3( dyn_off3 , sub_N0 , sub_N1 , sub_N2 , 0 , 0 , 0 , 0 , 0 ); - - ASSERT_EQ( stride3.dimension_0() , sub_N0 ); - ASSERT_EQ( stride3.dimension_1() , sub_N1 ); - ASSERT_EQ( stride3.dimension_2() , sub_N2 ); - ASSERT_EQ( stride3.size() , sub_N0 * sub_N1 * sub_N2 ); - - ASSERT_EQ( dyn_off3.stride_0() , stride3.stride_0() ); - ASSERT_EQ( dyn_off3.stride_1() , stride3.stride_1() ); - ASSERT_EQ( dyn_off3.stride_2() , stride3.stride_2() ); - ASSERT_GE( dyn_off3.span() , stride3.span() ); - - for ( int i = 0 ; i < sub_N0 ; ++i ){ - for ( int j = 0 ; j < sub_N1 ; ++j ){ - for ( int k = 0 ; k < sub_N2 ; ++k ){ - ASSERT_EQ( stride3(i,j,k) , dyn_off3(i,j,k) ); - }}} - } - - //---------------------------------------- - { - constexpr int N = 1000 ; - - test_view_range( N , N / 2 , N / 2 , 0 ); - test_view_range( N , Kokkos::Experimental::ALL , 0 , N ); - test_view_range( N , std::pair( N / 4 , 10 + N / 4 ) , N / 4 , 10 ); - test_view_range( N , Kokkos::pair( N / 4 , 10 + N / 4 ) , N / 4 , 10 ); - } - //---------------------------------------- - // view data analysis - - { - using namespace Kokkos::Experimental::Impl ; - - typedef ViewArrayAnalysis< int[] > a_int_r1 ; - typedef ViewArrayAnalysis< int**[4][5][6] > a_int_r5 ; - typedef ViewArrayAnalysis< const int[] > a_const_int_r1 ; - typedef ViewArrayAnalysis< const int**[4][5][6] > a_const_int_r5 ; - - static_assert( a_int_r1::dimension::rank == 1 , "" ); - static_assert( a_int_r1::dimension::rank_dynamic == 1 , "" ); - static_assert( std::is_same< typename a_int_r1::dimension , ViewDimension<0> >::value , "" ); - static_assert( std::is_same< typename a_int_r1::non_const_value_type , int >::value , "" ); - - static_assert( a_const_int_r1::dimension::rank == 1 , "" ); - static_assert( a_const_int_r1::dimension::rank_dynamic == 1 , "" ); - static_assert( std::is_same< typename a_const_int_r1::dimension , ViewDimension<0> >::value , "" ); - static_assert( std::is_same< typename a_const_int_r1::non_const_value_type , int >::value , "" ); - - static_assert( a_const_int_r5::dimension::rank == 5 , "" ); - static_assert( a_const_int_r5::dimension::rank_dynamic == 2 , "" ); - static_assert( std::is_same< typename a_const_int_r5::dimension , ViewDimension<0,0,4,5,6> >::value , "" ); - static_assert( std::is_same< typename a_const_int_r5::non_const_value_type , int >::value , "" ); - - static_assert( a_int_r5::dimension::rank == 5 , "" ); - static_assert( a_int_r5::dimension::rank_dynamic == 2 , "" ); - static_assert( std::is_same< typename a_int_r5::dimension , ViewDimension<0,0,4,5,6> >::value , "" ); - static_assert( std::is_same< typename a_int_r5::non_const_value_type , int >::value , "" ); - } - - { - using namespace Kokkos::Experimental::Impl ; - - typedef int t_i4[4] ; - - // Dimensions of t_i4 are appended to the multdimensional array. - typedef ViewArrayAnalysis< t_i4 ***[3] > a_int_r5 ; - - static_assert( a_int_r5::dimension::rank == 5 , "" ); - static_assert( a_int_r5::dimension::rank_dynamic == 3 , "" ); - static_assert( a_int_r5::dimension::arg_N0 == 0 , "" ); - static_assert( a_int_r5::dimension::arg_N1 == 0 , "" ); - static_assert( a_int_r5::dimension::arg_N2 == 0 , "" ); - static_assert( a_int_r5::dimension::arg_N3 == 3 , "" ); - static_assert( a_int_r5::dimension::arg_N4 == 4 , "" ); - static_assert( std::is_same< typename a_int_r5::non_const_value_type , int >::value , "" ); - } - - { - using namespace Kokkos::Experimental::Impl ; - - typedef ViewDataAnalysis< const int[] , typename ViewArrayAnalysis::non_const_value_type , void > a_const_int_r1 ; - - static_assert( std::is_same< typename a_const_int_r1::specialize , void >::value , "" ); - static_assert( std::is_same< typename a_const_int_r1::dimension , Kokkos::Experimental::Impl::ViewDimension<0> >::value , "" ); - - static_assert( std::is_same< typename a_const_int_r1::type , const int * >::value , "" ); - static_assert( std::is_same< typename a_const_int_r1::value_type , const int >::value , "" ); - - static_assert( std::is_same< typename a_const_int_r1::array_scalar_type , const int * >::value , "" ); - static_assert( std::is_same< typename a_const_int_r1::const_type , const int * >::value , "" ); - static_assert( std::is_same< typename a_const_int_r1::const_value_type , const int >::value , "" ); - static_assert( std::is_same< typename a_const_int_r1::const_array_scalar_type , const int * >::value , "" ); - static_assert( std::is_same< typename a_const_int_r1::non_const_type , int * >::value , "" ); - static_assert( std::is_same< typename a_const_int_r1::non_const_value_type , int >::value , "" ); - - typedef ViewDataAnalysis< const int**[4] , typename ViewArrayAnalysis< const int **[4] >::non_const_value_type , void > a_const_int_r3 ; - - static_assert( std::is_same< typename a_const_int_r3::specialize , void >::value , "" ); - static_assert( std::is_same< typename a_const_int_r3::dimension , Kokkos::Experimental::Impl::ViewDimension<0,0,4> >::value , "" ); - static_assert( std::is_same< typename a_const_int_r3::type , const int**[4] >::value , "" ); - static_assert( std::is_same< typename a_const_int_r3::value_type , const int >::value , "" ); - static_assert( std::is_same< typename a_const_int_r3::array_scalar_type , const int**[4] >::value , "" ); - static_assert( std::is_same< typename a_const_int_r3::const_type , const int**[4] >::value , "" ); - static_assert( std::is_same< typename a_const_int_r3::const_value_type , const int >::value , "" ); - static_assert( std::is_same< typename a_const_int_r3::const_array_scalar_type , const int**[4] >::value , "" ); - static_assert( std::is_same< typename a_const_int_r3::non_const_type , int**[4] >::value , "" ); - static_assert( std::is_same< typename a_const_int_r3::non_const_value_type , int >::value , "" ); - static_assert( std::is_same< typename a_const_int_r3::non_const_array_scalar_type , int**[4] >::value , "" ); - - - // std::cout << "typeid(const int**[4]).name() = " << typeid(const int**[4]).name() << std::endl ; - } - - //---------------------------------------- - - { - constexpr int N = 10 ; - - typedef Kokkos::Experimental::View T ; - typedef Kokkos::Experimental::View C ; - - int data[N] ; - - T vr1(data,N); - C cr1(vr1); - - // Generate static_assert error: - // T tmp( cr1 ); - - ASSERT_EQ( vr1.span() , N ); - ASSERT_EQ( cr1.span() , N ); - ASSERT_EQ( vr1.data() , & data[0] ); - ASSERT_EQ( cr1.data() , & data[0] ); - - ASSERT_TRUE( ( std::is_same< typename T::data_type , int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::const_data_type , const int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::non_const_data_type , int* >::value ) ); - - ASSERT_TRUE( ( std::is_same< typename T::array_scalar_type , int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::const_array_scalar_type , const int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::non_const_array_scalar_type , int* >::value ) ); - - ASSERT_TRUE( ( std::is_same< typename T::value_type , int >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::const_value_type , const int >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::non_const_value_type , int >::value ) ); - - ASSERT_TRUE( ( std::is_same< typename T::memory_space , typename ExecSpace::memory_space >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::reference_type , int & >::value ) ); - - ASSERT_EQ( T::Rank , 1 ); - - ASSERT_TRUE( ( std::is_same< typename C::data_type , const int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename C::const_data_type , const int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename C::non_const_data_type , int* >::value ) ); - - ASSERT_TRUE( ( std::is_same< typename C::array_scalar_type , const int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename C::const_array_scalar_type , const int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename C::non_const_array_scalar_type , int* >::value ) ); - - ASSERT_TRUE( ( std::is_same< typename C::value_type , const int >::value ) ); - ASSERT_TRUE( ( std::is_same< typename C::const_value_type , const int >::value ) ); - ASSERT_TRUE( ( std::is_same< typename C::non_const_value_type , int >::value ) ); - - ASSERT_TRUE( ( std::is_same< typename C::memory_space , typename ExecSpace::memory_space >::value ) ); - ASSERT_TRUE( ( std::is_same< typename C::reference_type , const int & >::value ) ); - - ASSERT_EQ( C::Rank , 1 ); - - ASSERT_EQ( vr1.dimension_0() , N ); - - if ( Kokkos::Impl::VerifyExecutionCanAccessMemorySpace< typename ExecSpace::memory_space , Kokkos::HostSpace >::value ) { - for ( int i = 0 ; i < N ; ++i ) data[i] = i + 1 ; - for ( int i = 0 ; i < N ; ++i ) ASSERT_EQ( vr1[i] , i + 1 ); - for ( int i = 0 ; i < N ; ++i ) ASSERT_EQ( cr1[i] , i + 1 ); - - { - T tmp( vr1 ); - for ( int i = 0 ; i < N ; ++i ) ASSERT_EQ( tmp[i] , i + 1 ); - for ( int i = 0 ; i < N ; ++i ) vr1(i) = i + 2 ; - for ( int i = 0 ; i < N ; ++i ) ASSERT_EQ( tmp[i] , i + 2 ); - } - - for ( int i = 0 ; i < N ; ++i ) ASSERT_EQ( vr1[i] , i + 2 ); - } - } - - { - constexpr int N = 10 ; - typedef Kokkos::Experimental::View T ; - typedef Kokkos::Experimental::View C ; - - T vr1("vr1",N); - C cr1(vr1); - - ASSERT_TRUE( ( std::is_same< typename T::data_type , int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::const_data_type , const int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::non_const_data_type , int* >::value ) ); - - ASSERT_TRUE( ( std::is_same< typename T::array_scalar_type , int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::const_array_scalar_type , const int* >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::non_const_array_scalar_type , int* >::value ) ); - - ASSERT_TRUE( ( std::is_same< typename T::value_type , int >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::const_value_type , const int >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::non_const_value_type , int >::value ) ); - - ASSERT_TRUE( ( std::is_same< typename T::memory_space , typename ExecSpace::memory_space >::value ) ); - ASSERT_TRUE( ( std::is_same< typename T::reference_type , int & >::value ) ); - ASSERT_EQ( T::Rank , 1 ); - - ASSERT_EQ( vr1.dimension_0() , N ); - - if ( Kokkos::Impl::VerifyExecutionCanAccessMemorySpace< typename ExecSpace::memory_space , Kokkos::HostSpace >::value ) { - for ( int i = 0 ; i < N ; ++i ) vr1(i) = i + 1 ; - for ( int i = 0 ; i < N ; ++i ) ASSERT_EQ( vr1[i] , i + 1 ); - for ( int i = 0 ; i < N ; ++i ) ASSERT_EQ( cr1[i] , i + 1 ); - - { - T tmp( vr1 ); - for ( int i = 0 ; i < N ; ++i ) ASSERT_EQ( tmp[i] , i + 1 ); - for ( int i = 0 ; i < N ; ++i ) vr1(i) = i + 2 ; - for ( int i = 0 ; i < N ; ++i ) ASSERT_EQ( tmp[i] , i + 2 ); - } - - for ( int i = 0 ; i < N ; ++i ) ASSERT_EQ( vr1[i] , i + 2 ); - } - } - - // Testing using space instance for allocation. - // The execution space of the memory space must be available for view data initialization - - if ( std::is_same< ExecSpace , typename ExecSpace::memory_space::execution_space >::value ) { - - using namespace Kokkos::Experimental ; - - typedef typename ExecSpace::memory_space memory_space ; - typedef View V ; - - constexpr int N = 10 ; - - memory_space mem_space ; - - V v( "v" , N ); - V va( view_alloc() , N ); - V vb( view_alloc( "vb" ) , N ); - V vc( view_alloc( "vc" , AllowPadding ) , N ); - V vd( view_alloc( "vd" , WithoutInitializing ) , N ); - V ve( view_alloc( "ve" , WithoutInitializing , AllowPadding ) , N ); - V vf( view_alloc( "vf" , mem_space , WithoutInitializing , AllowPadding ) , N ); - V vg( view_alloc( mem_space , "vg" , WithoutInitializing , AllowPadding ) , N ); - V vh( view_alloc( WithoutInitializing , AllowPadding ) , N ); - V vi( view_alloc( WithoutInitializing ) , N ); - V vj( view_alloc( std::string("vj") , AllowPadding ) , N ); - V vk( view_alloc( mem_space , std::string("vk") , AllowPadding ) , N ); - } - - { - typedef Kokkos::Experimental::ViewTraits traits_t ; - typedef Kokkos::Experimental::Impl::ViewDimension<0,0,0> dims_t ; - typedef Kokkos::Experimental::Impl::ViewOffset< dims_t , Kokkos::LayoutStride > offset_t ; - - Kokkos::LayoutStride stride ; - - stride.dimension[0] = 3 ; - stride.dimension[1] = 4 ; - stride.dimension[2] = 5 ; - stride.stride[0] = 4 ; - stride.stride[1] = 1 ; - stride.stride[2] = 12 ; - - const offset_t offset( stride ); - - ASSERT_EQ( offset.dimension_0() , 3 ); - ASSERT_EQ( offset.dimension_1() , 4 ); - ASSERT_EQ( offset.dimension_2() , 5 ); - - ASSERT_EQ( offset.stride_0() , 4 ); - ASSERT_EQ( offset.stride_1() , 1 ); - ASSERT_EQ( offset.stride_2() , 12 ); - - ASSERT_EQ( offset.span() , 60 ); - ASSERT_TRUE( offset.span_is_contiguous() ); - - Kokkos::Experimental::Impl::ViewMapping< traits_t , void > v( (int*) 0 , std::false_type() , stride ); - } - - { - typedef Kokkos::Experimental::View V ; - typedef typename V::HostMirror M ; - - constexpr int N0 = 10 ; - constexpr int N1 = 11 ; - - V a("a",N0,N1); - M b = Kokkos::Experimental::create_mirror(a); - M c = Kokkos::Experimental::create_mirror_view(a); - M d ; - - for ( int i0 = 0 ; i0 < N0 ; ++i0 ) - for ( int i1 = 0 ; i1 < N1 ; ++i1 ) - b(i0,i1) = 1 + i0 + i1 * N0 ; - - Kokkos::Experimental::deep_copy( a , b ); - Kokkos::Experimental::deep_copy( c , a ); - - for ( int i0 = 0 ; i0 < N0 ; ++i0 ) - for ( int i1 = 0 ; i1 < N1 ; ++i1 ) - ASSERT_EQ( b(i0,i1) , c(i0,i1) ); - - Kokkos::Experimental::resize( b , 5 , 6 ); - Kokkos::Experimental::realloc( c , 5 , 6 ); - Kokkos::Experimental::realloc( d , 5 , 6 ); - - ASSERT_EQ( b.dimension_0() , 5 ); - ASSERT_EQ( b.dimension_1() , 6 ); - ASSERT_EQ( c.dimension_0() , 5 ); - ASSERT_EQ( c.dimension_1() , 6 ); - ASSERT_EQ( d.dimension_0() , 5 ); - ASSERT_EQ( d.dimension_1() , 6 ); - } -} - -template< class ExecSpace > -struct TestViewMappingSubview { - - constexpr static int AN = 10 ; - typedef Kokkos::Experimental::View AT ; - typedef Kokkos::Experimental::Subview< AT , true > AS ; - - constexpr static int BN0 = 10 , BN1 = 11 , BN2 = 12 ; - typedef Kokkos::Experimental::View BT ; - typedef Kokkos::Experimental::Subview< BT , true , true , true > BS ; - - constexpr static int CN0 = 10 , CN1 = 11 , CN2 = 12 ; - typedef Kokkos::Experimental::View CT ; - typedef Kokkos::Experimental::Subview< CT , true , true , true , false , false > CS ; - - constexpr static int DN0 = 10 , DN1 = 11 , DN2 = 12 ; - typedef Kokkos::Experimental::View DT ; - typedef Kokkos::Experimental::Subview< DT , false , true , true , true , false > DS ; - - - typedef Kokkos::Experimental::View DLT ; - typedef Kokkos::Experimental::Subview< DLT , true , false , false , false , false > DLS1 ; - - static_assert( DLS1::rank == 1 && std::is_same< typename DLS1::array_layout , Kokkos::LayoutLeft >::value - , "Subview layout error for rank 1 subview of left-most range of LayoutLeft" ); - - typedef Kokkos::Experimental::View DRT ; - typedef Kokkos::Experimental::Subview< DRT , false , false , false , false , true > DRS1 ; - - static_assert( DRS1::rank == 1 && std::is_same< typename DRS1::array_layout , Kokkos::LayoutRight >::value - , "Subview layout error for rank 1 subview of right-most range of LayoutRight" ); - - AT Aa ; - AS Ab ; - BT Ba ; - BS Bb ; - CT Ca ; - CS Cb ; - DT Da ; - DS Db ; - - TestViewMappingSubview() - : Aa("Aa",AN) - , Ab( Kokkos::Experimental::subview( Aa , std::pair(1,AN-1) ) ) - , Ba("Ba",BN0,BN1,BN2) - , Bb( Kokkos::Experimental::subview( Ba - , std::pair(1,BN0-1) - , std::pair(1,BN1-1) - , std::pair(1,BN2-1) - ) ) - , Ca("Ca",CN0,CN1,CN2) - , Cb( Kokkos::Experimental::subview( Ca - , std::pair(1,CN0-1) - , std::pair(1,CN1-1) - , std::pair(1,CN2-1) - , 1 - , 2 - ) ) - , Da("Da",DN0,DN1,DN2) - , Db( Kokkos::Experimental::subview( Da - , 1 - , std::pair(1,DN0-1) - , std::pair(1,DN1-1) - , std::pair(1,DN2-1) - , 2 - ) ) - { - } - - - KOKKOS_INLINE_FUNCTION - void operator()( const int , long & error_count ) const - { - for ( int i = 1 ; i < AN-1 ; ++i ) if( & Aa[i] != & Ab[i-1] ) ++error_count ; - - for ( int i2 = 1 ; i2 < BN2-1 ; ++i2 ) { - for ( int i1 = 1 ; i1 < BN1-1 ; ++i1 ) { - for ( int i0 = 1 ; i0 < BN0-1 ; ++i0 ) { - if ( & Ba(i0,i1,i2) != & Bb(i0-1,i1-1,i2-1) ) ++error_count ; - }}} - - for ( int i2 = 1 ; i2 < CN2-1 ; ++i2 ) { - for ( int i1 = 1 ; i1 < CN1-1 ; ++i1 ) { - for ( int i0 = 1 ; i0 < CN0-1 ; ++i0 ) { - if ( & Ca(i0,i1,i2,1,2) != & Cb(i0-1,i1-1,i2-1) ) ++error_count ; - }}} - - for ( int i2 = 1 ; i2 < DN2-1 ; ++i2 ) { - for ( int i1 = 1 ; i1 < DN1-1 ; ++i1 ) { - for ( int i0 = 1 ; i0 < DN0-1 ; ++i0 ) { - if ( & Da(1,i0,i1,i2,2) != & Db(i0-1,i1-1,i2-1) ) ++error_count ; - }}} - } - - static void run() - { - TestViewMappingSubview self ; - - ASSERT_EQ( self.Da.stride_1() , self.Db.stride_0() ); - ASSERT_EQ( self.Da.stride_2() , self.Db.stride_1() ); - ASSERT_EQ( self.Da.stride_3() , self.Db.stride_2() ); - - long error_count = -1 ; - Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >(0,1) , self , error_count ); - ASSERT_EQ( error_count , 0 ); - } - -}; - -template< class ExecSpace > -void test_view_mapping_subview() -{ - TestViewMappingSubview< ExecSpace >::run(); -} - -/*--------------------------------------------------------------------------*/ - -template< class ViewType > -struct TestViewMapOperator { - - static_assert( ViewType::reference_type_is_lvalue_reference - , "Test only valid for lvalue reference type" ); - - const ViewType v ; - - KOKKOS_INLINE_FUNCTION - void test_left( size_t i0 , long & error_count ) const - { - typename ViewType::value_type * const base_ptr = & v(0,0,0,0,0,0,0,0); - const size_t n1 = v.dimension_1(); - const size_t n2 = v.dimension_2(); - const size_t n3 = v.dimension_3(); - const size_t n4 = v.dimension_4(); - const size_t n5 = v.dimension_5(); - const size_t n6 = v.dimension_6(); - const size_t n7 = v.dimension_7(); - - long offset = 0 ; - - for ( size_t i7 = 0 ; i7 < n7 ; ++i7 ) - for ( size_t i6 = 0 ; i6 < n6 ; ++i6 ) - for ( size_t i5 = 0 ; i5 < n5 ; ++i5 ) - for ( size_t i4 = 0 ; i4 < n4 ; ++i4 ) - for ( size_t i3 = 0 ; i3 < n3 ; ++i3 ) - for ( size_t i2 = 0 ; i2 < n2 ; ++i2 ) - for ( size_t i1 = 0 ; i1 < n1 ; ++i1 ) - { - const long d = & v(i0,i1,i2,i3,i4,i5,i6,i7) - base_ptr ; - if ( d < offset ) ++error_count ; - offset = d ; - } - - if ( v.span() <= size_t(offset) ) ++error_count ; - } - - KOKKOS_INLINE_FUNCTION - void test_right( size_t i0 , long & error_count ) const - { - typename ViewType::value_type * const base_ptr = & v(0,0,0,0,0,0,0,0); - const size_t n1 = v.dimension_1(); - const size_t n2 = v.dimension_2(); - const size_t n3 = v.dimension_3(); - const size_t n4 = v.dimension_4(); - const size_t n5 = v.dimension_5(); - const size_t n6 = v.dimension_6(); - const size_t n7 = v.dimension_7(); - - long offset = 0 ; - - for ( size_t i1 = 0 ; i1 < n1 ; ++i1 ) - for ( size_t i2 = 0 ; i2 < n2 ; ++i2 ) - for ( size_t i3 = 0 ; i3 < n3 ; ++i3 ) - for ( size_t i4 = 0 ; i4 < n4 ; ++i4 ) - for ( size_t i5 = 0 ; i5 < n5 ; ++i5 ) - for ( size_t i6 = 0 ; i6 < n6 ; ++i6 ) - for ( size_t i7 = 0 ; i7 < n7 ; ++i7 ) - { - const long d = & v(i0,i1,i2,i3,i4,i5,i6,i7) - base_ptr ; - if ( d < offset ) ++error_count ; - offset = d ; - } - - if ( v.span() <= size_t(offset) ) ++error_count ; - } - - KOKKOS_INLINE_FUNCTION - void operator()( size_t i , long & error_count ) const - { - if ( std::is_same< typename ViewType::array_layout , Kokkos::LayoutLeft >::value ) - test_left(i,error_count); - else if ( std::is_same< typename ViewType::array_layout , Kokkos::LayoutRight >::value ) - test_right(i,error_count); - } - - constexpr static size_t N0 = 10 ; - constexpr static size_t N1 = 9 ; - constexpr static size_t N2 = 8 ; - constexpr static size_t N3 = 7 ; - constexpr static size_t N4 = 6 ; - constexpr static size_t N5 = 5 ; - constexpr static size_t N6 = 4 ; - constexpr static size_t N7 = 3 ; - - TestViewMapOperator() : v( "Test" , N0, N1, N2, N3, N4, N5, N6, N7 ) {} - - static void run() - { - TestViewMapOperator self ; - - ASSERT_EQ( self.v.dimension_0() , ( 0 < ViewType::rank ? N0 : 1 ) ); - ASSERT_EQ( self.v.dimension_1() , ( 1 < ViewType::rank ? N1 : 1 ) ); - ASSERT_EQ( self.v.dimension_2() , ( 2 < ViewType::rank ? N2 : 1 ) ); - ASSERT_EQ( self.v.dimension_3() , ( 3 < ViewType::rank ? N3 : 1 ) ); - ASSERT_EQ( self.v.dimension_4() , ( 4 < ViewType::rank ? N4 : 1 ) ); - ASSERT_EQ( self.v.dimension_5() , ( 5 < ViewType::rank ? N5 : 1 ) ); - ASSERT_EQ( self.v.dimension_6() , ( 6 < ViewType::rank ? N6 : 1 ) ); - ASSERT_EQ( self.v.dimension_7() , ( 7 < ViewType::rank ? N7 : 1 ) ); - - ASSERT_LE( self.v.dimension_0()* - self.v.dimension_1()* - self.v.dimension_2()* - self.v.dimension_3()* - self.v.dimension_4()* - self.v.dimension_5()* - self.v.dimension_6()* - self.v.dimension_7() - , self.v.span() ); - - long error_count ; - Kokkos::RangePolicy< typename ViewType::execution_space > range(0,self.v.dimension_0()); - Kokkos::parallel_reduce( range , self , error_count ); - ASSERT_EQ( 0 , error_count ); - } -}; - - -template< class ExecSpace > -void test_view_mapping_operator() -{ - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); - TestViewMapOperator< Kokkos::Experimental::View >::run(); -} - -/*--------------------------------------------------------------------------*/ - -template< class ExecSpace > -struct TestViewMappingAtomic { - typedef Kokkos::MemoryTraits< Kokkos::Atomic > mem_trait ; - - typedef Kokkos::Experimental::View< int * , ExecSpace > T ; - typedef Kokkos::Experimental::View< int * , ExecSpace , mem_trait > T_atom ; - - T x ; - T_atom x_atom ; - - constexpr static size_t N = 100000 ; - - struct TagInit {}; - struct TagUpdate {}; - struct TagVerify {}; - - KOKKOS_INLINE_FUNCTION - void operator()( const TagInit & , const int i ) const - { x(i) = i ; } - - KOKKOS_INLINE_FUNCTION - void operator()( const TagUpdate & , const int i ) const - { x_atom(i%2) += 1 ; } - - KOKKOS_INLINE_FUNCTION - void operator()( const TagVerify & , const int i , long & error_count ) const - { - if ( i < 2 ) { if ( x(i) != int(i + N / 2) ) ++error_count ; } - else { if ( x(i) != int(i) ) ++error_count ; } - } - - TestViewMappingAtomic() - : x("x",N) - , x_atom( x ) - {} - - static void run() - { - ASSERT_TRUE( T::reference_type_is_lvalue_reference ); - ASSERT_FALSE( T_atom::reference_type_is_lvalue_reference ); - - TestViewMappingAtomic self ; - Kokkos::parallel_for( Kokkos::RangePolicy< ExecSpace , TagInit >(0,N) , self ); - Kokkos::parallel_for( Kokkos::RangePolicy< ExecSpace , TagUpdate >(0,N) , self ); - long error_count = -1 ; - Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace , TagVerify >(0,N) , self , error_count ); - ASSERT_EQ( 0 , error_count ); - } -}; - - -} /* namespace Test */ - -/*--------------------------------------------------------------------------*/ - diff --git a/lib/kokkos/core/unit_test/TestViewOfClass.hpp b/lib/kokkos/core/unit_test/TestViewOfClass.hpp deleted file mode 100644 index 09abacd80d..0000000000 --- a/lib/kokkos/core/unit_test/TestViewOfClass.hpp +++ /dev/null @@ -1,126 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include -#include -#include - -/*--------------------------------------------------------------------------*/ - -namespace Test { - -namespace { -volatile int nested_view_count ; -} - -template< class Space > -class NestedView { -private: - Kokkos::View member ; - -public: - - KOKKOS_INLINE_FUNCTION - NestedView() -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - : member("member",2) - { Kokkos::atomic_increment( & nested_view_count ); } -#else - : member(){} -#endif - - ~NestedView() -#if defined( KOKKOS_ACTIVE_EXECUTION_MEMORY_SPACE_HOST ) - { Kokkos::atomic_decrement( & nested_view_count ); } -#else - {} -#endif - -}; - - -template< class Space > -void view_nested_view() -{ - ASSERT_EQ( 0 , nested_view_count ); - { - Kokkos::View< NestedView * , Space > a("a_nested_view",2); - ASSERT_EQ( 2 , nested_view_count ); - Kokkos::View< NestedView * , Space > b("b_nested_view",2); - ASSERT_EQ( 4 , nested_view_count ); - } - // ASSERT_EQ( 0 , nested_view_count ); -} - -} - -namespace Kokkos { -namespace Impl { - -template< class ExecSpace , class S > -struct ViewDefaultConstruct< ExecSpace , Test::NestedView , true > -{ - typedef Test::NestedView type ; - type * const m_ptr ; - - KOKKOS_FORCEINLINE_FUNCTION - void operator()( const typename ExecSpace::size_type& i ) const - { new(m_ptr+i) type(); } - - ViewDefaultConstruct( type * pointer , size_t capacity ) - : m_ptr( pointer ) - { - Kokkos::RangePolicy< ExecSpace > range( 0 , capacity ); - parallel_for( range , *this ); - ExecSpace::fence(); - } -}; - -} // namespace Impl -} // namespace Kokkos - -/*--------------------------------------------------------------------------*/ - diff --git a/lib/kokkos/core/unit_test/TestViewSubview.hpp b/lib/kokkos/core/unit_test/TestViewSubview.hpp deleted file mode 100644 index e0c00d3a8b..0000000000 --- a/lib/kokkos/core/unit_test/TestViewSubview.hpp +++ /dev/null @@ -1,646 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include -#include -#include - -/*--------------------------------------------------------------------------*/ - -namespace TestViewSubview { - -template -struct getView { - static - Kokkos::View get(int n, int m) { - return Kokkos::View("G",n,m); - } -}; - -template -struct getView { - static - Kokkos::View get(int n, int m) { - const int rank = 2 ; - const int order[] = { 0, 1 }; - const unsigned dim[] = { unsigned(n), unsigned(m) }; - Kokkos::LayoutStride stride = Kokkos::LayoutStride::order_dimensions( rank , order , dim ); - return Kokkos::View("G",stride); - } -}; - -template -struct fill_1D { - typedef typename Space::execution_space execution_space; - typedef typename ViewType::size_type size_type; - ViewType a; - double val; - fill_1D(ViewType a_, double val_):a(a_),val(val_) { - } - KOKKOS_INLINE_FUNCTION - void operator() (const int i) const { - a(i) = val; - } -}; - -template -struct fill_2D { - typedef typename Space::execution_space execution_space; - typedef typename ViewType::size_type size_type; - ViewType a; - double val; - fill_2D(ViewType a_, double val_):a(a_),val(val_) { - } - KOKKOS_INLINE_FUNCTION - void operator() (const int i) const{ - for(int j = 0; j < static_cast(a.dimension_1()); j++) - a(i,j) = val; - } -}; - -template -void test_auto_1d () -{ - typedef Kokkos::View mv_type; - typedef typename mv_type::size_type size_type; - const double ZERO = 0.0; - const double ONE = 1.0; - const double TWO = 2.0; - - const size_type numRows = 10; - const size_type numCols = 3; - - mv_type X = getView::get(numRows, numCols); - typename mv_type::HostMirror X_h = Kokkos::create_mirror_view (X); - - fill_2D f1(X, ONE); - Kokkos::parallel_for(X.dimension_0(),f1); - Kokkos::deep_copy (X_h, X); - for (size_type j = 0; j < numCols; ++j) { - for (size_type i = 0; i < numRows; ++i) { - ASSERT_TRUE(X_h(i,j) == ONE); - } - } - - fill_2D f2(X, 0.0); - Kokkos::parallel_for(X.dimension_0(),f2); - Kokkos::deep_copy (X_h, X); - for (size_type j = 0; j < numCols; ++j) { - for (size_type i = 0; i < numRows; ++i) { - ASSERT_TRUE(X_h(i,j) == ZERO); - } - } - - fill_2D f3(X, TWO); - Kokkos::parallel_for(X.dimension_0(),f3); - Kokkos::deep_copy (X_h, X); - for (size_type j = 0; j < numCols; ++j) { - for (size_type i = 0; i < numRows; ++i) { - ASSERT_TRUE(X_h(i,j) == TWO); - } - } - - for (size_type j = 0; j < numCols; ++j) { - auto X_j = Kokkos::subview (X, Kokkos::ALL(), j); - - fill_1D f4(X_j, ZERO); - Kokkos::parallel_for(X_j.dimension_0(),f4); - Kokkos::deep_copy (X_h, X); - for (size_type i = 0; i < numRows; ++i) { - ASSERT_TRUE(X_h(i,j) == ZERO); - } - - for (size_type jj = 0; jj < numCols; ++jj) { - auto X_jj = Kokkos::subview (X, Kokkos::ALL(), jj); - fill_1D f5(X_jj, ONE); - Kokkos::parallel_for(X_jj.dimension_0(),f5); - Kokkos::deep_copy (X_h, X); - for (size_type i = 0; i < numRows; ++i) { - ASSERT_TRUE(X_h(i,jj) == ONE); - } - } - } -} - -template -void test_1d_strided_assignment_impl(bool a, bool b, bool c, bool d, int n, int m) { - Kokkos::View l2d("l2d",n,m); - - int col = n>2?2:0; - int row = m>2?2:0; - - if(Kokkos::Impl::VerifyExecutionCanAccessMemorySpace::value) { - if(a) { - Kokkos::View l1da = Kokkos::subview(l2d,Kokkos::ALL(),row); - ASSERT_TRUE( & l1da(0) == & l2d(0,row) ); - if(n>1) - ASSERT_TRUE( & l1da(1) == & l2d(1,row) ); - } - if(b && n>13) { - Kokkos::View l1db = Kokkos::subview(l2d,std::pair(2,13),row); - ASSERT_TRUE( & l1db(0) == & l2d(2,row) ); - ASSERT_TRUE( & l1db(1) == & l2d(3,row) ); - } - if(c) { - Kokkos::View l1dc = Kokkos::subview(l2d,col,Kokkos::ALL()); - ASSERT_TRUE( & l1dc(0) == & l2d(col,0) ); - if(m>1) - ASSERT_TRUE( & l1dc(1) == & l2d(col,1) ); - } - if(d && m>13) { - Kokkos::View l1dd = Kokkos::subview(l2d,col,std::pair(2,13)); - ASSERT_TRUE( & l1dd(0) == & l2d(col,2) ); - ASSERT_TRUE( & l1dd(1) == & l2d(col,3) ); - } - } - -} - -template -void test_1d_strided_assignment() { - test_1d_strided_assignment_impl(true,true,true,true,17,3); - test_1d_strided_assignment_impl(true,true,true,true,17,3); - - test_1d_strided_assignment_impl(true,true,false,false,17,3); - test_1d_strided_assignment_impl(true,true,false,false,17,3); - test_1d_strided_assignment_impl(false,false,true,true,17,3); - test_1d_strided_assignment_impl(false,false,true,true,17,3); - - test_1d_strided_assignment_impl(true,true,false,false,17,1); - test_1d_strided_assignment_impl(true,true,true,true,1,17); - test_1d_strided_assignment_impl(true,true,true,true,1,17); - test_1d_strided_assignment_impl(true,true,false,false,17,1); - - test_1d_strided_assignment_impl(true,true,true,true,17,1); - test_1d_strided_assignment_impl(false,false,true,true,1,17); - test_1d_strided_assignment_impl(false,false,true,true,1,17); - test_1d_strided_assignment_impl(true,true,true,true,17,1); -} - -template< class Space > -void test_left_0() -{ - typedef Kokkos::View< int [2][3][4][5][2][3][4][5] , Kokkos::LayoutLeft , Space > - view_static_8_type ; - - if(Kokkos::Impl::VerifyExecutionCanAccessMemorySpace::value) { - - view_static_8_type x_static_8("x_static_left_8"); - - ASSERT_TRUE( x_static_8.is_contiguous() ); - - Kokkos::View x0 = Kokkos::subview( x_static_8 , 0, 0, 0, 0, 0, 0, 0, 0 ); - - ASSERT_TRUE( x0.is_contiguous() ); - ASSERT_TRUE( & x0() == & x_static_8(0,0,0,0,0,0,0,0) ); - - Kokkos::View x1 = - Kokkos::subview( x_static_8, Kokkos::pair(0,2), 1, 2, 3, 0, 1, 2, 3 ); - - ASSERT_TRUE( x1.is_contiguous() ); - ASSERT_TRUE( & x1(0) == & x_static_8(0,1,2,3,0,1,2,3) ); - ASSERT_TRUE( & x1(1) == & x_static_8(1,1,2,3,0,1,2,3) ); - - Kokkos::View x2 = - Kokkos::subview( x_static_8, Kokkos::pair(0,2), 1, 2, 3 - , Kokkos::pair(0,2), 1, 2, 3 ); - - ASSERT_TRUE( ! x2.is_contiguous() ); - ASSERT_TRUE( & x2(0,0) == & x_static_8(0,1,2,3,0,1,2,3) ); - ASSERT_TRUE( & x2(1,0) == & x_static_8(1,1,2,3,0,1,2,3) ); - ASSERT_TRUE( & x2(0,1) == & x_static_8(0,1,2,3,1,1,2,3) ); - ASSERT_TRUE( & x2(1,1) == & x_static_8(1,1,2,3,1,1,2,3) ); - - // Kokkos::View error_2 = - Kokkos::View sx2 = - Kokkos::subview( x_static_8, 1, Kokkos::pair(0,2), 2, 3 - , Kokkos::pair(0,2), 1, 2, 3 ); - - ASSERT_TRUE( ! sx2.is_contiguous() ); - ASSERT_TRUE( & sx2(0,0) == & x_static_8(1,0,2,3,0,1,2,3) ); - ASSERT_TRUE( & sx2(1,0) == & x_static_8(1,1,2,3,0,1,2,3) ); - ASSERT_TRUE( & sx2(0,1) == & x_static_8(1,0,2,3,1,1,2,3) ); - ASSERT_TRUE( & sx2(1,1) == & x_static_8(1,1,2,3,1,1,2,3) ); - - Kokkos::View sx4 = - Kokkos::subview( x_static_8, 0, Kokkos::pair(0,2) /* of [3] */ - , 1, Kokkos::pair(1,3) /* of [5] */ - , 1, Kokkos::pair(0,2) /* of [3] */ - , 2, Kokkos::pair(2,4) /* of [5] */ - ); - - ASSERT_TRUE( ! sx4.is_contiguous() ); - - for ( int i0 = 0 ; i0 < (int) sx4.dimension_0() ; ++i0 ) - for ( int i1 = 0 ; i1 < (int) sx4.dimension_1() ; ++i1 ) - for ( int i2 = 0 ; i2 < (int) sx4.dimension_2() ; ++i2 ) - for ( int i3 = 0 ; i3 < (int) sx4.dimension_3() ; ++i3 ) { - ASSERT_TRUE( & sx4(i0,i1,i2,i3) == & x_static_8(0,0+i0, 1,1+i1, 1,0+i2, 2,2+i3) ); - } - - } -} - -template< class Space > -void test_left_1() -{ - typedef Kokkos::View< int ****[2][3][4][5] , Kokkos::LayoutLeft , Space > - view_type ; - - if(Kokkos::Impl::VerifyExecutionCanAccessMemorySpace::value) { - - view_type x8("x_left_8",2,3,4,5); - - ASSERT_TRUE( x8.is_contiguous() ); - - Kokkos::View x0 = Kokkos::subview( x8 , 0, 0, 0, 0, 0, 0, 0, 0 ); - - ASSERT_TRUE( x0.is_contiguous() ); - ASSERT_TRUE( & x0() == & x8(0,0,0,0,0,0,0,0) ); - - Kokkos::View x1 = - Kokkos::subview( x8, Kokkos::pair(0,2), 1, 2, 3, 0, 1, 2, 3 ); - - ASSERT_TRUE( x1.is_contiguous() ); - ASSERT_TRUE( & x1(0) == & x8(0,1,2,3,0,1,2,3) ); - ASSERT_TRUE( & x1(1) == & x8(1,1,2,3,0,1,2,3) ); - - Kokkos::View x2 = - Kokkos::subview( x8, Kokkos::pair(0,2), 1, 2, 3 - , Kokkos::pair(0,2), 1, 2, 3 ); - - ASSERT_TRUE( ! x2.is_contiguous() ); - ASSERT_TRUE( & x2(0,0) == & x8(0,1,2,3,0,1,2,3) ); - ASSERT_TRUE( & x2(1,0) == & x8(1,1,2,3,0,1,2,3) ); - ASSERT_TRUE( & x2(0,1) == & x8(0,1,2,3,1,1,2,3) ); - ASSERT_TRUE( & x2(1,1) == & x8(1,1,2,3,1,1,2,3) ); - - // Kokkos::View error_2 = - Kokkos::View sx2 = - Kokkos::subview( x8, 1, Kokkos::pair(0,2), 2, 3 - , Kokkos::pair(0,2), 1, 2, 3 ); - - ASSERT_TRUE( ! sx2.is_contiguous() ); - ASSERT_TRUE( & sx2(0,0) == & x8(1,0,2,3,0,1,2,3) ); - ASSERT_TRUE( & sx2(1,0) == & x8(1,1,2,3,0,1,2,3) ); - ASSERT_TRUE( & sx2(0,1) == & x8(1,0,2,3,1,1,2,3) ); - ASSERT_TRUE( & sx2(1,1) == & x8(1,1,2,3,1,1,2,3) ); - - Kokkos::View sx4 = - Kokkos::subview( x8, 0, Kokkos::pair(0,2) /* of [3] */ - , 1, Kokkos::pair(1,3) /* of [5] */ - , 1, Kokkos::pair(0,2) /* of [3] */ - , 2, Kokkos::pair(2,4) /* of [5] */ - ); - - ASSERT_TRUE( ! sx4.is_contiguous() ); - - for ( int i0 = 0 ; i0 < (int) sx4.dimension_0() ; ++i0 ) - for ( int i1 = 0 ; i1 < (int) sx4.dimension_1() ; ++i1 ) - for ( int i2 = 0 ; i2 < (int) sx4.dimension_2() ; ++i2 ) - for ( int i3 = 0 ; i3 < (int) sx4.dimension_3() ; ++i3 ) { - ASSERT_TRUE( & sx4(i0,i1,i2,i3) == & x8(0,0+i0, 1,1+i1, 1,0+i2, 2,2+i3) ); - } - - } -} - -template< class Space > -void test_left_2() -{ - typedef Kokkos::View< int **** , Kokkos::LayoutLeft , Space > view_type ; - - if(Kokkos::Impl::VerifyExecutionCanAccessMemorySpace::value) { - - view_type x4("x4",2,3,4,5); - - ASSERT_TRUE( x4.is_contiguous() ); - - Kokkos::View x0 = Kokkos::subview( x4 , 0, 0, 0, 0 ); - - ASSERT_TRUE( x0.is_contiguous() ); - ASSERT_TRUE( & x0() == & x4(0,0,0,0) ); - - Kokkos::View x1 = - Kokkos::subview( x4, Kokkos::pair(0,2), 1, 2, 3 ); - - ASSERT_TRUE( x1.is_contiguous() ); - ASSERT_TRUE( & x1(0) == & x4(0,1,2,3) ); - ASSERT_TRUE( & x1(1) == & x4(1,1,2,3) ); - - Kokkos::View x2 = - Kokkos::subview( x4, Kokkos::pair(0,2), 1, Kokkos::pair(1,3), 2 ); - - ASSERT_TRUE( ! x2.is_contiguous() ); - ASSERT_TRUE( & x2(0,0) == & x4(0,1,1,2) ); - ASSERT_TRUE( & x2(1,0) == & x4(1,1,1,2) ); - ASSERT_TRUE( & x2(0,1) == & x4(0,1,2,2) ); - ASSERT_TRUE( & x2(1,1) == & x4(1,1,2,2) ); - - // Kokkos::View error_2 = - Kokkos::View sx2 = - Kokkos::subview( x4, 1, Kokkos::pair(0,2) - , 2, Kokkos::pair(1,4) ); - - ASSERT_TRUE( ! sx2.is_contiguous() ); - ASSERT_TRUE( & sx2(0,0) == & x4(1,0,2,1) ); - ASSERT_TRUE( & sx2(1,0) == & x4(1,1,2,1) ); - ASSERT_TRUE( & sx2(0,1) == & x4(1,0,2,2) ); - ASSERT_TRUE( & sx2(1,1) == & x4(1,1,2,2) ); - ASSERT_TRUE( & sx2(0,2) == & x4(1,0,2,3) ); - ASSERT_TRUE( & sx2(1,2) == & x4(1,1,2,3) ); - - Kokkos::View sx4 = - Kokkos::subview( x4, Kokkos::pair(1,2) /* of [2] */ - , Kokkos::pair(1,3) /* of [3] */ - , Kokkos::pair(0,4) /* of [4] */ - , Kokkos::pair(2,4) /* of [5] */ - ); - - ASSERT_TRUE( ! sx4.is_contiguous() ); - - for ( int i0 = 0 ; i0 < (int) sx4.dimension_0() ; ++i0 ) - for ( int i1 = 0 ; i1 < (int) sx4.dimension_1() ; ++i1 ) - for ( int i2 = 0 ; i2 < (int) sx4.dimension_2() ; ++i2 ) - for ( int i3 = 0 ; i3 < (int) sx4.dimension_3() ; ++i3 ) { - ASSERT_TRUE( & sx4(i0,i1,i2,i3) == & x4( 1+i0, 1+i1, 0+i2, 2+i3 ) ); - } - - } -} - -template< class Space > -void test_left_3() -{ - typedef Kokkos::View< int ** , Kokkos::LayoutLeft , Space > view_type ; - - if(Kokkos::Impl::VerifyExecutionCanAccessMemorySpace::value) { - - view_type xm("x4",10,5); - - ASSERT_TRUE( xm.is_contiguous() ); - - Kokkos::View x0 = Kokkos::subview( xm , 5, 3 ); - - ASSERT_TRUE( x0.is_contiguous() ); - ASSERT_TRUE( & x0() == & xm(5,3) ); - - Kokkos::View x1 = - Kokkos::subview( xm, Kokkos::ALL(), 3 ); - - ASSERT_TRUE( x1.is_contiguous() ); - for ( int i = 0 ; i < int(xm.dimension_0()) ; ++i ) { - ASSERT_TRUE( & x1(i) == & xm(i,3) ); - } - - Kokkos::View x2 = - Kokkos::subview( xm, Kokkos::pair(1,9), Kokkos::ALL() ); - - ASSERT_TRUE( ! x2.is_contiguous() ); - for ( int j = 0 ; j < int(x2.dimension_1()) ; ++j ) - for ( int i = 0 ; i < int(x2.dimension_0()) ; ++i ) { - ASSERT_TRUE( & x2(i,j) == & xm(1+i,j) ); - } - - Kokkos::View x2c = - Kokkos::subview( xm, Kokkos::ALL(), std::pair(2,4) ); - - ASSERT_TRUE( x2c.is_contiguous() ); - for ( int j = 0 ; j < int(x2c.dimension_1()) ; ++j ) - for ( int i = 0 ; i < int(x2c.dimension_0()) ; ++i ) { - ASSERT_TRUE( & x2c(i,j) == & xm(i,2+j) ); - } - - Kokkos::View x2_n1 = - Kokkos::subview( xm , std::pair(1,1) , Kokkos::ALL() ); - - ASSERT_TRUE( x2_n1.dimension_0() == 0 ); - ASSERT_TRUE( x2_n1.dimension_1() == xm.dimension_1() ); - - Kokkos::View x2_n2 = - Kokkos::subview( xm , Kokkos::ALL() , std::pair(1,1) ); - - ASSERT_TRUE( x2_n2.dimension_0() == xm.dimension_0() ); - ASSERT_TRUE( x2_n2.dimension_1() == 0 ); - - } -} - -//---------------------------------------------------------------------------- - -template< class Space > -void test_right_0() -{ - typedef Kokkos::View< int [2][3][4][5][2][3][4][5] , Kokkos::LayoutRight , Space > - view_static_8_type ; - - if(Kokkos::Impl::VerifyExecutionCanAccessMemorySpace::value) { - - view_static_8_type x_static_8("x_static_right_8"); - - Kokkos::View x0 = Kokkos::subview( x_static_8 , 0, 0, 0, 0, 0, 0, 0, 0 ); - - ASSERT_TRUE( & x0() == & x_static_8(0,0,0,0,0,0,0,0) ); - - Kokkos::View x1 = - Kokkos::subview( x_static_8, 0, 1, 2, 3, 0, 1, 2, Kokkos::pair(1,3) ); - - ASSERT_TRUE( & x1(0) == & x_static_8(0,1,2,3,0,1,2,1) ); - ASSERT_TRUE( & x1(1) == & x_static_8(0,1,2,3,0,1,2,2) ); - - Kokkos::View x2 = - Kokkos::subview( x_static_8, 0, 1, 2, Kokkos::pair(1,3) - , 0, 1, 2, Kokkos::pair(1,3) ); - - ASSERT_TRUE( & x2(0,0) == & x_static_8(0,1,2,1,0,1,2,1) ); - ASSERT_TRUE( & x2(1,0) == & x_static_8(0,1,2,2,0,1,2,1) ); - ASSERT_TRUE( & x2(0,1) == & x_static_8(0,1,2,1,0,1,2,2) ); - ASSERT_TRUE( & x2(1,1) == & x_static_8(0,1,2,2,0,1,2,2) ); - - // Kokkos::View error_2 = - Kokkos::View sx2 = - Kokkos::subview( x_static_8, 1, Kokkos::pair(0,2), 2, 3 - , Kokkos::pair(0,2), 1, 2, 3 ); - - ASSERT_TRUE( & sx2(0,0) == & x_static_8(1,0,2,3,0,1,2,3) ); - ASSERT_TRUE( & sx2(1,0) == & x_static_8(1,1,2,3,0,1,2,3) ); - ASSERT_TRUE( & sx2(0,1) == & x_static_8(1,0,2,3,1,1,2,3) ); - ASSERT_TRUE( & sx2(1,1) == & x_static_8(1,1,2,3,1,1,2,3) ); - - Kokkos::View sx4 = - Kokkos::subview( x_static_8, 0, Kokkos::pair(0,2) /* of [3] */ - , 1, Kokkos::pair(1,3) /* of [5] */ - , 1, Kokkos::pair(0,2) /* of [3] */ - , 2, Kokkos::pair(2,4) /* of [5] */ - ); - - for ( int i0 = 0 ; i0 < (int) sx4.dimension_0() ; ++i0 ) - for ( int i1 = 0 ; i1 < (int) sx4.dimension_1() ; ++i1 ) - for ( int i2 = 0 ; i2 < (int) sx4.dimension_2() ; ++i2 ) - for ( int i3 = 0 ; i3 < (int) sx4.dimension_3() ; ++i3 ) { - ASSERT_TRUE( & sx4(i0,i1,i2,i3) == & x_static_8(0, 0+i0, 1, 1+i1, 1, 0+i2, 2, 2+i3) ); - } - - } -} - -template< class Space > -void test_right_1() -{ - typedef Kokkos::View< int ****[2][3][4][5] , Kokkos::LayoutRight , Space > - view_type ; - - if(Kokkos::Impl::VerifyExecutionCanAccessMemorySpace::value) { - - view_type x8("x_right_8",2,3,4,5); - - Kokkos::View x0 = Kokkos::subview( x8 , 0, 0, 0, 0, 0, 0, 0, 0 ); - - ASSERT_TRUE( & x0() == & x8(0,0,0,0,0,0,0,0) ); - - Kokkos::View x1 = - Kokkos::subview( x8, 0, 1, 2, 3, 0, 1, 2, Kokkos::pair(1,3) ); - - ASSERT_TRUE( & x1(0) == & x8(0,1,2,3,0,1,2,1) ); - ASSERT_TRUE( & x1(1) == & x8(0,1,2,3,0,1,2,2) ); - - Kokkos::View x2 = - Kokkos::subview( x8, 0, 1, 2, Kokkos::pair(1,3) - , 0, 1, 2, Kokkos::pair(1,3) ); - - ASSERT_TRUE( & x2(0,0) == & x8(0,1,2,1,0,1,2,1) ); - ASSERT_TRUE( & x2(1,0) == & x8(0,1,2,2,0,1,2,1) ); - ASSERT_TRUE( & x2(0,1) == & x8(0,1,2,1,0,1,2,2) ); - ASSERT_TRUE( & x2(1,1) == & x8(0,1,2,2,0,1,2,2) ); - - // Kokkos::View error_2 = - Kokkos::View sx2 = - Kokkos::subview( x8, 1, Kokkos::pair(0,2), 2, 3 - , Kokkos::pair(0,2), 1, 2, 3 ); - - ASSERT_TRUE( & sx2(0,0) == & x8(1,0,2,3,0,1,2,3) ); - ASSERT_TRUE( & sx2(1,0) == & x8(1,1,2,3,0,1,2,3) ); - ASSERT_TRUE( & sx2(0,1) == & x8(1,0,2,3,1,1,2,3) ); - ASSERT_TRUE( & sx2(1,1) == & x8(1,1,2,3,1,1,2,3) ); - - Kokkos::View sx4 = - Kokkos::subview( x8, 0, Kokkos::pair(0,2) /* of [3] */ - , 1, Kokkos::pair(1,3) /* of [5] */ - , 1, Kokkos::pair(0,2) /* of [3] */ - , 2, Kokkos::pair(2,4) /* of [5] */ - ); - - for ( int i0 = 0 ; i0 < (int) sx4.dimension_0() ; ++i0 ) - for ( int i1 = 0 ; i1 < (int) sx4.dimension_1() ; ++i1 ) - for ( int i2 = 0 ; i2 < (int) sx4.dimension_2() ; ++i2 ) - for ( int i3 = 0 ; i3 < (int) sx4.dimension_3() ; ++i3 ) { - ASSERT_TRUE( & sx4(i0,i1,i2,i3) == & x8(0,0+i0, 1,1+i1, 1,0+i2, 2,2+i3) ); - } - - } -} - -template< class Space > -void test_right_3() -{ - typedef Kokkos::View< int ** , Kokkos::LayoutRight , Space > view_type ; - - if(Kokkos::Impl::VerifyExecutionCanAccessMemorySpace::value) { - - view_type xm("x4",10,5); - - ASSERT_TRUE( xm.is_contiguous() ); - - Kokkos::View x0 = Kokkos::subview( xm , 5, 3 ); - - ASSERT_TRUE( x0.is_contiguous() ); - ASSERT_TRUE( & x0() == & xm(5,3) ); - - Kokkos::View x1 = - Kokkos::subview( xm, 3, Kokkos::ALL() ); - - ASSERT_TRUE( x1.is_contiguous() ); - for ( int i = 0 ; i < int(xm.dimension_1()) ; ++i ) { - ASSERT_TRUE( & x1(i) == & xm(3,i) ); - } - - Kokkos::View x2c = - Kokkos::subview( xm, Kokkos::pair(1,9), Kokkos::ALL() ); - - ASSERT_TRUE( x2c.is_contiguous() ); - for ( int j = 0 ; j < int(x2c.dimension_1()) ; ++j ) - for ( int i = 0 ; i < int(x2c.dimension_0()) ; ++i ) { - ASSERT_TRUE( & x2c(i,j) == & xm(1+i,j) ); - } - - Kokkos::View x2 = - Kokkos::subview( xm, Kokkos::ALL(), std::pair(2,4) ); - - ASSERT_TRUE( ! x2.is_contiguous() ); - for ( int j = 0 ; j < int(x2.dimension_1()) ; ++j ) - for ( int i = 0 ; i < int(x2.dimension_0()) ; ++i ) { - ASSERT_TRUE( & x2(i,j) == & xm(i,2+j) ); - } - - Kokkos::View x2_n1 = - Kokkos::subview( xm , std::pair(1,1) , Kokkos::ALL() ); - - ASSERT_TRUE( x2_n1.dimension_0() == 0 ); - ASSERT_TRUE( x2_n1.dimension_1() == xm.dimension_1() ); - - Kokkos::View x2_n2 = - Kokkos::subview( xm , Kokkos::ALL() , std::pair(1,1) ); - - ASSERT_TRUE( x2_n2.dimension_0() == xm.dimension_0() ); - ASSERT_TRUE( x2_n2.dimension_1() == 0 ); - - } -} - -//---------------------------------------------------------------------------- - -} - diff --git a/lib/kokkos/core/unit_test/UnitTestMain.cpp b/lib/kokkos/core/unit_test/UnitTestMain.cpp deleted file mode 100644 index f952ab3db5..0000000000 --- a/lib/kokkos/core/unit_test/UnitTestMain.cpp +++ /dev/null @@ -1,50 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -int main(int argc, char *argv[]) { - ::testing::InitGoogleTest(&argc,argv); - return RUN_ALL_TESTS(); -} - diff --git a/lib/kokkos/example/README b/lib/kokkos/example/README deleted file mode 100644 index ec64004842..0000000000 --- a/lib/kokkos/example/README +++ /dev/null @@ -1,16 +0,0 @@ -This directory contains example application proxies that use different -parts of Kokkos. If you are looking for the FENL ("finite element -nonlinear" solve) example, it has moved into the LinAlg subpackage of -Tpetra. - -MANIFEST: - - - common: Header files used by different examples - - feint: Unstructured finite-element method - - fixture: Some other finite-element method example - - global_2_local_ids: Example of global-to-local index lookup - - grow_array: Parallel dynamic memory allocation - - md_skeleton: Molecular dynamics - - query_device: Kokkos' HWLOC wrapper for querying device topology - - sort_array: Parallel sort - - tutorial: Kokkos tutorial (START HERE) diff --git a/lib/kokkos/example/common/VectorImport.hpp b/lib/kokkos/example/common/VectorImport.hpp deleted file mode 100644 index 8ecd74d463..0000000000 --- a/lib/kokkos/example/common/VectorImport.hpp +++ /dev/null @@ -1,294 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_VECTORIMPORT_HPP -#define KOKKOS_VECTORIMPORT_HPP - -#include -#include -#include -#include -#include - -#include - -#include - -namespace Kokkos { -namespace Example { - -template< class CommMessageType , class CommIdentType , class VectorType > -struct VectorImport ; - -} // namespace Example -} // namespace Kokkos - -#if ! defined( KOKKOS_HAVE_MPI ) - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { - -template< class CommMessageType , class CommIdentType , class VectorType > -struct VectorImport { - - const MPI_Comm comm ; - const unsigned count_owned ; - const unsigned count_receive ; - - VectorImport( MPI_Comm arg_comm , - const CommMessageType & , - const CommMessageType & , - const CommIdentType & , - const unsigned arg_count_owned , - const unsigned arg_count_receive ) - : comm( arg_comm ) - , count_owned( arg_count_owned ) - , count_receive( arg_count_receive ) - {} - - inline - void operator()( const VectorType & ) const {} -}; - - -} // namespace Example -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#else /* defined( KOKKOS_HAVE_MPI ) */ - -namespace Kokkos { -namespace Example { - -template< class CommMessageType , class CommIdentType , class VectorType > -class VectorImport { -private: - - // rank == 1 or array_layout == LayoutRight - enum { OK = Kokkos::Impl::StaticAssert< - ( VectorType::rank == 1 ) || - Kokkos::Impl::is_same< typename VectorType::array_layout , Kokkos::LayoutRight >::value - >::value }; - - typedef typename VectorType::HostMirror HostVectorType ; - - enum { ReceiveInPlace = - Kokkos::Impl::is_same< typename VectorType::memory_space , - typename HostVectorType::memory_space >::value }; - - const CommMessageType recv_msg ; - const CommMessageType send_msg ; - const CommIdentType send_nodeid ; - VectorType send_buffer ; - HostVectorType host_send_buffer ; - HostVectorType host_recv_buffer ; - unsigned chunk ; - -public: - - const MPI_Comm comm ; - const unsigned count_owned ; - const unsigned count_receive ; - - struct Pack { - typedef typename VectorType::execution_space execution_space ; - const CommIdentType index ; - const VectorType source ; - const VectorType buffer ; - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned i ) const - { buffer( i ) = source( index(i) ); } - - Pack( const CommIdentType & arg_index , - const VectorType & arg_source , - const VectorType & arg_buffer ) - : index( arg_index ) - , source( arg_source ) - , buffer( arg_buffer ) - { - Kokkos::parallel_for( index.dimension_0() , *this ); - execution_space::fence(); - } - }; - - VectorImport( MPI_Comm arg_comm , - const CommMessageType & arg_recv_msg , - const CommMessageType & arg_send_msg , - const CommIdentType & arg_send_nodeid , - const unsigned arg_count_owned , - const unsigned arg_count_receive ) - : recv_msg( arg_recv_msg ) - , send_msg( arg_send_msg ) - , send_nodeid( arg_send_nodeid ) - , send_buffer() - , host_send_buffer() - , host_recv_buffer() - , comm( arg_comm ) - , count_owned( arg_count_owned ) - , count_receive( arg_count_receive ) - { - if ( ! ReceiveInPlace ) { - host_recv_buffer = HostVectorType("recv_buffer",count_receive); - } - - unsigned send_count = 0 ; - for ( unsigned i = 0 ; i < send_msg.dimension_0() ; ++i ) { send_count += send_msg(i,1); } - send_buffer = VectorType("send_buffer",send_count); - host_send_buffer = Kokkos::create_mirror_view( send_buffer ); - } - - inline - void operator()( const VectorType & v ) const - { - typedef typename VectorType::value_type scalar_type ; - - const int mpi_tag = 42 ; - const unsigned chunk = v.dimension_1(); - - // Subvector for receives - const std::pair recv_range( count_owned , count_owned + count_receive ); - const VectorType recv_vector = Kokkos::subview( v , recv_range ); - - std::vector< MPI_Request > recv_request( recv_msg.dimension_0() , MPI_REQUEST_NULL ); - - { // Post receives - scalar_type * ptr = - ReceiveInPlace ? recv_vector.ptr_on_device() : host_recv_buffer.ptr_on_device(); - - for ( size_t i = 0 ; i < recv_msg.dimension_0() ; ++i ) { - const int proc = recv_msg(i,0); - const int count = recv_msg(i,1) * chunk ; - - MPI_Irecv( ptr , count * sizeof(scalar_type) , MPI_BYTE , - proc , mpi_tag , comm , & recv_request[i] ); - - ptr += count ; - } - } - - MPI_Barrier( comm ); - - { // Pack and send - const Pack pack( send_nodeid , v , send_buffer ); - - Kokkos::deep_copy( host_send_buffer , send_buffer ); - - scalar_type * ptr = host_send_buffer.ptr_on_device(); - - for ( size_t i = 0 ; i < send_msg.dimension_0() ; ++i ) { - const int proc = send_msg(i,0); - const int count = send_msg(i,1) * chunk ; - - // MPI_Ssend blocks until - // (1) a receive is matched for the message and - // (2) the send buffer can be re-used. - // - // It is suggested that MPI_Ssend will have the best performance: - // http://www.mcs.anl.gov/research/projects/mpi/sendmode.html . - - MPI_Ssend( ptr , - count * sizeof(scalar_type) , MPI_BYTE , - proc , mpi_tag , comm ); - - ptr += count ; - } - } - - // Wait for receives and verify: - - for ( size_t i = 0 ; i < recv_msg.dimension_0() ; ++i ) { - MPI_Status recv_status ; - int recv_which = 0 ; - int recv_size = 0 ; - - MPI_Waitany( recv_msg.dimension_0() , & recv_request[0] , & recv_which , & recv_status ); - - const int recv_proc = recv_status.MPI_SOURCE ; - - MPI_Get_count( & recv_status , MPI_BYTE , & recv_size ); - - // Verify message properly received: - - const int expected_proc = recv_msg(recv_which,0); - const int expected_size = recv_msg(recv_which,1) * chunk * sizeof(scalar_type); - - if ( ( expected_proc != recv_proc ) || - ( expected_size != recv_size ) ) { - - int local_rank = 0 ; - - MPI_Comm_rank( comm , & local_rank ); - - std::ostringstream msg ; - msg << "VectorImport error:" - << " P" << local_rank - << " received from P" << recv_proc - << " size " << recv_size - << " expected " << expected_size - << " from P" << expected_proc ; - throw std::runtime_error( msg.str() ); - } - } - - // Copy received data to device memory. - - if ( ! ReceiveInPlace ) { Kokkos::deep_copy( recv_vector , host_recv_buffer ); } - } -}; - -} // namespace Example -} // namespace Kokkos - -#endif - -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_VECTORIMPORT_HPP */ - - diff --git a/lib/kokkos/example/common/WrapMPI.hpp b/lib/kokkos/example/common/WrapMPI.hpp deleted file mode 100644 index c75e4bc5c7..0000000000 --- a/lib/kokkos/example/common/WrapMPI.hpp +++ /dev/null @@ -1,103 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXAMPLE_WRAP_MPI -#define KOKKOS_EXAMPLE_WRAP_MPI - -#include -#include - -#if defined( KOKKOS_HAVE_MPI ) - -#include - -namespace Kokkos { -namespace Example { - -inline -double all_reduce( double value , MPI_Comm comm ) -{ - double local = value ; - MPI_Allreduce( & local , & value , 1 , MPI_DOUBLE , MPI_SUM , comm ); - return value ; -} - -inline -double all_reduce_max( double value , MPI_Comm comm ) -{ - double local = value ; - MPI_Allreduce( & local , & value , 1 , MPI_DOUBLE , MPI_MAX , comm ); - return value ; -} - -} // namespace Example -} // namespace Kokkos - -#elif ! defined( KOKKOS_HAVE_MPI ) - -/* Wrap the the MPI_Comm type and heavily used MPI functions - * to reduce the number of '#if defined( KOKKOS_HAVE_MPI )' - * blocks which have to be sprinkled throughout the examples. - */ - -typedef int MPI_Comm ; - -inline int MPI_Comm_size( MPI_Comm , int * size ) { *size = 1 ; return 0 ; } -inline int MPI_Comm_rank( MPI_Comm , int * rank ) { *rank = 0 ; return 0 ; } -inline int MPI_Barrier( MPI_Comm ) { return 0; } - -namespace Kokkos { -namespace Example { - -inline -double all_reduce( double value , MPI_Comm ) { return value ; } - -inline -double all_reduce_max( double value , MPI_Comm ) { return value ; } - -} // namespace Example -} // namespace Kokkos - -#endif /* ! defined( KOKKOS_HAVE_MPI ) */ -#endif /* #ifndef KOKKOS_EXAMPLE_WRAP_MPI */ - diff --git a/lib/kokkos/example/feint/ElemFunctor.hpp b/lib/kokkos/example/feint/ElemFunctor.hpp deleted file mode 100644 index c935aab164..0000000000 --- a/lib/kokkos/example/feint/ElemFunctor.hpp +++ /dev/null @@ -1,489 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXAMPLE_FEINT_FUNCTORS_HPP -#define KOKKOS_EXAMPLE_FEINT_FUNCTORS_HPP - -#include -#include -#include - -namespace Kokkos { -namespace Example { - -/** \brief Numerically integrate a function on a finite element mesh and - * project the integrated values to nodes. - */ -template< class FixtureType , - class FunctionType , - bool PerformScatterAddWithAtomic > -struct FiniteElementIntegration ; - -// Specialized for an 'Example::BoxElemFixture' finite element mesh -template< class Device , BoxElemPart::ElemOrder ElemOrder , class GridMap , - class FunctionType , - bool PerformScatterAddWithAtomic > -struct FiniteElementIntegration< - Kokkos::Example::BoxElemFixture< Device , ElemOrder , GridMap > , - FunctionType , - PerformScatterAddWithAtomic > -{ - // Element mesh types: - typedef Kokkos::Example::BoxElemFixture< Device , ElemOrder > - BoxFixtureType ; - - typedef Kokkos::Example::HexElement_Data< BoxFixtureType::ElemNode > - HexElemDataType ; - - enum { ElemNodeCount = HexElemDataType::element_node_count }; - enum { IntegrationCount = HexElemDataType::integration_count }; - enum { ValueCount = FunctionType::value_count }; - - // Dictionary of view types: - typedef View ElemErrorType ; - typedef View ElemValueType ; - typedef View NodeValueType ; - - // Data members for this Functor: - const HexElemDataType m_hex_elem_data ; ///< Master element - const BoxFixtureType m_box_fixture ; ///< Unstructured mesh data - const FunctionType m_function ; ///< Function to integrate - const ElemErrorType m_elem_error ; ///< Flags for element errors - const ElemValueType m_elem_integral ; ///< Per-element quantities - const NodeValueType m_node_lumped ; ///< Quantities lumped to nodes - - //---------------------------------------- - - FiniteElementIntegration( - const BoxFixtureType & box_fixture , - const FunctionType & function ) - : m_hex_elem_data() - , m_box_fixture( box_fixture ) // Shallow copy of the mesh fixture - , m_function( function ) - , m_elem_error( "elem_error" , box_fixture.elem_count() ) - , m_elem_integral( "elem_integral" , box_fixture.elem_count() ) - , m_node_lumped( "node_lumped" , box_fixture.node_count() ) - {} - - //---------------------------------------- - // Device for parallel dispatch. - typedef typename Device::execution_space execution_space; - - // Value type for global parallel reduction. - struct value_type { - double value[ ValueCount ]; ///< Integrated quantitie - int error ; ///< Element inversion flag - }; - - //---------------------------------------- - // Transform element interpolation function gradients and - // compute determinant of spatial jacobian. - KOKKOS_INLINE_FUNCTION - float transform_gradients( - const float grad[][ ElemNodeCount ] , // Gradient of bases master element - const double coord[][ ElemNodeCount ] , - float dpsi[][ ElemNodeCount ] ) const - { - enum { TensorDim = 9 }; - enum { j11 = 0 , j12 = 1 , j13 = 2 , - j21 = 3 , j22 = 4 , j23 = 5 , - j31 = 6 , j32 = 7 , j33 = 8 }; - - // Temporary for jacobian accumulation is double for summation accuracy. - double J[ TensorDim ] = { 0, 0, 0, 0, 0, 0, 0, 0, 0 }; - - for( int i = 0; i < ElemNodeCount ; ++i ) { - J[j11] += grad[0][i] * coord[0][i] ; - J[j12] += grad[0][i] * coord[1][i] ; - J[j13] += grad[0][i] * coord[2][i] ; - - J[j21] += grad[1][i] * coord[0][i] ; - J[j22] += grad[1][i] * coord[1][i] ; - J[j23] += grad[1][i] * coord[2][i] ; - - J[j31] += grad[2][i] * coord[0][i] ; - J[j32] += grad[2][i] * coord[1][i] ; - J[j33] += grad[2][i] * coord[2][i] ; - } - - // Inverse jacobian, compute as double and store as float. - float invJ[ TensorDim ] = { - float( J[j22] * J[j33] - J[j23] * J[j32] ) , - float( J[j13] * J[j32] - J[j12] * J[j33] ) , - float( J[j12] * J[j23] - J[j13] * J[j22] ) , - - float( J[j23] * J[j31] - J[j21] * J[j33] ) , - float( J[j11] * J[j33] - J[j13] * J[j31] ) , - float( J[j13] * J[j21] - J[j11] * J[j23] ) , - - float( J[j21] * J[j32] - J[j22] * J[j31] ) , - float( J[j12] * J[j31] - J[j11] * J[j32] ) , - float( J[j11] * J[j22] - J[j12] * J[j21] ) }; - - const float detJ = J[j11] * invJ[j11] + - J[j21] * invJ[j12] + - J[j31] * invJ[j13] ; - - { - const float detJinv = 1.0 / detJ ; - for ( int i = 0 ; i < TensorDim ; ++i ) { invJ[i] *= detJinv ; } - } - - // Transform gradients: - for ( int i = 0; i < ElemNodeCount ; ++i ) { - dpsi[0][i] = grad[0][i] * invJ[j11] + - grad[1][i] * invJ[j12] + - grad[2][i] * invJ[j13]; - dpsi[1][i] = grad[0][i] * invJ[j21] + - grad[1][i] * invJ[j22] + - grad[2][i] * invJ[j23]; - dpsi[2][i] = grad[0][i] * invJ[j31] + - grad[1][i] * invJ[j32] + - grad[2][i] * invJ[j33]; - } - - return detJ ; - } - - // Functor's function called for each element in the mesh - // to numerically integrate the function and add element quantities - // to the global integral. - KOKKOS_INLINE_FUNCTION - void operator()( const int ielem , value_type & update ) const - { - // Local temporaries for gathering nodal data. - double node_coord[3][ ElemNodeCount ]; - - int inode[ ElemNodeCount ] ; - - // Gather indices of element's node from global memory to local memory. - for ( int i = 0 ; i < ElemNodeCount ; ++i ) { - inode[i] = m_box_fixture.elem_node( ielem , i ); - } - - // Gather coordinates of element's nodes from global memory to local memory. - for ( int i = 0 ; i < ElemNodeCount ; ++i ) { - node_coord[0][i] = m_box_fixture.node_coord( inode[i] , 0 ); - node_coord[1][i] = m_box_fixture.node_coord( inode[i] , 1 ); - node_coord[2][i] = m_box_fixture.node_coord( inode[i] , 2 ); - } - - // Local temporary to accumulate numerical integration - // of vector valued function. - double accum[ ValueCount ]; - - for ( int j = 0 ; j < ValueCount ; ++j ) { accum[j] = 0 ; } - - int error = 0 ; - - // Numerical integration loop for this element: - for ( int k = 0 ; k < IntegrationCount ; ++k ) { - - // Integration point in space as interpolated from nodal coordinates: - double point[3] = { 0 , 0 , 0 }; - for ( int i = 0 ; i < ElemNodeCount ; ++i ) { - point[0] += node_coord[0][i] * m_hex_elem_data.values[k][i] ; - point[1] += node_coord[1][i] * m_hex_elem_data.values[k][i] ; - point[2] += node_coord[2][i] * m_hex_elem_data.values[k][i] ; - } - - // Example function vector value at cubature point: - double val_at_pt[ ValueCount ]; - m_function( point , val_at_pt ); - - // Temporary array for transformed element basis functions' gradient. - // Not used in this example, but computed anyway by the more general - // deformation function. - float dpsi[3][ ElemNodeCount ]; - - // Compute deformation jacobian, transform basis function gradient, - // and return determinant of deformation jacobian. - float detJ = transform_gradients( m_hex_elem_data.gradients[k] , - node_coord , dpsi ); - - // Check for inverted spatial jacobian - if ( detJ <= 0 ) { error = 1 ; detJ = 0 ; } - - // Integration weight. - const float w = m_hex_elem_data.weights[k] * detJ ; - - // Cubature of function. - for ( int j = 0 ; j < ValueCount ; ++j ) { - accum[j] += val_at_pt[j] * w ; - } - } - - m_elem_error(ielem) = error ; - - - // Element contribution to global integral: - - if ( error ) { update.error = 1 ; } - - for ( int j = 0 ; j < ValueCount ; ++j ) { update.value[j] += accum[j] ; } - - // Element-node quantity for lumping to nodes: - for ( int i = 0 ; i < ElemNodeCount ; ++i ) { - for ( int j = 0 ; j < ValueCount ; ++j ) { - // Save element's integral apportionment to nodes to global memory - m_elem_integral( ielem , i , j ) = accum[j] / ElemNodeCount ; - } - } - - if ( PerformScatterAddWithAtomic ) { - // Option to immediately scatter-add the integrated quantities to nodes. - // This is a race condition as two or more threads could attempt - // concurrent update of nodal values. The atomic_fetch_add (+=) - // function guarantees that the summation will occur correctly; - // however, there can be no guarantee for the order of summation. - // Due to non-associativity of floating point arithmetic the result - // is non-deterministic within bounds of floating point round-off. - - for ( int i = 0 ; i < ElemNodeCount ; ++i ) { - for ( int j = 0 ; j < ValueCount ; ++j ) { - Kokkos::atomic_fetch_add( & m_node_lumped( inode[i] , j ) , - m_elem_integral( ielem , i , j ) ); - } - } - } - } - //-------------------------------------------------------------------------- - - // Initialization of the global reduction value. - KOKKOS_INLINE_FUNCTION - void init( value_type & update ) const - { - for ( int j = 0 ; j < ValueCount ; ++j ) update.value[j] = 0 ; - update.error = 0 ; - } - - // Join two contributions to global reduction value. - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & update , - volatile const value_type & input ) const - { - for ( int j = 0 ; j < ValueCount ; ++j ) update.value[j] += input.value[j] ; - if ( input.error ) update.error = 1 ; - } -}; - -} /* namespace Example */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { - -template< class ViewElemNode , - class ViewNodeScan , - class ViewNodeElem > -void map_node_to_elem( const ViewElemNode & elem_node , - const ViewNodeScan & node_scan , - const ViewNodeElem & node_elem ); - -/** \brief Functor to gather-sum elements' per-node quantities - * to element nodes. Gather-sum is thread safe and - * does not require atomic updates. - */ -template< class ViewNodeValue , - class ViewElemValue , - bool AlreadyUsedAtomic > -struct LumpElemToNode { - - typedef typename ViewElemValue::execution_space execution_space ; - - // In this example we know that the ViewElemValue - // array specification is < double*[nNode][nValue] > - -#if defined( KOKKOS_USING_EXPERIMENTAL_VIEW ) - enum { value_count = ViewElemValue::dimension::N2 }; -#else - enum { value_count = ViewElemValue::shape_type::N2 }; -#endif - - ViewNodeValue m_node_value ; ///< Integrated values at nodes - ViewElemValue m_elem_value ; ///< Values apportioned to nodes - View m_node_scan ; ///< Offsets for nodes->element - View m_node_elem ; ///< Node->element connectivity - - // Only allocate node->element connectivity if have - // not already used atomic updates for the nodes. - template< class ViewElemNode > - LumpElemToNode( const ViewNodeValue & node_value , - const ViewElemValue & elem_value , - const ViewElemNode & elem_node ) - : m_node_value( node_value ) - , m_elem_value( elem_value ) - , m_node_scan( "node_scan" , - AlreadyUsedAtomic ? 0 : node_value.dimension_0() + 1 ) - , m_node_elem( "node_elem" , - AlreadyUsedAtomic ? 0 : elem_node.dimension_0() * - elem_node.dimension_1() ) - { - if ( ! AlreadyUsedAtomic ) { - map_node_to_elem( elem_node , m_node_scan , m_node_elem ); - } - } - - //---------------------------------------- - - struct value_type { double value[ value_count ]; }; - - KOKKOS_INLINE_FUNCTION - void operator()( const int inode , value_type & update ) const - { - if ( ! AlreadyUsedAtomic ) { - // Sum element quantities to a local variable. - value_type local ; - for ( int j = 0 ; j < value_count ; ++j ) { local.value[j] = 0 ; } - - { - // nodes' element ids span [i,end) - int i = m_node_scan(inode); - const int end = m_node_scan(inode+1); - - for ( ; i < end ; ++i ) { - // element #ielem , local node #ielem_node is this node: - const int ielem = m_node_elem(i,0); - const int ielem_node = m_node_elem(i,1); - // Sum the vector-values quantity - for ( int j = 0 ; j < value_count ; ++j ) { - local.value[j] += m_elem_value( ielem , ielem_node , j ); - } - } - } - - // Assign nodal quantity (no race condition). - // Sum global value. - for ( int j = 0 ; j < value_count ; ++j ) { - m_node_value( inode , j ) = local.value[j] ; - update.value[j] += local.value[j] ; - } - } - else { - // Already used atomic update of the nodal quantity, - // query and sum the value. - for ( int j = 0 ; j < value_count ; ++j ) { - update.value[j] += m_node_value( inode , j ); - } - } - } - - KOKKOS_INLINE_FUNCTION - void init( value_type & update ) const - { for ( int j = 0 ; j < value_count ; ++j ) { update.value[j] = 0 ; } } - - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & update , - volatile const value_type & input ) const - { - for ( int j = 0 ; j < value_count ; ++j ) { - update.value[j] += input.value[j] ; - } - } -}; - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -template< class ViewElemNode , - class ViewNodeScan , - class ViewNodeElem > -void map_node_to_elem( const ViewElemNode & elem_node , - const ViewNodeScan & node_scan , - const ViewNodeElem & node_elem ) -{ - typedef typename ViewElemNode::host_mirror_space host_mirror_space ; - - const typename ViewElemNode::HostMirror host_elem_node = - Kokkos::create_mirror_view(elem_node); - - const typename ViewNodeScan::HostMirror host_node_scan = - Kokkos::create_mirror_view(node_scan); - - const typename ViewNodeElem::HostMirror host_node_elem = - Kokkos::create_mirror_view(node_elem); - - const int elem_count = host_elem_node.dimension_0(); - const int elem_node_count = host_elem_node.dimension_1(); - const int node_count = host_node_scan.dimension_0() - 1 ; - - const View - node_elem_count( "node_elem_count" , node_count ); - - Kokkos::deep_copy( host_elem_node , elem_node ); - - for ( int i = 0 ; i < elem_count ; ++i ) { - for ( int j = 0 ; j < elem_node_count ; ++j ) { - ++node_elem_count( host_elem_node(i,j) ); - } - } - - for ( int i = 0 ; i < node_count ; ++i ) { - host_node_scan(i+1) += host_node_scan(i) + node_elem_count(i); - node_elem_count(i) = 0 ; - } - - for ( int i = 0 ; i < elem_count ; ++i ) { - for ( int j = 0 ; j < elem_node_count ; ++j ) { - const int inode = host_elem_node(i,j); - const int offset = host_node_scan(inode) + node_elem_count(inode); - - host_node_elem( offset , 0 ) = i ; - host_node_elem( offset , 1 ) = j ; - - ++node_elem_count(inode); - } - } - - Kokkos::deep_copy( node_scan , host_node_scan ); - Kokkos::deep_copy( node_elem , host_node_elem ); -} - -} /* namespace Example */ -} /* namespace Kokkos */ - -#endif /* #ifndef KOKKOS_EXAMPLE_FEINT_FUNCTORS_HPP */ - diff --git a/lib/kokkos/example/feint/Makefile b/lib/kokkos/example/feint/Makefile deleted file mode 100644 index 98ab8747b3..0000000000 --- a/lib/kokkos/example/feint/Makefile +++ /dev/null @@ -1,62 +0,0 @@ -KOKKOS_PATH = ../.. - -vpath %.cpp ${KOKKOS_PATH}/example/fixture ${KOKKOS_PATH}/example/feint - -EXAMPLE_HEADERS = $(wildcard $(KOKKOS_PATH)/example/common/*.hpp ${KOKKOS_PATH}/example/fixture/*.hpp ${KOKKOS_PATH}/example/feint/*.hpp) - -default: build_all - echo "End Build" - -include $(KOKKOS_PATH)/Makefile.kokkos - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - CXX = nvcc_wrapper - CXXFLAGS ?= -O3 - LINK = $(CXX) - LDFLAGS ?= -lpthread -else - CXX ?= g++ - CXXFLAGS ?= -O3 - LINK ?= $(CXX) - LDFLAGS ?= -lpthread -endif - -KOKKOS_CXXFLAGS += \ - -I${KOKKOS_PATH}/example/common \ - -I${KOKKOS_PATH}/example/fixture \ - -I${KOKKOS_PATH}/example/feint - - -EXE_EXAMPLE_FEINT = KokkosExample_Feint -OBJ_EXAMPLE_FEINT = BoxElemPart.o main.o - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - OBJ_EXAMPLE_FEINT += feint_cuda.o -endif - -ifeq ($(KOKKOS_INTERNAL_USE_PTHREADS), 1) - OBJ_EXAMPLE_FEINT += feint_threads.o -endif - -ifeq ($(KOKKOS_INTERNAL_USE_OPENMP), 1) - OBJ_EXAMPLE_FEINT += feint_openmp.o -endif - -TARGETS = $(EXE_EXAMPLE_FEINT) - -#TEST_TARGETS = - -$(EXE_EXAMPLE_FEINT) : $(OBJ_EXAMPLE_FEINT) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_EXAMPLE_FEINT) $(KOKKOS_LIBS) $(LIB) -o $(EXE_EXAMPLE_FEINT) - -build_all : $(TARGETS) - - -test : build_all - - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) $(EXAMPLE_HEADERS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< - diff --git a/lib/kokkos/example/feint/feint.hpp b/lib/kokkos/example/feint/feint.hpp deleted file mode 100644 index 4b7196c4c7..0000000000 --- a/lib/kokkos/example/feint/feint.hpp +++ /dev/null @@ -1,165 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXAMPLE_FEINT_HPP -#define KOKKOS_EXAMPLE_FEINT_HPP - -#include -#include -#include -#include - -namespace Kokkos { -namespace Example { - -/** \brief Vector valued function to numerically integrate. - * - * F(X) = { 1 , x , y , z , x*y , y*z , z*x , x*y*z } - * - * Integrates on a unit cube to: - * { 1 , 1/2 , 1/2 , 1/2 , 1/4 , 1/4 , 1/4 , 1/8 } - */ -struct MyFunctionType { - - enum { value_count = 8 }; - - // Evaluate function at coordinate. - template< typename CoordType , typename ValueType > - KOKKOS_INLINE_FUNCTION - void operator()( const CoordType point[] , ValueType value[] ) const - { - value[0] = 1 ; - value[1] = point[0] ; - value[2] = point[1] ; - value[3] = point[2] ; - value[4] = point[0] * point[1] ; - value[5] = point[1] * point[2] ; - value[6] = point[2] * point[0] ; - value[7] = point[0] * point[1] * point[2] ; - } -}; - -template < class Device , bool UseAtomic > -void feint( - const unsigned global_elem_nx , - const unsigned global_elem_ny , - const unsigned global_elem_nz ) -{ - //---------------------------------------- - // Create the unstructured finite element mesh box fixture on the device: - - typedef Kokkos::Example:: - BoxElemFixture< Device , Kokkos::Example::BoxElemPart::ElemLinear > - // BoxElemFixture< Device , Kokkos::Example::BoxElemPart::ElemQuadratic > - BoxFixtureType ; - - // MPI distributed parallel domain decomposition of the fixture. - // Either by element (DecomposeElem) or by node (DecomposeNode) - // with ghosted elements. - - static const Kokkos::Example::BoxElemPart::Decompose - decompose = Kokkos::Example::BoxElemPart:: DecomposeElem ; - // decompose = Kokkos::Example::BoxElemPart:: DecomposeNode ; - - // Not using MPI in this example. - const unsigned mpi_rank = 0 ; - const unsigned mpi_size = 1 ; - - const BoxFixtureType fixture( decompose , mpi_size , mpi_rank , - global_elem_nx , - global_elem_ny , - global_elem_nz ); - - //---------------------------------------- - // Create and execute the numerical integration functor on the device: - - typedef Kokkos::Example:: - FiniteElementIntegration< BoxFixtureType , MyFunctionType , UseAtomic > - FeintType ; - - const FeintType feint( fixture , MyFunctionType() ); - - typename FeintType::value_type elem_integral ; - - // A reduction for the global integral: - Kokkos::parallel_reduce( fixture.elem_count() , feint , elem_integral ); - - if ( elem_integral.error ) { - std::cout << "An element had a spatial jacobian error" << std::endl ; - return ; - } - - std::cout << "Elem integral =" ; - for ( int i = 0 ; i < MyFunctionType::value_count ; ++i ) { - std::cout << " " << elem_integral.value[i] ; - } - std::cout << std::endl ; - - //---------------------------------------- - // Create and execute the nodal lumped value projection and reduction functor: - - typedef Kokkos::Example:: - LumpElemToNode< typename FeintType::NodeValueType , - typename FeintType::ElemValueType , - UseAtomic > LumpType ; - - const LumpType lump( feint.m_node_lumped , - feint.m_elem_integral , - fixture.elem_node() ); - - typename LumpType ::value_type node_sum ; - - Kokkos::parallel_reduce( fixture.node_count() , lump , node_sum ); - - std::cout << "Node lumped sum =" ; - for ( int i = 0 ; i < MyFunctionType::value_count ; ++i ) { - std::cout << " " << node_sum.value[i] ; - } - std::cout << std::endl ; -} - -} /* namespace Example */ -} /* namespace Kokkos */ - -#endif /* #ifndef KOKKOS_EXAMPLE_FEINT_HPP */ - diff --git a/lib/kokkos/example/feint/feint_cuda.cpp b/lib/kokkos/example/feint/feint_cuda.cpp deleted file mode 100644 index 1370822feb..0000000000 --- a/lib/kokkos/example/feint/feint_cuda.cpp +++ /dev/null @@ -1,67 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#if defined( KOKKOS_HAVE_CUDA ) - -#include - -namespace Kokkos { -namespace Example { - -template void feint( - const unsigned global_elem_nx , - const unsigned global_elem_ny , - const unsigned global_elem_nz ); - -template void feint( - const unsigned global_elem_nx , - const unsigned global_elem_ny , - const unsigned global_elem_nz ); - -} /* namespace Example */ -} /* namespace Kokkos */ - -#endif - diff --git a/lib/kokkos/example/feint/feint_fwd.hpp b/lib/kokkos/example/feint/feint_fwd.hpp deleted file mode 100644 index f02e547cfc..0000000000 --- a/lib/kokkos/example/feint/feint_fwd.hpp +++ /dev/null @@ -1,60 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXAMPLE_FEINT_FWD_HPP -#define KOKKOS_EXAMPLE_FEINT_FWD_HPP - -namespace Kokkos { -namespace Example { - -template < class Device , bool UseAtomic > -void feint( - const unsigned global_elem_nx = 100 , - const unsigned global_elem_ny = 115 , - const unsigned global_elem_nz = 130 ); - -} /* namespace Example */ -} /* namespace Kokkos */ - -#endif /* #ifndef KOKKOS_EXAMPLE_FEINT_FWD_HPP */ - diff --git a/lib/kokkos/example/feint/feint_openmp.cpp b/lib/kokkos/example/feint/feint_openmp.cpp deleted file mode 100644 index cf2fdca5ba..0000000000 --- a/lib/kokkos/example/feint/feint_openmp.cpp +++ /dev/null @@ -1,67 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#ifdef KOKKOS_HAVE_OPENMP - -#include - -namespace Kokkos { -namespace Example { - -template void feint( - const unsigned global_elem_nx , - const unsigned global_elem_ny , - const unsigned global_elem_nz ); - -template void feint( - const unsigned global_elem_nx , - const unsigned global_elem_ny , - const unsigned global_elem_nz ); - -} /* namespace Example */ -} /* namespace Kokkos */ - -#endif - diff --git a/lib/kokkos/example/feint/feint_threads.cpp b/lib/kokkos/example/feint/feint_threads.cpp deleted file mode 100644 index 5dcf5654f1..0000000000 --- a/lib/kokkos/example/feint/feint_threads.cpp +++ /dev/null @@ -1,66 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#if defined( KOKKOS_HAVE_PTHREAD ) - -#include - -namespace Kokkos { -namespace Example { - -template void feint< Kokkos::Threads ,false>( - const unsigned global_elem_nx , - const unsigned global_elem_ny , - const unsigned global_elem_nz ); - -template void feint< Kokkos::Threads ,true>( - const unsigned global_elem_nx , - const unsigned global_elem_ny , - const unsigned global_elem_nz ); - -} /* namespace Example */ -} /* namespace Kokkos */ - -#endif /* #if defined( KOKKOS_HAVE_PTHREAD ) */ diff --git a/lib/kokkos/example/feint/main.cpp b/lib/kokkos/example/feint/main.cpp deleted file mode 100644 index c45d483e76..0000000000 --- a/lib/kokkos/example/feint/main.cpp +++ /dev/null @@ -1,110 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#include -#include - -#include - -#include - -int main() -{ -#if defined( KOKKOS_HAVE_PTHREAD ) - { - // Use 4 cores per NUMA region, unless fewer available - - const unsigned use_numa_count = Kokkos::hwloc::get_available_numa_count(); - const unsigned use_cores_per_numa = std::min( 4u , Kokkos::hwloc::get_available_cores_per_numa() ); - - Kokkos::Threads::initialize( use_numa_count * use_cores_per_numa ); - - std::cout << "feint< Threads , NotUsingAtomic >" << std::endl ; - Kokkos::Example::feint< Kokkos::Threads , false >(); - - std::cout << "feint< Threads , Usingtomic >" << std::endl ; - Kokkos::Example::feint< Kokkos::Threads , true >(); - - Kokkos::Threads::finalize(); - } -#endif - -#if defined( KOKKOS_HAVE_OPENMP ) - { - // Use 4 cores per NUMA region, unless fewer available - - const unsigned use_numa_count = Kokkos::hwloc::get_available_numa_count(); - const unsigned use_cores_per_numa = std::min( 4u , Kokkos::hwloc::get_available_cores_per_numa() ); - - Kokkos::OpenMP::initialize( use_numa_count * use_cores_per_numa ); - - std::cout << "feint< OpenMP , NotUsingAtomic >" << std::endl ; - Kokkos::Example::feint< Kokkos::OpenMP , false >(); - - std::cout << "feint< OpenMP , Usingtomic >" << std::endl ; - Kokkos::Example::feint< Kokkos::OpenMP , true >(); - - Kokkos::OpenMP::finalize(); - } -#endif - -#if defined( KOKKOS_HAVE_CUDA ) - { - // Initialize Host mirror device - Kokkos::HostSpace::execution_space::initialize(1); - const unsigned device_count = Kokkos::Cuda::detect_device_count(); - - // Use the last device: - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice(device_count-1) ); - - std::cout << "feint< Cuda , NotUsingAtomic >" << std::endl ; - Kokkos::Example::feint< Kokkos::Cuda , false >(); - - std::cout << "feint< Cuda , UsingAtomic >" << std::endl ; - Kokkos::Example::feint< Kokkos::Cuda , true >(); - - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); - - } -#endif -} - diff --git a/lib/kokkos/example/fenl/CGSolve.hpp b/lib/kokkos/example/fenl/CGSolve.hpp deleted file mode 100644 index 370dee15ac..0000000000 --- a/lib/kokkos/example/fenl/CGSolve.hpp +++ /dev/null @@ -1,296 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXAMPLE_CG_SOLVE -#define KOKKOS_EXAMPLE_CG_SOLVE - -#include -#include -#include -#include - -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { - -template< typename ValueType , class Space > -struct CrsMatrix { - typedef Kokkos::StaticCrsGraph< unsigned , Space , void , unsigned > StaticCrsGraphType ; - typedef View< ValueType * , Space > coeff_type ; - - StaticCrsGraphType graph ; - coeff_type coeff ; - - CrsMatrix() : graph(), coeff() {} - - CrsMatrix( const StaticCrsGraphType & arg_graph ) - : graph( arg_graph ) - , coeff( "crs_matrix_coeff" , arg_graph.entries.dimension_0() ) - {} -}; - -template< typename MScalar - , typename VScalar - , class Space > -struct Multiply { - - const Example::CrsMatrix< MScalar , Space > m_A ; - const Kokkos::View< const VScalar * , Space > m_x ; - const Kokkos::View< VScalar * , Space > m_y ; - - KOKKOS_INLINE_FUNCTION - void operator()( const int iRow ) const - { - const int iEntryBegin = m_A.graph.row_map[iRow]; - const int iEntryEnd = m_A.graph.row_map[iRow+1]; - - double sum = 0 ; - - for ( int iEntry = iEntryBegin ; iEntry < iEntryEnd ; ++iEntry ) { - sum += m_A.coeff(iEntry) * m_x( m_A.graph.entries(iEntry) ); - } - - m_y(iRow) = sum ; - } - - Multiply( const View< VScalar * , Space > & y - , const CrsMatrix< MScalar , Space > & A - , const View< const VScalar * , Space > & x - ) - : m_A( A ), m_x( x ), m_y( y ) - {} -}; - -template< typename MScalar - , typename VScalar - , class Space > -inline -void multiply( const int nrow - , const Kokkos::View< VScalar * , Space > & y - , const Example::CrsMatrix< MScalar , Space > & A - , const Kokkos::View< VScalar * , Space > & x - ) -{ - Kokkos::parallel_for( Kokkos::RangePolicy(0,nrow), Multiply( y , A , x ) ); -} - -template< typename ValueType , class Space > -struct WAXPBY { - const Kokkos::View< const ValueType * , Space > m_x ; - const Kokkos::View< const ValueType * , Space > m_y ; - const Kokkos::View< ValueType * , Space > m_w ; - const double m_alpha ; - const double m_beta ; - - KOKKOS_INLINE_FUNCTION - void operator()( const int i ) const - { m_w(i) = m_alpha * m_x(i) + m_beta * m_y(i); } - - WAXPBY( const View< ValueType * , Space > & arg_w - , const double arg_alpha - , const View< ValueType * , Space > & arg_x - , const double arg_beta - , const View< ValueType * , Space > & arg_y - ) - : m_x( arg_x ) - , m_y( arg_y ) - , m_w( arg_w ) - , m_alpha( arg_alpha ) - , m_beta( arg_beta ) - {} -}; - -template< typename VScalar , class Space > -void waxpby( const int n - , const Kokkos::View< VScalar * , Space > & arg_w - , const double arg_alpha - , const Kokkos::View< VScalar * , Space > & arg_x - , const double arg_beta - , const Kokkos::View< VScalar * , Space > & arg_y - ) -{ - Kokkos::parallel_for( Kokkos::RangePolicy(0,n), WAXPBY(arg_w,arg_alpha,arg_x,arg_beta,arg_y) ); -} - -template< typename VScalar , class Space > -struct Dot { - typedef double value_type ; - - const Kokkos::View< const VScalar * , Space > m_x ; - const Kokkos::View< const VScalar * , Space > m_y ; - - KOKKOS_INLINE_FUNCTION - void operator()( const int i , value_type & update ) const - { update += m_x(i) * m_y(i); } - - Dot( const Kokkos::View< VScalar * , Space > & arg_x - , const Kokkos::View< VScalar * , Space > & arg_y - ) - : m_x(arg_x), m_y(arg_y) {} -}; - -template< typename VScalar , class Space > -double dot( const int n - , const Kokkos::View< VScalar * , Space > & arg_x - , const Kokkos::View< VScalar * , Space > & arg_y - ) -{ - double result = 0 ; - Kokkos::parallel_reduce( Kokkos::RangePolicy(0,n) , Dot( arg_x , arg_y ) , result ); - return result ; -} - -} // namespace Example -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { - -struct CGSolveResult { - size_t iteration ; - double iter_time ; - double matvec_time ; - double norm_res ; -}; - -template< class ImportType - , typename MScalar - , typename VScalar - , class Space - > -inline -void cgsolve( const ImportType & import - , const CrsMatrix< MScalar , Space > & A - , const Kokkos::View< VScalar * , Space > & b - , const Kokkos::View< VScalar * , Space > & x - , const size_t maximum_iteration = 200 - , const double tolerance = std::numeric_limits::epsilon() - , CGSolveResult * result = 0 - ) -{ - typedef View< VScalar * , Space > VectorType ; - - const size_t count_owned = import.count_owned ; - const size_t count_total = import.count_owned + import.count_receive; - - size_t iteration = 0 ; - double iter_time = 0 ; - double matvec_time = 0 ; - double norm_res = 0 ; - - // Need input vector to matvec to be owned + received - VectorType pAll ( "cg::p" , count_total ); - - VectorType p = Kokkos::subview( pAll , std::pair(0,count_owned) ); - VectorType r ( "cg::r" , count_owned ); - VectorType Ap( "cg::Ap", count_owned ); - - /* r = b - A * x ; */ - - /* p = x */ Kokkos::deep_copy( p , x ); - /* import p */ import( pAll ); - /* Ap = A * p */ multiply( count_owned , Ap , A , pAll ); - /* r = b - Ap */ waxpby( count_owned , r , 1.0 , b , -1.0 , Ap ); - /* p = r */ Kokkos::deep_copy( p , r ); - - double old_rdot = Kokkos::Example::all_reduce( dot( count_owned , r , r ) , import.comm ); - - norm_res = sqrt( old_rdot ); - iteration = 0 ; - - Kokkos::Impl::Timer wall_clock ; - Kokkos::Impl::Timer timer; - - while ( tolerance < norm_res && iteration < maximum_iteration ) { - - /* pAp_dot = dot( p , Ap = A * p ) */ - - timer.reset(); - /* import p */ import( pAll ); - /* Ap = A * p */ multiply( count_owned , Ap , A , pAll ); - Space::fence(); - matvec_time += timer.seconds(); - - const double pAp_dot = Kokkos::Example::all_reduce( dot( count_owned , p , Ap ) , import.comm ); - const double alpha = old_rdot / pAp_dot ; - - /* x += alpha * p ; */ waxpby( count_owned , x , alpha, p , 1.0 , x ); - /* r += -alpha * Ap ; */ waxpby( count_owned , r , -alpha, Ap , 1.0 , r ); - - const double r_dot = Kokkos::Example::all_reduce( dot( count_owned , r , r ) , import.comm ); - const double beta = r_dot / old_rdot ; - - /* p = r + beta * p ; */ waxpby( count_owned , p , 1.0 , r , beta , p ); - - norm_res = sqrt( old_rdot = r_dot ); - - ++iteration ; - } - - Space::fence(); - iter_time = wall_clock.seconds(); - - if ( 0 != result ) { - result->iteration = iteration ; - result->iter_time = iter_time ; - result->matvec_time = matvec_time ; - result->norm_res = norm_res ; - } -} - -} // namespace Example -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_EXAMPLE_CG_SOLVE */ - - diff --git a/lib/kokkos/example/fenl/Makefile b/lib/kokkos/example/fenl/Makefile deleted file mode 100644 index 491ed4ee6d..0000000000 --- a/lib/kokkos/example/fenl/Makefile +++ /dev/null @@ -1,50 +0,0 @@ -KOKKOS_PATH = ../.. - -vpath %.cpp ${KOKKOS_PATH}/example/fixture ${KOKKOS_PATH}/example/fenl - -EXAMPLE_HEADERS = $(wildcard $(KOKKOS_PATH)/example/common/*.hpp ${KOKKOS_PATH}/example/fixture/*.hpp ${KOKKOS_PATH}/example/fenl/*.hpp) - -default: build_all - echo "End Build" - -include $(KOKKOS_PATH)/Makefile.kokkos - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - CXX = nvcc_wrapper - CXXFLAGS ?= -O3 - LINK = $(CXX) - LDFLAGS ?= -lpthread -else - CXX ?= g++ - CXXFLAGS ?= -O3 - LINK ?= $(CXX) - LDFLAGS ?= -lpthread -endif - -KOKKOS_CXXFLAGS += \ - -I${KOKKOS_PATH}/example/common \ - -I${KOKKOS_PATH}/example/fixture \ - -I${KOKKOS_PATH}/example/fenl - - -EXE_EXAMPLE_FENL = KokkosExample_Fenl -OBJ_EXAMPLE_FENL = BoxElemPart.o main.o fenl.o - -TARGETS = $(EXE_EXAMPLE_FENL) - -#TEST_TARGETS = - -$(EXE_EXAMPLE_FENL) : $(OBJ_EXAMPLE_FENL) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_EXAMPLE_FENL) $(KOKKOS_LIBS) $(LIB) -o $(EXE_EXAMPLE_FENL) - -build_all : $(TARGETS) - - -test : build_all - - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) $(EXAMPLE_HEADERS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< - diff --git a/lib/kokkos/example/fenl/fenl.cpp b/lib/kokkos/example/fenl/fenl.cpp deleted file mode 100644 index a5cba608f4..0000000000 --- a/lib/kokkos/example/fenl/fenl.cpp +++ /dev/null @@ -1,117 +0,0 @@ -/* -// ************************************************************************ -// -// Kokkos: Manycore Performance-Portable Multidimensional Arrays -// Copyright (2012) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -*/ - -#include -#include - -namespace Kokkos { -namespace Example { -namespace FENL { - -#if defined( KOKKOS_HAVE_PTHREAD ) - -template -Perf fenl< Kokkos::Threads , Kokkos::Example::BoxElemPart::ElemLinear >( - MPI_Comm comm , - const int use_print , - const int use_trials , - const int use_atomic , - const int global_elems[] ); - - -template -Perf fenl< Kokkos::Threads , Kokkos::Example::BoxElemPart::ElemQuadratic >( - MPI_Comm comm , - const int use_print , - const int use_trials , - const int use_atomic , - const int global_elems[] ); - -#endif - - -#if defined (KOKKOS_HAVE_OPENMP) - -template -Perf fenl< Kokkos::OpenMP , Kokkos::Example::BoxElemPart::ElemLinear >( - MPI_Comm comm , - const int use_print , - const int use_trials , - const int use_atomic , - const int global_elems[] ); - - -template -Perf fenl< Kokkos::OpenMP , Kokkos::Example::BoxElemPart::ElemQuadratic >( - MPI_Comm comm , - const int use_print , - const int use_trials , - const int use_atomic , - const int global_elems[] ); - -#endif - -#if defined( KOKKOS_HAVE_CUDA ) - -template -Perf fenl< Kokkos::Cuda , Kokkos::Example::BoxElemPart::ElemLinear >( - MPI_Comm comm , - const int use_print , - const int use_trials , - const int use_atomic , - const int global_elems[] ); - - -template -Perf fenl< Kokkos::Cuda , Kokkos::Example::BoxElemPart::ElemQuadratic >( - MPI_Comm comm , - const int use_print , - const int use_trials , - const int use_atomic , - const int global_elems[] ); - -#endif - - -} /* namespace FENL */ -} /* namespace Example */ -} /* namespace Kokkos */ - diff --git a/lib/kokkos/example/fenl/fenl.hpp b/lib/kokkos/example/fenl/fenl.hpp deleted file mode 100644 index e524a378c0..0000000000 --- a/lib/kokkos/example/fenl/fenl.hpp +++ /dev/null @@ -1,89 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXAMPLE_FENL_HPP -#define KOKKOS_EXAMPLE_FENL_HPP - -#include -#include -#include - -namespace Kokkos { -namespace Example { -namespace FENL { - -struct Perf { - size_t global_elem_count ; - size_t global_node_count ; - size_t newton_iter_count ; - size_t cg_iter_count ; - double map_ratio ; - double fill_node_set ; - double scan_node_count ; - double fill_graph_entries ; - double sort_graph_entries ; - double fill_element_graph ; - double create_sparse_matrix ; - double fill_time ; - double bc_time ; - double matvec_time ; - double cg_time ; - double newton_residual ; - double error_max ; - -}; - -template < class Device , BoxElemPart::ElemOrder ElemOrder > -Perf fenl( - MPI_Comm comm , - const int use_print , - const int use_trials , - const int use_atomic , - const int global_elems[] ); - -} /* namespace FENL */ -} /* namespace Example */ -} /* namespace Kokkos */ - -#endif /* #ifndef KOKKOS_EXAMPLE_FENL_HPP */ - diff --git a/lib/kokkos/example/fenl/fenl_functors.hpp b/lib/kokkos/example/fenl/fenl_functors.hpp deleted file mode 100644 index 30f5274a51..0000000000 --- a/lib/kokkos/example/fenl/fenl_functors.hpp +++ /dev/null @@ -1,1173 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXAMPLE_FENLFUNCTORS_HPP -#define KOKKOS_EXAMPLE_FENLFUNCTORS_HPP - -#include - -#include -#include -#include -#include -#include -#include - -#include -#include - -#include - -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { -namespace FENL { - -template< class ElemNodeIdView , class CrsGraphType , unsigned ElemNode > -class NodeNodeGraph { -public: - - typedef typename ElemNodeIdView::execution_space execution_space ; - typedef pair key_type ; - - typedef Kokkos::UnorderedMap< key_type, void , execution_space > SetType ; - typedef typename CrsGraphType::row_map_type::non_const_type RowMapType ; - typedef Kokkos::View< unsigned , execution_space > UnsignedValue ; - - // Static dimensions of 0 generate compiler warnings or errors. - typedef Kokkos::View< unsigned*[ElemNode][ElemNode] , execution_space > - ElemGraphType ; - - struct TagFillNodeSet {}; - struct TagScanNodeCount {}; - struct TagFillGraphEntries {}; - struct TagSortGraphEntries {}; - struct TagFillElementGraph {}; - -private: - - enum PhaseType { FILL_NODE_SET , - SCAN_NODE_COUNT , - FILL_GRAPH_ENTRIES , - SORT_GRAPH_ENTRIES , - FILL_ELEMENT_GRAPH }; - - const unsigned node_count ; - const ElemNodeIdView elem_node_id ; - UnsignedValue row_total ; - RowMapType row_count ; - RowMapType row_map ; - SetType node_node_set ; - PhaseType phase ; - -public: - - CrsGraphType graph ; - ElemGraphType elem_graph ; - - struct Times - { - double ratio; - double fill_node_set; - double scan_node_count; - double fill_graph_entries; - double sort_graph_entries; - double fill_element_graph; - }; - - NodeNodeGraph( const ElemNodeIdView & arg_elem_node_id , - const unsigned arg_node_count, - Times & results - ) - : node_count(arg_node_count) - , elem_node_id( arg_elem_node_id ) - , row_total( "row_total" ) - , row_count(Kokkos::ViewAllocateWithoutInitializing("row_count") , node_count ) // will deep_copy to 0 inside loop - , row_map( "graph_row_map" , node_count + 1 ) - , node_node_set() - , phase( FILL_NODE_SET ) - , graph() - , elem_graph() - { - //-------------------------------- - // Guess at capacity required for the map: - - Kokkos::Impl::Timer wall_clock ; - - wall_clock.reset(); - phase = FILL_NODE_SET ; - - // upper bound on the capacity - size_t set_capacity = (28ull * node_count) / 2; - unsigned failed_insert_count = 0 ; - - do { - // Zero the row count to restart the fill - Kokkos::deep_copy( row_count , 0u ); - - node_node_set = SetType( ( set_capacity += failed_insert_count ) ); - - // May be larger that requested: - set_capacity = node_node_set.capacity(); - - Kokkos::parallel_reduce( Kokkos::RangePolicy(0,elem_node_id.dimension_0()) - , *this - , failed_insert_count ); - - } while ( failed_insert_count ); - - execution_space::fence(); - results.ratio = (double)node_node_set.size() / (double)node_node_set.capacity(); - results.fill_node_set = wall_clock.seconds(); - //-------------------------------- - - wall_clock.reset(); - phase = SCAN_NODE_COUNT ; - - // Exclusive scan of row_count into row_map - // including the final total in the 'node_count + 1' position. - // Zero the 'row_count' values. - Kokkos::parallel_scan( node_count , *this ); - - // Zero the row count for the fill: - Kokkos::deep_copy( row_count , 0u ); - - unsigned graph_entry_count = 0 ; - - Kokkos::deep_copy( graph_entry_count , row_total ); - - // Assign graph's row_map and allocate graph's entries - graph.row_map = row_map ; - graph.entries = typename CrsGraphType::entries_type( "graph_entries" , graph_entry_count ); - - //-------------------------------- - // Fill graph's entries from the (node,node) set. - - execution_space::fence(); - results.scan_node_count = wall_clock.seconds(); - - wall_clock.reset(); - phase = FILL_GRAPH_ENTRIES ; - Kokkos::parallel_for( node_node_set.capacity() , *this ); - - execution_space::fence(); - results.fill_graph_entries = wall_clock.seconds(); - - //-------------------------------- - // Done with the temporary sets and arrays - wall_clock.reset(); - phase = SORT_GRAPH_ENTRIES ; - - row_total = UnsignedValue(); - row_count = RowMapType(); - row_map = RowMapType(); - node_node_set.clear(); - - //-------------------------------- - - Kokkos::parallel_for( node_count , *this ); - - execution_space::fence(); - results.sort_graph_entries = wall_clock.seconds(); - - //-------------------------------- - // Element-to-graph mapping: - wall_clock.reset(); - phase = FILL_ELEMENT_GRAPH ; - elem_graph = ElemGraphType("elem_graph", elem_node_id.dimension_0() ); - Kokkos::parallel_for( elem_node_id.dimension_0() , *this ); - - execution_space::fence(); - results.fill_element_graph = wall_clock.seconds(); - } - - //------------------------------------ - // parallel_for: create map and count row length - - KOKKOS_INLINE_FUNCTION - void operator()( const TagFillNodeSet & , unsigned ielem , unsigned & count ) const - { - // Loop over element's (row_local_node,col_local_node) pairs: - for ( unsigned row_local_node = 0 ; row_local_node < elem_node_id.dimension_1() ; ++row_local_node ) { - - const unsigned row_node = elem_node_id( ielem , row_local_node ); - - for ( unsigned col_local_node = row_local_node ; col_local_node < elem_node_id.dimension_1() ; ++col_local_node ) { - - const unsigned col_node = elem_node_id( ielem , col_local_node ); - - // If either node is locally owned then insert the pair into the unordered map: - - if ( row_node < row_count.dimension_0() || col_node < row_count.dimension_0() ) { - - const key_type key = (row_node < col_node) ? make_pair( row_node, col_node ) : make_pair( col_node, row_node ) ; - - const typename SetType::insert_result result = node_node_set.insert( key ); - - // A successfull insert: the first time this pair was added - if ( result.success() ) { - - // If row node is owned then increment count - if ( row_node < row_count.dimension_0() ) { atomic_fetch_add( & row_count( row_node ) , 1 ); } - - // If column node is owned and not equal to row node then increment count - if ( col_node < row_count.dimension_0() && col_node != row_node ) { atomic_fetch_add( & row_count( col_node ) , 1 ); } - } - else if ( result.failed() ) { - ++count ; - } - } - } - } - } - - KOKKOS_INLINE_FUNCTION - void fill_graph_entries( const unsigned iset ) const - { - if ( node_node_set.valid_at(iset) ) { - // Add each entry to the graph entries. - - const key_type key = node_node_set.key_at(iset) ; - const unsigned row_node = key.first ; - const unsigned col_node = key.second ; - - if ( row_node < row_count.dimension_0() ) { - const unsigned offset = graph.row_map( row_node ) + atomic_fetch_add( & row_count( row_node ) , 1 ); - graph.entries( offset ) = col_node ; - } - - if ( col_node < row_count.dimension_0() && col_node != row_node ) { - const unsigned offset = graph.row_map( col_node ) + atomic_fetch_add( & row_count( col_node ) , 1 ); - graph.entries( offset ) = row_node ; - } - } - } - - KOKKOS_INLINE_FUNCTION - void sort_graph_entries( const unsigned irow ) const - { - const unsigned row_beg = graph.row_map( irow ); - const unsigned row_end = graph.row_map( irow + 1 ); - for ( unsigned i = row_beg + 1 ; i < row_end ; ++i ) { - const unsigned col = graph.entries(i); - unsigned j = i ; - for ( ; row_beg < j && col < graph.entries(j-1) ; --j ) { - graph.entries(j) = graph.entries(j-1); - } - graph.entries(j) = col ; - } - } - - KOKKOS_INLINE_FUNCTION - void fill_elem_graph_map( const unsigned ielem ) const - { - for ( unsigned row_local_node = 0 ; row_local_node < elem_node_id.dimension_1() ; ++row_local_node ) { - - const unsigned row_node = elem_node_id( ielem , row_local_node ); - - for ( unsigned col_local_node = 0 ; col_local_node < elem_node_id.dimension_1() ; ++col_local_node ) { - - const unsigned col_node = elem_node_id( ielem , col_local_node ); - - unsigned entry = ~0u ; - - if ( row_node + 1 < graph.row_map.dimension_0() ) { - - const unsigned entry_end = graph.row_map( row_node + 1 ); - - entry = graph.row_map( row_node ); - - for ( ; entry < entry_end && graph.entries(entry) != col_node ; ++entry ); - - if ( entry == entry_end ) entry = ~0u ; - } - - elem_graph( ielem , row_local_node , col_local_node ) = entry ; - } - } - } - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned iwork ) const - { -/* - if ( phase == FILL_NODE_SET ) { - operator()( TagFillNodeSet() , iwork ); - } - else */ - if ( phase == FILL_GRAPH_ENTRIES ) { - fill_graph_entries( iwork ); - } - else if ( phase == SORT_GRAPH_ENTRIES ) { - sort_graph_entries( iwork ); - } - else if ( phase == FILL_ELEMENT_GRAPH ) { - fill_elem_graph_map( iwork ); - } - } - - //------------------------------------ - // parallel_scan: row offsets - - typedef unsigned value_type ; - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned irow , unsigned & update , const bool final ) const - { - // exclusive scan - if ( final ) { row_map( irow ) = update ; } - - update += row_count( irow ); - - if ( final ) { - if ( irow + 1 == row_count.dimension_0() ) { - row_map( irow + 1 ) = update ; - row_total() = update ; - } - } - } - - // For the reduce phase: - KOKKOS_INLINE_FUNCTION - void init( const TagFillNodeSet & , unsigned & update ) const { update = 0 ; } - - KOKKOS_INLINE_FUNCTION - void join( const TagFillNodeSet & - , volatile unsigned & update - , volatile const unsigned & input ) const { update += input ; } - - // For the scan phase:: - KOKKOS_INLINE_FUNCTION - void init( unsigned & update ) const { update = 0 ; } - - KOKKOS_INLINE_FUNCTION - void join( volatile unsigned & update - , volatile const unsigned & input ) const { update += input ; } - - //------------------------------------ -}; - -} /* namespace FENL */ -} /* namespace Example */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { -namespace FENL { - -template< class ElemCompType > -class NodeElemGatherFill { -public: - - typedef typename ElemCompType::execution_space execution_space ; - typedef typename ElemCompType::vector_type vector_type ; - typedef typename ElemCompType::sparse_matrix_type sparse_matrix_type ; - typedef typename ElemCompType::elem_node_type elem_node_type ; - typedef typename ElemCompType::elem_vectors_type elem_vectors_type ; - typedef typename ElemCompType::elem_matrices_type elem_matrices_type ; - typedef typename ElemCompType::elem_graph_type elem_graph_type ; - - static const unsigned ElemNodeCount = ElemCompType::ElemNodeCount ; - - //------------------------------------ - -private: - - typedef Kokkos::StaticCrsGraph< unsigned[2] , execution_space > CrsGraphType ; - typedef typename CrsGraphType::row_map_type::non_const_type RowMapType ; - typedef Kokkos::View< unsigned , execution_space > UnsignedValue ; - - enum PhaseType { FILL_NODE_COUNT , - SCAN_NODE_COUNT , - FILL_GRAPH_ENTRIES , - SORT_GRAPH_ENTRIES , - GATHER_FILL }; - - const elem_node_type elem_node_id ; - const elem_graph_type elem_graph ; - UnsignedValue row_total ; - RowMapType row_count ; - RowMapType row_map ; - CrsGraphType graph ; - vector_type residual ; - sparse_matrix_type jacobian ; - elem_vectors_type elem_residual ; - elem_matrices_type elem_jacobian ; - PhaseType phase ; - -public: - - NodeElemGatherFill() - : elem_node_id() - , elem_graph() - , row_total() - , row_count() - , row_map() - , graph() - , residual() - , jacobian() - , elem_residual() - , elem_jacobian() - , phase( FILL_NODE_COUNT ) - {} - - NodeElemGatherFill( const NodeElemGatherFill & rhs ) - : elem_node_id( rhs.elem_node_id ) - , elem_graph( rhs.elem_graph ) - , row_total( rhs.row_total ) - , row_count( rhs.row_count ) - , row_map( rhs.row_map ) - , graph( rhs.graph ) - , residual( rhs.residual ) - , jacobian( rhs.jacobian ) - , elem_residual( rhs.elem_residual ) - , elem_jacobian( rhs.elem_jacobian ) - , phase( rhs.phase ) - {} - - NodeElemGatherFill( const elem_node_type & arg_elem_node_id , - const elem_graph_type & arg_elem_graph , - const vector_type & arg_residual , - const sparse_matrix_type & arg_jacobian , - const elem_vectors_type & arg_elem_residual , - const elem_matrices_type & arg_elem_jacobian ) - : elem_node_id( arg_elem_node_id ) - , elem_graph( arg_elem_graph ) - , row_total( "row_total" ) - , row_count( "row_count" , arg_residual.dimension_0() ) - , row_map( "graph_row_map" , arg_residual.dimension_0() + 1 ) - , graph() - , residual( arg_residual ) - , jacobian( arg_jacobian ) - , elem_residual( arg_elem_residual ) - , elem_jacobian( arg_elem_jacobian ) - , phase( FILL_NODE_COUNT ) - { - //-------------------------------- - // Count node->element relations - - phase = FILL_NODE_COUNT ; - - Kokkos::parallel_for( elem_node_id.dimension_0() , *this ); - - //-------------------------------- - - phase = SCAN_NODE_COUNT ; - - // Exclusive scan of row_count into row_map - // including the final total in the 'node_count + 1' position. - // Zero the 'row_count' values. - Kokkos::parallel_scan( residual.dimension_0() , *this ); - - // Zero the row count for the fill: - Kokkos::deep_copy( row_count , typename RowMapType::value_type(0) ); - - unsigned graph_entry_count = 0 ; - - Kokkos::deep_copy( graph_entry_count , row_total ); - - // Assign graph's row_map and allocate graph's entries - graph.row_map = row_map ; - - typedef typename CrsGraphType::entries_type graph_entries_type ; - - graph.entries = graph_entries_type( "graph_entries" , graph_entry_count ); - - //-------------------------------- - // Fill graph's entries from the (node,node) set. - - phase = FILL_GRAPH_ENTRIES ; - - Kokkos::deep_copy( row_count , 0u ); - Kokkos::parallel_for( elem_node_id.dimension_0() , *this ); - - execution_space::fence(); - - //-------------------------------- - // Done with the temporary sets and arrays - - row_total = UnsignedValue(); - row_count = RowMapType(); - row_map = RowMapType(); - - //-------------------------------- - - phase = SORT_GRAPH_ENTRIES ; - Kokkos::parallel_for( residual.dimension_0() , *this ); - - execution_space::fence(); - - phase = GATHER_FILL ; - } - - void apply() const - { - Kokkos::parallel_for( residual.dimension_0() , *this ); - } - - //------------------------------------ - //------------------------------------ - // parallel_for: Count node->element pairs - - KOKKOS_INLINE_FUNCTION - void fill_node_count( const unsigned ielem ) const - { - for ( unsigned row_local_node = 0 ; row_local_node < elem_node_id.dimension_1() ; ++row_local_node ) { - - const unsigned row_node = elem_node_id( ielem , row_local_node ); - - if ( row_node < row_count.dimension_0() ) { - atomic_fetch_add( & row_count( row_node ) , 1 ); - } - } - } - - KOKKOS_INLINE_FUNCTION - void fill_graph_entries( const unsigned ielem ) const - { - for ( unsigned row_local_node = 0 ; row_local_node < elem_node_id.dimension_1() ; ++row_local_node ) { - - const unsigned row_node = elem_node_id( ielem , row_local_node ); - - if ( row_node < row_count.dimension_0() ) { - - const unsigned offset = graph.row_map( row_node ) + atomic_fetch_add( & row_count( row_node ) , 1 ); - - graph.entries( offset , 0 ) = ielem ; - graph.entries( offset , 1 ) = row_local_node ; - } - } - } - - KOKKOS_INLINE_FUNCTION - void sort_graph_entries( const unsigned irow ) const - { - const unsigned row_beg = graph.row_map( irow ); - const unsigned row_end = graph.row_map( irow + 1 ); - for ( unsigned i = row_beg + 1 ; i < row_end ; ++i ) { - const unsigned elem = graph.entries(i,0); - const unsigned local = graph.entries(i,1); - unsigned j = i ; - for ( ; row_beg < j && elem < graph.entries(j-1,0) ; --j ) { - graph.entries(j,0) = graph.entries(j-1,0); - graph.entries(j,1) = graph.entries(j-1,1); - } - graph.entries(j,0) = elem ; - graph.entries(j,1) = local ; - } - } - - //------------------------------------ - - KOKKOS_INLINE_FUNCTION - void gather_fill( const unsigned irow ) const - { - const unsigned node_elem_begin = graph.row_map(irow); - const unsigned node_elem_end = graph.row_map(irow+1); - - // for each element that a node belongs to - - for ( unsigned i = node_elem_begin ; i < node_elem_end ; i++ ) { - - const unsigned elem_id = graph.entries( i, 0); - const unsigned row_index = graph.entries( i, 1); - - residual(irow) += elem_residual(elem_id, row_index); - - // for each node in a particular related element - // gather the contents of the element stiffness - // matrix that belong in irow - - for ( unsigned j = 0 ; j < ElemNodeCount ; ++j ) { - const unsigned A_index = elem_graph( elem_id , row_index , j ); - - jacobian.coeff( A_index ) += elem_jacobian( elem_id, row_index, j ); - } - } - } - - //------------------------------------ - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned iwork ) const - { - if ( phase == FILL_NODE_COUNT ) { - fill_node_count( iwork ); - } - else if ( phase == FILL_GRAPH_ENTRIES ) { - fill_graph_entries( iwork ); - } - else if ( phase == SORT_GRAPH_ENTRIES ) { - sort_graph_entries( iwork ); - } - else if ( phase == GATHER_FILL ) { - gather_fill( iwork ); - } - } - - //------------------------------------ - // parallel_scan: row offsets - - typedef unsigned value_type ; - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned irow , unsigned & update , const bool final ) const - { - // exclusive scan - if ( final ) { row_map( irow ) = update ; } - - update += row_count( irow ); - - if ( final ) { - if ( irow + 1 == row_count.dimension_0() ) { - row_map( irow + 1 ) = update ; - row_total() = update ; - } - } - } - - KOKKOS_INLINE_FUNCTION - void init( unsigned & update ) const { update = 0 ; } - - KOKKOS_INLINE_FUNCTION - void join( volatile unsigned & update , const volatile unsigned & input ) const { update += input ; } -}; - -} /* namespace FENL */ -} /* namespace Example */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { -namespace FENL { - -template< class FiniteElementMeshType , class SparseMatrixType > -class ElementComputation ; - - -template< class ExecSpace , BoxElemPart::ElemOrder Order , class CoordinateMap , typename ScalarType > -class ElementComputation< - Kokkos::Example::BoxElemFixture< ExecSpace , Order , CoordinateMap > , - Kokkos::Example::CrsMatrix< ScalarType , ExecSpace > > -{ -public: - - typedef Kokkos::Example::BoxElemFixture< ExecSpace, Order, CoordinateMap > mesh_type ; - typedef Kokkos::Example::HexElement_Data< mesh_type::ElemNode > element_data_type ; - - typedef Kokkos::Example::CrsMatrix< ScalarType , ExecSpace > sparse_matrix_type ; - typedef typename sparse_matrix_type::StaticCrsGraphType sparse_graph_type ; - - typedef ExecSpace execution_space ; - typedef ScalarType scalar_type ; - - static const unsigned SpatialDim = element_data_type::spatial_dimension ; - static const unsigned TensorDim = SpatialDim * SpatialDim ; - static const unsigned ElemNodeCount = element_data_type::element_node_count ; - static const unsigned FunctionCount = element_data_type::function_count ; - static const unsigned IntegrationCount = element_data_type::integration_count ; - - //------------------------------------ - - typedef typename mesh_type::node_coord_type node_coord_type ; - typedef typename mesh_type::elem_node_type elem_node_type ; - typedef Kokkos::View< scalar_type*[FunctionCount][FunctionCount] , execution_space > elem_matrices_type ; - typedef Kokkos::View< scalar_type*[FunctionCount] , execution_space > elem_vectors_type ; - typedef Kokkos::View< scalar_type* , execution_space > vector_type ; - - typedef typename NodeNodeGraph< elem_node_type , sparse_graph_type , ElemNodeCount >::ElemGraphType elem_graph_type ; - - //------------------------------------ - - - //------------------------------------ - // Computational data: - - const element_data_type elem_data ; - const elem_node_type elem_node_ids ; - const node_coord_type node_coords ; - const elem_graph_type elem_graph ; - const elem_matrices_type elem_jacobians ; - const elem_vectors_type elem_residuals ; - const vector_type solution ; - const vector_type residual ; - const sparse_matrix_type jacobian ; - const scalar_type coeff_K ; - - ElementComputation( const ElementComputation & rhs ) - : elem_data() - , elem_node_ids( rhs.elem_node_ids ) - , node_coords( rhs.node_coords ) - , elem_graph( rhs.elem_graph ) - , elem_jacobians( rhs.elem_jacobians ) - , elem_residuals( rhs.elem_residuals ) - , solution( rhs.solution ) - , residual( rhs.residual ) - , jacobian( rhs.jacobian ) - , coeff_K( rhs.coeff_K ) - {} - - // If the element->sparse_matrix graph is provided then perform atomic updates - // Otherwise fill per-element contributions for subequent gather-add into a residual and jacobian. - ElementComputation( const mesh_type & arg_mesh , - const scalar_type arg_coeff_K , - const vector_type & arg_solution , - const elem_graph_type & arg_elem_graph , - const sparse_matrix_type & arg_jacobian , - const vector_type & arg_residual ) - : elem_data() - , elem_node_ids( arg_mesh.elem_node() ) - , node_coords( arg_mesh.node_coord() ) - , elem_graph( arg_elem_graph ) - , elem_jacobians() - , elem_residuals() - , solution( arg_solution ) - , residual( arg_residual ) - , jacobian( arg_jacobian ) - , coeff_K( arg_coeff_K ) - {} - - ElementComputation( const mesh_type & arg_mesh , - const scalar_type arg_coeff_K , - const vector_type & arg_solution ) - : elem_data() - , elem_node_ids( arg_mesh.elem_node() ) - , node_coords( arg_mesh.node_coord() ) - , elem_graph() - , elem_jacobians( "elem_jacobians" , arg_mesh.elem_count() ) - , elem_residuals( "elem_residuals" , arg_mesh.elem_count() ) - , solution( arg_solution ) - , residual() - , jacobian() - , coeff_K( arg_coeff_K ) - {} - - //------------------------------------ - - void apply() const - { - parallel_for( elem_node_ids.dimension_0() , *this ); - } - - //------------------------------------ - - static const unsigned FLOPS_transform_gradients = - /* Jacobian */ FunctionCount * TensorDim * 2 + - /* Inverse jacobian */ TensorDim * 6 + 6 + - /* Gradient transform */ FunctionCount * 15 ; - - KOKKOS_INLINE_FUNCTION - float transform_gradients( - const float grad[][ FunctionCount ] , // Gradient of bases master element - const double x[] , - const double y[] , - const double z[] , - float dpsidx[] , - float dpsidy[] , - float dpsidz[] ) const - { - enum { j11 = 0 , j12 = 1 , j13 = 2 , - j21 = 3 , j22 = 4 , j23 = 5 , - j31 = 6 , j32 = 7 , j33 = 8 }; - - // Jacobian accumulation: - - double J[ TensorDim ] = { 0, 0, 0, 0, 0, 0, 0, 0, 0 }; - - for( unsigned i = 0; i < FunctionCount ; ++i ) { - const double x1 = x[i] ; - const double x2 = y[i] ; - const double x3 = z[i] ; - - const float g1 = grad[0][i] ; - const float g2 = grad[1][i] ; - const float g3 = grad[2][i] ; - - J[j11] += g1 * x1 ; - J[j12] += g1 * x2 ; - J[j13] += g1 * x3 ; - - J[j21] += g2 * x1 ; - J[j22] += g2 * x2 ; - J[j23] += g2 * x3 ; - - J[j31] += g3 * x1 ; - J[j32] += g3 * x2 ; - J[j33] += g3 * x3 ; - } - - // Inverse jacobian: - - float invJ[ TensorDim ] = { - static_cast( J[j22] * J[j33] - J[j23] * J[j32] ) , - static_cast( J[j13] * J[j32] - J[j12] * J[j33] ) , - static_cast( J[j12] * J[j23] - J[j13] * J[j22] ) , - - static_cast( J[j23] * J[j31] - J[j21] * J[j33] ) , - static_cast( J[j11] * J[j33] - J[j13] * J[j31] ) , - static_cast( J[j13] * J[j21] - J[j11] * J[j23] ) , - - static_cast( J[j21] * J[j32] - J[j22] * J[j31] ) , - static_cast( J[j12] * J[j31] - J[j11] * J[j32] ) , - static_cast( J[j11] * J[j22] - J[j12] * J[j21] ) }; - - const float detJ = J[j11] * invJ[j11] + - J[j21] * invJ[j12] + - J[j31] * invJ[j13] ; - - const float detJinv = 1.0 / detJ ; - - for ( unsigned i = 0 ; i < TensorDim ; ++i ) { invJ[i] *= detJinv ; } - - // Transform gradients: - - for( unsigned i = 0; i < FunctionCount ; ++i ) { - const float g0 = grad[0][i]; - const float g1 = grad[1][i]; - const float g2 = grad[2][i]; - - dpsidx[i] = g0 * invJ[j11] + g1 * invJ[j12] + g2 * invJ[j13]; - dpsidy[i] = g0 * invJ[j21] + g1 * invJ[j22] + g2 * invJ[j23]; - dpsidz[i] = g0 * invJ[j31] + g1 * invJ[j32] + g2 * invJ[j33]; - } - - return detJ ; - } - - KOKKOS_INLINE_FUNCTION - void contributeResidualJacobian( - const float coeff_k , - const double dof_values[] , - const float dpsidx[] , - const float dpsidy[] , - const float dpsidz[] , - const float detJ , - const float integ_weight , - const float bases_vals[] , - double elem_res[] , - double elem_mat[][ FunctionCount ] ) const - { - double value_at_pt = 0 ; - double gradx_at_pt = 0 ; - double grady_at_pt = 0 ; - double gradz_at_pt = 0 ; - - for ( unsigned m = 0 ; m < FunctionCount ; m++ ) { - value_at_pt += dof_values[m] * bases_vals[m] ; - gradx_at_pt += dof_values[m] * dpsidx[m] ; - grady_at_pt += dof_values[m] * dpsidy[m] ; - gradz_at_pt += dof_values[m] * dpsidz[m] ; - } - - const scalar_type k_detJ_weight = coeff_k * detJ * integ_weight ; - const double res_val = value_at_pt * value_at_pt * detJ * integ_weight ; - const double mat_val = 2.0 * value_at_pt * detJ * integ_weight ; - - // $$ R_i = \int_{\Omega} \nabla \phi_i \cdot (k \nabla T) + \phi_i T^2 d \Omega $$ - // $$ J_{i,j} = \frac{\partial R_i}{\partial T_j} = \int_{\Omega} k \nabla \phi_i \cdot \nabla \phi_j + 2 \phi_i \phi_j T d \Omega $$ - - for ( unsigned m = 0; m < FunctionCount; ++m) { - double * const mat = elem_mat[m] ; - const float bases_val_m = bases_vals[m]; - const float dpsidx_m = dpsidx[m] ; - const float dpsidy_m = dpsidy[m] ; - const float dpsidz_m = dpsidz[m] ; - - elem_res[m] += k_detJ_weight * ( dpsidx_m * gradx_at_pt + - dpsidy_m * grady_at_pt + - dpsidz_m * gradz_at_pt ) + - res_val * bases_val_m ; - - for( unsigned n = 0; n < FunctionCount; n++) { - - mat[n] += k_detJ_weight * ( dpsidx_m * dpsidx[n] + - dpsidy_m * dpsidy[n] + - dpsidz_m * dpsidz[n] ) + - mat_val * bases_val_m * bases_vals[n]; - } - } - } - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned ielem ) const - { - // Gather nodal coordinates and solution vector: - - double x[ FunctionCount ] ; - double y[ FunctionCount ] ; - double z[ FunctionCount ] ; - double val[ FunctionCount ] ; - unsigned node_index[ ElemNodeCount ]; - - for ( unsigned i = 0 ; i < ElemNodeCount ; ++i ) { - const unsigned ni = elem_node_ids( ielem , i ); - - node_index[i] = ni ; - - x[i] = node_coords( ni , 0 ); - y[i] = node_coords( ni , 1 ); - z[i] = node_coords( ni , 2 ); - - val[i] = solution( ni ); - } - - - double elem_vec[ FunctionCount ] ; - double elem_mat[ FunctionCount ][ FunctionCount ] ; - - for( unsigned i = 0; i < FunctionCount ; i++ ) { - elem_vec[i] = 0 ; - for( unsigned j = 0; j < FunctionCount ; j++){ - elem_mat[i][j] = 0 ; - } - } - - - for ( unsigned i = 0 ; i < IntegrationCount ; ++i ) { - float dpsidx[ FunctionCount ] ; - float dpsidy[ FunctionCount ] ; - float dpsidz[ FunctionCount ] ; - - const float detJ = - transform_gradients( elem_data.gradients[i] , x , y , z , - dpsidx , dpsidy , dpsidz ); - - contributeResidualJacobian( coeff_K , - val , dpsidx , dpsidy , dpsidz , - detJ , - elem_data.weights[i] , - elem_data.values[i] , - elem_vec , elem_mat ); - } - -#if 0 - -if ( 1 == ielem ) { - printf("ElemResidual { %f %f %f %f %f %f %f %f }\n", - elem_vec[0], elem_vec[1], elem_vec[2], elem_vec[3], - elem_vec[4], elem_vec[5], elem_vec[6], elem_vec[7]); - - printf("ElemJacobian {\n"); - - for ( unsigned j = 0 ; j < FunctionCount ; ++j ) { - printf(" { %f %f %f %f %f %f %f %f }\n", - elem_mat[j][0], elem_mat[j][1], elem_mat[j][2], elem_mat[j][3], - elem_mat[j][4], elem_mat[j][5], elem_mat[j][6], elem_mat[j][7]); - } - printf("}\n"); -} - -#endif - - if ( ! residual.dimension_0() ) { - for( unsigned i = 0; i < FunctionCount ; i++){ - elem_residuals(ielem, i) = elem_vec[i] ; - for( unsigned j = 0; j < FunctionCount ; j++){ - elem_jacobians(ielem, i, j) = elem_mat[i][j] ; - } - } - } - else { - for( unsigned i = 0 ; i < FunctionCount ; i++ ) { - const unsigned row = node_index[i] ; - if ( row < residual.dimension_0() ) { - atomic_fetch_add( & residual( row ) , elem_vec[i] ); - - for( unsigned j = 0 ; j < FunctionCount ; j++ ) { - const unsigned entry = elem_graph( ielem , i , j ); - if ( entry != ~0u ) { - atomic_fetch_add( & jacobian.coeff( entry ) , elem_mat[i][j] ); - } - } - } - } - } - } -}; /* ElementComputation */ - -//---------------------------------------------------------------------------- - -template< class FixtureType , class SparseMatrixType > -class DirichletComputation ; - -template< class ExecSpace , BoxElemPart::ElemOrder Order , class CoordinateMap , typename ScalarType > -class DirichletComputation< - Kokkos::Example::BoxElemFixture< ExecSpace , Order , CoordinateMap > , - Kokkos::Example::CrsMatrix< ScalarType , ExecSpace > > -{ -public: - - typedef Kokkos::Example::BoxElemFixture< ExecSpace, Order, CoordinateMap > mesh_type ; - typedef typename mesh_type::node_coord_type node_coord_type ; - typedef typename node_coord_type::value_type scalar_coord_type ; - - typedef Kokkos::Example::CrsMatrix< ScalarType , ExecSpace > sparse_matrix_type ; - typedef typename sparse_matrix_type::StaticCrsGraphType sparse_graph_type ; - - typedef ExecSpace execution_space ; - typedef ScalarType scalar_type ; - - //------------------------------------ - - typedef Kokkos::View< scalar_type* , execution_space > vector_type ; - - //------------------------------------ - // Computational data: - - const node_coord_type node_coords ; - const vector_type solution ; - const sparse_matrix_type jacobian ; - const vector_type residual ; - const scalar_type bc_lower_value ; - const scalar_type bc_upper_value ; - const scalar_coord_type bc_lower_limit ; - const scalar_coord_type bc_upper_limit ; - const unsigned bc_plane ; - const unsigned node_count ; - bool init ; - - - DirichletComputation( const mesh_type & arg_mesh , - const vector_type & arg_solution , - const sparse_matrix_type & arg_jacobian , - const vector_type & arg_residual , - const unsigned arg_bc_plane , - const scalar_type arg_bc_lower_value , - const scalar_type arg_bc_upper_value ) - : node_coords( arg_mesh.node_coord() ) - , solution( arg_solution ) - , jacobian( arg_jacobian ) - , residual( arg_residual ) - , bc_lower_value( arg_bc_lower_value ) - , bc_upper_value( arg_bc_upper_value ) - , bc_lower_limit( std::numeric_limits::epsilon() ) - , bc_upper_limit( scalar_coord_type(1) - std::numeric_limits::epsilon() ) - , bc_plane( arg_bc_plane ) - , node_count( arg_mesh.node_count_owned() ) - , init( false ) - { - parallel_for( node_count , *this ); - init = true ; - } - - void apply() const - { - parallel_for( node_count , *this ); - } - - //------------------------------------ - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned inode ) const - { - // Apply dirichlet boundary condition on the Solution and Residual vectors. - // To maintain the symmetry of the original global stiffness matrix, - // zero out the columns that correspond to boundary conditions, and - // update the residual vector accordingly - - const unsigned iBeg = jacobian.graph.row_map[inode]; - const unsigned iEnd = jacobian.graph.row_map[inode+1]; - - const scalar_coord_type c = node_coords(inode,bc_plane); - const bool bc_lower = c <= bc_lower_limit ; - const bool bc_upper = bc_upper_limit <= c ; - - if ( ! init ) { - solution(inode) = bc_lower ? bc_lower_value : ( - bc_upper ? bc_upper_value : 0 ); - } - else { - if ( bc_lower || bc_upper ) { - - residual(inode) = 0 ; - - // zero each value on the row, and leave a one - // on the diagonal - - for( unsigned i = iBeg ; i < iEnd ; ++i ) { - jacobian.coeff(i) = int(inode) == int(jacobian.graph.entries(i)) ? 1 : 0 ; - } - } - else { - - // Find any columns that are boundary conditions. - // Clear them and adjust the residual vector - - for( unsigned i = iBeg ; i < iEnd ; ++i ) { - const unsigned cnode = jacobian.graph.entries(i) ; - const scalar_coord_type cc = node_coords(cnode,bc_plane); - - if ( ( cc <= bc_lower_limit ) || ( bc_upper_limit <= cc ) ) { - jacobian.coeff(i) = 0 ; - } - } - } - } - } -}; - -} /* namespace FENL */ -} /* namespace Example */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - -/* A Cuda-specific specialization for the element computation functor. */ -#if defined( __CUDACC__ ) -// #include -#endif - -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_EXAMPLE_FENLFUNCTORS_HPP */ - diff --git a/lib/kokkos/example/fenl/fenl_impl.hpp b/lib/kokkos/example/fenl/fenl_impl.hpp deleted file mode 100644 index 9c57da2989..0000000000 --- a/lib/kokkos/example/fenl/fenl_impl.hpp +++ /dev/null @@ -1,598 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXAMPLE_FENL_IMPL_HPP -#define KOKKOS_EXAMPLE_FENL_IMPL_HPP - -#include - -// Kokkos libraries' headers: - -#include -#include -#include - -// Examples headers: - -#include -#include -#include - -#include -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { -namespace FENL { - -inline -double maximum( MPI_Comm comm , double local ) -{ - double global = local ; -#if defined( KOKKOS_HAVE_MPI ) - MPI_Allreduce( & local , & global , 1 , MPI_DOUBLE , MPI_MAX , comm ); -#endif - return global ; -} - -} /* namespace FENL */ -} /* namespace Example */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { -namespace FENL { - -class ManufacturedSolution { -public: - - // Manufactured solution for one dimensional nonlinear PDE - // - // -K T_zz + T^2 = 0 ; T(zmin) = T_zmin ; T(zmax) = T_zmax - // - // Has an analytic solution of the form: - // - // T(z) = ( a ( z - zmin ) + b )^(-2) where K = 1 / ( 6 a^2 ) - // - // Given T_0 and T_L compute K for this analytic solution. - // - // Two analytic solutions: - // - // Solution with singularity: - // , a( ( 1.0 / sqrt(T_zmax) + 1.0 / sqrt(T_zmin) ) / ( zmax - zmin ) ) - // , b( -1.0 / sqrt(T_zmin) ) - // - // Solution without singularity: - // , a( ( 1.0 / sqrt(T_zmax) - 1.0 / sqrt(T_zmin) ) / ( zmax - zmin ) ) - // , b( 1.0 / sqrt(T_zmin) ) - - const double zmin ; - const double zmax ; - const double T_zmin ; - const double T_zmax ; - const double a ; - const double b ; - const double K ; - - ManufacturedSolution( const double arg_zmin , - const double arg_zmax , - const double arg_T_zmin , - const double arg_T_zmax ) - : zmin( arg_zmin ) - , zmax( arg_zmax ) - , T_zmin( arg_T_zmin ) - , T_zmax( arg_T_zmax ) - , a( ( 1.0 / sqrt(T_zmax) - 1.0 / sqrt(T_zmin) ) / ( zmax - zmin ) ) - , b( 1.0 / sqrt(T_zmin) ) - , K( 1.0 / ( 6.0 * a * a ) ) - {} - - double operator()( const double z ) const - { - const double tmp = a * ( z - zmin ) + b ; - return 1.0 / ( tmp * tmp ); - } -}; - -} /* namespace FENL */ -} /* namespace Example */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { -namespace FENL { - -template < class Space , BoxElemPart::ElemOrder ElemOrder > -Perf fenl( - MPI_Comm comm , - const int use_print , - const int use_trials , - const int use_atomic , - const int use_elems[] ) -{ - typedef Kokkos::Example::BoxElemFixture< Space , ElemOrder > FixtureType ; - - typedef Kokkos::Example::CrsMatrix< double , Space > - SparseMatrixType ; - - typedef typename SparseMatrixType::StaticCrsGraphType - SparseGraphType ; - - typedef Kokkos::Example::FENL::NodeNodeGraph< typename FixtureType::elem_node_type , SparseGraphType , FixtureType::ElemNode > - NodeNodeGraphType ; - - typedef Kokkos::Example::FENL::ElementComputation< FixtureType , SparseMatrixType > - ElementComputationType ; - - typedef Kokkos::Example::FENL::DirichletComputation< FixtureType , SparseMatrixType > - DirichletComputationType ; - - typedef NodeElemGatherFill< ElementComputationType > - NodeElemGatherFillType ; - - typedef typename ElementComputationType::vector_type VectorType ; - - typedef Kokkos::Example::VectorImport< - typename FixtureType::comm_list_type , - typename FixtureType::send_nodeid_type , - VectorType > ImportType ; - - //------------------------------------ - - const unsigned newton_iteration_limit = 10 ; - const double newton_iteration_tolerance = 1e-7 ; - const unsigned cg_iteration_limit = 200 ; - const double cg_iteration_tolerance = 1e-7 ; - - //------------------------------------ - - const int print_flag = use_print && Kokkos::Impl::is_same< Kokkos::HostSpace , typename Space::memory_space >::value ; - - int comm_rank ; - int comm_size ; - - MPI_Comm_rank( comm , & comm_rank ); - MPI_Comm_size( comm , & comm_size ); - - // Decompose by node to avoid mpi-communication for assembly - - const float bubble_x = 1.0 ; - const float bubble_y = 1.0 ; - const float bubble_z = 1.0 ; - - const FixtureType fixture( BoxElemPart::DecomposeNode , comm_size , comm_rank , - use_elems[0] , use_elems[1] , use_elems[2] , - bubble_x , bubble_y , bubble_z ); - - - { - int global_error = ! fixture.ok(); - -#if defined( KOKKOS_HAVE_MPI ) - int local_error = global_error ; - global_error = 0 ; - MPI_Allreduce( & local_error , & global_error , 1 , MPI_INT , MPI_SUM , comm ); -#endif - - if ( global_error ) { - throw std::runtime_error(std::string("Error generating finite element fixture")); - } - } - - //------------------------------------ - - const ImportType comm_nodal_import( - comm , - fixture.recv_node() , - fixture.send_node() , - fixture.send_nodeid() , - fixture.node_count_owned() , - fixture.node_count() - fixture.node_count_owned() ); - - //------------------------------------ - - const double bc_lower_value = 1 ; - const double bc_upper_value = 2 ; - - const Kokkos::Example::FENL::ManufacturedSolution - manufactured_solution( 0 , 1 , bc_lower_value , bc_upper_value ); - - //------------------------------------ - - for ( int k = 0 ; k < comm_size && use_print ; ++k ) { - if ( k == comm_rank ) { - typename FixtureType::node_grid_type::HostMirror - h_node_grid = Kokkos::create_mirror_view( fixture.node_grid() ); - - typename FixtureType::node_coord_type::HostMirror - h_node_coord = Kokkos::create_mirror_view( fixture.node_coord() ); - - typename FixtureType::elem_node_type::HostMirror - h_elem_node = Kokkos::create_mirror_view( fixture.elem_node() ); - - Kokkos::deep_copy( h_node_grid , fixture.node_grid() ); - Kokkos::deep_copy( h_node_coord , fixture.node_coord() ); - Kokkos::deep_copy( h_elem_node , fixture.elem_node() ); - - std::cout << "MPI[" << comm_rank << "]" << std::endl ; - std::cout << "Node grid {" ; - for ( unsigned inode = 0 ; inode < fixture.node_count() ; ++inode ) { - std::cout << " (" << h_node_grid(inode,0) - << "," << h_node_grid(inode,1) - << "," << h_node_grid(inode,2) - << ")" ; - } - std::cout << " }" << std::endl ; - - std::cout << "Node coord {" ; - for ( unsigned inode = 0 ; inode < fixture.node_count() ; ++inode ) { - std::cout << " (" << h_node_coord(inode,0) - << "," << h_node_coord(inode,1) - << "," << h_node_coord(inode,2) - << ")" ; - } - std::cout << " }" << std::endl ; - - std::cout << "Manufactured solution" - << " a[" << manufactured_solution.a << "]" - << " b[" << manufactured_solution.b << "]" - << " K[" << manufactured_solution.K << "]" - << " {" ; - for ( unsigned inode = 0 ; inode < fixture.node_count() ; ++inode ) { - std::cout << " " << manufactured_solution( h_node_coord( inode , 2 ) ); - } - std::cout << " }" << std::endl ; - - std::cout << "ElemNode {" << std::endl ; - for ( unsigned ielem = 0 ; ielem < fixture.elem_count() ; ++ielem ) { - std::cout << " elem[" << ielem << "]{" ; - for ( unsigned inode = 0 ; inode < FixtureType::ElemNode ; ++inode ) { - std::cout << " " << h_elem_node(ielem,inode); - } - std::cout << " }{" ; - for ( unsigned inode = 0 ; inode < FixtureType::ElemNode ; ++inode ) { - std::cout << " (" << h_node_grid(h_elem_node(ielem,inode),0) - << "," << h_node_grid(h_elem_node(ielem,inode),1) - << "," << h_node_grid(h_elem_node(ielem,inode),2) - << ")" ; - } - std::cout << " }" << std::endl ; - } - std::cout << "}" << std::endl ; - } - std::cout.flush(); - MPI_Barrier( comm ); - } - - //------------------------------------ - - Kokkos::Impl::Timer wall_clock ; - - Perf perf_stats = Perf() ; - - for ( int itrial = 0 ; itrial < use_trials ; ++itrial ) { - - Perf perf = Perf() ; - - perf.global_elem_count = fixture.elem_count_global(); - perf.global_node_count = fixture.node_count_global(); - - //---------------------------------- - // Create the sparse matrix graph and element-to-graph map - // from the element->to->node identifier array. - // The graph only has rows for the owned nodes. - - typename NodeNodeGraphType::Times graph_times; - - const NodeNodeGraphType - mesh_to_graph( fixture.elem_node() , fixture.node_count_owned(), graph_times ); - - perf.map_ratio = maximum(comm, graph_times.ratio); - perf.fill_node_set = maximum(comm, graph_times.fill_node_set); - perf.scan_node_count = maximum(comm, graph_times.scan_node_count); - perf.fill_graph_entries = maximum(comm, graph_times.fill_graph_entries); - perf.sort_graph_entries = maximum(comm, graph_times.sort_graph_entries); - perf.fill_element_graph = maximum(comm, graph_times.fill_element_graph); - - wall_clock.reset(); - // Create the sparse matrix from the graph: - - SparseMatrixType jacobian( mesh_to_graph.graph ); - - Space::fence(); - - perf.create_sparse_matrix = maximum( comm , wall_clock.seconds() ); - - //---------------------------------- - - for ( int k = 0 ; k < comm_size && print_flag ; ++k ) { - if ( k == comm_rank ) { - const unsigned nrow = jacobian.graph.numRows(); - std::cout << "MPI[" << comm_rank << "]" << std::endl ; - std::cout << "JacobianGraph {" << std::endl ; - for ( unsigned irow = 0 ; irow < nrow ; ++irow ) { - std::cout << " row[" << irow << "]{" ; - const unsigned entry_end = jacobian.graph.row_map(irow+1); - for ( unsigned entry = jacobian.graph.row_map(irow) ; entry < entry_end ; ++entry ) { - std::cout << " " << jacobian.graph.entries(entry); - } - std::cout << " }" << std::endl ; - } - std::cout << "}" << std::endl ; - - std::cout << "ElemGraph {" << std::endl ; - for ( unsigned ielem = 0 ; ielem < mesh_to_graph.elem_graph.dimension_0() ; ++ielem ) { - std::cout << " elem[" << ielem << "]{" ; - for ( unsigned irow = 0 ; irow < mesh_to_graph.elem_graph.dimension_1() ; ++irow ) { - std::cout << " {" ; - for ( unsigned icol = 0 ; icol < mesh_to_graph.elem_graph.dimension_2() ; ++icol ) { - std::cout << " " << mesh_to_graph.elem_graph(ielem,irow,icol); - } - std::cout << " }" ; - } - std::cout << " }" << std::endl ; - } - std::cout << "}" << std::endl ; - } - std::cout.flush(); - MPI_Barrier( comm ); - } - - //---------------------------------- - - // Allocate solution vector for each node in the mesh and residual vector for each owned node - const VectorType nodal_solution( "nodal_solution" , fixture.node_count() ); - const VectorType nodal_residual( "nodal_residual" , fixture.node_count_owned() ); - const VectorType nodal_delta( "nodal_delta" , fixture.node_count_owned() ); - - // Create element computation functor - const ElementComputationType elemcomp( - use_atomic ? ElementComputationType( fixture , manufactured_solution.K , nodal_solution , - mesh_to_graph.elem_graph , jacobian , nodal_residual ) - : ElementComputationType( fixture , manufactured_solution.K , nodal_solution ) ); - - const NodeElemGatherFillType gatherfill( - use_atomic ? NodeElemGatherFillType() - : NodeElemGatherFillType( fixture.elem_node() , - mesh_to_graph.elem_graph , - nodal_residual , - jacobian , - elemcomp.elem_residuals , - elemcomp.elem_jacobians ) ); - - // Create boundary condition functor - const DirichletComputationType dirichlet( - fixture , nodal_solution , jacobian , nodal_residual , - 2 /* apply at 'z' ends */ , - manufactured_solution.T_zmin , - manufactured_solution.T_zmax ); - - //---------------------------------- - // Nonlinear Newton iteration: - - double residual_norm_init = 0 ; - - for ( perf.newton_iter_count = 0 ; - perf.newton_iter_count < newton_iteration_limit ; - ++perf.newton_iter_count ) { - - //-------------------------------- - - comm_nodal_import( nodal_solution ); - - //-------------------------------- - // Element contributions to residual and jacobian - - wall_clock.reset(); - - Kokkos::deep_copy( nodal_residual , double(0) ); - Kokkos::deep_copy( jacobian.coeff , double(0) ); - - elemcomp.apply(); - - if ( ! use_atomic ) { - gatherfill.apply(); - } - - Space::fence(); - perf.fill_time = maximum( comm , wall_clock.seconds() ); - - //-------------------------------- - // Apply boundary conditions - - wall_clock.reset(); - - dirichlet.apply(); - - Space::fence(); - perf.bc_time = maximum( comm , wall_clock.seconds() ); - - //-------------------------------- - // Evaluate convergence - - const double residual_norm = - std::sqrt( - Kokkos::Example::all_reduce( - Kokkos::Example::dot( fixture.node_count_owned() , nodal_residual, nodal_residual ) , comm ) ); - - perf.newton_residual = residual_norm ; - - if ( 0 == perf.newton_iter_count ) { residual_norm_init = residual_norm ; } - - if ( residual_norm < residual_norm_init * newton_iteration_tolerance ) { break ; } - - //-------------------------------- - // Solve for nonlinear update - - CGSolveResult cg_result ; - - Kokkos::Example::cgsolve( comm_nodal_import - , jacobian - , nodal_residual - , nodal_delta - , cg_iteration_limit - , cg_iteration_tolerance - , & cg_result - ); - - // Update solution vector - - Kokkos::Example::waxpby( fixture.node_count_owned() , nodal_solution , -1.0 , nodal_delta , 1.0 , nodal_solution ); - - perf.cg_iter_count += cg_result.iteration ; - perf.matvec_time += cg_result.matvec_time ; - perf.cg_time += cg_result.iter_time ; - - //-------------------------------- - - if ( print_flag ) { - const double delta_norm = - std::sqrt( - Kokkos::Example::all_reduce( - Kokkos::Example::dot( fixture.node_count_owned() , nodal_delta, nodal_delta ) , comm ) ); - - if ( 0 == comm_rank ) { - std::cout << "Newton iteration[" << perf.newton_iter_count << "]" - << " residual[" << perf.newton_residual << "]" - << " update[" << delta_norm << "]" - << " cg_iteration[" << cg_result.iteration << "]" - << " cg_residual[" << cg_result.norm_res << "]" - << std::endl ; - } - - for ( int k = 0 ; k < comm_size ; ++k ) { - if ( k == comm_rank ) { - const unsigned nrow = jacobian.graph.numRows(); - - std::cout << "MPI[" << comm_rank << "]" << std::endl ; - std::cout << "Residual {" ; - for ( unsigned irow = 0 ; irow < nrow ; ++irow ) { - std::cout << " " << nodal_residual(irow); - } - std::cout << " }" << std::endl ; - - std::cout << "Delta {" ; - for ( unsigned irow = 0 ; irow < nrow ; ++irow ) { - std::cout << " " << nodal_delta(irow); - } - std::cout << " }" << std::endl ; - - std::cout << "Solution {" ; - for ( unsigned irow = 0 ; irow < nrow ; ++irow ) { - std::cout << " " << nodal_solution(irow); - } - std::cout << " }" << std::endl ; - - std::cout << "Jacobian[ " - << jacobian.graph.numRows() << " x " << Kokkos::maximum_entry( jacobian.graph ) - << " ] {" << std::endl ; - for ( unsigned irow = 0 ; irow < nrow ; ++irow ) { - std::cout << " {" ; - const unsigned entry_end = jacobian.graph.row_map(irow+1); - for ( unsigned entry = jacobian.graph.row_map(irow) ; entry < entry_end ; ++entry ) { - std::cout << " (" << jacobian.graph.entries(entry) - << "," << jacobian.coeff(entry) - << ")" ; - } - std::cout << " }" << std::endl ; - } - std::cout << "}" << std::endl ; - } - std::cout.flush(); - MPI_Barrier( comm ); - } - } - //-------------------------------- - } - - // Evaluate solution error - - if ( 0 == itrial ) { - const typename FixtureType::node_coord_type::HostMirror - h_node_coord = Kokkos::create_mirror_view( fixture.node_coord() ); - - const typename VectorType::HostMirror - h_nodal_solution = Kokkos::create_mirror_view( nodal_solution ); - - Kokkos::deep_copy( h_node_coord , fixture.node_coord() ); - Kokkos::deep_copy( h_nodal_solution , nodal_solution ); - - double error_max = 0 ; - for ( unsigned inode = 0 ; inode < fixture.node_count_owned() ; ++inode ) { - const double answer = manufactured_solution( h_node_coord( inode , 2 ) ); - const double error = ( h_nodal_solution(inode) - answer ) / answer ; - if ( error_max < fabs( error ) ) { error_max = fabs( error ); } - } - - perf.error_max = std::sqrt( Kokkos::Example::all_reduce_max( error_max , comm ) ); - - perf_stats = perf ; - } - else { - perf_stats.fill_node_set = std::min( perf_stats.fill_node_set , perf.fill_node_set ); - perf_stats.scan_node_count = std::min( perf_stats.scan_node_count , perf.scan_node_count ); - perf_stats.fill_graph_entries = std::min( perf_stats.fill_graph_entries , perf.fill_graph_entries ); - perf_stats.sort_graph_entries = std::min( perf_stats.sort_graph_entries , perf.sort_graph_entries ); - perf_stats.fill_element_graph = std::min( perf_stats.fill_element_graph , perf.fill_element_graph ); - perf_stats.create_sparse_matrix = std::min( perf_stats.create_sparse_matrix , perf.create_sparse_matrix ); - perf_stats.fill_time = std::min( perf_stats.fill_time , perf.fill_time ); - perf_stats.bc_time = std::min( perf_stats.bc_time , perf.bc_time ); - perf_stats.cg_time = std::min( perf_stats.cg_time , perf.cg_time ); - } - } - - return perf_stats ; -} - -} /* namespace FENL */ -} /* namespace Example */ -} /* namespace Kokkos */ - -#endif /* #ifndef KOKKOS_EXAMPLE_FENL_IMPL_HPP */ - diff --git a/lib/kokkos/example/fenl/main.cpp b/lib/kokkos/example/fenl/main.cpp deleted file mode 100644 index 06005d97cb..0000000000 --- a/lib/kokkos/example/fenl/main.cpp +++ /dev/null @@ -1,422 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#include -#include -#include -#include - -#include -#include -#include -#include -#include -#include - -#include - -#include -#include - -// For vtune -#include -#include - -//---------------------------------------------------------------------------- - -enum { CMD_USE_THREADS = 0 - , CMD_USE_NUMA - , CMD_USE_CORE_PER_NUMA - , CMD_USE_CUDA - , CMD_USE_OPENMP - , CMD_USE_CUDA_DEV - , CMD_USE_FIXTURE_X - , CMD_USE_FIXTURE_Y - , CMD_USE_FIXTURE_Z - , CMD_USE_FIXTURE_BEGIN - , CMD_USE_FIXTURE_END - , CMD_USE_FIXTURE_QUADRATIC - , CMD_USE_ATOMIC - , CMD_USE_TRIALS - , CMD_VTUNE - , CMD_PRINT - , CMD_ECHO - , CMD_ERROR - , CMD_COUNT }; - -void print_cmdline( std::ostream & s , const int cmd[] ) -{ - if ( cmd[ CMD_USE_THREADS ] ) { - s << " Threads(" << cmd[ CMD_USE_THREADS ] - << ") NUMA(" << cmd[ CMD_USE_NUMA ] - << ") CORE_PER_NUMA(" << cmd[ CMD_USE_CORE_PER_NUMA ] - << ")" ; - } - if ( cmd[ CMD_USE_OPENMP ] ) { - s << " OpenMP(" << cmd[ CMD_USE_OPENMP ] - << ") NUMA(" << cmd[ CMD_USE_NUMA ] - << ") CORE_PER_NUMA(" << cmd[ CMD_USE_CORE_PER_NUMA ] - << ")" ; - } - if ( cmd[ CMD_USE_FIXTURE_X ] ) { - s << " Fixture(" << cmd[ CMD_USE_FIXTURE_X ] - << "x" << cmd[ CMD_USE_FIXTURE_Y ] - << "x" << cmd[ CMD_USE_FIXTURE_Z ] - << ")" ; - } - if ( cmd[ CMD_USE_FIXTURE_BEGIN ] ) { - s << " Fixture( " << cmd[ CMD_USE_FIXTURE_BEGIN ] - << " .. " << cmd[ CMD_USE_FIXTURE_END ] - << " )" ; - } - if ( cmd[ CMD_USE_FIXTURE_QUADRATIC ] ) { - s << " Quadratic-Element" ; - } - if ( cmd[ CMD_USE_CUDA ] ) { - s << " CUDA(" << cmd[ CMD_USE_CUDA_DEV ] << ")" ; - } - if ( cmd[ CMD_USE_ATOMIC ] ) { - s << " ATOMIC" ; - } - if ( cmd[ CMD_USE_TRIALS ] ) { - s << " TRIALS(" << cmd[ CMD_USE_TRIALS ] << ")" ; - } - if ( cmd[ CMD_VTUNE ] ) { - s << " VTUNE" ; - } - if ( cmd[ CMD_PRINT ] ) { - s << " PRINT" ; - } - s << std::endl ; -} - -void print_perf_value( std::ostream & s , const std::vector & widths, const Kokkos::Example::FENL::Perf & perf ) -{ - int i=0; - s << std::setw(widths[i++]) << perf.global_elem_count << " ,"; - s << std::setw(widths[i++]) << perf.global_node_count << " ,"; - s << std::setw(widths[i++]) << perf.newton_iter_count << " ,"; - s << std::setw(widths[i++]) << perf.cg_iter_count << " ,"; - s << std::setw(widths[i++]) << perf.map_ratio << " ,"; - s << std::setw(widths[i++]) << ( perf.fill_node_set * 1000.0 ) / perf.global_node_count << " ,"; - s << std::setw(widths[i++]) << ( perf.scan_node_count * 1000.0 ) / perf.global_node_count << " ,"; - s << std::setw(widths[i++]) << ( perf.fill_graph_entries * 1000.0 ) / perf.global_node_count << " ,"; - s << std::setw(widths[i++]) << ( perf.sort_graph_entries * 1000.0 ) / perf.global_node_count << " ,"; - s << std::setw(widths[i++]) << ( perf.fill_element_graph * 1000.0 ) / perf.global_node_count << " ,"; - s << std::setw(widths[i++]) << ( perf.create_sparse_matrix * 1000.0 ) / perf.global_node_count << " ,"; - s << std::setw(widths[i++]) << ( perf.fill_time * 1000.0 ) / perf.global_node_count << " ,"; - s << std::setw(widths[i++]) << ( perf.bc_time * 1000.0 ) / perf.global_node_count << " ,"; - s << std::setw(widths[i++]) << ( ( perf.matvec_time * 1000.0 ) / perf.cg_iter_count ) / perf.global_node_count << " ,"; - s << std::setw(widths[i++]) << ( ( perf.cg_time * 1000.0 ) / perf.cg_iter_count ) / perf.global_node_count << " ,"; - s << std::setw(widths[i]) << perf.error_max; - s << std::endl ; -} - -template< class Device , Kokkos::Example::BoxElemPart::ElemOrder ElemOrder > -void run( MPI_Comm comm , const int cmd[] ) -{ - int comm_rank = 0 ; - -#if defined( KOKKOS_HAVE_MPI ) - MPI_Comm_rank( comm , & comm_rank ); -#else - comm = 0 ; -#endif - - - if ( 0 == comm_rank ) { - if ( cmd[ CMD_USE_THREADS ] ) { std::cout << "THREADS , " << cmd[ CMD_USE_THREADS ] ; } - else if ( cmd[ CMD_USE_OPENMP ] ) { std::cout << "OPENMP , " << cmd[ CMD_USE_OPENMP ] ; } - else if ( cmd[ CMD_USE_CUDA ] ) { std::cout << "CUDA" ; } - - if ( cmd[ CMD_USE_FIXTURE_QUADRATIC ] ) { std::cout << " , QUADRATIC-ELEMENT" ; } - else { std::cout << " , LINEAR-ELEMENT" ; } - - if ( cmd[ CMD_USE_ATOMIC ] ) { std::cout << " , USING ATOMICS" ; } - } - - std::vector< std::pair > headers; - - - headers.push_back(std::make_pair("ELEMS","count")); - headers.push_back(std::make_pair("NODES","count")); - headers.push_back(std::make_pair("NEWTON","iter")); - headers.push_back(std::make_pair("CG","iter")); - headers.push_back(std::make_pair("MAP_RATIO","ratio")); - headers.push_back(std::make_pair("SET_FILL/NODE","millisec")); - headers.push_back(std::make_pair("SCAN/NODE","millisec")); - headers.push_back(std::make_pair("GRAPH_FILL/NODE","millisec")); - headers.push_back(std::make_pair("SORT/NODE","millisec")); - headers.push_back(std::make_pair("ELEM_GRAPH_FILL/NODE","millisec")); - headers.push_back(std::make_pair("MATRIX_CREATE/NODE","millisec")); - headers.push_back(std::make_pair("MATRIX_FILL/NODE","millisec")); - headers.push_back(std::make_pair("BOUNDARY/NODE","millisec")); - headers.push_back(std::make_pair("MAT_VEC/ITER/ROW","millisec")); - headers.push_back(std::make_pair("CG/ITER/ROW","millisec")); - headers.push_back(std::make_pair("ERROR","ratio")); - - // find print widths - size_t min_width = 10; - std::vector< size_t > widths(headers.size()); - for (size_t i=0, ie=headers.size(); i - ( comm , cmd[CMD_PRINT], cmd[CMD_USE_TRIALS], cmd[CMD_USE_ATOMIC], nelem ) - : Kokkos::Example::FENL::fenl< Device , Kokkos::Example::BoxElemPart::ElemLinear > - ( comm , cmd[CMD_PRINT], cmd[CMD_USE_TRIALS], cmd[CMD_USE_ATOMIC], nelem ) - ; - - if ( 0 == comm_rank ) print_perf_value( std::cout , widths, perf ); - } - } - else { - int nelem[3] = { cmd[ CMD_USE_FIXTURE_X ] , - cmd[ CMD_USE_FIXTURE_Y ] , - cmd[ CMD_USE_FIXTURE_Z ] }; - - const Kokkos::Example::FENL::Perf perf = - cmd[ CMD_USE_FIXTURE_QUADRATIC ] - ? Kokkos::Example::FENL::fenl< Device , Kokkos::Example::BoxElemPart::ElemQuadratic > - ( comm , cmd[CMD_PRINT], cmd[CMD_USE_TRIALS], cmd[CMD_USE_ATOMIC], nelem ) - : Kokkos::Example::FENL::fenl< Device , Kokkos::Example::BoxElemPart::ElemLinear > - ( comm , cmd[CMD_PRINT], cmd[CMD_USE_TRIALS], cmd[CMD_USE_ATOMIC], nelem ) - ; - - if ( 0 == comm_rank ) print_perf_value( std::cout , widths, perf ); - } -} - -//---------------------------------------------------------------------------- - -int main( int argc , char ** argv ) -{ - int comm_rank = 0 ; - -#if defined( KOKKOS_HAVE_MPI ) - MPI_Init( & argc , & argv ); - MPI_Comm comm = MPI_COMM_WORLD ; - MPI_Comm_rank( comm , & comm_rank ); -#else - MPI_Comm comm = 0 ; - (void) comm ; // suppress warning -#endif - - int cmdline[ CMD_COUNT ] ; - - for ( int i = 0 ; i < CMD_COUNT ; ++i ) cmdline[i] = 0 ; - - if ( 0 == comm_rank ) { - for ( int i = 1 ; i < argc ; ++i ) { - if ( 0 == strcasecmp( argv[i] , "threads" ) ) { - cmdline[ CMD_USE_THREADS ] = atoi( argv[++i] ); - } - else if ( 0 == strcasecmp( argv[i] , "openmp" ) ) { - cmdline[ CMD_USE_OPENMP ] = atoi( argv[++i] ); - } - else if ( 0 == strcasecmp( argv[i] , "cores" ) ) { - sscanf( argv[++i] , "%dx%d" , - cmdline + CMD_USE_NUMA , - cmdline + CMD_USE_CORE_PER_NUMA ); - } - else if ( 0 == strcasecmp( argv[i] , "cuda" ) ) { - cmdline[ CMD_USE_CUDA ] = 1 ; - } - else if ( 0 == strcasecmp( argv[i] , "cuda-dev" ) ) { - cmdline[ CMD_USE_CUDA ] = 1 ; - cmdline[ CMD_USE_CUDA_DEV ] = atoi( argv[++i] ) ; - } - else if ( 0 == strcasecmp( argv[i] , "fixture" ) ) { - sscanf( argv[++i] , "%dx%dx%d" , - cmdline + CMD_USE_FIXTURE_X , - cmdline + CMD_USE_FIXTURE_Y , - cmdline + CMD_USE_FIXTURE_Z ); - } - else if ( 0 == strcasecmp( argv[i] , "fixture-range" ) ) { - sscanf( argv[++i] , "%d..%d" , - cmdline + CMD_USE_FIXTURE_BEGIN , - cmdline + CMD_USE_FIXTURE_END ); - } - else if ( 0 == strcasecmp( argv[i] , "fixture-quadratic" ) ) { - cmdline[ CMD_USE_FIXTURE_QUADRATIC ] = 1 ; - } - else if ( 0 == strcasecmp( argv[i] , "atomic" ) ) { - cmdline[ CMD_USE_ATOMIC ] = 1 ; - } - else if ( 0 == strcasecmp( argv[i] , "trials" ) ) { - cmdline[ CMD_USE_TRIALS ] = atoi( argv[++i] ) ; - } - else if ( 0 == strcasecmp( argv[i] , "vtune" ) ) { - cmdline[ CMD_VTUNE ] = 1 ; - } - else if ( 0 == strcasecmp( argv[i] , "print" ) ) { - cmdline[ CMD_PRINT ] = 1 ; - } - else if ( 0 == strcasecmp( argv[i] , "echo" ) ) { - cmdline[ CMD_ECHO ] = 1 ; - } - else { - cmdline[ CMD_ERROR ] = 1 ; - - std::cerr << "Unrecognized command line argument #" << i << ": " << argv[i] << std::endl ; - } - } - - if ( cmdline[ CMD_ECHO ] && 0 == comm_rank ) { print_cmdline( std::cout , cmdline ); } - } - -#if defined( KOKKOS_HAVE_MPI ) - MPI_Bcast( cmdline , CMD_COUNT , MPI_INT , 0 , comm ); -#endif - - if ( cmdline[ CMD_VTUNE ] ) { - std::stringstream cmd; - pid_t my_os_pid=getpid(); - const std::string vtune_loc = - "/usr/local/intel/vtune_amplifier_xe_2013/bin64/amplxe-cl"; - const std::string output_dir = "./vtune/vtune."; - const int p_rank = comm_rank; - cmd << vtune_loc - << " -collect hotspots -result-dir " << output_dir << p_rank - << " -target-pid " << my_os_pid << " &"; - if (p_rank == 0) - std::cout << cmd.str() << std::endl; - system(cmd.str().c_str()); - system("sleep 10"); - } - - if ( ! cmdline[ CMD_ERROR ] && ! cmdline[ CMD_ECHO ] ) { - - if ( ! cmdline[ CMD_USE_TRIALS ] ) { cmdline[ CMD_USE_TRIALS ] = 1 ; } - - if ( ! cmdline[ CMD_USE_FIXTURE_X ] && ! cmdline[ CMD_USE_FIXTURE_BEGIN ] ) { - cmdline[ CMD_USE_FIXTURE_X ] = 2 ; - cmdline[ CMD_USE_FIXTURE_Y ] = 2 ; - cmdline[ CMD_USE_FIXTURE_Z ] = 2 ; - } - -#if defined( KOKKOS_HAVE_PTHREAD ) - - if ( cmdline[ CMD_USE_THREADS ] ) { - - if ( cmdline[ CMD_USE_NUMA ] && cmdline[ CMD_USE_CORE_PER_NUMA ] ) { - Kokkos::Threads::initialize( cmdline[ CMD_USE_THREADS ] , - cmdline[ CMD_USE_NUMA ] , - cmdline[ CMD_USE_CORE_PER_NUMA ] ); - } - else { - Kokkos::Threads::initialize( cmdline[ CMD_USE_THREADS ] ); - } - - run< Kokkos::Threads , Kokkos::Example::BoxElemPart::ElemLinear >( comm , cmdline ); - - Kokkos::Threads::finalize(); - } - -#endif - -#if defined( KOKKOS_HAVE_OPENMP ) - - if ( cmdline[ CMD_USE_OPENMP ] ) { - - if ( cmdline[ CMD_USE_NUMA ] && cmdline[ CMD_USE_CORE_PER_NUMA ] ) { - Kokkos::OpenMP::initialize( cmdline[ CMD_USE_OPENMP ] , - cmdline[ CMD_USE_NUMA ] , - cmdline[ CMD_USE_CORE_PER_NUMA ] ); - } - else { - Kokkos::OpenMP::initialize( cmdline[ CMD_USE_OPENMP ] ); - } - - run< Kokkos::OpenMP , Kokkos::Example::BoxElemPart::ElemLinear >( comm , cmdline ); - - Kokkos::OpenMP::finalize(); - } - -#endif - -#if defined( KOKKOS_HAVE_CUDA ) - if ( cmdline[ CMD_USE_CUDA ] ) { - // Use the last device: - - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice( cmdline[ CMD_USE_CUDA_DEV ] ) ); - - run< Kokkos::Cuda , Kokkos::Example::BoxElemPart::ElemLinear >( comm , cmdline ); - - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); - } - -#endif - - } - -#if defined( KOKKOS_HAVE_MPI ) - MPI_Finalize(); -#endif - - return cmdline[ CMD_ERROR ] ? -1 : 0 ; -} - diff --git a/lib/kokkos/example/fixture/BoxElemFixture.hpp b/lib/kokkos/example/fixture/BoxElemFixture.hpp deleted file mode 100644 index 66d6e741af..0000000000 --- a/lib/kokkos/example/fixture/BoxElemFixture.hpp +++ /dev/null @@ -1,355 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXAMPLE_BOXELEMFIXTURE_HPP -#define KOKKOS_EXAMPLE_BOXELEMFIXTURE_HPP - -#include -#include - -#include - -#include -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { - -/** \brief Map a grid onto a unit cube with smooth nonlinear grading - * of the map. - */ -struct MapGridUnitCube { - - const float m_a ; - const float m_b ; - const float m_c ; - const size_t m_max_x ; - const size_t m_max_y ; - const size_t m_max_z ; - - MapGridUnitCube( const size_t grid_max_x , - const size_t grid_max_y , - const size_t grid_max_z , - const float bubble_x , - const float bubble_y , - const float bubble_z ) - : m_a( bubble_x ) - , m_b( bubble_y ) - , m_c( bubble_z ) - , m_max_x( grid_max_x ) - , m_max_y( grid_max_y ) - , m_max_z( grid_max_z ) - {} - - template< typename Scalar > - KOKKOS_INLINE_FUNCTION - void operator()( int grid_x , - int grid_y , - int grid_z , - Scalar & coord_x , - Scalar & coord_y , - Scalar & coord_z ) const - { - // Map to a unit cube [0,1]^3 - - const double x = double(grid_x) / double(m_max_x); - const double y = double(grid_y) / double(m_max_y); - const double z = double(grid_z) / double(m_max_z); - - coord_x = x + x * x * ( x - 1 ) * ( x - 1 ) * m_a ; - coord_y = y + y * y * ( y - 1 ) * ( y - 1 ) * m_b ; - coord_z = z + z * z * ( z - 1 ) * ( z - 1 ) * m_c ; - } -}; - -} // namespace Example -} // namespace Kokkos - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { - -/** \brief Generate a distributed unstructured finite element mesh - * from a partitioned NX*NY*NZ box of elements. - * - * Order owned nodes first followed by off-process nodes - * grouped by owning process. - */ -template< class Device , - BoxElemPart::ElemOrder Order , - class CoordinateMap = MapGridUnitCube > -class BoxElemFixture { -public: - - typedef Device execution_space ; - - enum { SpaceDim = 3 }; - enum { ElemNode = Order == BoxElemPart::ElemLinear ? 8 : - Order == BoxElemPart::ElemQuadratic ? 27 : 0 }; - -private: - - typedef Kokkos::Example::HexElement_TensorData< ElemNode > hex_data ; - - Kokkos::Example::BoxElemPart m_box_part ; - CoordinateMap m_coord_map ; - - Kokkos::View< double *[SpaceDim] , Device > m_node_coord ; - Kokkos::View< size_t *[SpaceDim] , Device > m_node_grid ; - Kokkos::View< size_t *[ElemNode] , Device > m_elem_node ; - Kokkos::View< size_t *[2] , Device > m_recv_node ; - Kokkos::View< size_t *[2] , Device > m_send_node ; - Kokkos::View< size_t * , Device > m_send_node_id ; - - unsigned char m_elem_node_local[ ElemNode ][4] ; - -public: - - typedef Kokkos::View< const size_t * [ElemNode], Device > elem_node_type ; - typedef Kokkos::View< const double * [SpaceDim], Device > node_coord_type ; - typedef Kokkos::View< const size_t * [SpaceDim], Device > node_grid_type ; - typedef Kokkos::View< const size_t * [2] , Device > comm_list_type ; - typedef Kokkos::View< const size_t * , Device > send_nodeid_type ; - - inline bool ok() const { return m_box_part.ok(); } - - KOKKOS_INLINE_FUNCTION - size_t node_count() const { return m_node_grid.dimension_0(); } - - KOKKOS_INLINE_FUNCTION - size_t node_count_owned() const { return m_box_part.owns_node_count(); } - - KOKKOS_INLINE_FUNCTION - size_t node_count_global() const { return m_box_part.global_node_count(); } - - KOKKOS_INLINE_FUNCTION - size_t elem_count() const { return m_elem_node.dimension_0(); } - - KOKKOS_INLINE_FUNCTION - size_t elem_count_global() const { return m_box_part.global_elem_count(); } - - KOKKOS_INLINE_FUNCTION - size_t elem_node_local( size_t inode , int k ) const - { return m_elem_node_local[inode][k] ; } - - KOKKOS_INLINE_FUNCTION - size_t node_grid( size_t inode , int iaxis ) const - { return m_node_grid(inode,iaxis); } - - KOKKOS_INLINE_FUNCTION - size_t node_global_index( size_t local ) const - { - const size_t tmp_node_grid[SpaceDim] = - { m_node_grid(local,0) , m_node_grid(local,1) , m_node_grid(local,2) }; - return m_box_part.global_node_id( tmp_node_grid ); - } - - KOKKOS_INLINE_FUNCTION - double node_coord( size_t inode , int iaxis ) const - { return m_node_coord(inode,iaxis); } - - KOKKOS_INLINE_FUNCTION - size_t node_grid_max( int iaxis ) const - { return m_box_part.global_coord_max(iaxis); } - - KOKKOS_INLINE_FUNCTION - size_t elem_node( size_t ielem , size_t inode ) const - { return m_elem_node(ielem,inode); } - - elem_node_type elem_node() const { return m_elem_node ; } - node_coord_type node_coord() const { return m_node_coord ; } - node_grid_type node_grid() const { return m_node_grid ; } - comm_list_type recv_node() const { return m_recv_node ; } - comm_list_type send_node() const { return m_send_node ; } - send_nodeid_type send_nodeid() const { return m_send_node_id ; } - - KOKKOS_INLINE_FUNCTION - BoxElemFixture( const BoxElemFixture & rhs ) - : m_box_part( rhs.m_box_part ) - , m_coord_map( rhs.m_coord_map ) - , m_node_coord( rhs.m_node_coord ) - , m_node_grid( rhs.m_node_grid ) - , m_elem_node( rhs.m_elem_node ) - , m_recv_node( rhs.m_recv_node ) - , m_send_node( rhs.m_send_node ) - , m_send_node_id( rhs.m_send_node_id ) - { - for ( int i = 0 ; i < ElemNode ; ++i ) { - m_elem_node_local[i][0] = rhs.m_elem_node_local[i][0] ; - m_elem_node_local[i][1] = rhs.m_elem_node_local[i][1] ; - m_elem_node_local[i][2] = rhs.m_elem_node_local[i][2] ; - m_elem_node_local[i][3] = 0 ; - } - } - - BoxElemFixture & operator = ( const BoxElemFixture & rhs ) - { - m_box_part = rhs.m_box_part ; - m_coord_map = rhs.m_coord_map ; - m_node_coord = rhs.m_node_coord ; - m_node_grid = rhs.m_node_grid ; - m_elem_node = rhs.m_elem_node ; - m_recv_node = rhs.m_recv_node ; - m_send_node = rhs.m_send_node ; - m_send_node_id = rhs.m_send_node_id ; - - for ( int i = 0 ; i < ElemNode ; ++i ) { - m_elem_node_local[i][0] = rhs.m_elem_node_local[i][0] ; - m_elem_node_local[i][1] = rhs.m_elem_node_local[i][1] ; - m_elem_node_local[i][2] = rhs.m_elem_node_local[i][2] ; - m_elem_node_local[i][3] = 0 ; - } - return *this ; - } - - BoxElemFixture( const BoxElemPart::Decompose decompose , - const size_t global_size , - const size_t global_rank , - const size_t elem_nx , - const size_t elem_ny , - const size_t elem_nz , - const float bubble_x = 1.1f , - const float bubble_y = 1.2f , - const float bubble_z = 1.3f ) - : m_box_part( Order , decompose , global_size , global_rank , elem_nx , elem_ny , elem_nz ) - , m_coord_map( m_box_part.global_coord_max(0) , - m_box_part.global_coord_max(1) , - m_box_part.global_coord_max(2) , - bubble_x , - bubble_y , - bubble_z ) - , m_node_coord( "fixture_node_coord" , m_box_part.uses_node_count() ) - , m_node_grid( "fixture_node_grid" , m_box_part.uses_node_count() ) - , m_elem_node( "fixture_elem_node" , m_box_part.uses_elem_count() ) - , m_recv_node( "fixture_recv_node" , m_box_part.recv_node_msg_count() ) - , m_send_node( "fixture_send_node" , m_box_part.send_node_msg_count() ) - , m_send_node_id( "fixture_send_node_id" , m_box_part.send_node_id_count() ) - { - { - const hex_data elem_data ; - - for ( int i = 0 ; i < ElemNode ; ++i ) { - m_elem_node_local[i][0] = elem_data.eval_map[i][0] ; - m_elem_node_local[i][1] = elem_data.eval_map[i][1] ; - m_elem_node_local[i][2] = elem_data.eval_map[i][2] ; - m_elem_node_local[i][3] = 0 ; - } - } - - const size_t nwork = - std::max( m_recv_node.dimension_0() , - std::max( m_send_node.dimension_0() , - std::max( m_send_node_id.dimension_0() , - std::max( m_node_grid.dimension_0() , - m_elem_node.dimension_0() * m_elem_node.dimension_1() )))); - - Kokkos::parallel_for( nwork , *this ); - } - - - // Initialization: - - KOKKOS_INLINE_FUNCTION - void operator()( size_t i ) const - { - if ( i < m_elem_node.dimension_0() * m_elem_node.dimension_1() ) { - - const size_t ielem = i / ElemNode ; - const size_t inode = i % ElemNode ; - - size_t elem_grid[SpaceDim] ; - size_t tmp_node_grid[SpaceDim] ; - - m_box_part.uses_elem_coord( ielem , elem_grid ); - - enum { elem_node_scale = Order == BoxElemPart::ElemLinear ? 1 : - Order == BoxElemPart::ElemQuadratic ? 2 : 0 }; - - tmp_node_grid[0] = elem_node_scale * elem_grid[0] + m_elem_node_local[inode][0] ; - tmp_node_grid[1] = elem_node_scale * elem_grid[1] + m_elem_node_local[inode][1] ; - tmp_node_grid[2] = elem_node_scale * elem_grid[2] + m_elem_node_local[inode][2] ; - - m_elem_node(ielem,inode) = m_box_part.local_node_id( tmp_node_grid ); - } - - if ( i < m_node_grid.dimension_0() ) { - size_t tmp_node_grid[SpaceDim] ; - m_box_part.local_node_coord( i , tmp_node_grid ); - m_node_grid(i,0) = tmp_node_grid[0] ; - m_node_grid(i,1) = tmp_node_grid[1] ; - m_node_grid(i,2) = tmp_node_grid[2] ; - - m_coord_map( tmp_node_grid[0] , - tmp_node_grid[1] , - tmp_node_grid[2] , - m_node_coord(i,0) , - m_node_coord(i,1) , - m_node_coord(i,2) ); - } - - if ( i < m_recv_node.dimension_0() ) { - m_recv_node(i,0) = m_box_part.recv_node_rank(i); - m_recv_node(i,1) = m_box_part.recv_node_count(i); - } - - if ( i < m_send_node.dimension_0() ) { - m_send_node(i,0) = m_box_part.send_node_rank(i); - m_send_node(i,1) = m_box_part.send_node_count(i); - } - - if ( i < m_send_node_id.dimension_0() ) { - m_send_node_id(i) = m_box_part.send_node_id(i); - } - } -}; - -} // namespace Example -} // namespace Kokkos - -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_EXAMPLE_BOXELEMFIXTURE_HPP */ - diff --git a/lib/kokkos/example/fixture/BoxElemPart.cpp b/lib/kokkos/example/fixture/BoxElemPart.cpp deleted file mode 100644 index fe89246689..0000000000 --- a/lib/kokkos/example/fixture/BoxElemPart.cpp +++ /dev/null @@ -1,413 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { - -void box_partition( const size_t global_size , - const size_t global_rank , - const size_t global_box[][2] , - size_t box[][2] ) -{ - box[0][0] = global_box[0][0] ; box[0][1] = global_box[0][1] ; - box[1][0] = global_box[1][0] ; box[1][1] = global_box[1][1] ; - box[2][0] = global_box[2][0] ; box[2][1] = global_box[2][1] ; - - size_t ip = 0 ; - size_t np = global_size ; - - while ( 1 < np ) { - - // P = [ ip + j * portion , ip + ( j + 1 ) * portion ) - - size_t jip , jup ; - - { - const size_t part = ( 0 == ( np % 5 ) ) ? 5 : ( - ( 0 == ( np % 3 ) ) ? 3 : 2 ); - - const size_t portion = np / part ; - - if ( 2 < part || global_rank < ip + portion ) { - jip = portion * size_t( double( global_rank - ip ) / double(portion) ); - jup = jip + portion ; - } - else { - jip = portion ; - jup = np ; - } - } - - // Choose axis with largest count: - - const size_t nb[3] = { - box[0][1] - box[0][0] , - box[1][1] - box[1][0] , - box[2][1] - box[2][0] }; - - const int axis = nb[2] > nb[1] ? ( nb[2] > nb[0] ? 2 : 0 ) - : ( nb[1] > nb[0] ? 1 : 0 ); - - box[ axis ][1] = box[ axis ][0] + size_t( double(nb[axis]) * ( double(jup) / double(np) )); - box[ axis ][0] = box[ axis ][0] + size_t( double(nb[axis]) * ( double(jip) / double(np) )); - - np = jup - jip ; - ip = ip + jip ; - } -} - -} /* namespace Example */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { - -void BoxElemPart::local( const size_t rank , - size_t uses_elem[][2] , - size_t owns_node[][2] , - size_t uses_node[][2] ) const -{ - if ( BoxElemPart::DecomposeElem == m_decompose ) { - - Kokkos::Example::box_partition( m_global_size , rank , m_global_elem_box , uses_elem ); - - for ( int i = 0 ; i < 3 ; ++i ) { - owns_node[i][0] = uses_elem[i][0] ; - owns_node[i][1] = uses_elem[i][1] + ( m_global_elem_box[i][1] == uses_elem[i][1] ? 1 : 0 ); - } - } - else { - - const size_t global_vert[3][2] = - { { 0 , m_global_elem_box[0][1] + 1 }, - { 0 , m_global_elem_box[1][1] + 1 }, - { 0 , m_global_elem_box[2][1] + 1 } }; - - Kokkos::Example::box_partition( m_global_size , rank , global_vert , owns_node ); - - for ( int i = 0 ; i < 3 ; ++i ) { - uses_elem[i][0] = global_vert[i][0] == owns_node[i][0] ? owns_node[i][0] : owns_node[i][0] - 1 ; - uses_elem[i][1] = global_vert[i][1] == owns_node[i][1] ? owns_node[i][1] - 1 : owns_node[i][1] ; - } - } - - for ( int i = 0 ; i < 3 ; ++i ) { - uses_node[i][0] = uses_elem[i][0] ; - uses_node[i][1] = uses_elem[i][1] + 1 ; - } - - if ( BoxElemPart::ElemQuadratic == m_elem_order ) { - for ( int i = 0 ; i < 3 ; ++i ) { - owns_node[i][0] = 2 * owns_node[i][0] ; - uses_node[i][0] = 2 * uses_node[i][0] ; - owns_node[i][1] = 2 * owns_node[i][1] - 1 ; - uses_node[i][1] = 2 * uses_node[i][1] - 1 ; - } - } -} - -BoxElemPart::BoxElemPart( - const BoxElemPart::ElemOrder elem_order , - const BoxElemPart::Decompose decompose , - const size_t global_size , - const size_t global_rank , - const size_t elem_nx , - const size_t elem_ny , - const size_t elem_nz ) -{ - m_global_size = global_size ; - m_global_rank = global_rank ; - m_decompose = decompose ; - m_elem_order = elem_order ; - - m_global_elem_box[0][0] = 0 ; m_global_elem_box[0][1] = elem_nx ; - m_global_elem_box[1][0] = 0 ; m_global_elem_box[1][1] = elem_ny ; - m_global_elem_box[2][0] = 0 ; m_global_elem_box[2][1] = elem_nz ; - - m_global_node_box[0][0] = 0 ; m_global_node_box[0][1] = 0 ; - m_global_node_box[1][0] = 0 ; m_global_node_box[1][1] = 0 ; - m_global_node_box[2][0] = 0 ; m_global_node_box[2][1] = 0 ; - - m_owns_node_count = 0 ; - m_send_node_count = 0 ; - - m_ok = true ; - - //---------------------------------------- - - if ( ElemLinear == elem_order ) { - m_global_node_box[0][1] = elem_nx + 1 ; - m_global_node_box[1][1] = elem_ny + 1 ; - m_global_node_box[2][1] = elem_nz + 1 ; - } - else if ( ElemQuadratic == elem_order ) { - m_global_node_box[0][1] = 2 * elem_nx + 1 ; - m_global_node_box[1][1] = 2 * elem_ny + 1 ; - m_global_node_box[2][1] = 2 * elem_nz + 1 ; - } - - //---------------------------------------- - - local( m_global_rank , m_uses_elem_box , m_owns_node_box[0] , m_uses_node_box ); - - const size_t global_node_count_ = Kokkos::Example::box_count( m_global_node_box ); - const size_t global_elem_count_ = Kokkos::Example::box_count( m_global_elem_box ); - - //---------------------------------------- - - size_t elem_count = Kokkos::Example::box_count( m_uses_elem_box ); - size_t node_count = Kokkos::Example::box_count( m_owns_node_box[0] ); - - m_owns_node[0][0] = global_rank ; - m_owns_node[0][1] = node_count ; - m_owns_node_count = 1 ; - m_send_node_count = 0 ; - - for ( size_t rr = 1 ; rr < m_global_size && m_ok ; ++rr ) { - - const size_t rank = ( m_global_rank + rr ) % m_global_size ; - - size_t elem_box[3][2] , o_node_box[3][2] , u_node_box[3][2] ; - - // Boxes for process 'rank' - local( rank , elem_box , o_node_box , u_node_box ); - - // Box that this process uses but is owned by process 'rank' - Kokkos::Example::box_intersect( m_owns_node_box[ m_owns_node_count ] , m_uses_node_box , o_node_box ); - - m_owns_node[ m_owns_node_count ][1] = Kokkos::Example::box_count( m_owns_node_box[ m_owns_node_count ] ); - - if ( m_owns_node[ m_owns_node_count ][1] ) { - - if ( ( PROC_NEIGH_MAX - 1 ) <= m_owns_node_count ) { - std::cout << "BoxElemPart exceeded maximum neighbor count" << std::endl ; - m_ok = false ; - break ; - } - - m_owns_node[ m_owns_node_count ][0] = rank ; - - ++m_owns_node_count ; - } - - // Box that this process owns and is used by process 'rank' - Kokkos::Example::box_intersect( m_send_node_box[ m_send_node_count ] , m_owns_node_box[0] , u_node_box ); - - m_send_node[ m_send_node_count ][1] = Kokkos::Example::box_count( m_send_node_box[ m_send_node_count ] ); - - if ( m_send_node[ m_send_node_count ][1] ) { - - if ( ( PROC_NEIGH_MAX - 1 ) <= m_send_node_count ) { - std::cout << "BoxElemPart exceeded maximum neighbor count" << std::endl ; - m_ok = false ; - break ; - } - - m_send_node[ m_send_node_count ][0] = rank ; - ++m_send_node_count ; - } - - // Error checking: - - size_t test_box[3][2] ; - - elem_count += Kokkos::Example::box_count( elem_box ); - node_count += Kokkos::Example::box_count( o_node_box ); - - { - Kokkos::Example::box_intersect( test_box , m_owns_node_box[0] , o_node_box ); - - if ( Kokkos::Example::box_count( test_box ) ) { - std::cout << "Box partitioning error" << std::endl ; - std::cout << "owns_node[" << m_global_rank << "]{" - << " [" << m_owns_node_box[0][0][0] << "," << m_owns_node_box[0][0][1] << ")" - << " [" << m_owns_node_box[0][1][0] << "," << m_owns_node_box[0][1][1] << ")" - << " [" << m_owns_node_box[0][2][0] << "," << m_owns_node_box[0][2][1] << ")" - << "} intersects" - << " owns_node[" << rank << "]{" - << " [" << o_node_box[0][0] << "," << o_node_box[0][1] << ")" - << " [" << o_node_box[1][0] << "," << o_node_box[1][1] << ")" - << " [" << o_node_box[2][0] << "," << o_node_box[2][1] << ")" - << "}" << std::endl ; - m_ok = false ; - break ; - } - } - - if ( DecomposeElem == decompose ) { - - Kokkos::Example::box_intersect( test_box , m_uses_elem_box , elem_box ); - - if ( Kokkos::Example::box_count( test_box ) ) { - std::cout << "Box partitioning error" << std::endl ; - std::cout << "ElemBox[" << m_global_rank << "]{" - << " [" << m_uses_elem_box[0][0] << "," << m_uses_elem_box[0][1] << ")" - << " [" << m_uses_elem_box[1][0] << "," << m_uses_elem_box[1][1] << ")" - << " [" << m_uses_elem_box[2][0] << "," << m_uses_elem_box[2][1] << ")" - << "} intersects" - << " ElemBox[" << rank << "]{" - << " [" << elem_box[0][0] << "," << elem_box[0][1] << ")" - << " [" << elem_box[1][0] << "," << elem_box[1][1] << ")" - << " [" << elem_box[2][0] << "," << elem_box[2][1] << ")" - << "}" << std::endl ; - m_ok = false ; - break ; - } - } - } - - // Sentinal values at the end of the owns and send lists: - - m_owns_node[ m_owns_node_count ][0] = ~0u ; - m_owns_node[ m_owns_node_count ][1] = ~0u ; - m_owns_node_box[ m_owns_node_count ][0][0] = 0u ; m_owns_node_box[ m_owns_node_count ][0][0] = ~0u ; - m_owns_node_box[ m_owns_node_count ][1][0] = 0u ; m_owns_node_box[ m_owns_node_count ][1][0] = ~0u ; - m_owns_node_box[ m_owns_node_count ][2][0] = 0u ; m_owns_node_box[ m_owns_node_count ][2][0] = ~0u ; - - m_send_node[ m_send_node_count ][0] = ~0u ; - m_send_node[ m_send_node_count ][1] = ~0u ; - m_send_node_box[ m_send_node_count ][0][0] = 0u ; m_send_node_box[ m_send_node_count ][0][0] = ~0u ; - m_send_node_box[ m_send_node_count ][1][0] = 0u ; m_send_node_box[ m_send_node_count ][1][0] = ~0u ; - m_send_node_box[ m_send_node_count ][2][0] = 0u ; m_send_node_box[ m_send_node_count ][2][0] = ~0u ; - - { - size_t count = 0 ; - for ( size_t i = 0 ; i < m_owns_node_count ; ++i ) { - count += m_owns_node[i][1] ; - } - if ( count != Kokkos::Example::box_count( m_uses_node_box ) ) { - std::cout << "Node uses count = " << Kokkos::Example::box_count( m_uses_node_box ) - << " error count = " << count << std::endl ; - m_ok = false ; - } - } - - if ( global_node_count_ != node_count ) { - std::cout << "Node count = " << global_node_count_ << " overlap error count = " << node_count << std::endl ; - m_ok = false ; - } - - if ( DecomposeElem == decompose && global_elem_count_ != elem_count ) { - std::cout << "Elem count = " << global_elem_count_ << " overlap error count = " << elem_count << std::endl ; - m_ok = false ; - } - - if ( ! m_ok ) { - for ( int i = 0 ; i < 3 ; ++i ) { for ( int j = 0 ; j < 2 ; ++j ) { - m_global_elem_box[i][j] = 0 ; - m_global_node_box[i][j] = 0 ; - m_uses_elem_box[i][j] = 0 ; - m_uses_node_box[i][j] = 0 ; - }} - m_owns_node_count = 0 ; - m_send_node_count = 0 ; - } -} - -void BoxElemPart::print( std::ostream & s ) const -{ - s << "BoxElemPart P[" << m_global_rank << ":" << m_global_size << "]" - << std::endl - << " elem_box {" - << " [" << m_uses_elem_box[0][0] << "," << m_uses_elem_box[0][1] << ")" - << " [" << m_uses_elem_box[1][0] << "," << m_uses_elem_box[1][1] << ")" - << " [" << m_uses_elem_box[2][0] << "," << m_uses_elem_box[2][1] << ")" - << " } / {" - << " [" << m_global_elem_box[0][0] << "," << m_global_elem_box[0][1] << ")" - << " [" << m_global_elem_box[1][0] << "," << m_global_elem_box[1][1] << ")" - << " [" << m_global_elem_box[2][0] << "," << m_global_elem_box[2][1] << ")" - << " }" - << std::endl - << " node_box {" - << " [" << m_owns_node_box[0][0][0] << "," << m_owns_node_box[0][0][1] << ")" - << " [" << m_owns_node_box[0][1][0] << "," << m_owns_node_box[0][1][1] << ")" - << " [" << m_owns_node_box[0][2][0] << "," << m_owns_node_box[0][2][1] << ")" - << " } / {" - << " [" << m_uses_node_box[0][0] << "," << m_uses_node_box[0][1] << ")" - << " [" << m_uses_node_box[1][0] << "," << m_uses_node_box[1][1] << ")" - << " [" << m_uses_node_box[2][0] << "," << m_uses_node_box[2][1] << ")" - << " } / {" - << " [" << m_global_node_box[0][0] << "," << m_global_node_box[0][1] << ")" - << " [" << m_global_node_box[1][0] << "," << m_global_node_box[1][1] << ")" - << " [" << m_global_node_box[2][0] << "," << m_global_node_box[2][1] << ")" - << " }" - << std::endl ; - - for ( size_t i = 1 ; i < m_owns_node_count ; ++i ) { - s << " P[" << m_owns_node[i][0] << "]" - << " recv node_box {" - << " [" << m_owns_node_box[i][0][0] << "," << m_owns_node_box[i][0][1] << ")" - << " [" << m_owns_node_box[i][1][0] << "," << m_owns_node_box[i][1][1] << ")" - << " [" << m_owns_node_box[i][2][0] << "," << m_owns_node_box[i][2][1] << ")" - << " }" - << std::endl ; - } - - for ( size_t i = 0 ; i < m_send_node_count ; ++i ) { - s << " P[" << m_send_node[i][0] << "]" - << " send node_box {" - << " [" << m_send_node_box[i][0][0] << "," << m_send_node_box[i][0][1] << ")" - << " [" << m_send_node_box[i][1][0] << "," << m_send_node_box[i][1][1] << ")" - << " [" << m_send_node_box[i][2][0] << "," << m_send_node_box[i][2][1] << ")" - << " }" - << std::endl ; - } -} - -} /* namespace Example */ -} /* namespace Kokkos */ - -//---------------------------------------------------------------------------- - - diff --git a/lib/kokkos/example/fixture/BoxElemPart.hpp b/lib/kokkos/example/fixture/BoxElemPart.hpp deleted file mode 100644 index 98f44e7d9d..0000000000 --- a/lib/kokkos/example/fixture/BoxElemPart.hpp +++ /dev/null @@ -1,320 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_BOXELEMPART_HPP -#define KOKKOS_BOXELEMPART_HPP - -#include -#include -#include - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { - -KOKKOS_INLINE_FUNCTION -void box_intersect( size_t box[][2] , - const size_t boxA[][2] , - const size_t boxB[][2] ) -{ - for ( int i = 0 ; i < 3 ; ++i ) { - box[i][0] = boxA[i][0] > boxB[i][0] ? boxA[i][0] : boxB[i][0] ; - box[i][1] = boxA[i][1] < boxB[i][1] ? boxA[i][1] : boxB[i][1] ; - if ( box[i][0] > box[i][1] ) box[i][1] = box[i][0] ; - } -} - -KOKKOS_INLINE_FUNCTION -size_t box_count( const size_t box[][2] ) -{ - return size_t( box[0][1] - box[0][0] ) * - size_t( box[1][1] - box[1][0] ) * - size_t( box[2][1] - box[2][0] ); -} - -KOKKOS_INLINE_FUNCTION -void box_ghost_layer( const size_t global_box[][2] , - const size_t local_box[][2] , - const size_t ghost_layer , - size_t ghost_box[][2] ) -{ - for ( int i = 0 ; i < 3 ; ++i ) { - ghost_box[i][0] = global_box[i][0] + ghost_layer > local_box[i][0] ? global_box[i][0] : local_box[i][0] - ghost_layer ; - ghost_box[i][1] = global_box[i][1] < local_box[i][1] + ghost_layer ? global_box[i][1] : local_box[i][1] + ghost_layer ; - } -} - -void box_partition( const size_t global_size , - const size_t global_rank , - const size_t global_box[][2] , - size_t box[][2] ); - -} // namespace Example -} // namespace Kokkos - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Example { - -/** \brief Partition a box of hexahedral elements among subdomains. - * - * Nodes are ordered locally as follows: - * { owned_by[ this_process ] , - * owned_by[ neighbor_process[0] ] , - * owned_by[ neighbor_process[1] ] , - * owned_by[ neighbor_process[2] ] , - * ... }; - */ -class BoxElemPart { -public: - - enum Decompose { DecomposeNode , DecomposeElem }; - enum ElemOrder { ElemLinear , ElemQuadratic }; - - bool ok() const { return m_ok ; } - - BoxElemPart( const ElemOrder elem_order , - const Decompose decompose , - const size_t global_size , - const size_t global_rank , - const size_t elem_nx , - const size_t elem_ny , - const size_t elem_nz ); - - KOKKOS_INLINE_FUNCTION - size_t global_elem_count() const - { return Kokkos::Example::box_count( m_global_elem_box ); } - - KOKKOS_INLINE_FUNCTION - size_t global_node_count() const - { return Kokkos::Example::box_count( m_global_node_box ); } - - KOKKOS_INLINE_FUNCTION - size_t uses_elem_count() const - { return Kokkos::Example::box_count( m_uses_elem_box ); } - - KOKKOS_INLINE_FUNCTION - size_t owns_node_count() const - { return Kokkos::Example::box_count( m_owns_node_box[0] ); } - - KOKKOS_INLINE_FUNCTION - size_t uses_node_count() const - { return Kokkos::Example::box_count( m_uses_node_box ); } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION - size_t uses_elem_offset( const size_t ix , - const size_t iy , - const size_t iz ) const - { - return size_t( ix - m_uses_elem_box[0][0] ) + size_t( m_uses_elem_box[0][1] - m_uses_elem_box[0][0] ) * ( - size_t( iy - m_uses_elem_box[1][0] ) + size_t( m_uses_elem_box[1][1] - m_uses_elem_box[1][0] ) * ( - size_t( iz - m_uses_elem_box[2][0] ) ) ); - } - - KOKKOS_INLINE_FUNCTION - void uses_elem_coord( size_t lid , size_t c[] ) const - { - const size_t nx = m_uses_elem_box[0][1] - m_uses_elem_box[0][0] ; - const size_t ny = m_uses_elem_box[1][1] - m_uses_elem_box[1][0] ; - - c[0] = m_uses_elem_box[0][0] + lid % nx ; lid /= nx ; - c[1] = m_uses_elem_box[1][0] + lid % ny ; lid /= ny ; - c[2] = m_uses_elem_box[2][0] + lid ; - } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION - size_t global_coord_max( size_t axis ) const - { return m_global_node_box[axis][1] - 1 ; } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION - void local_node_coord( size_t lid , size_t coord[] ) const - { - // Local id within an 'owns' block (has sentinal) - size_t j = 0 ; - while ( m_owns_node[j][1] <= lid ) { lid -= m_owns_node[j][1] ; ++j ; } - - // Map to global coordinates: - const size_t nx = m_owns_node_box[j][0][1] - m_owns_node_box[j][0][0] ; - const size_t ny = m_owns_node_box[j][1][1] - m_owns_node_box[j][1][0] ; - - coord[0] = m_owns_node_box[j][0][0] + lid % nx ; lid /= nx ; - coord[1] = m_owns_node_box[j][1][0] + lid % ny ; lid /= ny ; - coord[2] = m_owns_node_box[j][2][0] + lid ; - } - - KOKKOS_INLINE_FUNCTION - size_t local_node_id( const size_t c[] ) const - { - // Find which 'owns' block and accumulate the offset of this block: - size_t lid = 0 ; - size_t j = 0 ; - while ( ! ( m_owns_node_box[j][0][0] <= c[0] && c[0] < m_owns_node_box[j][0][1] && - m_owns_node_box[j][1][0] <= c[1] && c[1] < m_owns_node_box[j][1][1] && - m_owns_node_box[j][2][0] <= c[2] && c[2] < m_owns_node_box[j][2][1] ) ) { - - lid += m_owns_node[j][1] ; - ++j ; - } - - // Map offset to the block plus offset within the block: - return lid + - size_t( c[0] - m_owns_node_box[j][0][0] ) + size_t( m_owns_node_box[j][0][1] - m_owns_node_box[j][0][0] ) * ( - size_t( c[1] - m_owns_node_box[j][1][0] ) + size_t( m_owns_node_box[j][1][1] - m_owns_node_box[j][1][0] ) * ( - size_t( c[2] - m_owns_node_box[j][2][0] ) ) ); - } - - KOKKOS_INLINE_FUNCTION - size_t global_node_id( const size_t c[] ) const - { - return size_t( c[0] - m_global_node_box[0][0] ) + size_t( m_global_node_box[0][1] - m_global_node_box[0][0] ) * ( - size_t( c[1] - m_global_node_box[1][0] ) + size_t( m_global_node_box[1][1] - m_global_node_box[1][0] ) * ( - size_t( c[2] - m_global_node_box[2][0] ) ) ); - } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION - size_t recv_node_msg_count() const { return m_owns_node_count - 1 ; } - - KOKKOS_INLINE_FUNCTION - size_t recv_node_rank( size_t msg ) const { return m_owns_node[msg+1][0] ; } - - KOKKOS_INLINE_FUNCTION - size_t recv_node_count( size_t msg ) const { return m_owns_node[msg+1][1] ; } - - //---------------------------------------- - - KOKKOS_INLINE_FUNCTION - size_t send_node_msg_count() const { return m_send_node_count ; } - - KOKKOS_INLINE_FUNCTION - size_t send_node_rank( size_t msg ) const { return m_send_node[msg][0] ; } - - KOKKOS_INLINE_FUNCTION - size_t send_node_count( size_t msg ) const { return m_send_node[msg][1] ; } - - KOKKOS_INLINE_FUNCTION - size_t send_node_id_count() const - { - size_t count = 0 ; - for ( size_t i = 0 ; i < m_send_node_count ; ++i ) { - count += m_send_node[i][1] ; - } - return count ; - } - - KOKKOS_INLINE_FUNCTION - size_t send_node_id( size_t item ) const - { - // Find which send list this send item is in: - size_t j = 0 ; - while ( m_send_node[j][1] <= item ) { item -= m_send_node[j][1] ; ++j ; } - - // Map to global coordinate: - const size_t nx = m_send_node_box[j][0][1] - m_send_node_box[j][0][0] ; - const size_t ny = m_send_node_box[j][1][1] - m_send_node_box[j][1][0] ; - - size_t c[3] ; - - c[0] = m_send_node_box[j][0][0] + item % nx ; item /= nx ; - c[1] = m_send_node_box[j][1][0] + item % ny ; item /= ny ; - c[2] = m_send_node_box[j][2][0] + item ; - - // Map to local id: - return size_t( c[0] - m_owns_node_box[0][0][0] ) + size_t( m_owns_node_box[0][0][1] - m_owns_node_box[0][0][0] ) * ( - size_t( c[1] - m_owns_node_box[0][1][0] ) + size_t( m_owns_node_box[0][1][1] - m_owns_node_box[0][1][0] ) * ( - size_t( c[2] - m_owns_node_box[0][2][0] ) ) ); - } - - //---------------------------------------- - - void print( std::ostream & s ) const ; - -private: - - // Maximum number of processes in a neighborhood, including this process - enum { PROC_NEIGH_MAX = 64 }; - - void local( const size_t rank , - size_t uses_elem[][2] , - size_t owns_node[][2] , - size_t uses_node[][2] ) const ; - - size_t m_global_size ; - size_t m_global_rank ; - - Decompose m_decompose ; - ElemOrder m_elem_order ; - - size_t m_global_elem_box[3][2] ; - size_t m_global_node_box[3][2] ; - size_t m_uses_elem_box[3][2] ; - size_t m_uses_node_box[3][2] ; - - // [ processor rank , count ] - size_t m_owns_node_box[ PROC_NEIGH_MAX ][3][2] ; - size_t m_owns_node[ PROC_NEIGH_MAX ][2] ; - size_t m_owns_node_count ; - - size_t m_send_node_box[ PROC_NEIGH_MAX ][3][2] ; - size_t m_send_node[ PROC_NEIGH_MAX ][2] ; - size_t m_send_node_count ; - - bool m_ok ; -}; - -} // namespace Example -} // namespace Kokkos - -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_BOXELEMPART_HPP */ - diff --git a/lib/kokkos/example/fixture/HexElement.hpp b/lib/kokkos/example/fixture/HexElement.hpp deleted file mode 100644 index cb39358f9d..0000000000 --- a/lib/kokkos/example/fixture/HexElement.hpp +++ /dev/null @@ -1,270 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_HEXELEMENT_HPP -#define KOKKOS_HEXELEMENT_HPP - -namespace Kokkos { -namespace Example { - -template< unsigned NodeCount > -class HexElement_TensorData ; - -template< unsigned NodeCount , class Device > -class HexElement_TensorEval ; - -//---------------------------------------------------------------------------- -/** \brief Evaluate Hex element on interval [-1,1]^3 */ -template<> -class HexElement_TensorData< 8 > { -public: - - static const unsigned element_node_count = 8 ; - static const unsigned spatial_dimension = 3 ; - static const unsigned integration_count_1d = 2 ; - static const unsigned function_count_1d = 2 ; - - float values_1d [ function_count_1d ][ integration_count_1d ]; - float derivs_1d [ function_count_1d ][ integration_count_1d ]; - float weights_1d[ integration_count_1d ]; - - unsigned char eval_map[ element_node_count ][4] ; - - static float eval_value_1d( const unsigned jf , const float x ) - { - return 0 == jf ? 0.5 * ( 1.0 - x ) : ( - 1 == jf ? 0.5 * ( 1.0 + x ) : 0 ); - } - - static float eval_deriv_1d( const unsigned jf , const float ) - { - return 0 == jf ? -0.5 : ( - 1 == jf ? 0.5 : 0 ); - } - - HexElement_TensorData() - { - const unsigned char tmp_map[ element_node_count ][ spatial_dimension ] = - { { 0 , 0 , 0 }, - { 1 , 0 , 0 }, - { 1 , 1 , 0 }, - { 0 , 1 , 0 }, - { 0 , 0 , 1 }, - { 1 , 0 , 1 }, - { 1 , 1 , 1 }, - { 0 , 1 , 1 } }; - - weights_1d[0] = 1 ; - weights_1d[1] = 1 ; - - const float points_1d[ integration_count_1d ] = - { -0.577350269 , 0.577350269 }; - - for ( unsigned i = 0 ; i < element_node_count ; ++i ) { - eval_map[i][0] = tmp_map[i][0]; - eval_map[i][1] = tmp_map[i][1]; - eval_map[i][2] = tmp_map[i][2]; - } - - for ( unsigned xp = 0 ; xp < integration_count_1d ; ++xp ) { - for ( unsigned xf = 0 ; xf < function_count_1d ; ++xf ) { - values_1d[xp][xf] = eval_value_1d( xf , points_1d[xp] ); - derivs_1d[xp][xf] = eval_deriv_1d( xf , points_1d[xp] ); - }} - } -}; - -//---------------------------------------------------------------------------- - -template<> -class HexElement_TensorData< 27 > { -public: - - static const unsigned element_node_count = 27 ; - static const unsigned spatial_dimension = 3 ; - static const unsigned integration_count_1d = 3 ; - static const unsigned function_count_1d = 3 ; - - float values_1d [ function_count_1d ][ integration_count_1d ]; - float derivs_1d [ function_count_1d ][ integration_count_1d ]; - float weights_1d[ integration_count_1d ]; - - unsigned char eval_map[ element_node_count ][4] ; - - // sizeof(EvaluateElementHex) = 111 bytes = - // sizeof(float) * 9 + - // sizeof(float) * 9 + - // sizeof(float) * 3 + - // sizeof(char) * 27 - - static float eval_value_1d( const unsigned jf , const float p ) - { - return 0 == jf ? 0.5 * p * ( p - 1 ) : ( - 1 == jf ? 1.0 - p * p : ( - 2 == jf ? 0.5 * p * ( p + 1 ) : 0 )); - } - - static float eval_deriv_1d( const unsigned jf , const float p ) - { - return 0 == jf ? p - 0.5 : ( - 1 == jf ? -2.0 * p : ( - 2 == jf ? p + 0.5 : 0 )); - } - - HexElement_TensorData() - { - const unsigned char tmp_map[ element_node_count ][ spatial_dimension ] = - { { 0 , 0 , 0 }, - { 2 , 0 , 0 }, - { 2 , 2 , 0 }, - { 0 , 2 , 0 }, - { 0 , 0 , 2 }, - { 2 , 0 , 2 }, - { 2 , 2 , 2 }, - { 0 , 2 , 2 }, - { 1 , 0 , 0 }, - { 2 , 1 , 0 }, - { 1 , 2 , 0 }, - { 0 , 1 , 0 }, - { 0 , 0 , 1 }, - { 2 , 0 , 1 }, - { 2 , 2 , 1 }, - { 0 , 2 , 1 }, - { 1 , 0 , 2 }, - { 2 , 1 , 2 }, - { 1 , 2 , 2 }, - { 0 , 1 , 2 }, - { 1 , 1 , 1 }, - { 1 , 1 , 0 }, - { 1 , 1 , 2 }, - { 0 , 1 , 1 }, - { 2 , 1 , 1 }, - { 1 , 0 , 1 }, - { 1 , 2 , 1 } }; - - // Interval [-1,1] - - weights_1d[0] = 0.555555556 ; - weights_1d[1] = 0.888888889 ; - weights_1d[2] = 0.555555556 ; - - const float points_1d[3] = { -0.774596669 , - 0.000000000 , - 0.774596669 }; - - for ( unsigned i = 0 ; i < element_node_count ; ++i ) { - eval_map[i][0] = tmp_map[i][0]; - eval_map[i][1] = tmp_map[i][1]; - eval_map[i][2] = tmp_map[i][2]; - } - - for ( unsigned xp = 0 ; xp < integration_count_1d ; ++xp ) { - for ( unsigned xf = 0 ; xf < function_count_1d ; ++xf ) { - values_1d[xp][xf] = eval_value_1d( xf , points_1d[xp] ); - derivs_1d[xp][xf] = eval_deriv_1d( xf , points_1d[xp] ); - }} - } -}; - -//---------------------------------------------------------------------------- - -template< unsigned NodeCount > -class HexElement_Data { -public: - static const unsigned spatial_dimension = 3 ; - static const unsigned element_node_count = NodeCount ; - static const unsigned integration_count = NodeCount ; - static const unsigned function_count = NodeCount ; - - float weights[ integration_count ] ; - float values[ integration_count ][ function_count ]; - float gradients[ integration_count ][ spatial_dimension ][ function_count ]; - - HexElement_Data() - { - HexElement_TensorData< NodeCount > tensor_data ; - - for ( unsigned ip = 0 ; ip < integration_count ; ++ip ) { - - const unsigned ipx = tensor_data.eval_map[ip][0] ; - const unsigned ipy = tensor_data.eval_map[ip][1] ; - const unsigned ipz = tensor_data.eval_map[ip][2] ; - - weights[ip] = tensor_data.weights_1d[ ipx ] * - tensor_data.weights_1d[ ipy ] * - tensor_data.weights_1d[ ipz ] ; - - for ( unsigned jf = 0 ; jf < function_count ; ++jf ) { - - const unsigned jfx = tensor_data.eval_map[jf][0] ; - const unsigned jfy = tensor_data.eval_map[jf][1] ; - const unsigned jfz = tensor_data.eval_map[jf][2] ; - - values[ip][jf] = tensor_data.values_1d[ ipx ][ jfx ] * - tensor_data.values_1d[ ipy ][ jfy ] * - tensor_data.values_1d[ ipz ][ jfz ] ; - - gradients[ip][0][jf] = tensor_data.derivs_1d[ ipx ][ jfx ] * - tensor_data.values_1d[ ipy ][ jfy ] * - tensor_data.values_1d[ ipz ][ jfz ] ; - - gradients[ip][1][jf] = tensor_data.values_1d[ ipx ][ jfx ] * - tensor_data.derivs_1d[ ipy ][ jfy ] * - tensor_data.values_1d[ ipz ][ jfz ] ; - - gradients[ip][2][jf] = tensor_data.values_1d[ ipx ][ jfx ] * - tensor_data.values_1d[ ipy ][ jfy ] * - tensor_data.derivs_1d[ ipz ][ jfz ] ; - } - } - } -}; - -//---------------------------------------------------------------------------- - -} /* namespace Example */ -} /* namespace Kokkos */ - -#endif /* #ifndef KOKKOS_HEXELEMENT_HPP */ - - diff --git a/lib/kokkos/example/fixture/Main.cpp b/lib/kokkos/example/fixture/Main.cpp deleted file mode 100644 index d80828ca52..0000000000 --- a/lib/kokkos/example/fixture/Main.cpp +++ /dev/null @@ -1,304 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#include -#include - -#include - -#include - -namespace Kokkos { -namespace Example { -template< class > void test_fixture(); -} -} - -int test_box( const size_t global_size - , const size_t global_box[][2] - , const bool print_verbose ) -{ - size_t global_count = 0 ; - size_t global_max = 0 ; - size_t global_min = Kokkos::Example::box_count( global_box ); - size_t global_box_max[3][2] = { { 0 , 0 } , { 0 , 0 } , { 0 , 0 } }; - size_t global_box_min[3][2] = { { 0 , global_box[0][1] } , { 0 , global_box[1][1] } , { 0 , global_box[2][1] } }; - size_t intersect_error = 0 ; - size_t neighbor_max = 0 ; - - for ( size_t global_rank = 0 ; global_rank < global_size ; ++global_rank ) { - size_t box[3][2] = { { 0 , global_box[0][1] } , { 0 , global_box[1][1] } , { 0 , global_box[2][1] } }; - size_t ghost_box[3][2] ; - size_t neighbor_count = 0 ; - - Kokkos::Example::box_partition( global_size , global_rank , global_box , box ); - - Kokkos::Example::box_ghost_layer( global_box , box , 1 , ghost_box ); - - { - const size_t n = Kokkos::Example::box_count( box ); - - for ( int i = 0 ; i < 3 ; ++i ) { - if ( ( box[i][1] - box[i][0] ) < ( global_box_min[i][1] - global_box_min[i][0] ) ) { - global_box_min[i][0] = box[i][0] ; - global_box_min[i][1] = box[i][1] ; - } - if ( ( box[i][1] - box[i][0] ) > ( global_box_max[i][1] - global_box_max[i][0] ) ) { - global_box_max[i][0] = box[i][0] ; - global_box_max[i][1] = box[i][1] ; - } - } - - global_max = std::max( global_max , n ); - global_min = std::min( global_min , n ); - global_count += n ; - } - - for ( size_t other_rank = 0 ; other_rank < global_size ; ++other_rank ) { - - if ( other_rank == global_rank ) continue ; - - size_t other_box[3][2] = { { 0 , global_box[0][1] } , { 0 , global_box[1][1] } , { 0 , global_box[2][1] } }; - size_t intersect_box[3][2] ; - - Kokkos::Example::box_partition( global_size , other_rank , global_box , other_box ); - - Kokkos::Example::box_intersect( intersect_box , box , other_box ); - - const size_t n = Kokkos::Example::box_count( intersect_box ); - - intersect_error += n ; - - Kokkos::Example::box_intersect( intersect_box , ghost_box , other_box ); - - neighbor_count += Kokkos::Example::box_count( intersect_box ) ? 1 : 0 ; - - if ( n ) { - std::cout << "box partition intersection error" << std::endl ; - std::cout << "box = {" - << " [ " << box[0][0] << " , " << box[0][1] << " )" - << " [ " << box[1][0] << " , " << box[1][1] << " )" - << " [ " << box[2][0] << " , " << box[2][1] << " )" - << " }" << std::endl ; - std::cout << "other_box = {" - << " [ " << other_box[0][0] << " , " << other_box[0][1] << " )" - << " [ " << other_box[1][0] << " , " << other_box[1][1] << " )" - << " [ " << other_box[2][0] << " , " << other_box[2][1] << " )" - << " }" << std::endl ; - return 0 ; - } - } - - neighbor_max = std::max( neighbor_max , neighbor_count ); - } - - if ( print_verbose ) { - - std::cout << "global_part = " << global_size << std::endl ; - std::cout << "global_box = { " - << " [ " << global_box[0][0] << " .. " << global_box[0][1] << " ) X" - << " [ " << global_box[1][0] << " .. " << global_box[1][1] << " ) X" - << " [ " << global_box[2][0] << " .. " << global_box[2][1] << " )" - << " }" << std::endl ; - std::cout << "count( global_box ) = " << Kokkos::Example::box_count( global_box ) << std::endl ; - std::cout << "sum partition( global_box ) = " << global_count << std::endl ; - std::cout << "avg partition( global_box ) = " << size_t( double(global_count) / double(global_size)) << std::endl ; - std::cout << "min partition( global_box ) = " << global_min << std::endl ; - std::cout << "min part X ( global_box ) = [ " << global_box_min[0][0] << " .. " << global_box_min[0][1] << " )" << std::endl ; - std::cout << "min part Y ( global_box ) = [ " << global_box_min[1][0] << " .. " << global_box_min[1][1] << " )" << std::endl ; - std::cout << "min part Z ( global_box ) = [ " << global_box_min[2][0] << " .. " << global_box_min[2][1] << " )" << std::endl ; - std::cout << "max partition( global_box ) = " << global_max << std::endl ; - std::cout << "max part X ( global_box ) = [ " << global_box_max[0][0] << " .. " << global_box_max[0][1] << " )" << std::endl ; - std::cout << "max part Y ( global_box ) = [ " << global_box_max[1][0] << " .. " << global_box_max[1][1] << " )" << std::endl ; - std::cout << "max part Z ( global_box ) = [ " << global_box_max[2][0] << " .. " << global_box_max[2][1] << " )" << std::endl ; - std::cout << "sum intersect( global_box ) = " << intersect_error << std::endl ; - std::cout << "max neighbor = " << neighbor_max << std::endl ; - } - - return neighbor_max ; -} - -void test_elem() -{ - const Kokkos::Example::BoxElemPart::Decompose - decompose = Kokkos::Example::BoxElemPart:: DecomposeElem ; // DecomposeElem | DecomposeNode ; - const size_t global_size = 256 ; - const size_t global_nx = 100 ; - const size_t global_ny = 120 ; - const size_t global_nz = 140 ; - - double node_count_avg = 0 ; - size_t node_count_max = 0 ; - size_t node_count_min = ( global_nx + 1 ) * ( global_ny + 1 ) * ( global_nz + 1 ); - double elem_count_avg = 0 ; - size_t elem_count_max = 0 ; - size_t elem_count_min = global_nx * global_ny * global_nz ; - double recv_count_avg = 0 ; - size_t recv_count_max = 0 ; - size_t recv_count_min = global_size ; - double send_count_avg = 0 ; - size_t send_count_max = 0 ; - size_t send_count_min = global_size ; - - for ( size_t r = 0 ; r < global_size ; ++r ) { - const Kokkos::Example::BoxElemPart - fixture( Kokkos::Example::BoxElemPart::ElemLinear , - decompose , global_size , r , global_nx , global_ny , global_nz ); - - // Print a sample: - - // if ( r == global_size * 2 / 3 ) fixture.print( std::cout ); - - // Verify recv/send alignment: - - { - size_t recv_lid = fixture.owns_node_count(); - - for ( size_t i = 0 ; i < fixture.recv_node_msg_count() ; ++i ) { - const size_t recv_rank = fixture.recv_node_rank( i ); - const size_t recv_count = fixture.recv_node_count( i ); - - const Kokkos::Example::BoxElemPart other_fixture( - Kokkos::Example::BoxElemPart::ElemLinear , - decompose , global_size , recv_rank , global_nx , global_ny , global_nz ); - - size_t send_item = 0 ; - - size_t j = 0 ; - while ( j < other_fixture.send_node_msg_count() && other_fixture.send_node_rank(j) != r ) { - send_item += other_fixture.send_node_count( j ); - ++j ; - } - - if ( recv_count != other_fixture.send_node_count(j) ) { - std::cout << "Error P[" << r << "].recv(" << recv_count << ") != " - << "P[" << recv_rank << "].send(" << other_fixture.send_node_count(j) << ")" - << std::endl ; - } - else { - - for ( size_t k = 0 ; k < recv_count ; ++k , ++send_item , ++recv_lid ) { - - const size_t send_lid = other_fixture.send_node_id( send_item ); - - size_t recv_coord[3] , send_coord[3] ; - - fixture.local_node_coord( recv_lid , recv_coord ); - - other_fixture.local_node_coord( send_lid , send_coord ); - - if ( recv_coord[0] != send_coord[0] || - recv_coord[1] != send_coord[1] || - recv_coord[2] != send_coord[2] ) { - std::cout << "Error P[" << r << "].recv[" << recv_lid << "]{ " - << recv_coord[0] << " , " - << recv_coord[1] << " , " - << recv_coord[2] << " } != " - << "P[" << recv_rank << "].send[" << send_lid << "]{ " - << send_coord[0] << " , " - << send_coord[1] << " , " - << send_coord[2] << " }" - << std::endl ; - } - } - } - } - } - - node_count_avg += fixture.owns_node_count(); - elem_count_avg += fixture.uses_elem_count(); - recv_count_avg += fixture.recv_node_msg_count(); - send_count_avg += fixture.send_node_msg_count(); - - elem_count_min = std::min( (size_t) fixture.uses_elem_count() , elem_count_min ); - elem_count_max = std::max( (size_t) fixture.uses_elem_count() , elem_count_max ); - node_count_min = std::min( (size_t) fixture.owns_node_count() , node_count_min ); - node_count_max = std::max( (size_t) fixture.owns_node_count() , node_count_max ); - - recv_count_max = std::max( (size_t) fixture.recv_node_msg_count() , recv_count_max ); - recv_count_min = std::min( (size_t) fixture.recv_node_msg_count() , recv_count_min ); - send_count_max = std::max( (size_t) fixture.send_node_msg_count() , send_count_max ); - send_count_min = std::min( (size_t) fixture.send_node_msg_count() , send_count_min ); - } - - node_count_avg /= double(global_size); - elem_count_avg /= double(global_size); - recv_count_avg /= double(global_size); - send_count_avg /= double(global_size); - - std::cout << "Elem min(" << elem_count_min << ") avg(" << elem_count_avg << ") max(" << elem_count_max << ") " << std::endl - << "Node min(" << node_count_min << ") avg(" << node_count_avg << ") max(" << node_count_max << ") " << std::endl - << "Recv min(" << recv_count_min << ") avg(" << recv_count_avg << ") max(" << recv_count_max << ") " << std::endl - << "Send min(" << send_count_min << ") avg(" << send_count_avg << ") max(" << send_count_max << ") " << std::endl - ; -} - -int main() -{ - for ( int i = 1 ; i <= 32 ; ++i ) { - const size_t global_size = 16 * i ; - const size_t global_box[3][2] = { { 0 , 65 } , { 0 , 65 } , { 0 , 65 } }; - if ( 30 < test_box( global_size , global_box , false ) ) { - test_box( global_size , global_box , true ); - } - } - -// test_elem(); - - { - std::cout << "test_fixture< Host >" << std::endl ; - Kokkos::HostSpace::execution_space::initialize( 1 ); - Kokkos::Example::test_fixture< Kokkos::HostSpace::execution_space >(); - Kokkos::HostSpace::execution_space::finalize(); - } - -#if defined( KOKKOS_HAVE_CUDA ) - { - std::cout << "test_fixture< Cuda >" << std::endl ; - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice(0) ); - Kokkos::Example::test_fixture< Kokkos::Cuda >(); - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); - } -#endif -} - diff --git a/lib/kokkos/example/fixture/Makefile b/lib/kokkos/example/fixture/Makefile deleted file mode 100644 index 1e3770cf74..0000000000 --- a/lib/kokkos/example/fixture/Makefile +++ /dev/null @@ -1,49 +0,0 @@ -KOKKOS_PATH = ../.. - -vpath %.cpp ${KOKKOS_PATH}/example/fixture - -EXAMPLE_HEADERS = $(wildcard $(KOKKOS_PATH)/example/common/*.hpp ${KOKKOS_PATH}/example/fixture/*.hpp ) - -default: build_all - echo "End Build" - -include $(KOKKOS_PATH)/Makefile.kokkos - -ifeq ($(KOKKOS_INTERNAL_USE_CUDA), 1) - CXX = nvcc_wrapper - CXXFLAGS ?= -O3 - LINK = $(CXX) - LDFLAGS ?= -lpthread -else - CXX ?= g++ - CXXFLAGS ?= -O3 - LINK ?= $(CXX) - LDFLAGS ?= -lpthread -endif - -KOKKOS_CXXFLAGS += \ - -I${KOKKOS_PATH}/example/common \ - -I${KOKKOS_PATH}/example/fixture - -OBJ_EXAMPLE_FIXTURE = Main.o TestFixture.o BoxElemPart.o -EXE_EXAMPLE_FIXTURE = KokkosExample_Fixture - -TARGETS = $(EXE_EXAMPLE_FIXTURE) - -#TEST_TARGETS = - -$(EXE_EXAMPLE_FIXTURE) : $(OBJ_EXAMPLE_FIXTURE) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LDFLAGS) $(EXTRA_PATH) $(OBJ_EXAMPLE_FIXTURE) $(KOKKOS_LIBS) $(LIB) -o $(EXE_EXAMPLE_FIXTURE) - - -build_all : $(TARGETS) - - -test : build_all - - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) $(EXAMPLE_HEADERS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< - diff --git a/lib/kokkos/example/fixture/TestFixture.cpp b/lib/kokkos/example/fixture/TestFixture.cpp deleted file mode 100644 index 9cf2f07322..0000000000 --- a/lib/kokkos/example/fixture/TestFixture.cpp +++ /dev/null @@ -1,58 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -namespace Kokkos { -namespace Example { - -template void test_fixture< Kokkos::HostSpace::execution_space >(); - -#if defined( KOKKOS_HAVE_CUDA ) -template void test_fixture(); -#endif - -} /* namespace Example */ -} /* namespace Kokkos */ - diff --git a/lib/kokkos/example/fixture/TestFixture.hpp b/lib/kokkos/example/fixture/TestFixture.hpp deleted file mode 100644 index dbf5ca56f5..0000000000 --- a/lib/kokkos/example/fixture/TestFixture.hpp +++ /dev/null @@ -1,156 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXAMPLE_TESTFIXTURE_HPP -#define KOKKOS_EXAMPLE_TESTFIXTURE_HPP - -#include -#include - -#include - -#include -#include - -namespace Kokkos { -namespace Example { - -template< class Device > -struct FixtureVerifyElemNodeCoord -{ - typedef Device execution_space ; - - typedef struct { size_t success , error ; } value_type ; - - typedef Kokkos::Example::BoxElemFixture< Device , Kokkos::Example::BoxElemPart::ElemLinear > FixtureType ; - - FixtureType m_fixture ; - - KOKKOS_INLINE_FUNCTION - void init( value_type & update ) const { update.success = update.error = 0 ; } - - KOKKOS_INLINE_FUNCTION - void join( volatile value_type & update , - volatile const value_type & input ) const - { - update.success += input.success ; - update.error += input.error ; - } - - - KOKKOS_INLINE_FUNCTION - void operator()( size_t ielem , value_type & update ) const - { - unsigned node_coord[ FixtureType::ElemNode ][3] ; - - for ( unsigned i = 0 ; i < FixtureType::ElemNode ; ++i ) { - const unsigned node_id = m_fixture.elem_node(ielem,i); - node_coord[i][0] = m_fixture.node_grid(node_id,0); - node_coord[i][1] = m_fixture.node_grid(node_id,1); - node_coord[i][2] = m_fixture.node_grid(node_id,2); - } - - int error = 0 ; - for ( unsigned i = 1 ; i < FixtureType::ElemNode ; ++i ) { - if ( node_coord[0][0] + m_fixture.elem_node_local(i,0) != node_coord[i][0] || - node_coord[0][1] + m_fixture.elem_node_local(i,1) != node_coord[i][1] || - node_coord[0][2] + m_fixture.elem_node_local(i,2) != node_coord[i][2] ) { - error = 1 ; - } - } - - if ( error ) { - ++update.error ; - } - else { - ++update.success ; - } - } - - FixtureVerifyElemNodeCoord( const FixtureType & f ) : m_fixture(f) {} -}; - - -template< class Device > -void test_fixture() -{ - typedef Kokkos::Example::BoxElemFixture< Device , Kokkos::Example::BoxElemPart::ElemLinear > FixtureType ; - - const Kokkos::Example::BoxElemPart::Decompose - decompose = Kokkos::Example::BoxElemPart:: DecomposeElem ; // DecomposeElem | DecomposeNode ; - - const unsigned global_size = 256 ; - const unsigned global_nx = 400 ; - const unsigned global_ny = 400 ; - const unsigned global_nz = 400 ; - - for ( unsigned my_rank = 0 ; my_rank < global_size ; ++my_rank ) { - - const FixtureType fixture( decompose , global_size , my_rank , global_nx , global_ny , global_nz ); - - // Verify grid coordinates of element's nodes - - typename FixtureVerifyElemNodeCoord::value_type result = { 0 , 0 }; - - Kokkos::parallel_reduce( fixture.elem_node().dimension_0() , FixtureVerifyElemNodeCoord( fixture ) , result ); - - if ( result.error ) { - std::cout << "P[" << my_rank << ":" << global_size - << "] Fixture elem_node_coord" - << " success(" << result.success << ")" - << " error(" << result.error << ")" - << std::endl ; - } - - // Check send/recv alignment - - - } -} - - -} /* namespace Example */ -} /* namespace Kokkos */ - -#endif /* #ifndef KOKKOS_EXAMPLE_TESTFIXTURE_HPP */ - diff --git a/lib/kokkos/example/global_2_local_ids/G2L.hpp b/lib/kokkos/example/global_2_local_ids/G2L.hpp deleted file mode 100644 index d4198c61ac..0000000000 --- a/lib/kokkos/example/global_2_local_ids/G2L.hpp +++ /dev/null @@ -1,266 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#ifndef KOKKOS_GLOBAL_TO_LOCAL_IDS_HPP -#define KOKKOS_GLOBAL_TO_LOCAL_IDS_HPP - -#include - -#include - -#include -#include -#include - -#include - -// This test will simulate global ids - -namespace G2L { - -static const unsigned begin_id_size = 256u; -static const unsigned end_id_size = 1u << 25; -static const unsigned id_step = 2u; - -//use to help generate global ids -union helper -{ - uint32_t word; - uint8_t byte[4]; -}; - - -//generate a unique global id from the local id -template -struct generate_ids -{ - typedef Device execution_space; - typedef typename execution_space::size_type size_type; - typedef Kokkos::View local_id_view; - - local_id_view local_2_global; - - generate_ids( local_id_view & ids) - : local_2_global(ids) - { - Kokkos::parallel_for(local_2_global.size(), *this); - } - - - KOKKOS_INLINE_FUNCTION - void operator()(size_type i) const - { - - helper x = {static_cast(i)}; - - // shuffle the bytes of i to create a unique, semi-random global_id - x.word = ~x.word; - - uint8_t tmp = x.byte[3]; - x.byte[3] = x.byte[1]; - x.byte[1] = tmp; - - tmp = x.byte[2]; - x.byte[2] = x.byte[0]; - x.byte[0] = tmp; - - local_2_global[i] = x.word; - } - -}; - -// fill a map of global_id -> local_id -template -struct fill_map -{ - typedef Device execution_space; - typedef typename execution_space::size_type size_type; - typedef Kokkos::View local_id_view; - typedef Kokkos::UnorderedMap global_id_view; - - global_id_view global_2_local; - local_id_view local_2_global; - - fill_map( global_id_view gIds, local_id_view lIds) - : global_2_local(gIds) , local_2_global(lIds) - { - Kokkos::parallel_for(local_2_global.size(), *this); - } - - KOKKOS_INLINE_FUNCTION - void operator()(size_type i) const - { - global_2_local.insert( local_2_global[i], i); - } - -}; - -// check that the global id is found and that it maps to the local id -template -struct find_test -{ - typedef Device execution_space; - typedef typename execution_space::size_type size_type; - typedef Kokkos::View local_id_view; - typedef Kokkos::UnorderedMap global_id_view; - - global_id_view global_2_local; - local_id_view local_2_global; - - typedef size_t value_type; - - find_test( global_id_view gIds, local_id_view lIds, value_type & num_errors) - : global_2_local(gIds) , local_2_global(lIds) - { - Kokkos::parallel_reduce(local_2_global.size(), *this, num_errors); - } - - KOKKOS_INLINE_FUNCTION - void init(value_type & v) const - { v = 0; } - - KOKKOS_INLINE_FUNCTION - void join(volatile value_type & dst, volatile value_type const & src) const - { dst += src; } - - KOKKOS_INLINE_FUNCTION - void operator()(size_type i, value_type & num_errors) const - { - uint32_t index = global_2_local.find( local_2_global[i] ); - - if ( !global_2_local.valid_at(index) - || global_2_local.key_at(index) != local_2_global[i] - || global_2_local.value_at(index) != i) - ++num_errors; - } - -}; - -// run test -template -size_t test_global_to_local_ids(unsigned num_ids, unsigned capacity, unsigned num_find_iterations) -{ - - typedef Device execution_space; - typedef typename execution_space::size_type size_type; - - typedef Kokkos::View local_id_view; - typedef Kokkos::UnorderedMap global_id_view; - - double elasped_time = 0; - Kokkos::Impl::Timer timer; - - local_id_view local_2_global("local_ids", num_ids); - global_id_view global_2_local(capacity); - - int shiftw = 15; - - //create - elasped_time = timer.seconds(); - std::cout << std::setw(shiftw) << "allocate: " << elasped_time << std::endl; - timer.reset(); - - // generate unique ids - { - generate_ids gen(local_2_global); - } - - // generate - elasped_time = timer.seconds(); - std::cout << std::setw(shiftw) << "generate: " << elasped_time << std::endl; - timer.reset(); - - { - fill_map fill(global_2_local, local_2_global); - } - - // fill - elasped_time = timer.seconds(); - std::cout << std::setw(shiftw) << "fill: " << elasped_time << std::endl; - timer.reset(); - - - size_t num_errors = global_2_local.failed_insert(); - - if (num_errors == 0u) { - for (unsigned i=0; i find(global_2_local, local_2_global,num_errors); - } - - // find - elasped_time = timer.seconds(); - std::cout << std::setw(shiftw) << "lookup: " << elasped_time << std::endl; - } - else { - std::cout << " !!! Fill Failed !!!" << std::endl; - } - - return num_errors; -} - -template -size_t run_test(unsigned num_ids, unsigned num_find_iterations) -{ - // expect to fail - unsigned capacity = (num_ids*2u)/3u; - std::cout << " 66% of needed capacity (should fail)" << std::endl; - test_global_to_local_ids(num_ids, capacity, num_find_iterations); - - //should not fail - std::cout << " 100% of needed capacity" << std::endl; - capacity = num_ids; - size_t num_errors = test_global_to_local_ids(num_ids, capacity, num_find_iterations); - - //should not fail - std::cout << " 150% of needed capacity" << std::endl; - capacity = (num_ids*3u)/2u; - num_errors += test_global_to_local_ids(num_ids, capacity, num_find_iterations); - - return num_errors; -} - - -} // namespace G2L - - -#endif //KOKKOS_GLOBAL_TO_LOCAL_IDS_HPP - diff --git a/lib/kokkos/example/global_2_local_ids/G2L_Main.cpp b/lib/kokkos/example/global_2_local_ids/G2L_Main.cpp deleted file mode 100644 index 171ed4b5f6..0000000000 --- a/lib/kokkos/example/global_2_local_ids/G2L_Main.cpp +++ /dev/null @@ -1,149 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include - -namespace G2L { - -size_t run_serial(unsigned num_ids, unsigned num_find_iterations) -{ -#ifdef KOKKOS_HAVE_SERIAL - std::cout << "Serial" << std::endl; - return run_test(num_ids,num_find_iterations); -#else - return 0; -#endif // KOKKOS_HAVE_SERIAL -} - -size_t run_threads(unsigned num_ids, unsigned num_find_iterations) -{ -#ifdef KOKKOS_HAVE_PTHREAD - std::cout << "Threads" << std::endl; - return run_test(num_ids,num_find_iterations); -#else - return 0; -#endif -} - -size_t run_openmp(unsigned num_ids, unsigned num_find_iterations) -{ -#ifdef KOKKOS_HAVE_OPENMP - std::cout << "OpenMP" << std::endl; - return run_test(num_ids,num_find_iterations); -#else - return 0; -#endif -} - -size_t run_cuda(unsigned num_ids, unsigned num_find_iterations) -{ -#ifdef KOKKOS_HAVE_CUDA - std::cout << "Cuda" << std::endl; - return run_test(num_ids,num_find_iterations); -#else - return 0; -#endif -} - -} // namespace G2L - - -int main(int argc, char *argv[]) -{ - unsigned num_ids = 100000; - unsigned num_find_iterations = 1000; - - if (argc == 3) { - num_ids = atoi(argv[1]); - num_find_iterations = atoi(argv[2]); - } - else if (argc != 1) { - std::cout << argv[0] << " num_ids num_find_iterations" << std::endl; - return 0; - } - - - // query the topology of the host - unsigned threads_count = 4 ; - - if (Kokkos::hwloc::available()) { - threads_count = Kokkos::hwloc::get_available_numa_count() * - Kokkos::hwloc::get_available_cores_per_numa() * - Kokkos::hwloc::get_available_threads_per_core(); - - } - - std::cout << "Threads: " << threads_count << std::endl; - std::cout << "Number of ids: " << num_ids << std::endl; - std::cout << "Number of find iterations: " << num_find_iterations << std::endl; - - size_t num_errors = 0; - - num_errors += G2L::run_serial(num_ids,num_find_iterations); - -#ifdef KOKKOS_HAVE_CUDA - Kokkos::HostSpace::execution_space::initialize(threads_count); - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice(0) ); - num_errors += G2L::run_cuda(num_ids,num_find_iterations); - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); -#endif - -#ifdef KOKKOS_HAVE_PTHREAD - Kokkos::Threads::initialize( threads_count ); - num_errors += G2L::run_threads(num_ids,num_find_iterations); - Kokkos::Threads::finalize(); -#endif - -#ifdef KOKKOS_HAVE_OPENMP - Kokkos::OpenMP::initialize( threads_count ); - num_errors += G2L::run_openmp(num_ids,num_find_iterations); - Kokkos::OpenMP::finalize(); -#endif - - - return num_errors; -} - diff --git a/lib/kokkos/example/grow_array/grow_array.hpp b/lib/kokkos/example/grow_array/grow_array.hpp deleted file mode 100644 index 9daef1a4b0..0000000000 --- a/lib/kokkos/example/grow_array/grow_array.hpp +++ /dev/null @@ -1,257 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef EXAMPLE_GROW_ARRAY -#define EXAMPLE_GROW_ARRAY - -#include - -#include - -#include - -#if defined(KOKKOS_HAVE_CUDA) -#include -#include -#endif - -namespace Example { - -//---------------------------------------------------------------------------- - -template< class ExecSpace > -struct SortView { - - template< typename ValueType > - SortView( const Kokkos::View v , int begin , int end ) - { - std::sort( v.ptr_on_device() + begin , v.ptr_on_device() + end ); - } -}; - -#if defined(KOKKOS_HAVE_CUDA) -template<> -struct SortView< Kokkos::Cuda > { - template< typename ValueType > - SortView( const Kokkos::View v , int begin , int end ) - { - thrust::sort( thrust::device_ptr( v.ptr_on_device() + begin ) - , thrust::device_ptr( v.ptr_on_device() + end ) ); - } -}; -#endif - - - -//---------------------------------------------------------------------------- - -template< class ExecSpace > -struct GrowArrayFunctor { - - typedef ExecSpace execution_space ; - - enum { SHIFT = sizeof(int) == 8 ? 6 : 5 }; // 8 or 4 byte int - enum { MASK = ( 1 << SHIFT ) - 1 }; - - const Kokkos::View m_search_flags ; // bit flags for values to append - const Kokkos::View m_search_array ; // array to append values - const Kokkos::View m_search_count ; // offset - const int m_search_total ; - const int m_search_team_chunk ; - - GrowArrayFunctor( int array_length , int search_length , int print = 1 ) - : m_search_flags( "flags" , ( search_length + MASK ) >> SHIFT ) // One bit per search entry - , m_search_array( "array" , array_length ) - , m_search_count( "count" ) - , m_search_total( search_length ) - , m_search_team_chunk( 2048 ) - {} - - KOKKOS_INLINE_FUNCTION - bool flag_is_set( const int index ) const - { - // 64 or 32 bit integer: - - const int j = index >> SHIFT ; // which integer flag - const int k = 1 << ( index & MASK ); // which bit in that integer - const int s = ( j < int(m_search_flags.dimension_0()) ) && ( 0 != ( m_search_flags(j) & k ) ); - - return s ; - } - - typedef typename Kokkos::TeamPolicy::member_type team_member ; - - KOKKOS_INLINE_FUNCTION - void operator()( const team_member & member ) const - { - enum { LOCAL_BUFFER_LENGTH = 16 }; - - int local_buffer[ LOCAL_BUFFER_LENGTH ] ; - int local_count = 0 ; - - // Each team searches 'm_search_team_chunk' indices. - // The threads of a team must iterate together because all - // threads in the team must call 'team_scan' to prevent deadlock in the team. - - int search_team_begin = member.league_rank() * m_search_team_chunk ; - const int search_team_end = search_team_begin + m_search_team_chunk ; - - int k = 0 ; - - while ( search_team_begin < search_team_end ) { - - // This iteration searches [ search_team_begin .. search_team_begin + member.team_size() ] - const int thread_search_index = search_team_begin + member.team_rank(); - - // If this thread's search index is in the range - // and the flag is set, push into this thread's local buffer. - if ( thread_search_index < m_search_total && flag_is_set(thread_search_index) ) { - local_buffer[ local_count ] = thread_search_index ; - ++local_count ; - } - - // Move the team's search range forward - search_team_begin += member.team_size(); // Striding team by team size - - // Count number of times a thread's buffer might have grown: - ++k ; - - // Write buffer if end of search or a thread might have filled its buffer. - if ( k == LOCAL_BUFFER_LENGTH /* A thread in my team might have filled its buffer */ || - ! ( search_team_begin < search_team_end ) /* Team is at the end of its search */ ) { - - // Team's exclusive scan of threads' contributions, with global offset. - // This thread writes its buffer into [ team_offset .. team_offset + local_count ) - const int team_offset = member.team_scan( local_count , & *m_search_count ); - - // Copy locally buffered entries into global array: - for ( int i = 0 ; i < local_count ; ++i ) { - m_search_array( team_offset + i ) = local_buffer[i] ; - } - - k = 0 ; - local_count = 0 ; - } - } - } -}; - - -template< class ExecSpace > -void grow_array( int array_length , int search_length , int print = 1 ) -{ - typedef GrowArrayFunctor< ExecSpace > FunctorType ; - - FunctorType functor( array_length , search_length , print ); - - typename Kokkos::View::HostMirror count = Kokkos::create_mirror_view( functor.m_search_count ); - typename Kokkos::View::HostMirror flags = Kokkos::create_mirror_view( functor.m_search_flags ); - - // Set at most 'array_length' random bits over the search length. - for ( int i = 0 ; i < array_length ; ++i ) { - // 'lrand48()' generates random number between [0..2^31] - // index = ( lrand48() * search_length ) / ( 2^31 ) - const long int index = ( lrand48() * search_length ) >> 31 ; - // set the bit within the flags: - flags( index >> FunctorType::SHIFT ) |= ( 1 << ( index & FunctorType::MASK ) ); - } - - Kokkos::deep_copy( functor.m_search_flags , flags ); - - // Each team works on 'functor.m_search_team_chunk' span of the search_length - Kokkos::TeamPolicy< ExecSpace > - work( /* #teams */ ( search_length + functor.m_search_team_chunk - 1 ) / functor.m_search_team_chunk - , /* threads/team */ Kokkos::TeamPolicy< ExecSpace >::team_size_max( functor ) ); - - // Fill array: - Kokkos::parallel_for( work , functor ); - - // How much was filled: - Kokkos::deep_copy( count , functor.m_search_count ); - - // Sort array: - SortView< ExecSpace >( functor.m_search_array , 0 , *count ); - - // Mirror the results: - typename Kokkos::View::HostMirror results = Kokkos::create_mirror_view( functor.m_search_array ); - Kokkos::deep_copy( results , functor.m_search_array ); - - // Verify results: - int result_error_count = 0 ; - int flags_error_count = 0 ; - for ( int i = 0 ; i < *count ; ++i ) { - const int index = results(i); - const int entry = index >> FunctorType::SHIFT ; - const int bit = 1 << ( index & FunctorType::MASK ); - const bool flag = 0 != ( flags( entry ) & bit ); - if ( ! flag ) { - if ( print ) std::cerr << "result( " << i << " : " << index << " )"; - ++result_error_count ; - } - flags( entry ) &= ~bit ; // Clear that verified bit - } - - for ( int i = 0 ; i < int(flags.dimension_0()) ; ++i ) { - // If any uncleared bits then an error - if ( flags(i) ) { - if ( print ) std::cerr << "flags( " << i << " : " << flags(i) << " )" ; - ++flags_error_count ; - } - } - - if ( result_error_count || flags_error_count ) { - std::cerr << std::endl << "Example::GrowArrayFunctor( " << array_length - << " , " << search_length - << " ) result_error_count( " << result_error_count << " )" - << " ) flags_error_count( " << flags_error_count << " )" - << std::endl ; - } -} - - -} // namespace Example - -//---------------------------------------------------------------------------- - -#endif /* #ifndef EXAMPLE_GROW_ARRAY */ - diff --git a/lib/kokkos/example/grow_array/main.cpp b/lib/kokkos/example/grow_array/main.cpp deleted file mode 100644 index 4693aa3af4..0000000000 --- a/lib/kokkos/example/grow_array/main.cpp +++ /dev/null @@ -1,110 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -#include - -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -int main( int argc , char ** argv ) -{ - int num_threads = 4 ; - int use_numa = 1 ; - int use_core = 1 ; - int length_array = 1000000 ; - int span_values = 100000000 ; - - - if ( Kokkos::hwloc::available() ) { - use_numa = Kokkos::hwloc::get_available_numa_count(); - use_core = Kokkos::hwloc::get_available_cores_per_numa() - 1 ; - num_threads = use_numa * use_core * Kokkos::hwloc::get_available_threads_per_core(); - } - -#if defined( KOKKOS_HAVE_SERIAL ) - { - std::cout << "Kokkos::Serial" << std::endl ; - // The Serial device accepts these arguments, though it may ignore them. - Kokkos::Serial::initialize( num_threads , use_numa , use_core ); - Example::grow_array< Kokkos::Serial >( length_array , span_values ); - Kokkos::Serial::finalize (); - } -#endif // defined( KOKKOS_HAVE_SERIAL ) - -#if defined( KOKKOS_HAVE_PTHREAD ) - { - std::cout << "Kokkos::Threads" << std::endl ; - Kokkos::Threads::initialize( num_threads , use_numa , use_core ); - Example::grow_array< Kokkos::Threads >( length_array , span_values ); - Kokkos::Threads::finalize(); - } -#endif - -#if defined( KOKKOS_HAVE_OPENMP ) - { - std::cout << "Kokkos::OpenMP" << std::endl ; - Kokkos::OpenMP::initialize( num_threads , use_numa , use_core ); - Example::grow_array< Kokkos::OpenMP >( length_array , span_values ); - Kokkos::OpenMP::finalize(); - } -#endif - -#if defined( KOKKOS_HAVE_CUDA ) - { - std::cout << "Kokkos::Cuda" << std::endl ; - Kokkos::HostSpace::execution_space::initialize(1); - Kokkos::Cuda::initialize(); - Example::grow_array< Kokkos::Cuda >( length_array , span_values ); - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); - } -#endif - - return 0 ; -} - diff --git a/lib/kokkos/example/md_skeleton/README b/lib/kokkos/example/md_skeleton/README deleted file mode 100644 index 1ce682b0a6..0000000000 --- a/lib/kokkos/example/md_skeleton/README +++ /dev/null @@ -1,3 +0,0 @@ -To build this example on a 2012-model Macbook Pro with NVIDIA Kepler GPU: - -./build.cuda_std g++_osx cuda_osx 30 opt diff --git a/lib/kokkos/example/md_skeleton/force.cpp b/lib/kokkos/example/md_skeleton/force.cpp deleted file mode 100644 index a31944f859..0000000000 --- a/lib/kokkos/example/md_skeleton/force.cpp +++ /dev/null @@ -1,192 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -/* Define values which set the max number of registers used for the Force Kernel - * Its 32 * 2048 / (KOKKOS_CUDA_MAX_THREADS * KOKKOS_CUDA_MIN_BLOCKS) - * Have to be set before including Kokkos header files. - */ - -#define KOKKOS_CUDA_MAX_THREADS 512 -#define KOKKOS_CUDA_MIN_BLOCKS 3 - -#include -#include - - -/* Simple Lennard Jones Force Kernel using neighborlists - * Calculates for every pair of atoms (i,j) with distance smaller r_cut - * f_ij = 4*epsilon * ( (sigma/r_ij)^12 - (sigma/r_ij)^6 ) - * where r_ij is the distance of atoms (i,j). - * The force on atom i is the sum over f_ij: - * f_i = sum_j (f_ij) - * Neighborlists are used in order to pre calculate which atoms j are - * close enough to i to be able to contribute. By choosing a larger neighbor - * cutoff then the force cutoff, the neighbor list can be reused several times - * (typically 10 - 100). - */ - -struct ForceFunctor { - - typedef t_x_array::execution_space execution_space; //Device Type for running the kernel - typedef double2 value_type; // When energy calculation is requested return energy, and virial - - t_x_array_randomread x; //atom positions - t_f_array f; //atom forces - t_int_1d_const numneigh; //number of neighbors per atom - t_neighbors_const neighbors; //neighborlist - double cutforcesq; //force cutoff - double epsilon; //Potential parameter - double sigma6; //Potential parameter - - - ForceFunctor(System s) { - x = s.d_x; - f = s.f; - numneigh = s.numneigh; - neighbors = s.neighbors; - cutforcesq = s.force_cutsq; - epsilon = 1.0; - sigma6 = 1.0; - } - - /* Operator for not calculating energy and virial */ - - KOKKOS_INLINE_FUNCTION - void operator() (const int &i) const { - force<0>(i); - } - - /* Operator for calculating energy and virial */ - - KOKKOS_INLINE_FUNCTION - void operator() (const int &i, double2 &energy_virial) const { - double2 ev = force<1>(i); - energy_virial.x += ev.x; - energy_virial.y += ev.y; - } - - template - KOKKOS_INLINE_FUNCTION - double2 force(const int &i) const - { - const int numneighs = numneigh[i]; - const double xtmp = x(i, 0); - const double ytmp = x(i, 1); - const double ztmp = x(i, 2); - double fix = 0; - double fiy = 0; - double fiz = 0; - double energy = 0; - double virial = 0; - - //pragma simd forces vectorization (ignoring the performance objections of the compiler) - //give hint to compiler that fix, fiy and fiz are used for reduction only - - #ifdef USE_SIMD - #pragma simd reduction (+: fix,fiy,fiz,energy,virial) - #endif - for(int k = 0; k < numneighs; k++) { - const int j = neighbors(i, k); - const double delx = xtmp - x(j, 0); - const double dely = ytmp - x(j, 1); - const double delz = ztmp - x(j, 2); - const double rsq = delx * delx + dely * dely + delz * delz; - - //if(i==0) printf("%i %i %lf %lf\n",i,j,rsq,cutforcesq); - if(rsq < cutforcesq) { - const double sr2 = 1.0 / rsq; - const double sr6 = sr2 * sr2 * sr2 * sigma6; - const double force = 48.0 * sr6 * (sr6 - 0.5) * sr2 * epsilon; - fix += delx * force; - fiy += dely * force; - fiz += delz * force; - - if(EVFLAG) { - energy += sr6 * (sr6 - 1.0) * epsilon; - virial += delx * delx * force + dely * dely * force + delz * delz * force; - } - } - } - - f(i, 0) += fix; - f(i, 1) += fiy; - f(i, 2) += fiz; - - double2 energy_virial ; - energy_virial.x = 4.0 * energy ; - energy_virial.y = 0.5 * virial ; - return energy_virial; - } - - /* init and join functions when doing the reduction to obtain energy and virial */ - - KOKKOS_FUNCTION - static void init(volatile value_type &update) { - update.x = update.y = 0; - } - KOKKOS_FUNCTION - static void join(volatile value_type &update , - const volatile value_type &source) { - update.x += source.x ; - update.y += source.y ; - } - -}; - - -/* Calling function */ - -double2 force(System &s,int evflag) { - - ForceFunctor f(s); - - double2 ev ; ev.x = 0 ; ev.y = 0 ; - if(!evflag) - Kokkos::parallel_for(s.nlocal,f); - else - Kokkos::parallel_reduce(s.nlocal,f,ev); - - execution_space::fence(); - return ev; -} - diff --git a/lib/kokkos/example/md_skeleton/main.cpp b/lib/kokkos/example/md_skeleton/main.cpp deleted file mode 100644 index 06287bc609..0000000000 --- a/lib/kokkos/example/md_skeleton/main.cpp +++ /dev/null @@ -1,205 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include "system.h" - -int create_system(System &system, int nx, int ny, int nz, double rho); -int neigh_setup(System &system); -int neigh_build(System &system); -double2 force(System &system,int evflag); - -/* simple MD Skeleton which - * - constructs a simple FCC lattice, - * - computes a neighborlist - * - compute LJ-Force kernel a number of times - */ - -int main(int argc, char** argv) { - - printf("Running MD Skeleton\n"); - /* Thread numbers for Host */ - - int num_threads = 1; - int teams = 1; - int device = 0; // Default device for GPU runs - - /* avoid unused variable warnings */ - (void)num_threads; - (void)teams; - (void)device; - - /* Default value for number of force calculations */ - - int iter = 100; - - /* Default value for system size (4*nx*ny*nz atoms) - * nx, ny and nz are set to system_size if not specififed on commandline */ - - int system_size = 20; - int nx = -1; - int ny = -1; - int nz = -1; - - int neighbor_size = 1; // Default bin size for neighbor list construction - - double rho = 0.8442; // Number density of the system - double delta = 0; // Scaling factor for random offsets of atom positions - - - /* read in command-line arguments */ - - for(int i = 0; i < argc; i++) { - if((strcmp(argv[i], "-t") == 0) || (strcmp(argv[i], "--num_threads") == 0)) { - num_threads = atoi(argv[++i]); - continue; - } - - if((strcmp(argv[i], "--teams") == 0)) { - teams = atoi(argv[++i]); - continue; - } - - if((strcmp(argv[i], "-d") == 0) || (strcmp(argv[i], "--device") == 0)) { - device = atoi(argv[++i]); - continue; - } - - if((strcmp(argv[i], "--delta") == 0)) { - delta = atof(argv[++i]); - continue; - } - - if((strcmp(argv[i], "-i") == 0) || (strcmp(argv[i], "--iter") == 0)) { - iter = atoi(argv[++i]); - continue; - } - - if((strcmp(argv[i], "-rho") == 0)) { - rho = atoi(argv[++i]); - continue; - } - - if((strcmp(argv[i], "-s") == 0) || (strcmp(argv[i], "--size") == 0)) { - system_size = atoi(argv[++i]); - continue; - } - - if((strcmp(argv[i], "-nx") == 0)) { - nx = atoi(argv[++i]); - continue; - } - - if((strcmp(argv[i], "-ny") == 0)) { - ny = atoi(argv[++i]); - continue; - } - - if((strcmp(argv[i], "-nz") == 0)) { - nz = atoi(argv[++i]); - continue; - } - - if((strcmp(argv[i], "-b") == 0) || (strcmp(argv[i], "--neigh_bins") == 0)) { - neighbor_size = atoi(argv[++i]); - continue; - } - } - - if( nx < 0 ) nx = system_size; - if( ny < 0 ) ny = system_size; - if( nz < 0 ) nz = system_size; - - printf("-> Init Device\n"); - -#if defined( KOKKOS_HAVE_CUDA ) - Kokkos::HostSpace::execution_space::initialize(teams*num_threads); - Kokkos::Cuda::SelectDevice select_device(device); - Kokkos::Cuda::initialize(select_device); -#elif defined( KOKKOS_HAVE_OPENMP ) - Kokkos::OpenMP::initialize(teams*num_threads); -#elif defined( KOKKOS_HAVE_PTHREAD ) - Kokkos::Threads::initialize(teams*num_threads); -#endif - - System system; - system.neigh_cut = 2.8; - system.force_cut = 2.5; - system.force_cutsq = system.force_cut*system.force_cut; - system.delta = delta; - - printf("-> Build system\n"); - create_system(system,nx,ny,nz,rho); - - printf("-> Created %i atoms and %i ghost atoms\n",system.nlocal,system.nghost); - - system.nbinx = system.box.xprd/neighbor_size+1; - system.nbiny = system.box.yprd/neighbor_size+1; - system.nbinz = system.box.zprd/neighbor_size+1; - - - printf("-> Building Neighborlist\n"); - - neigh_setup(system); - neigh_build(system); - - double2 ev = force(system,1); - - printf("-> Calculate Energy: %f Virial: %f\n",ev.x,ev.y); - - printf("-> Running %i force calculations\n",iter); - - Kokkos::Impl::Timer timer; - - for(int i=0;i -#include -#include - -#define SMALL 1.0e-6 -#define FACTOR 0.999 - -/* BinningFunctor puts atoms into bins of the simulation box - * Neighborlists are then created by checking only distances of atoms - * in adjacent bins. That makes neighborlist construction a O(N) operation. - */ - -struct BinningFunctor { - typedef t_int_2d::execution_space execution_space; - - System s; - - int atoms_per_bin; - - BinningFunctor(System _s): s(_s) { - atoms_per_bin = s.bins.dimension_1(); - } - - KOKKOS_INLINE_FUNCTION - void operator() (const int &i) const - { - const int ibin = coord2bin(s.d_x(i, 0), s.d_x(i, 1), s.d_x(i, 2)); - - const int ac = Kokkos::atomic_fetch_add(&s.bincount[ibin], 1); - - if(ac < atoms_per_bin) { - s.bins(ibin, ac) = i; - } else if(s.d_resize(0) < ac) { - s.d_resize(0) = ac; - } - } - - KOKKOS_INLINE_FUNCTION - int coord2bin(double x, double y, double z) const - { - int ix, iy, iz; - - if(x >= s.box.xprd) - ix = (int)((x - s.box.xprd) * s.bininvx) + s.nbinx - s.mbinxlo; - else if(x >= 0.0) - ix = (int)(x * s.bininvx) - s.mbinxlo; - else - ix = (int)(x * s.bininvx) - s.mbinxlo - 1; - - if(y >= s.box.yprd) - iy = (int)((y - s.box.yprd) * s.bininvy) + s.nbiny - s.mbinylo; - else if(y >= 0.0) - iy = (int)(y * s.bininvy) - s.mbinylo; - else - iy = (int)(y * s.bininvy) - s.mbinylo - 1; - - if(z >= s.box.zprd) - iz = (int)((z - s.box.zprd) * s.bininvz) + s.nbinz - s.mbinzlo; - else if(z >= 0.0) - iz = (int)(z * s.bininvz) - s.mbinzlo; - else - iz = (int)(z * s.bininvz) - s.mbinzlo - 1; - - return (iz * s.mbiny * s.mbinx + iy * s.mbinx + ix + 1); - } -}; - -/* Build the actual neighborlist*/ - -struct BuildFunctor { - - typedef t_int_2d::execution_space execution_space; - - System s; - - int maxneighs; - BuildFunctor(System _s): s(_s) { - maxneighs = s.neighbors.dimension_1(); - } - - KOKKOS_INLINE_FUNCTION - void operator() (const int &i) const - { - int n = 0; - - const t_int_1d_const_um bincount_c = s.bincount; - - const double xtmp = s.d_x(i, 0); - const double ytmp = s.d_x(i, 1); - const double ztmp = s.d_x(i, 2); - - const int ibin = coord2bin(xtmp, ytmp, ztmp); - - // loop over all bins in neighborhood (includes ibin) - for(int k = 0; k < s.nstencil; k++) { - const int jbin = ibin + s.d_stencil[k]; - - // get subview of jbin - const t_int_1d_const_um loc_bin = - Kokkos::subview(s.bins,jbin,Kokkos::ALL()); - - if(ibin == jbin) - for(int m = 0; m < bincount_c[jbin]; m++) { - const int j = loc_bin[m]; - - //for same bin as atom i skip j if i==j - if (j == i) continue; - - const double delx = xtmp - s.d_x(j, 0); - const double dely = ytmp - s.d_x(j, 1); - const double delz = ztmp - s.d_x(j, 2); - const double rsq = delx * delx + dely * dely + delz * delz; - - if(rsq <= s.neigh_cutsq && n= maxneighs) { - if(n >= s.d_resize(0)) s.d_resize(0) = n; - } - } - - KOKKOS_INLINE_FUNCTION - int coord2bin(double x, double y, double z) const - { - int ix, iy, iz; - - if(x >= s.box.xprd) - ix = (int)((x - s.box.xprd) * s.bininvx) + s.nbinx - s.mbinxlo; - else if(x >= 0.0) - ix = (int)(x * s.bininvx) - s.mbinxlo; - else - ix = (int)(x * s.bininvx) - s.mbinxlo - 1; - - if(y >= s.box.yprd) - iy = (int)((y - s.box.yprd) * s.bininvy) + s.nbiny - s.mbinylo; - else if(y >= 0.0) - iy = (int)(y * s.bininvy) - s.mbinylo; - else - iy = (int)(y * s.bininvy) - s.mbinylo - 1; - - if(z >= s.box.zprd) - iz = (int)((z - s.box.zprd) * s.bininvz) + s.nbinz - s.mbinzlo; - else if(z >= 0.0) - iz = (int)(z * s.bininvz) - s.mbinzlo; - else - iz = (int)(z * s.bininvz) - s.mbinzlo - 1; - - return (iz * s.mbiny * s.mbinx + iy * s.mbinx + ix + 1); - } -}; - -/* Reset an array to zero */ - -struct MemsetZeroFunctor { - typedef t_x_array::execution_space execution_space ; - void* ptr; - KOKKOS_INLINE_FUNCTION void operator()(const int i) const { - ((int*)ptr)[i] = 0; - } -}; - -/* Calculate distance of two bins */ - -double bindist(System &s, int i, int j, int k) -{ - double delx, dely, delz; - - if(i > 0) - delx = (i - 1) * s.binsizex; - else if(i == 0) - delx = 0.0; - else - delx = (i + 1) * s.binsizex; - - if(j > 0) - dely = (j - 1) * s.binsizey; - else if(j == 0) - dely = 0.0; - else - dely = (j + 1) * s.binsizey; - - if(k > 0) - delz = (k - 1) * s.binsizez; - else if(k == 0) - delz = 0.0; - else - delz = (k + 1) * s.binsizez; - - return (delx * delx + dely * dely + delz * delz); -} - -/* Setup the neighborlist construction - * Determine binsizes, a stencil for defining adjacency, etc. - */ - -void neigh_setup(System &s) { - - s.neigh_cutsq = s.neigh_cut * s.neigh_cut; - - /* - c bins must evenly divide into box size, - c becoming larger than cutneigh if necessary - c binsize = 1/2 of cutoff is near optimal - - if (flag == 0) { - nbinx = 2.0 * xprd / cutneigh; - nbiny = 2.0 * yprd / cutneigh; - nbinz = 2.0 * zprd / cutneigh; - if (nbinx == 0) nbinx = 1; - if (nbiny == 0) nbiny = 1; - if (nbinz == 0) nbinz = 1; - } - */ - - s.binsizex = s.box.xprd / s.nbinx; - s.binsizey = s.box.yprd / s.nbiny; - s.binsizez = s.box.zprd / s.nbinz; - s.bininvx = 1.0 / s.binsizex; - s.bininvy = 1.0 / s.binsizey; - s.bininvz = 1.0 / s.binsizez; - - double coord = s.box.xlo - s.neigh_cut - SMALL * s.box.xprd; - s.mbinxlo = static_cast(coord * s.bininvx); - - if(coord < 0.0) s.mbinxlo = s.mbinxlo - 1; - - coord = s.box.xhi + s.neigh_cut + SMALL * s.box.xprd; - int mbinxhi = static_cast(coord * s.bininvx); - - coord = s.box.ylo - s.neigh_cut - SMALL * s.box.yprd; - s.mbinylo = static_cast(coord * s.bininvy); - - if(coord < 0.0) s.mbinylo = s.mbinylo - 1; - - coord = s.box.yhi + s.neigh_cut + SMALL * s.box.yprd; - int mbinyhi = static_cast(coord * s.bininvy); - - coord = s.box.zlo - s.neigh_cut - SMALL * s.box.zprd; - s.mbinzlo = static_cast(coord * s.bininvz); - - if(coord < 0.0) s.mbinzlo = s.mbinzlo - 1; - - coord = s.box.zhi + s.neigh_cut + SMALL * s.box.zprd; - int mbinzhi = static_cast(coord * s.bininvz); - - /* extend bins by 1 in each direction to insure stencil coverage */ - - s.mbinxlo = s.mbinxlo - 1; - mbinxhi = mbinxhi + 1; - s.mbinx = mbinxhi - s.mbinxlo + 1; - - s.mbinylo = s.mbinylo - 1; - mbinyhi = mbinyhi + 1; - s.mbiny = mbinyhi - s.mbinylo + 1; - - s.mbinzlo = s.mbinzlo - 1; - mbinzhi = mbinzhi + 1; - s.mbinz = mbinzhi - s.mbinzlo + 1; - - /* - compute bin stencil of all bins whose closest corner to central bin - is within neighbor cutoff - for partial Newton (newton = 0), - stencil is all surrounding bins including self - for full Newton (newton = 1), - stencil is bins to the "upper right" of central bin, does NOT include self - next(xyz) = how far the stencil could possibly extend - factor < 1.0 for special case of LJ benchmark so code will create - correct-size stencil when there are 3 bins for every 5 lattice spacings - */ - - int nextx = static_cast(s.neigh_cut * s.bininvx); - - if(nextx * s.binsizex < FACTOR * s.neigh_cut) nextx++; - - int nexty = static_cast(s.neigh_cut * s.bininvy); - - if(nexty * s.binsizey < FACTOR * s.neigh_cut) nexty++; - - int nextz = static_cast(s.neigh_cut * s.bininvz); - - if(nextz * s.binsizez < FACTOR * s.neigh_cut) nextz++; - - int nmax = (2 * nextz + 1) * (2 * nexty + 1) * (2 * nextx + 1); - s.d_stencil = t_int_1d("stencil", nmax); - s.h_stencil = Kokkos::create_mirror_view(s.d_stencil); - s.nstencil = 0; - int kstart = -nextz; - - for(int k = kstart; k <= nextz; k++) { - for(int j = -nexty; j <= nexty; j++) { - for(int i = -nextx; i <= nextx; i++) { - if(bindist(s,i, j, k) < s.neigh_cutsq) { - s.h_stencil(s.nstencil++) = k * s.mbiny * s.mbinx + j * s.mbinx + i; - } - } - } - } - - /* Allocate neighbor arrays */ - - Kokkos::deep_copy(s.d_stencil, s.h_stencil); - s.mbins = s.mbinx * s.mbiny * s.mbinz; - s.bincount = t_int_1d("bincount", s.mbins); - s.bins = t_int_2d("bins", s.mbins, 8); - - s.neighbors = t_neighbors("neighbors",s.natoms,80); - s.numneigh = t_int_1d("numneigh",s.natoms); - s.d_resize = t_int_scalar("resize"); - s.h_resize = Kokkos::create_mirror_view(s.d_resize); -} - - -/* Build the neighborlist - * This is a try and rerun algorithm for handling the case where the bins array - * and the neighbors array are not big enough. So if one is too small, it will - * reallocate and rerun the binnind algorithm or the neighborlist construction. - */ - -void neigh_build(System &s) { - - /* Binning of atoms */ - - s.h_resize(0) = 1; - - while(s.h_resize(0) > 0) { - s.h_resize(0) = 0; - Kokkos::deep_copy(s.d_resize, s.h_resize); - - MemsetZeroFunctor f_zero; - f_zero.ptr = (void*) s.bincount.ptr_on_device(); - Kokkos::parallel_for(s.mbins, f_zero); - execution_space::fence(); - - BinningFunctor f(s); - Kokkos::parallel_for(s.natoms, f); - execution_space::fence(); - - /* Check if bins was large enough, if nor reallocated and rerun */ - - deep_copy(s.h_resize, s.d_resize); - - if(s.h_resize(0)) { - int atoms_per_bin = s.h_resize(0)+2; - s.bins = t_int_2d("bins", s.mbins, atoms_per_bin); - } - } - - /* Neighborlist construction */ - - s.h_resize(0) = 1; - - while(s.h_resize(0)) { - s.h_resize(0) = 0; - - Kokkos::deep_copy(s.d_resize, s.h_resize); - - BuildFunctor f(s); - Kokkos::parallel_for(s.nlocal, f); - - execution_space::fence(); - - /* Check if neighbors was large enough, if nor reallocated and rerun */ - - deep_copy(s.h_resize, s.d_resize); - - if(s.h_resize(0)) { - int maxneighs = s.h_resize(0) * 1.2; - s.neighbors = t_neighbors("neighbors", s.natoms, maxneighs); - } - } -} diff --git a/lib/kokkos/example/md_skeleton/setup.cpp b/lib/kokkos/example/md_skeleton/setup.cpp deleted file mode 100644 index 7815a89101..0000000000 --- a/lib/kokkos/example/md_skeleton/setup.cpp +++ /dev/null @@ -1,271 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -/* initialize atoms on fcc lattice in parallel fashion */ - -#define MAX(a,b) (a>b?a:b) -#define MIN(a,b) (a(system.box.xlo / (0.5 * alat) - 1); - int ihi = static_cast(system.box.xhi / (0.5 * alat) + 1); - int jlo = static_cast(system.box.ylo / (0.5 * alat) - 1); - int jhi = static_cast(system.box.yhi / (0.5 * alat) + 1); - int klo = static_cast(system.box.zlo / (0.5 * alat) - 1); - int khi = static_cast(system.box.zhi / (0.5 * alat) + 1); - - ilo = MAX(ilo, 0); - ihi = MIN(ihi, 2 * nx - 1); - jlo = MAX(jlo, 0); - jhi = MIN(jhi, 2 * ny - 1); - klo = MAX(klo, 0); - khi = MIN(khi, 2 * nz - 1); - - - - /* generates positions of atoms on fcc sublattice*/ - - srand(3718273); - /* create non-ghost atoms */ - { - double xtmp, ytmp, ztmp; - int sx = 0; - int sy = 0; - int sz = 0; - int ox = 0; - int oy = 0; - int oz = 0; - int subboxdim = 8; - - int n = 0; - int iflag = 0; - - while(oz * subboxdim <= khi) { - const int k = oz * subboxdim + sz; - const int j = oy * subboxdim + sy; - const int i = ox * subboxdim + sx; - - if(iflag) continue; - - if(((i + j + k) % 2 == 0) && - (i >= ilo) && (i <= ihi) && - (j >= jlo) && (j <= jhi) && - (k >= klo) && (k <= khi)) { - - const int nold = n; - while(nold == n) { - xtmp = 0.5 * alat * i + system.delta/1000*(rand()%1000-500); - ytmp = 0.5 * alat * j + system.delta/1000*(rand()%1000-500); - ztmp = 0.5 * alat * k + system.delta/1000*(rand()%1000-500); - - if(xtmp >= system.box.xlo && xtmp < system.box.xhi && - ytmp >= system.box.ylo && ytmp < system.box.yhi && - ztmp >= system.box.zlo && ztmp < system.box.zhi) { - system.h_x(n,0) = xtmp; - system.h_x(n,1) = ytmp; - system.h_x(n,2) = ztmp; - n++; - } - } - } - - sx++; - - if(sx == subboxdim) { - sx = 0; - sy++; - } - - if(sy == subboxdim) { - sy = 0; - sz++; - } - - if(sz == subboxdim) { - sz = 0; - ox++; - } - - if(ox * subboxdim > ihi) { - ox = 0; - oy++; - } - - if(oy * subboxdim > jhi) { - oy = 0; - oz++; - } - } - - /* check that correct # of atoms were created */ - - if(system.nlocal != n) { - printf("Created incorrect # of atoms\n"); - - return 1; - } - } - - /* create ghost atoms */ - - { - double xtmp, ytmp, ztmp; - - int ilo_g = ilo - 2 * ghost_dist; - int jlo_g = jlo - 2 * ghost_dist; - int klo_g = klo - 2 * ghost_dist; - int ihi_g = ihi + 2 * ghost_dist; - int jhi_g = jhi + 2 * ghost_dist; - int khi_g = khi + 2 * ghost_dist; - - int subboxdim = 8; - int sx = 0; - int sy = 0; - int sz = 0; - int ox = subboxdim * ilo_g; - int oy = subboxdim * jlo_g; - int oz = subboxdim * klo_g; - - int n = system.nlocal; - int iflag = 0; - - - while(oz * subboxdim <= khi_g) { - const int k = oz * subboxdim + sz; - const int j = oy * subboxdim + sy; - const int i = ox * subboxdim + sx; - - if(iflag) continue; - - if(((i + j + k) % 2 == 0) && - (i >= ilo_g) && (i <= ihi_g) && - (j >= jlo_g) && (j <= jhi_g) && - (k >= klo_g) && (k <= khi_g) && - ((i < ilo) || (i > ihi) || - (j < jlo) || (j > jhi) || - (k < klo) || (k > khi)) - ) { - - xtmp = 0.5 * alat * i; - ytmp = 0.5 * alat * j; - ztmp = 0.5 * alat * k; - - system.h_x(n,0) = xtmp + system.delta/1000*(rand()%1000-500);; - system.h_x(n,1) = ytmp + system.delta/1000*(rand()%1000-500);; - system.h_x(n,2) = ztmp + system.delta/1000*(rand()%1000-500);; - n++; - } - - sx++; - - if(sx == subboxdim) { - sx = 0; - sy++; - } - - if(sy == subboxdim) { - sy = 0; - sz++; - } - - if(sz == subboxdim) { - sz = 0; - ox++; - //printf("%i %i %i // %i %i %i\n",ox,oy,oz,i,j,k); - } - - if(ox * subboxdim > ihi_g) { - ox = subboxdim * ilo_g; - oy++; - } - - if(oy * subboxdim > jhi_g) { - oy = subboxdim * jlo_g; - oz++; - } - } - } - - Kokkos::deep_copy(system.d_x,system.h_x); - return 0; -} - diff --git a/lib/kokkos/example/md_skeleton/system.h b/lib/kokkos/example/md_skeleton/system.h deleted file mode 100644 index 0184a119ff..0000000000 --- a/lib/kokkos/example/md_skeleton/system.h +++ /dev/null @@ -1,92 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef SYSTEM_H_ -#define SYSTEM_H_ - -#include - -struct Box { - double xprd, yprd, zprd; - double xlo, xhi; - double ylo, yhi; - double zlo, zhi; -}; - -struct System { - Box box; - - int natoms; - int nlocal; - int nghost; - - t_x_array d_x; - t_x_array_host h_x; - - t_f_array f; - - t_neighbors neighbors; - t_int_1d numneigh; - - double delta; - - double neigh_cut,neigh_cutsq; - - int mbins; - int nbinx,nbiny,nbinz; - int mbinx,mbiny,mbinz; - int mbinxlo,mbinylo,mbinzlo; - double binsizex,binsizey,binsizez; - double bininvx,bininvy,bininvz; - - t_int_1d bincount; - t_int_2d bins; - t_int_scalar d_resize; - t_int_scalar_host h_resize; - t_int_1d d_stencil; - t_int_1d_host h_stencil; - int nstencil; - - double force_cut,force_cutsq; -}; -#endif diff --git a/lib/kokkos/example/md_skeleton/types.h b/lib/kokkos/example/md_skeleton/types.h deleted file mode 100644 index 7f92b7cd0f..0000000000 --- a/lib/kokkos/example/md_skeleton/types.h +++ /dev/null @@ -1,118 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef TYPES_H_ -#define TYPES_H_ - -/* Determine default device type and necessary includes */ - -#include - -typedef Kokkos::DefaultExecutionSpace execution_space ; - -#if ! defined( KOKKOS_HAVE_CUDA ) - struct double2 { - double x, y; - KOKKOS_INLINE_FUNCTION - double2(double xinit, double yinit) { - x = xinit; - y = yinit; - } - KOKKOS_INLINE_FUNCTION - double2() { - x = 0.0; - y = 0.0; - } - KOKKOS_INLINE_FUNCTION - double2& operator += (const double2& src) { - x+=src.x; - y+=src.y; - return *this; - } - - KOKKOS_INLINE_FUNCTION - volatile double2& operator += (const volatile double2& src) volatile { - x+=src.x; - y+=src.y; - return *this; - } - - }; -#endif - -#include - -/* Define types used throughout the code */ - -//Position arrays -typedef Kokkos::View t_x_array ; -typedef t_x_array::HostMirror t_x_array_host ; -typedef Kokkos::View t_x_array_const ; -typedef Kokkos::View t_x_array_randomread ; - -//Force array -typedef Kokkos::View t_f_array ; - - -//Neighborlist -typedef Kokkos::View t_neighbors ; -typedef Kokkos::View t_neighbors_const ; -typedef Kokkos::View t_neighbors_sub ; -typedef Kokkos::View t_neighbors_const_sub ; - -//1d int array -typedef Kokkos::View t_int_1d ; -typedef t_int_1d::HostMirror t_int_1d_host ; -typedef Kokkos::View t_int_1d_const ; -typedef Kokkos::View t_int_1d_um ; -typedef Kokkos::View t_int_1d_const_um ; - -//2d int array -typedef Kokkos::View t_int_2d ; -typedef t_int_2d::HostMirror t_int_2d_host ; - -//Scalar ints -typedef Kokkos::View t_int_scalar ; -typedef t_int_scalar::HostMirror t_int_scalar_host ; - -#endif /* TYPES_H_ */ diff --git a/lib/kokkos/example/multi_fem/BoxMeshFixture.hpp b/lib/kokkos/example/multi_fem/BoxMeshFixture.hpp deleted file mode 100644 index 195bb4a6ae..0000000000 --- a/lib/kokkos/example/multi_fem/BoxMeshFixture.hpp +++ /dev/null @@ -1,610 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_BOXMESHFIXTURE_HPP -#define KOKKOS_BOXMESHFIXTURE_HPP - -#include -#include -#include - -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -struct FixtureElementHex8 { - - static const unsigned element_node_count = 8 ; - - HybridFEM::HexElement_TensorData< element_node_count > elem_data ; - BoxBoundsLinear box_bounds ; - - FixtureElementHex8() : elem_data(), box_bounds() {} - - static void create_node_boxes_from_vertex_boxes( - const BoxType & vertex_box_global , - const std::vector< BoxType > & vertex_box_parts , - BoxType & node_box_global , - std::vector< BoxType > & node_box_parts ) - { - node_box_global = vertex_box_global ; - node_box_parts = vertex_box_parts ; - } - - void elem_to_node( const unsigned node_local , unsigned coord[] ) const - { - coord[0] += elem_data.eval_map[ node_local ][0] ; - coord[1] += elem_data.eval_map[ node_local ][1] ; - coord[2] += elem_data.eval_map[ node_local ][2] ; - } -}; - -struct FixtureElementHex27 { - static const unsigned element_node_count = 27 ; - - HybridFEM::HexElement_TensorData< element_node_count > elem_data ; - BoxBoundsQuadratic box_bounds ; - - FixtureElementHex27() : elem_data(), box_bounds() {} - - static void create_node_boxes_from_vertex_boxes( - const BoxType & vertex_box_global , - const std::vector< BoxType > & vertex_box_parts , - BoxType & node_box_global , - std::vector< BoxType > & node_box_parts ) - { - node_box_global = vertex_box_global ; - node_box_parts = vertex_box_parts ; - - node_box_global[0][1] = 2 * node_box_global[0][1] - 1 ; - node_box_global[1][1] = 2 * node_box_global[1][1] - 1 ; - node_box_global[2][1] = 2 * node_box_global[2][1] - 1 ; - - for ( unsigned i = 0 ; i < vertex_box_parts.size() ; ++i ) { - node_box_parts[i][0][0] = 2 * node_box_parts[i][0][0] ; - node_box_parts[i][1][0] = 2 * node_box_parts[i][1][0] ; - node_box_parts[i][2][0] = 2 * node_box_parts[i][2][0] ; - - node_box_parts[i][0][1] = - std::min( node_box_global[0][1] , 2 * node_box_parts[i][0][1] ); - node_box_parts[i][1][1] = - std::min( node_box_global[1][1] , 2 * node_box_parts[i][1][1] ); - node_box_parts[i][2][1] = - std::min( node_box_global[2][1] , 2 * node_box_parts[i][2][1] ); - } - } - - void elem_to_node( const unsigned node_local , unsigned coord[] ) const - { - coord[0] = 2 * coord[0] + elem_data.eval_map[ node_local ][0] ; - coord[1] = 2 * coord[1] + elem_data.eval_map[ node_local ][1] ; - coord[2] = 2 * coord[2] + elem_data.eval_map[ node_local ][2] ; - } -}; - -//---------------------------------------------------------------------------- - -template< typename Scalar , class Device , class ElementSpec > -struct BoxMeshFixture { - - typedef Scalar coordinate_scalar_type ; - typedef Device execution_space ; - - static const unsigned element_node_count = ElementSpec::element_node_count ; - - typedef HybridFEM::FEMesh< coordinate_scalar_type , - element_node_count , - execution_space > FEMeshType ; - - typedef typename FEMeshType::node_coords_type node_coords_type ; - typedef typename FEMeshType::elem_node_ids_type elem_node_ids_type ; - typedef typename FEMeshType::node_elem_ids_type node_elem_ids_type ; - - - static void verify( - const typename FEMeshType::node_coords_type::HostMirror & node_coords , - const typename FEMeshType::elem_node_ids_type::HostMirror & elem_node_ids , - const typename FEMeshType::node_elem_ids_type::HostMirror & node_elem_ids ) - { - typedef typename FEMeshType::size_type size_type ; - //typedef typename node_coords_type::value_type coords_type ; // unused - - const size_type node_count_total = node_coords.dimension_0(); - const size_type elem_count_total = elem_node_ids.dimension_0(); - - const ElementSpec element ; - - for ( size_type node_index = 0 ; - node_index < node_count_total ; ++node_index ) { - - for ( size_type - j = node_elem_ids.row_map[ node_index ] ; - j < node_elem_ids.row_map[ node_index + 1 ] ; ++j ) { - - const size_type elem_index = node_elem_ids.entries(j,0); - const size_type node_local = node_elem_ids.entries(j,1); - const size_type en_id = elem_node_ids(elem_index,node_local); - - if ( node_index != en_id ) { - std::ostringstream msg ; - msg << "BoxMeshFixture node_elem_ids error" - << " : node_index(" << node_index - << ") entry(" << j - << ") elem_index(" << elem_index - << ") node_local(" << node_local - << ") elem_node_id(" << en_id - << ")" ; - throw std::runtime_error( msg.str() ); - } - } - } - - for ( size_type elem_index = 0 ; - elem_index < elem_count_total; ++elem_index ) { - - coordinate_scalar_type elem_node_coord[ element_node_count ][3] ; - - for ( size_type nn = 0 ; nn < element_node_count ; ++nn ) { - const size_type node_index = elem_node_ids( elem_index , nn ); - - for ( size_type nc = 0 ; nc < 3 ; ++nc ) { - elem_node_coord[nn][nc] = node_coords( node_index , nc ); - } - } - - - for ( size_type nn = 0 ; nn < element_node_count ; ++nn ) { - - const unsigned ix = element.elem_data.eval_map[nn][0] ; - const unsigned iy = element.elem_data.eval_map[nn][1] ; - const unsigned iz = element.elem_data.eval_map[nn][2] ; - - if ( elem_node_coord[nn][0] != elem_node_coord[0][0] + ix || - elem_node_coord[nn][1] != elem_node_coord[0][1] + iy || - elem_node_coord[nn][2] != elem_node_coord[0][2] + iz ) { - - std::ostringstream msg ; - msg << "BoxMeshFixture elem_node_coord mapping failure { " - << elem_node_coord[nn][0] << " " - << elem_node_coord[nn][1] << " " - << elem_node_coord[nn][2] << " } != { " - << elem_node_coord[ 0][0] + ix << " " - << elem_node_coord[ 0][1] + iy << " " - << elem_node_coord[ 0][2] + iz - << " }" ; - throw std::runtime_error( msg.str() ); - } - } - } - } - - //------------------------------------ - // Initialize element-node connectivity: - // Order elements that only depend on owned nodes first. - // These elements could be computed while waiting for - // received node data. - - static void layout_elements_interior_exterior( - const BoxType vertex_box_local_used , - const BoxType vertex_box_local_owned , - const BoxType node_box_local_used , - const std::vector & node_used_id_map , - const ElementSpec element_fixture , - const size_t elem_count_interior , - const typename elem_node_ids_type::HostMirror elem_node_ids ) - { - size_t elem_index_interior = 0 ; - size_t elem_index_boundary = elem_count_interior ; - - for ( size_t iz = vertex_box_local_used[2][0] ; - iz < vertex_box_local_used[2][1] - 1 ; ++iz ) { - for ( size_t iy = vertex_box_local_used[1][0] ; - iy < vertex_box_local_used[1][1] - 1 ; ++iy ) { - for ( size_t ix = vertex_box_local_used[0][0] ; - ix < vertex_box_local_used[0][1] - 1 ; ++ix ) { - - size_t elem_index ; - - // If lower and upper vertices are owned then element is interior - if ( contain( vertex_box_local_owned, ix, iy, iz ) && - contain( vertex_box_local_owned, ix+1, iy+1, iz+1 ) ) { - elem_index = elem_index_interior++ ; - } - else { - elem_index = elem_index_boundary++ ; - } - - for ( size_t nn = 0 ; nn < element_node_count ; ++nn ) { - unsigned coord[3] = { static_cast(ix) , static_cast(iy) , static_cast(iz) }; - - element_fixture.elem_to_node( nn , coord ); - - const size_t node_local_id = - box_map_id( node_box_local_used , - node_used_id_map , - coord[0] , coord[1] , coord[2] ); - - elem_node_ids( elem_index , nn ) = node_local_id ; - } - }}} - } - - //------------------------------------ - // Nested partitioning of elements by number of thread 'gangs' - - static void layout_elements_partitioned( - const BoxType vertex_box_local_used , - const BoxType /*vertex_box_local_owned*/ , - const BoxType node_box_local_used , - const std::vector & node_used_id_map , - const ElementSpec element_fixture , - const size_t thread_gang_count , - const typename elem_node_ids_type::HostMirror elem_node_ids ) - { - std::vector< BoxType > element_box_gangs( thread_gang_count ); - - BoxType element_box_local_used = vertex_box_local_used ; - - element_box_local_used[0][1] -= 1 ; - element_box_local_used[1][1] -= 1 ; - element_box_local_used[2][1] -= 1 ; - - box_partition_rcb( element_box_local_used , element_box_gangs ); - - size_t elem_index = 0 ; - - for ( size_t ig = 0 ; ig < thread_gang_count ; ++ig ) { - - const BoxType box = element_box_gangs[ig] ; - - for ( size_t iz = box[2][0] ; iz < box[2][1] ; ++iz ) { - for ( size_t iy = box[1][0] ; iy < box[1][1] ; ++iy ) { - for ( size_t ix = box[0][0] ; ix < box[0][1] ; ++ix , ++elem_index ) { - - for ( size_t nn = 0 ; nn < element_node_count ; ++nn ) { - unsigned coord[3] = { static_cast(ix) , static_cast(iy) , static_cast(iz) }; - - element_fixture.elem_to_node( nn , coord ); - - const size_t node_local_id = - box_map_id( node_box_local_used , - node_used_id_map , - coord[0] , coord[1] , coord[2] ); - - elem_node_ids( elem_index , nn ) = node_local_id ; - } - }}} - } - } - - //------------------------------------ - - static FEMeshType create( const size_t proc_count , - const size_t proc_local , - const size_t gang_count , - const size_t elems_x , - const size_t elems_y , - const size_t elems_z , - const double x_coord_curve = 1 , - const double y_coord_curve = 1 , - const double z_coord_curve = 1 ) - { - const size_t vertices_x = elems_x + 1 ; - const size_t vertices_y = elems_y + 1 ; - const size_t vertices_z = elems_z + 1 ; - - const BoxBoundsLinear vertex_box_bounds ; - const ElementSpec element ; - - // Partition based upon vertices: - - BoxType vertex_box_global ; - std::vector< BoxType > vertex_box_parts( proc_count ); - - vertex_box_global[0][0] = 0 ; vertex_box_global[0][1] = vertices_x ; - vertex_box_global[1][0] = 0 ; vertex_box_global[1][1] = vertices_y ; - vertex_box_global[2][0] = 0 ; vertex_box_global[2][1] = vertices_z ; - - box_partition_rcb( vertex_box_global , vertex_box_parts ); - - const BoxType vertex_box_local_owned = vertex_box_parts[ proc_local ]; - - // Determine interior and used vertices: - - BoxType vertex_box_local_interior ; - BoxType vertex_box_local_used ; - - vertex_box_bounds.apply( vertex_box_global , - vertex_box_local_owned , - vertex_box_local_interior , - vertex_box_local_used ); - - // Element counts: - - const long local_elems_x = - ( vertex_box_local_used[0][1] - vertex_box_local_used[0][0] ) - 1 ; - const long local_elems_y = - ( vertex_box_local_used[1][1] - vertex_box_local_used[1][0] ) - 1 ; - const long local_elems_z = - ( vertex_box_local_used[2][1] - vertex_box_local_used[2][0] ) - 1 ; - - const size_t elem_count_total = std::max( long(0) , local_elems_x ) * - std::max( long(0) , local_elems_y ) * - std::max( long(0) , local_elems_z ); - - const long interior_elems_x = - ( vertex_box_local_owned[0][1] - vertex_box_local_owned[0][0] ) - 1 ; - const long interior_elems_y = - ( vertex_box_local_owned[1][1] - vertex_box_local_owned[1][0] ) - 1 ; - const long interior_elems_z = - ( vertex_box_local_owned[2][1] - vertex_box_local_owned[2][0] ) - 1 ; - - const size_t elem_count_interior = std::max( long(0) , interior_elems_x ) * - std::max( long(0) , interior_elems_y ) * - std::max( long(0) , interior_elems_z ); - - // Expand vertex boxes to node boxes: - - BoxType node_box_global ; - BoxType node_box_local_used ; - std::vector< BoxType > node_box_parts ; - - element.create_node_boxes_from_vertex_boxes( - vertex_box_global , vertex_box_parts , - node_box_global , node_box_parts ); - - // Node communication maps: - - size_t node_count_interior = 0 ; - size_t node_count_owned = 0 ; - size_t node_count_total = 0 ; - std::vector node_used_id_map ; - std::vector node_part_counts ; - std::vector< std::vector > node_send_map ; - - box_partition_maps( node_box_global , - node_box_parts , - element.box_bounds , - proc_local , - node_box_local_used , - node_used_id_map , - node_count_interior , - node_count_owned , - node_count_total , - node_part_counts , - node_send_map ); - - size_t node_count_send = 0 ; - for ( size_t i = 0 ; i < node_send_map.size() ; ++i ) { - node_count_send += node_send_map[i].size(); - } - - size_t recv_msg_count = 0 ; - size_t send_msg_count = 0 ; - size_t send_count = 0 ; - - for ( size_t i = 1 ; i < proc_count ; ++i ) { - if ( node_part_counts[i] ) ++recv_msg_count ; - if ( node_send_map[i].size() ) { - ++send_msg_count ; - send_count += node_send_map[i].size(); - } - } - - // Finite element mesh: - - FEMeshType mesh ; - - if ( node_count_total ) { - mesh.node_coords = node_coords_type( "node_coords", node_count_total ); - } - - if ( elem_count_total ) { - mesh.elem_node_ids = - elem_node_ids_type( "elem_node_ids", elem_count_total ); - } - - mesh.parallel_data_map.assign( node_count_interior , - node_count_owned , - node_count_total , - recv_msg_count , - send_msg_count , - send_count ); - - typename node_coords_type::HostMirror node_coords = - Kokkos::create_mirror( mesh.node_coords ); - - typename elem_node_ids_type::HostMirror elem_node_ids = - Kokkos::create_mirror( mesh.elem_node_ids ); - - //------------------------------------ - // set node coordinates to grid location for subsequent verification - - for ( size_t iz = node_box_local_used[2][0] ; - iz < node_box_local_used[2][1] ; ++iz ) { - - for ( size_t iy = node_box_local_used[1][0] ; - iy < node_box_local_used[1][1] ; ++iy ) { - - for ( size_t ix = node_box_local_used[0][0] ; - ix < node_box_local_used[0][1] ; ++ix ) { - - const size_t node_local_id = - box_map_id( node_box_local_used , node_used_id_map , ix , iy , iz ); - - node_coords( node_local_id , 0 ) = ix ; - node_coords( node_local_id , 1 ) = iy ; - node_coords( node_local_id , 2 ) = iz ; - }}} - - //------------------------------------ - // Initialize element-node connectivity: - - if ( 1 < gang_count ) { - layout_elements_partitioned( vertex_box_local_used , - vertex_box_local_owned , - node_box_local_used , - node_used_id_map , - element , - gang_count , - elem_node_ids ); - } - else { - layout_elements_interior_exterior( vertex_box_local_used , - vertex_box_local_owned , - node_box_local_used , - node_used_id_map , - element , - elem_count_interior , - elem_node_ids ); - } - - //------------------------------------ - // Populate node->element connectivity: - - std::vector node_elem_work( node_count_total , (size_t) 0 ); - - for ( size_t i = 0 ; i < elem_count_total ; ++i ) { - for ( size_t n = 0 ; n < element_node_count ; ++n ) { - ++node_elem_work[ elem_node_ids(i,n) ]; - } - } - - mesh.node_elem_ids = - Kokkos::create_staticcrsgraph< node_elem_ids_type >( "node_elem_ids" , node_elem_work ); - - typename node_elem_ids_type::HostMirror - node_elem_ids = Kokkos::create_mirror( mesh.node_elem_ids ); - - for ( size_t i = 0 ; i < node_count_total ; ++i ) { - node_elem_work[i] = node_elem_ids.row_map[i]; - } - - // Looping in element order insures the list of elements - // is sorted by element index. - - for ( size_t i = 0 ; i < elem_count_total ; ++i ) { - for ( size_t n = 0 ; n < element_node_count ; ++n ) { - const unsigned nid = elem_node_ids(i, n); - const unsigned j = node_elem_work[nid] ; ++node_elem_work[nid] ; - - node_elem_ids.entries( j , 0 ) = i ; - node_elem_ids.entries( j , 1 ) = n ; - } - } - //------------------------------------ - // Verify setup with node coordinates matching grid indices. - verify( node_coords , elem_node_ids , node_elem_ids ); - - //------------------------------------ - // Scale node coordinates to problem extent with - // nonlinear mapping. - { - const double problem_extent[3] = - { static_cast( vertex_box_global[0][1] - 1 ) , - static_cast( vertex_box_global[1][1] - 1 ) , - static_cast( vertex_box_global[2][1] - 1 ) }; - - const double grid_extent[3] = - { static_cast( node_box_global[0][1] - 1 ) , - static_cast( node_box_global[1][1] - 1 ) , - static_cast( node_box_global[2][1] - 1 ) }; - - for ( size_t i = 0 ; i < node_count_total ; ++i ) { - const double x_unit = node_coords(i,0) / grid_extent[0] ; - const double y_unit = node_coords(i,1) / grid_extent[1] ; - const double z_unit = node_coords(i,2) / grid_extent[2] ; - - node_coords(i,0) = coordinate_scalar_type( problem_extent[0] * std::pow( x_unit , x_coord_curve ) ); - node_coords(i,1) = coordinate_scalar_type( problem_extent[1] * std::pow( y_unit , y_coord_curve ) ); - node_coords(i,2) = coordinate_scalar_type( problem_extent[2] * std::pow( z_unit , z_coord_curve ) ); - } - } - - Kokkos::deep_copy( mesh.node_coords , node_coords ); - Kokkos::deep_copy( mesh.elem_node_ids , elem_node_ids ); - Kokkos::deep_copy( mesh.node_elem_ids.entries , node_elem_ids.entries ); - - //------------------------------------ - // Communication lists: - { - recv_msg_count = 0 ; - send_msg_count = 0 ; - send_count = 0 ; - - for ( size_t i = 1 ; i < proc_count ; ++i ) { - - // Order sending starting with the local processor rank - // to try to smooth out the amount of messages simultaneously - // send to a particular processor. - - const int proc = ( proc_local + i ) % proc_count ; - if ( node_part_counts[i] ) { - mesh.parallel_data_map.host_recv(recv_msg_count,0) = proc ; - mesh.parallel_data_map.host_recv(recv_msg_count,1) = node_part_counts[i] ; - ++recv_msg_count ; - } - if ( node_send_map[i].size() ) { - mesh.parallel_data_map.host_send(send_msg_count,0) = proc ; - mesh.parallel_data_map.host_send(send_msg_count,1) = node_send_map[i].size() ; - for ( size_t j = 0 ; j < node_send_map[i].size() ; ++j , ++send_count ) { - mesh.parallel_data_map.host_send_item(send_count) = node_send_map[i][j] - node_count_interior ; - } - ++send_msg_count ; - } - } - } - - return mesh ; - } -}; - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_BOXMESHFIXTURE_HPP */ - - diff --git a/lib/kokkos/example/multi_fem/BoxMeshPartition.cpp b/lib/kokkos/example/multi_fem/BoxMeshPartition.cpp deleted file mode 100644 index 17a6696fb9..0000000000 --- a/lib/kokkos/example/multi_fem/BoxMeshPartition.cpp +++ /dev/null @@ -1,381 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -namespace { - -void box_partition( size_t ip , size_t up , - const BoxType & box , - BoxType * const p_box ) -{ - const size_t np = up - ip ; - - if ( 1 == np ) { - p_box[ip] = box ; - } - else { - // Choose axis with largest count: - - const size_t n0 = box[0][1] - box[0][0] ; - const size_t n1 = box[1][1] - box[1][0] ; - const size_t n2 = box[2][1] - box[2][0] ; - - const size_t axis = n2 > n1 ? ( n2 > n0 ? 2 : ( n1 > n0 ? 1 : 0 ) ) : - ( n1 > n0 ? 1 : 0 ); - - const size_t n = box[ axis ][1] - box[ axis ][0] ; - - if ( 0 == np % 3 ) { - const size_t np_part = np / 3 ; // exact - - const size_t nbox_low = (size_t)(( (double) n ) * ( 1.0 / 3.0 )); - const size_t nbox_mid = (size_t)(( (double) n ) * ( 2.0 / 3.0 )); - - BoxType dbox_low = box ; // P = [ip,ip+np/3) - BoxType dbox_mid = box ; // P = [ip+np/3,ip+2*np/3) - BoxType dbox_upp = box ; // P = [ip+2*np/3,ip+np) - - dbox_low[ axis ][1] = box[ axis ][0] + nbox_low ; - dbox_mid[ axis ][1] = box[ axis ][0] + nbox_mid ; - - dbox_mid[ axis ][0] = dbox_low[ axis ][1]; - dbox_upp[ axis ][0] = dbox_mid[ axis ][1]; - - box_partition( ip, ip + np_part, dbox_low , p_box ); - box_partition( ip+ np_part, ip + 2*np_part, dbox_mid , p_box ); - box_partition( ip+2*np_part, up, dbox_upp , p_box ); - } - else { - const size_t np_low = np / 2 ; /* Rounded down */ - const size_t nbox_low = (size_t) - (((double)n) * ( ((double) np_low ) / ((double) np ) )); - - BoxType dbox_low = box ; - BoxType dbox_upp = box ; - - dbox_low[ axis ][1] = dbox_low[ axis ][0] + nbox_low ; - dbox_upp[ axis ][0] = dbox_low[ axis ][1]; - - box_partition( ip, ip + np_low, dbox_low , p_box ); - box_partition( ip + np_low, up, dbox_upp , p_box ); - } - } -} - -size_t box_map_offset( const BoxType & local_use , - const size_t global_i , - const size_t global_j , - const size_t global_k ) - -{ - const size_t max = std::numeric_limits::max(); - - const size_t n[3] = - { local_use[0][1] - local_use[0][0] , - local_use[1][1] - local_use[1][0] , - local_use[2][1] - local_use[2][0] }; - - const size_t use[3] = { - ( global_i >= local_use[0][0] ? global_i - local_use[0][0] : max ) , - ( global_j >= local_use[1][0] ? global_j - local_use[1][0] : max ) , - ( global_k >= local_use[2][0] ? global_k - local_use[2][0] : max ) }; - - const size_t offset = - ( use[0] < n[0] && use[1] < n[1] && use[2] < n[2] ) ? - ( use[0] + n[0] * ( use[1] + n[1] * use[2] ) ) : max ; - - if ( offset == max ) { - std::ostringstream msg ; - msg << "box_map_offset ERROR: " - << " use " << local_use - << " ( " << global_i - << " , " << global_j - << " , " << global_k - << " )" ; - throw std::runtime_error( msg.str() ); - } - - return offset ; -} - -} // namespace - -//---------------------------------------------------------------------------- - -void BoxBoundsLinear::apply( const BoxType & box_global , - const BoxType & box_part , - BoxType & box_interior , - BoxType & box_use ) const -{ - const unsigned ghost = 1 ; - - if ( 0 == count( box_part ) ) { - box_interior = box_part ; - box_use = box_part ; - } - else { - for ( size_t i = 0 ; i < 3 ; ++i ) { - - box_interior[i][0] = - ( box_part[i][0] == box_global[i][0] ) ? box_part[i][0] : ( - ( box_part[i][0] + ghost < box_part[i][1] ) ? box_part[i][0] + ghost : - box_part[i][1] ); - - box_interior[i][1] = - ( box_part[i][1] == box_global[i][1] ) ? box_part[i][1] : ( - ( box_part[i][0] + ghost < box_part[i][1] ) ? box_part[i][1] - ghost : - box_part[i][0] ); - - box_use[i][0] = - ( box_part[i][0] > ghost + box_global[i][0] ) ? box_part[i][0] - ghost : - box_global[i][0] ; - box_use[i][1] = - ( box_part[i][1] + ghost < box_global[i][1] ) ? box_part[i][1] + ghost : - box_global[i][1] ; - } - } -} - -void BoxBoundsQuadratic::apply( const BoxType & box_global , - const BoxType & box_part , - BoxType & box_interior , - BoxType & box_use ) const -{ - if ( 0 == count( box_part ) ) { - box_interior = box_part ; - box_use = box_part ; - } - else { - for ( size_t i = 0 ; i < 3 ; ++i ) { - const bool odd = ( box_part[i][0] - box_global[i][0] ) & 01 ; - - const unsigned ghost = odd ? 1 : 2 ; - - box_interior[i][0] = - ( box_part[i][0] == box_global[i][0] ) ? box_part[i][0] : ( - ( box_part[i][0] + ghost < box_part[i][1] ) ? box_part[i][0] + ghost : - box_part[i][1] ); - - box_interior[i][1] = - ( box_part[i][1] == box_global[i][1] ) ? box_part[i][1] : ( - ( box_part[i][0] + ghost < box_part[i][1] ) ? box_part[i][1] - ghost : - box_part[i][0] ); - - box_use[i][0] = - ( box_part[i][0] > ghost + box_global[i][0] ) ? box_part[i][0] - ghost : - box_global[i][0] ; - box_use[i][1] = - ( box_part[i][1] + ghost < box_global[i][1] ) ? box_part[i][1] + ghost : - box_global[i][1] ; - } - } -} - -//---------------------------------------------------------------------------- - -void box_partition_rcb( const BoxType & root_box , - std::vector & part_boxes ) -{ - const BoxBoundsLinear use_boxes ; - - const size_t part_count = part_boxes.size(); - - box_partition( 0 , part_count , root_box , & part_boxes[0] ); - - // Verify partitioning - - size_t total_cell = 0 ; - - for ( size_t i = 0 ; i < part_count ; ++i ) { - - total_cell += count( part_boxes[i] ); - - BoxType box_interior , box_use ; - - use_boxes.apply( root_box , part_boxes[i] , box_interior , box_use ); - - if ( count( box_use ) < count( part_boxes[i] ) || - count( part_boxes[i] ) < count( box_interior ) || - part_boxes[i] != intersect( part_boxes[i] , box_use ) || - box_interior != intersect( part_boxes[i] , box_interior )) { - - std::ostringstream msg ; - - msg << "box_partition_rcb ERROR : " - << "part_boxes[" << i << "] = " - << part_boxes[i] - << " use " << box_use - << " interior " << box_interior - << std::endl - << " part ^ use " << intersect( part_boxes[i] , box_use ) - << " part ^ interior " << intersect( part_boxes[i] , box_interior ); - - throw std::runtime_error( msg.str() ); - } - - for ( size_t j = i + 1 ; j < part_count ; ++j ) { - const BoxType tmp = intersect( part_boxes[i] , part_boxes[j] ); - - if ( count( tmp ) ) { - throw std::runtime_error( std::string("box partition intersection") ); - } - } - } - - if ( total_cell != count( root_box ) ) { - throw std::runtime_error( std::string("box partition count") ); - } -} - -//---------------------------------------------------------------------------- - -size_t box_map_id( const BoxType & local_use , - const std::vector & local_use_id_map , - const size_t global_i , - const size_t global_j , - const size_t global_k ) - -{ - const size_t offset = - box_map_offset( local_use , global_i , global_j , global_k ); - return local_use_id_map[ offset ]; -} - -//---------------------------------------------------------------------------- - -void box_partition_maps( const BoxType & root_box , - const std::vector & part_boxes , - const BoxBounds & use_boxes , - const size_t my_part , - BoxType & my_use_box , - std::vector & my_use_id_map , - size_t & my_count_interior , - size_t & my_count_owned , - size_t & my_count_uses , - std::vector & my_part_counts , - std::vector > & my_send_map ) -{ - const size_t np = part_boxes.size(); - - if ( np <= my_part ) { - std::ostringstream msg ; - msg << "box_partition_maps ERROR : " - << " np(" << np << ") <= my_part(" << my_part << ")" ; - throw std::runtime_error( msg.str() ); - } - - const BoxType my_owned_box = part_boxes[my_part]; - BoxType my_interior_box ; - - - use_boxes.apply( root_box, my_owned_box, my_interior_box, my_use_box ); - - my_count_interior = count( my_interior_box ); - my_count_owned = count( my_owned_box ); - my_count_uses = count( my_use_box ); - - my_use_id_map.assign( my_count_uses , std::numeric_limits::max() ); - - // Order ids as { owned-interior , owned-parallel , received_{(p+i)%np} } - - size_t offset_interior = 0 ; - size_t offset_parallel = my_count_interior ; - - for ( size_t iz = my_owned_box[2][0] ; iz < my_owned_box[2][1] ; ++iz ) { - for ( size_t iy = my_owned_box[1][0] ; iy < my_owned_box[1][1] ; ++iy ) { - for ( size_t ix = my_owned_box[0][0] ; ix < my_owned_box[0][1] ; ++ix ) { - const size_t offset = box_map_offset( my_use_box , ix , iy , iz ); - if ( contain( my_interior_box , ix , iy , iz ) ) { - my_use_id_map[ offset ] = offset_interior++ ; - } - else { - my_use_id_map[ offset ] = offset_parallel++ ; - } - }}} - - - my_part_counts.assign( np , (size_t) 0 ); - my_send_map.assign( np , std::vector() ); - - my_part_counts[0] = my_count_owned ; - - for ( size_t i = 1 ; i < np ; ++i ) { - - const size_t ip = ( my_part + i ) % np ; - - const BoxType p_owned_box = part_boxes[ip]; - BoxType p_use_box , p_interior_box ; - use_boxes.apply( root_box, p_owned_box, p_interior_box, p_use_box ); - - const BoxType recv_box = intersect( my_use_box , p_owned_box ); - const BoxType send_box = intersect( my_owned_box , p_use_box ); - - if ( 0 != ( my_part_counts[i] = count( recv_box ) ) ) { - for ( size_t iz = recv_box[2][0] ; iz < recv_box[2][1] ; ++iz ) { - for ( size_t iy = recv_box[1][0] ; iy < recv_box[1][1] ; ++iy ) { - for ( size_t ix = recv_box[0][0] ; ix < recv_box[0][1] ; ++ix ) { - const size_t offset = box_map_offset( my_use_box , ix , iy , iz ); - my_use_id_map[ offset ] = offset_parallel++ ; - }}} - } - - if ( 0 != count( send_box ) ) { - for ( size_t iz = send_box[2][0] ; iz < send_box[2][1] ; ++iz ) { - for ( size_t iy = send_box[1][0] ; iy < send_box[1][1] ; ++iy ) { - for ( size_t ix = send_box[0][0] ; ix < send_box[0][1] ; ++ix ) { - const size_t offset = box_map_offset( my_use_box , ix , iy , iz ); - - my_send_map[ i ].push_back( my_use_id_map[ offset ] ); - }}} - } - } -} - - diff --git a/lib/kokkos/example/multi_fem/BoxMeshPartition.hpp b/lib/kokkos/example/multi_fem/BoxMeshPartition.hpp deleted file mode 100644 index f2aa6f57cc..0000000000 --- a/lib/kokkos/example/multi_fem/BoxMeshPartition.hpp +++ /dev/null @@ -1,210 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef BOXMESHPARTITION_HPP -#define BOXMESHPARTITION_HPP - -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -struct BoxType { - size_t data[3][2] ; - - typedef size_t range_type[2] ; - - inline - const range_type & operator[]( size_t i ) const { return data[i]; } - - inline - range_type & operator[]( size_t i ) { return data[i]; } - - inline - bool operator == ( const BoxType & rhs ) const - { - return data[0][0] == rhs.data[0][0] && data[0][1] == rhs.data[0][1] && - data[1][0] == rhs.data[1][0] && data[1][1] == rhs.data[2][1] && - data[2][0] == rhs.data[2][0] && data[2][1] == rhs.data[2][1] ; - } - - inline - bool operator != ( const BoxType & rhs ) const - { - return data[0][0] != rhs.data[0][0] || data[0][1] != rhs.data[0][1] || - data[1][0] != rhs.data[1][0] || data[1][1] != rhs.data[1][1] || - data[2][0] != rhs.data[2][0] || data[2][1] != rhs.data[2][1] ; - } -}; - -inline -size_t count( const BoxType & b ) -{ - size_t n = 1 ; - for ( size_t i = 0 ; i < 3 ; ++i ) { - n *= b[i][1] > b[i][0] ? b[i][1] - b[i][0] : 0 ; - } - return n ; -} - -inline -bool contain( const BoxType & b , size_t i , size_t j , size_t k ) -{ - return b[0][0] <= i && i < b[0][1] && - b[1][0] <= j && j < b[1][1] && - b[2][0] <= k && k < b[2][1] ; -} - -inline -BoxType intersect( const BoxType & x , const BoxType & y ) -{ - BoxType z ; - for ( size_t i = 0 ; i < 3 ; ++i ) { - z[i][0] = std::max( x[i][0] , y[i][0] ); - z[i][1] = std::min( x[i][1] , y[i][1] ); - } - - return z ; -} - -inline -std::ostream & operator << ( std::ostream & s , const BoxType & box ) -{ - s << "{ " - << box[0][0] << " " << box[0][1] << " , " - << box[1][0] << " " << box[1][1] << " , " - << box[2][0] << " " << box[2][1] << " }" ; - return s ; -} - -//---------------------------------------------------------------------------- - -class BoxBounds { -public: - /** \brief Default bounds to one layer of ghosting */ - virtual - void apply( const BoxType & box_global , - const BoxType & box_part , - BoxType & box_interior , - BoxType & box_use ) const = 0 ; - - virtual ~BoxBounds() {} - BoxBounds() {} -}; - -class BoxBoundsLinear : public BoxBounds -{ -public: - /** \brief Default bounds to one layer of ghosting */ - virtual - void apply( const BoxType & box_global , - const BoxType & box_part , - BoxType & box_interior , - BoxType & box_use ) const ; - - virtual ~BoxBoundsLinear() {} - BoxBoundsLinear() {} -}; - -class BoxBoundsQuadratic : public BoxBounds { -public: - /** \brief Quadratic mesh: even ordinates have two layers, - * odd ordinates have one layer. - */ - virtual - void apply( const BoxType & box_global , - const BoxType & box_part , - BoxType & box_interior , - BoxType & box_use ) const ; - - virtual ~BoxBoundsQuadratic() {} - BoxBoundsQuadratic() {} -}; - -//---------------------------------------------------------------------------- -/* Partition box into part_boxes.size() sub-boxes */ - -void box_partition_rcb( const BoxType & root_box , - std::vector & part_boxes ); - -//---------------------------------------------------------------------------- -/* Determine local id layout and communication maps for partitioned boxes. - * - * Local ids are layed out as follows: - * { [ owned-interior ids not sent ] , - * [ owned-boundary ids to be sent to other processes ] , - * [ received ids from processor ( my_part + 1 ) % part_count ] - * [ received ids from processor ( my_part + 2 ) % part_count ] - * [ received ids from processor ( my_part + 3 ) % part_count ] - * ... }; - * - * This layout allows - * (1) received data to be copied into a contiguous block of memory - * (2) send data to be extracted from a contiguous block of memory. - */ -void box_partition_maps( - const BoxType & root_box , // [in] Global box - const std::vector & part_boxes , // [in] Partitioned boxes - const BoxBounds & use_boxes , // [in] Ghost boundaries - const size_t my_part , // [in] My local part - BoxType & my_use_box , // [out] My used box with ghost - std::vector & my_use_id_map , // [out] Local ordering map - size_t & my_count_interior , // [out] How many interior - size_t & my_count_owned , // [out] How many owned - size_t & my_count_uses , // [out] How may used - std::vector & my_part_counts , // [out] Partitioning of my_use_id_map - std::vector > & my_send_map ); // [out] Send id map - -/* Mapping of cartesian coordinate to local id */ -size_t box_map_id( const BoxType & my_use_box , - const std::vector & my_use_id_map , - const size_t global_i , - const size_t global_j , - const size_t global_k ); - -//---------------------------------------------------------------------------- - -#endif /* #ifndef BOXMESHPARTITION_HPP */ - diff --git a/lib/kokkos/example/multi_fem/Explicit.hpp b/lib/kokkos/example/multi_fem/Explicit.hpp deleted file mode 100644 index ddeb53ae61..0000000000 --- a/lib/kokkos/example/multi_fem/Explicit.hpp +++ /dev/null @@ -1,452 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef EXPLICIT_DRIVER_HPP -#define EXPLICIT_DRIVER_HPP - -#include -#include -#include -#include -#include - -#include - -#include - -//---------------------------------------------------------------------------- - -namespace Explicit { - -struct PerformanceData { - double mesh_time ; - double init_time ; - double internal_force_time ; - double central_diff ; - double comm_time ; - size_t number_of_steps ; - - PerformanceData() - : mesh_time(0) - , init_time(0) - , internal_force_time(0) - , central_diff(0) - , comm_time(0) - , number_of_steps(0) - {} - - void best( const PerformanceData & rhs ) - { - if ( rhs.mesh_time < mesh_time ) mesh_time = rhs.mesh_time ; - if ( rhs.init_time < init_time ) init_time = rhs.init_time ; - if ( rhs.internal_force_time < internal_force_time ) internal_force_time = rhs.internal_force_time ; - if ( rhs.central_diff < central_diff ) central_diff = rhs.central_diff ; - if ( rhs.comm_time < comm_time ) comm_time = rhs.comm_time ; - } -}; - -template< typename Scalar , class FixtureType > -PerformanceData run( const typename FixtureType::FEMeshType & mesh , - const int global_max_x , - const int global_max_y , - const int global_max_z , - const int steps , - const int print_sample ) -{ - typedef Scalar scalar_type ; - typedef FixtureType fixture_type ; - typedef typename fixture_type::execution_space execution_space ; - //typedef typename fixture_type::FEMeshType mesh_type ; // unused - - enum { ElementNodeCount = fixture_type::element_node_count }; - - const int NumStates = 2; - - const int total_num_steps = steps ; - - const Scalar user_dt = 5.0e-6; - //const Scalar end_time = 0.0050; - - // element block parameters - const Scalar lin_bulk_visc = 0.0; - const Scalar quad_bulk_visc = 0.0; - - // const Scalar lin_bulk_visc = 0.06; - // const Scalar quad_bulk_visc = 1.2; - // const Scalar hg_stiffness = 0.0; - // const Scalar hg_viscosity = 0.0; - // const Scalar hg_stiffness = 0.03; - // const Scalar hg_viscosity = 0.001; - - // material properties - const Scalar youngs_modulus=1.0e6; - const Scalar poissons_ratio=0.0; - const Scalar density = 8.0e-4; - - const comm::Machine machine = mesh.parallel_data_map.machine ; - - PerformanceData perf_data ; - - Kokkos::Impl::Timer wall_clock ; - - //------------------------------------ - // Generate fields - - typedef Fields< scalar_type , execution_space > fields_type ; - - fields_type mesh_fields( mesh , - lin_bulk_visc , - quad_bulk_visc , - youngs_modulus , - poissons_ratio , - density ); - - typename fields_type::node_coords_type::HostMirror - model_coords_h = Kokkos::create_mirror( mesh_fields.model_coords ); - - typename fields_type::geom_state_array_type::HostMirror - displacement_h = Kokkos::create_mirror( mesh_fields.displacement ); - - typename fields_type::geom_state_array_type::HostMirror - velocity_h = Kokkos::create_mirror( mesh_fields.velocity ); - - Kokkos::deep_copy( model_coords_h , mesh_fields.model_coords ); - - //------------------------------------ - // Initialization - - initialize_element::apply( mesh_fields ); - initialize_node< Scalar,execution_space>::apply( mesh_fields ); - - const Scalar x_bc = global_max_x ; - - // Initial condition on velocity to initiate a pulse along the X axis - { - const unsigned X = 0; - for (int inode = 0; inode< mesh_fields.num_nodes; ++inode) { - if ( model_coords_h(inode,X) == 0) { - velocity_h(inode,X,0) = 1.0e3; - velocity_h(inode,X,1) = 1.0e3; - } - } - } - - Kokkos::deep_copy( mesh_fields.velocity , velocity_h ); - - //-------------------------------------------------------------------------- - // We will call a sequence of functions. These functions have been - // grouped into several functors to balance the number of global memory - // accesses versus requiring too many registers or too much L1 cache. - // Global memory accees have read/write cost and memory subsystem contention cost. - //-------------------------------------------------------------------------- - - perf_data.init_time = comm::max( machine , wall_clock.seconds() ); - - // Parameters required for the internal force computations. - - int current_state = 0; - int previous_state = 0; - int next_state = 0; - - perf_data.number_of_steps = total_num_steps ; - -#if defined( KOKKOS_HAVE_MPI ) - - typedef typename - fields_type::geom_state_array_type::value_type comm_value_type ; - - const unsigned comm_value_count = 6 ; - - Kokkos::AsyncExchange< comm_value_type , execution_space , - Kokkos::ParallelDataMap > - comm_exchange( mesh.parallel_data_map , comm_value_count ); - -#endif - - for (int step = 0; step < total_num_steps; ++step) { - - wall_clock.reset(); - - //------------------------------------------------------------------------ -#if defined( KOKKOS_HAVE_MPI ) - { - // Communicate "send" nodes' displacement and velocity next_state - // to the ghosted nodes. - // buffer packages: { { dx , dy , dz , vx , vy , vz }_node } - - pack_state< Scalar , execution_space > - ::apply( comm_exchange.buffer() , - mesh.parallel_data_map.count_interior , - mesh.parallel_data_map.count_send , - mesh_fields , next_state ); - - comm_exchange.setup(); - - comm_exchange.send_receive(); - - unpack_state< Scalar , execution_space > - ::apply( mesh_fields , next_state , - comm_exchange.buffer() , - mesh.parallel_data_map.count_owned , - mesh.parallel_data_map.count_receive ); - - execution_space::fence(); - } -#endif - - perf_data.comm_time += comm::max( machine , wall_clock.seconds() ); - - //------------------------------------------------------------------------ - // rotate the states - - previous_state = current_state; - current_state = next_state; - ++next_state; - next_state %= NumStates; - - wall_clock.reset(); - - // First kernel 'grad_hgop' combines two functions: - // gradient, velocity gradient - grad< Scalar , execution_space >::apply( mesh_fields , - current_state , - previous_state ); - - // Combine tensor decomposition and rotation functions. - decomp_rotate< Scalar , execution_space >::apply( mesh_fields , - current_state , - previous_state ); - - internal_force< Scalar , execution_space >::apply( mesh_fields , - user_dt , - current_state ); - - execution_space::fence(); - - perf_data.internal_force_time += - comm::max( machine , wall_clock.seconds() ); - - wall_clock.reset(); - - // Assembly of elements' contributions to nodal force into - // a nodal force vector. Update the accelerations, velocities, - // displacements. - // The same pattern can be used for matrix-free residual computations. - nodal_step< Scalar , execution_space >::apply( mesh_fields , - x_bc , - current_state, - next_state ); - execution_space::fence(); - - perf_data.central_diff += - comm::max( machine , wall_clock.seconds() ); - - if ( print_sample && 0 == step % 100 ) { - Kokkos::deep_copy( displacement_h , mesh_fields.displacement ); - Kokkos::deep_copy( velocity_h , mesh_fields.velocity ); - - if ( 1 == print_sample ) { - - std::cout << "step " << step - << " : displacement(*,0,0) =" ; - for ( int i = 0 ; i < mesh_fields.num_nodes_owned ; ++i ) { - if ( model_coords_h(i,1) == 0 && model_coords_h(i,2) == 0 ) { - std::cout << " " << displacement_h(i,0,next_state); - } - } - std::cout << std::endl ; - - const float tol = 1.0e-6 ; - const int yb = global_max_y ; - const int zb = global_max_z ; - std::cout << "step " << step - << " : displacement(*," << yb << "," << zb << ") =" ; - for ( int i = 0 ; i < mesh_fields.num_nodes_owned ; ++i ) { - if ( fabs( model_coords_h(i,1) - yb ) < tol && - fabs( model_coords_h(i,2) - zb ) < tol ) { - std::cout << " " << displacement_h(i,0,next_state); - } - } - std::cout << std::endl ; - } - else if ( 2 == print_sample ) { - - const float tol = 1.0e-6 ; - const int xb = global_max_x / 2 ; - const int yb = global_max_y / 2 ; - const int zb = global_max_z / 2 ; - - for ( int i = 0 ; i < mesh_fields.num_nodes_owned ; ++i ) { - if ( fabs( model_coords_h(i,0) - xb ) < tol && - fabs( model_coords_h(i,1) - yb ) < tol && - fabs( model_coords_h(i,2) - zb ) < tol ) { - std::cout << "step " << step - << " : displacement(" - << xb << "," << yb << "," << zb << ") = {" - << std::setprecision(6) - << " " << displacement_h(i,0,next_state) - << std::setprecision(2) - << " " << displacement_h(i,1,next_state) - << std::setprecision(2) - << " " << displacement_h(i,2,next_state) - << " }" << std::endl ; - } - } - } - } - } - - return perf_data ; -} - - -template -static void driver( const char * const label , - comm::Machine machine , - const int gang_count , - const int elem_count_beg , - const int elem_count_end , - const int runs ) -{ - typedef Scalar scalar_type ; - typedef Device execution_space ; - typedef double coordinate_scalar_type ; - typedef FixtureElementHex8 fixture_element_type ; - - typedef BoxMeshFixture< coordinate_scalar_type , - execution_space , - fixture_element_type > fixture_type ; - - typedef typename fixture_type::FEMeshType mesh_type ; - - const size_t proc_count = comm::size( machine ); - const size_t proc_rank = comm::rank( machine ); - - const int space = 15 ; - const int steps = 1000 ; - const int print_sample = 0 ; - - if ( comm::rank( machine ) == 0 ) { - - std::cout << std::endl ; - std::cout << "\"MiniExplicitDynamics with Kokkos " << label - << " time_steps(" << steps << ")" - << "\"" << std::endl; - std::cout << std::left << std::setw(space) << "\"Element\" , "; - std::cout << std::left << std::setw(space) << "\"Node\" , "; - std::cout << std::left << std::setw(space) << "\"Initialize\" , "; - std::cout << std::left << std::setw(space) << "\"ElemForce\" , "; - std::cout << std::left << std::setw(space) << "\"NodeUpdate\" , "; - std::cout << std::left << std::setw(space) << "\"NodeComm\" , "; - std::cout << std::left << std::setw(space) << "\"Time/Elem\" , "; - std::cout << std::left << std::setw(space) << "\"Time/Node\""; - - std::cout << std::endl; - - std::cout << std::left << std::setw(space) << "\"count\" , "; - std::cout << std::left << std::setw(space) << "\"count\" , "; - std::cout << std::left << std::setw(space) << "\"microsec\" , "; - std::cout << std::left << std::setw(space) << "\"microsec\" , "; - std::cout << std::left << std::setw(space) << "\"microsec\" , "; - std::cout << std::left << std::setw(space) << "\"microsec\" , "; - std::cout << std::left << std::setw(space) << "\"microsec\" , "; - std::cout << std::left << std::setw(space) << "\"microsec\""; - - std::cout << std::endl; - } - - for(int i = elem_count_beg ; i < elem_count_end ; i *= 2 ) - { - const int iz = std::max( 1 , (int) cbrt( ((double) i) / 2.0 ) ); - const int iy = iz + 1 ; - const int ix = 2 * iy ; - const int nelem = ix * iy * iz ; - const int nnode = ( ix + 1 ) * ( iy + 1 ) * ( iz + 1 ); - - mesh_type mesh = - fixture_type::create( proc_count , proc_rank , gang_count , - ix , iy , iz ); - - mesh.parallel_data_map.machine = machine ; - - PerformanceData perf , best ; - - for(int j = 0; j < runs; j++){ - - perf = run(mesh,ix,iy,iz,steps,print_sample); - - if( j == 0 ) { - best = perf ; - } - else { - best.best( perf ); - } - } - - if ( comm::rank( machine ) == 0 ) { - double time_per_element = - ( best.internal_force_time ) / ( nelem * perf.number_of_steps ); - double time_per_node = - ( best.comm_time + best.central_diff ) / ( nnode * perf.number_of_steps ); - - std::cout << std::setw(space-3) << nelem << " , " - << std::setw(space-3) << nnode << " , " - << std::setw(space-3) << best.number_of_steps << " , " - << std::setw(space-3) << best.init_time * 1000000 << " , " - << std::setw(space-3) - << ( best.internal_force_time * 1000000 ) / best.number_of_steps << " , " - << std::setw(space-3) - << ( best.central_diff * 1000000 ) / best.number_of_steps << " , " - << std::setw(space-3) - << ( best.comm_time * 1000000 ) / best.number_of_steps << " , " - << std::setw(space-3) << time_per_element * 1000000 << " , " - << std::setw(space-3) << time_per_node * 1000000 - << std::endl ; - } - } -} - - -} // namespace Explicit - -#endif /* #ifndef EXPLICIT_DRIVER_HPP */ diff --git a/lib/kokkos/example/multi_fem/ExplicitFunctors.hpp b/lib/kokkos/example/multi_fem/ExplicitFunctors.hpp deleted file mode 100644 index feea82244f..0000000000 --- a/lib/kokkos/example/multi_fem/ExplicitFunctors.hpp +++ /dev/null @@ -1,1471 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_EXPLICITFUNCTORS_HPP -#define KOKKOS_EXPLICITFUNCTORS_HPP - -#include -#include -#include - -namespace Explicit { - -template -struct Fields { - - static const int NumStates = 2 ; - static const int SpatialDim = 3 ; - static const int ElemNodeCount = 8 ; - - // Indices for full 3x3 tensor: - - static const int K_F_XX = 0 ; - static const int K_F_YY = 1 ; - static const int K_F_ZZ = 2 ; - static const int K_F_XY = 3 ; - static const int K_F_YZ = 4 ; - static const int K_F_ZX = 5 ; - static const int K_F_YX = 6 ; - static const int K_F_ZY = 7 ; - static const int K_F_XZ = 8 ; - - // Indexes into a 3 by 3 symmetric tensor stored as a length 6 vector - - static const int K_S_XX = 0 ; - static const int K_S_YY = 1 ; - static const int K_S_ZZ = 2 ; - static const int K_S_XY = 3 ; - static const int K_S_YZ = 4 ; - static const int K_S_ZX = 5 ; - static const int K_S_YX = 3 ; - static const int K_S_ZY = 4 ; - static const int K_S_XZ = 5 ; - - // Indexes into a 3 by 3 skew symmetric tensor stored as a length 3 vector - - static const int K_V_XY = 0 ; - static const int K_V_YZ = 1 ; - static const int K_V_ZX = 2 ; - - - typedef Device execution_space ; - typedef typename execution_space::size_type size_type ; - - typedef HybridFEM::FEMesh FEMesh ; - - typedef typename FEMesh::node_coords_type node_coords_type ; - typedef typename FEMesh::elem_node_ids_type elem_node_ids_type ; - typedef typename FEMesh::node_elem_ids_type node_elem_ids_type ; - typedef typename Kokkos::ParallelDataMap parallel_data_map ; - - typedef Kokkos::View< double[][ SpatialDim ][ NumStates ] , execution_space > geom_state_array_type ; - typedef Kokkos::View< Scalar[][ SpatialDim ] , execution_space > geom_array_type ; - typedef Kokkos::View< Scalar[] , execution_space > array_type ; - typedef Kokkos::View< Scalar , execution_space > scalar_type ; - - typedef Kokkos::View< Scalar[][ 6 ] , execution_space > elem_sym_tensor_type ; - typedef Kokkos::View< Scalar[][ 9 ] , execution_space > elem_tensor_type ; - typedef Kokkos::View< Scalar[][ 9 ][ NumStates ] , execution_space > elem_tensor_state_type ; - typedef Kokkos::View< Scalar[][ SpatialDim ][ ElemNodeCount ] , execution_space > elem_node_geom_type ; - - // Parameters: - const int num_nodes ; - const int num_nodes_owned ; - const int num_elements ; - - const Scalar lin_bulk_visc; - const Scalar quad_bulk_visc; - const Scalar two_mu; - const Scalar bulk_modulus; - const Scalar density; - - // Mesh: - const elem_node_ids_type elem_node_connectivity ; - const node_elem_ids_type node_elem_connectivity ; - const node_coords_type model_coords ; - - // Compute: - const scalar_type dt ; - const scalar_type prev_dt ; - const geom_state_array_type displacement ; - const geom_state_array_type velocity ; - const geom_array_type acceleration ; - const geom_array_type internal_force ; - const array_type nodal_mass ; - const array_type elem_mass ; - const array_type internal_energy ; - const elem_sym_tensor_type stress_new ; - const elem_tensor_state_type rotation ; - const elem_node_geom_type element_force ; - const elem_tensor_type vel_grad ; - const elem_sym_tensor_type stretch ; - const elem_sym_tensor_type rot_stretch ; - - Fields( - const FEMesh & mesh, - Scalar arg_lin_bulk_visc, - Scalar arg_quad_bulk_visc, - Scalar youngs_modulus, - Scalar poissons_ratio, - Scalar arg_density ) - : num_nodes( mesh.parallel_data_map.count_owned + - mesh.parallel_data_map.count_receive ) - , num_nodes_owned( mesh.parallel_data_map.count_owned ) - , num_elements( mesh.elem_node_ids.dimension_0() ) - , lin_bulk_visc( arg_lin_bulk_visc ) - , quad_bulk_visc( arg_quad_bulk_visc ) - , two_mu(youngs_modulus/(1.0+poissons_ratio)) - , bulk_modulus(youngs_modulus/(3*(1.0-2.0*poissons_ratio))) - , density(arg_density) - - // mesh - - , elem_node_connectivity( mesh.elem_node_ids ) // ( num_elements , ElemNodeCount ) - , node_elem_connectivity( mesh.node_elem_ids ) // ( num_nodes , ... ) - , model_coords( mesh.node_coords ) // ( num_nodes , 3 ) - - // compute with input/output - - , dt( "dt" ) - , prev_dt( "prev_dt" ) - , displacement( "displacement" , num_nodes ) - , velocity( "velocity" , num_nodes ) - , acceleration( "acceleration" , num_nodes_owned ) - , internal_force( "internal_force" , num_nodes_owned ) - , nodal_mass( "nodal_mass" , num_nodes_owned ) - , elem_mass( "elem_mass" , num_elements ) - , internal_energy( "internal_energy" , num_elements ) - , stress_new( "stress_new" , num_elements ) - - // temporary arrays - - , rotation( "rotation" , num_elements ) - , element_force( "element_force" , num_elements ) - , vel_grad( "vel_grad" , num_elements ) - , stretch( "stretch" , num_elements ) - , rot_stretch( "rot_stretch" , num_elements ) - { } -}; - - -//---------------------------------------------------------------------------- - -template< typename Scalar , class DeviceType > -KOKKOS_INLINE_FUNCTION -Scalar dot8( const Scalar * a , const Scalar * b ) -{ return a[0] * b[0] + a[1] * b[1] + a[2] * b[2] + a[3] * b[3] + - a[4] * b[4] + a[5] * b[5] + a[6] * b[6] + a[7] * b[7] ; } - -template< typename Scalar , class DeviceType > -KOKKOS_INLINE_FUNCTION -void comp_grad( const Scalar * const x , - const Scalar * const y , - const Scalar * const z, - Scalar * const grad_x , - Scalar * const grad_y , - Scalar * const grad_z ) -{ - // calc X difference vectors - - Scalar R42=(x[3] - x[1]); - Scalar R52=(x[4] - x[1]); - Scalar R54=(x[4] - x[3]); - - Scalar R63=(x[5] - x[2]); - Scalar R83=(x[7] - x[2]); - Scalar R86=(x[7] - x[5]); - - Scalar R31=(x[2] - x[0]); - Scalar R61=(x[5] - x[0]); - Scalar R74=(x[6] - x[3]); - - Scalar R72=(x[6] - x[1]); - Scalar R75=(x[6] - x[4]); - Scalar R81=(x[7] - x[0]); - - Scalar t1=(R63 + R54); - Scalar t2=(R61 + R74); - Scalar t3=(R72 + R81); - - Scalar t4 =(R86 + R42); - Scalar t5 =(R83 + R52); - Scalar t6 =(R75 + R31); - - // Calculate Y gradient from X and Z data - - grad_y[0] = (z[1] * t1) - (z[2] * R42) - (z[3] * t5) + (z[4] * t4) + (z[5] * R52) - (z[7] * R54); - grad_y[1] = (z[2] * t2) + (z[3] * R31) - (z[0] * t1) - (z[5] * t6) + (z[6] * R63) - (z[4] * R61); - grad_y[2] = (z[3] * t3) + (z[0] * R42) - (z[1] * t2) - (z[6] * t4) + (z[7] * R74) - (z[5] * R72); - grad_y[3] = (z[0] * t5) - (z[1] * R31) - (z[2] * t3) + (z[7] * t6) + (z[4] * R81) - (z[6] * R83); - grad_y[4] = (z[5] * t3) + (z[6] * R86) - (z[7] * t2) - (z[0] * t4) - (z[3] * R81) + (z[1] * R61); - grad_y[5] = (z[6] * t5) - (z[4] * t3) - (z[7] * R75) + (z[1] * t6) - (z[0] * R52) + (z[2] * R72); - grad_y[6] = (z[7] * t1) - (z[5] * t5) - (z[4] * R86) + (z[2] * t4) - (z[1] * R63) + (z[3] * R83); - grad_y[7] = (z[4] * t2) - (z[6] * t1) + (z[5] * R75) - (z[3] * t6) - (z[2] * R74) + (z[0] * R54); - - // calc Z difference vectors - - R42=(z[3] - z[1]); - R52=(z[4] - z[1]); - R54=(z[4] - z[3]); - - R63=(z[5] - z[2]); - R83=(z[7] - z[2]); - R86=(z[7] - z[5]); - - R31=(z[2] - z[0]); - R61=(z[5] - z[0]); - R74=(z[6] - z[3]); - - R72=(z[6] - z[1]); - R75=(z[6] - z[4]); - R81=(z[7] - z[0]); - - t1=(R63 + R54); - t2=(R61 + R74); - t3=(R72 + R81); - - t4 =(R86 + R42); - t5 =(R83 + R52); - t6 =(R75 + R31); - - // Calculate X gradient from Y and Z data - - grad_x[0] = (y[1] * t1) - (y[2] * R42) - (y[3] * t5) + (y[4] * t4) + (y[5] * R52) - (y[7] * R54); - grad_x[1] = (y[2] * t2) + (y[3] * R31) - (y[0] * t1) - (y[5] * t6) + (y[6] * R63) - (y[4] * R61); - grad_x[2] = (y[3] * t3) + (y[0] * R42) - (y[1] * t2) - (y[6] * t4) + (y[7] * R74) - (y[5] * R72); - grad_x[3] = (y[0] * t5) - (y[1] * R31) - (y[2] * t3) + (y[7] * t6) + (y[4] * R81) - (y[6] * R83); - grad_x[4] = (y[5] * t3) + (y[6] * R86) - (y[7] * t2) - (y[0] * t4) - (y[3] * R81) + (y[1] * R61); - grad_x[5] = (y[6] * t5) - (y[4] * t3) - (y[7] * R75) + (y[1] * t6) - (y[0] * R52) + (y[2] * R72); - grad_x[6] = (y[7] * t1) - (y[5] * t5) - (y[4] * R86) + (y[2] * t4) - (y[1] * R63) + (y[3] * R83); - grad_x[7] = (y[4] * t2) - (y[6] * t1) + (y[5] * R75) - (y[3] * t6) - (y[2] * R74) + (y[0] * R54); - - // calc Y difference vectors - - R42=(y[3] - y[1]); - R52=(y[4] - y[1]); - R54=(y[4] - y[3]); - - R63=(y[5] - y[2]); - R83=(y[7] - y[2]); - R86=(y[7] - y[5]); - - R31=(y[2] - y[0]); - R61=(y[5] - y[0]); - R74=(y[6] - y[3]); - - R72=(y[6] - y[1]); - R75=(y[6] - y[4]); - R81=(y[7] - y[0]); - - t1=(R63 + R54); - t2=(R61 + R74); - t3=(R72 + R81); - - t4 =(R86 + R42); - t5 =(R83 + R52); - t6 =(R75 + R31); - - // Calculate Z gradient from X and Y data - - grad_z[0] = (x[1] * t1) - (x[2] * R42) - (x[3] * t5) + (x[4] * t4) + (x[5] * R52) - (x[7] * R54); - grad_z[1] = (x[2] * t2) + (x[3] * R31) - (x[0] * t1) - (x[5] * t6) + (x[6] * R63) - (x[4] * R61); - grad_z[2] = (x[3] * t3) + (x[0] * R42) - (x[1] * t2) - (x[6] * t4) + (x[7] * R74) - (x[5] * R72); - grad_z[3] = (x[0] * t5) - (x[1] * R31) - (x[2] * t3) + (x[7] * t6) + (x[4] * R81) - (x[6] * R83); - grad_z[4] = (x[5] * t3) + (x[6] * R86) - (x[7] * t2) - (x[0] * t4) - (x[3] * R81) + (x[1] * R61); - grad_z[5] = (x[6] * t5) - (x[4] * t3) - (x[7] * R75) + (x[1] * t6) - (x[0] * R52) + (x[2] * R72); - grad_z[6] = (x[7] * t1) - (x[5] * t5) - (x[4] * R86) + (x[2] * t4) - (x[1] * R63) + (x[3] * R83); - grad_z[7] = (x[4] * t2) - (x[6] * t1) + (x[5] * R75) - (x[3] * t6) - (x[2] * R74) + (x[0] * R54); -} - -//---------------------------------------------------------------------------- - -template< typename Scalar , class DeviceType > -struct initialize_element -{ - typedef DeviceType execution_space ; - - typedef Explicit::Fields< Scalar , execution_space > Fields ; - - typename Fields::elem_node_ids_type elem_node_connectivity ; - typename Fields::node_coords_type model_coords ; - typename Fields::elem_sym_tensor_type stretch ; - typename Fields::elem_tensor_state_type rotation ; - typename Fields::array_type elem_mass ; - - const Scalar density ; - - initialize_element( const Fields & mesh_fields ) - : elem_node_connectivity( mesh_fields.elem_node_connectivity ) - , model_coords( mesh_fields.model_coords ) - , stretch( mesh_fields.stretch ) - , rotation( mesh_fields.rotation ) - , elem_mass( mesh_fields.elem_mass ) - , density( mesh_fields.density ) - {} - - KOKKOS_INLINE_FUNCTION - void operator()( int ielem )const - { - const int K_XX = 0 ; - const int K_YY = 1 ; - const int K_ZZ = 2 ; - const Scalar ONE12TH = 1.0 / 12.0 ; - - Scalar x[ Fields::ElemNodeCount ]; - Scalar y[ Fields::ElemNodeCount ]; - Scalar z[ Fields::ElemNodeCount ]; - Scalar grad_x[ Fields::ElemNodeCount ]; - Scalar grad_y[ Fields::ElemNodeCount ]; - Scalar grad_z[ Fields::ElemNodeCount ]; - - for ( int i = 0 ; i < Fields::ElemNodeCount ; ++i ) { - const int n = elem_node_connectivity( ielem , i ); - - x[i] = model_coords( n , 0 ); - y[i] = model_coords( n , 1 ); - z[i] = model_coords( n , 2 ); - } - - comp_grad( x, y, z, grad_x, grad_y, grad_z); - - stretch(ielem,K_XX) = 1 ; - stretch(ielem,K_YY) = 1 ; - stretch(ielem,K_ZZ) = 1 ; - - rotation(ielem,K_XX,0) = 1 ; - rotation(ielem,K_YY,0) = 1 ; - rotation(ielem,K_ZZ,0) = 1 ; - - rotation(ielem,K_XX,1) = 1 ; - rotation(ielem,K_YY,1) = 1 ; - rotation(ielem,K_ZZ,1) = 1 ; - - elem_mass(ielem) = ONE12TH * density * - dot8( x , grad_x ); - } - - static void apply( const Fields & mesh_fields ) - { - initialize_element op( mesh_fields ); - Kokkos::parallel_for( mesh_fields.num_elements , op ); - } -}; - - -template -struct initialize_node -{ - typedef DeviceType execution_space ; - - typedef Explicit::Fields< Scalar , execution_space > Fields ; - - typename Fields::node_elem_ids_type node_elem_connectivity ; - typename Fields::array_type nodal_mass ; - typename Fields::array_type elem_mass ; - - static const int ElemNodeCount = Fields::ElemNodeCount ; - - initialize_node( const Fields & mesh_fields ) - : node_elem_connectivity( mesh_fields.node_elem_connectivity ) - , nodal_mass( mesh_fields.nodal_mass ) - , elem_mass( mesh_fields.elem_mass ) - {} - - - KOKKOS_INLINE_FUNCTION - void operator()( int inode )const - { - const int begin = node_elem_connectivity.row_map[inode]; - const int end = node_elem_connectivity.row_map[inode+1]; - - Scalar node_mass = 0; - - for(int i = begin; i != end; ++i) { - const int elem_id = node_elem_connectivity.entries( i , 0 ); - node_mass += elem_mass(elem_id); - } - - nodal_mass(inode) = node_mass / ElemNodeCount ; - } - - static void apply( const Fields & mesh_fields ) - { - initialize_node op( mesh_fields ); - Kokkos::parallel_for( mesh_fields.num_nodes_owned , op ); - } -}; - -//---------------------------------------------------------------------------- - - -template -struct grad -{ - typedef DeviceType execution_space ; - - typedef Explicit::Fields< Scalar , execution_space > Fields ; - - static const int ElemNodeCount = Fields::ElemNodeCount ; - - static const int K_F_XX = Fields::K_F_XX ; - static const int K_F_YY = Fields::K_F_YY ; - static const int K_F_ZZ = Fields::K_F_ZZ ; - static const int K_F_XY = Fields::K_F_XY ; - static const int K_F_YZ = Fields::K_F_YZ ; - static const int K_F_ZX = Fields::K_F_ZX ; - static const int K_F_YX = Fields::K_F_YX ; - static const int K_F_ZY = Fields::K_F_ZY ; - static const int K_F_XZ = Fields::K_F_XZ ; - - // Global arrays used by this functor. - - const typename Fields::elem_node_ids_type elem_node_connectivity ; - const typename Fields::node_coords_type model_coords ; - const typename Fields::geom_state_array_type displacement ; - const typename Fields::geom_state_array_type velocity ; - const typename Fields::elem_tensor_type vel_grad ; - const typename Fields::scalar_type dt ; - - const int current_state; - const int previous_state; - - // Constructor on the Host to populate this device functor. - // All array view copies are shallow. - grad( const Fields & fields, - const int arg_current_state, - const int arg_previous_state) - : elem_node_connectivity( fields.elem_node_connectivity) - , model_coords( fields.model_coords) - , displacement( fields.displacement) - , velocity( fields.velocity) - , vel_grad( fields.vel_grad) - , dt( fields.dt) - , current_state(arg_current_state) - , previous_state(arg_previous_state) - { } - - //-------------------------------------------------------------------------- - - // Calculate Velocity Gradients - KOKKOS_INLINE_FUNCTION - void v_grad( int ielem, - Scalar * vx, Scalar * vy, Scalar * vz, - Scalar * grad_x, Scalar * grad_y, Scalar * grad_z, - Scalar inv_vol) const - { - const int K_F_XX = Fields::K_F_XX ; - const int K_F_YY = Fields::K_F_YY ; - const int K_F_ZZ = Fields::K_F_ZZ ; - const int K_F_XY = Fields::K_F_XY ; - const int K_F_YZ = Fields::K_F_YZ ; - const int K_F_ZX = Fields::K_F_ZX ; - const int K_F_YX = Fields::K_F_YX ; - const int K_F_ZY = Fields::K_F_ZY ; - const int K_F_XZ = Fields::K_F_XZ ; - - vel_grad(ielem, K_F_XX) = inv_vol * dot8( vx , grad_x ); - vel_grad(ielem, K_F_YX) = inv_vol * dot8( vy , grad_x ); - vel_grad(ielem, K_F_ZX) = inv_vol * dot8( vz , grad_x ); - - vel_grad(ielem, K_F_XY) = inv_vol * dot8( vx , grad_y ); - vel_grad(ielem, K_F_YY) = inv_vol * dot8( vy , grad_y ); - vel_grad(ielem, K_F_ZY) = inv_vol * dot8( vz , grad_y ); - - vel_grad(ielem, K_F_XZ) = inv_vol * dot8( vx , grad_z ); - vel_grad(ielem, K_F_YZ) = inv_vol * dot8( vy , grad_z ); - vel_grad(ielem, K_F_ZZ) = inv_vol * dot8( vz , grad_z ); - } - - //-------------------------------------------------------------------------- - // Functor operator() which calls the three member functions. - - - KOKKOS_INLINE_FUNCTION - void operator()( int ielem )const - { - const int X = 0 ; - const int Y = 1 ; - const int Z = 2 ; - const Scalar dt_scale = -0.5 * *dt; - - // declare and reuse local data for frequently accessed data to - // reduce global memory reads and writes. - - Scalar x[8], y[8], z[8]; - Scalar vx[8], vy[8], vz[8]; - Scalar grad_x[8], grad_y[8], grad_z[8]; - - // Read global velocity once and use many times - // via local registers / L1 cache. - // store the velocity information in local memory before using, - // so it can be returned for other functions to use - - // Read global coordinates and velocity once and use many times - // via local registers / L1 cache. - // load X coordinate information and move by half time step - - for ( int i = 0 ; i < ElemNodeCount ; ++i ) { - const int n = elem_node_connectivity( ielem , i ); - - vx[i] = velocity( n , X , current_state ); - vy[i] = velocity( n , Y , current_state ); - vz[i] = velocity( n , Z , current_state ); - - x[i] = model_coords( n , X ) + - displacement( n , X , current_state ) + - dt_scale * vx[i]; - - y[i] = model_coords( n , Y ) + - displacement( n , Y , current_state ) + - dt_scale * vy[i]; - - z[i] = model_coords( n , Z ) + - displacement( n , Z , current_state ) + - dt_scale * vz[i]; - } - - comp_grad( x, y, z, grad_x, grad_y, grad_z); - - // Calculate hexahedral volume from x model_coords and gradient information - - const Scalar inv_vol = 1.0 / dot8( x , grad_x ); - - v_grad(ielem, vx, vy, vz, grad_x, grad_y, grad_z, inv_vol); - } - - static void apply( const Fields & fields , - const int arg_current_state , - const int arg_previous_state ) - { - grad op( fields, arg_current_state , arg_previous_state ); - Kokkos::parallel_for( fields.num_elements , op ); - } -}; - -//---------------------------------------------------------------------------- - -template -struct decomp_rotate -{ - typedef DeviceType execution_space ; - - typedef Explicit::Fields< Scalar , execution_space > Fields ; - - static const int ElemNodeCount = Fields::ElemNodeCount ; - - static const int K_F_XX = Fields::K_F_XX ; - static const int K_F_YY = Fields::K_F_YY ; - static const int K_F_ZZ = Fields::K_F_ZZ ; - static const int K_F_XY = Fields::K_F_XY ; - static const int K_F_YZ = Fields::K_F_YZ ; - static const int K_F_ZX = Fields::K_F_ZX ; - static const int K_F_YX = Fields::K_F_YX ; - static const int K_F_ZY = Fields::K_F_ZY ; - static const int K_F_XZ = Fields::K_F_XZ ; - - static const int K_S_XX = Fields::K_S_XX ; - static const int K_S_YY = Fields::K_S_YY ; - static const int K_S_ZZ = Fields::K_S_ZZ ; - static const int K_S_XY = Fields::K_S_XY ; - static const int K_S_YZ = Fields::K_S_YZ ; - static const int K_S_ZX = Fields::K_S_ZX ; - static const int K_S_YX = Fields::K_S_YX ; - static const int K_S_ZY = Fields::K_S_ZY ; - static const int K_S_XZ = Fields::K_S_XZ ; - - static const int K_V_XY = Fields::K_V_XY ; - static const int K_V_YZ = Fields::K_V_YZ ; - static const int K_V_ZX = Fields::K_V_ZX ; - - // Global arrays used by this functor. - - const typename Fields::elem_tensor_state_type rotation ; - const typename Fields::elem_tensor_type vel_grad ; - const typename Fields::elem_sym_tensor_type stretch ; - const typename Fields::elem_sym_tensor_type rot_stretch ; - const typename Fields::scalar_type dt_value ; - - const int current_state; - const int previous_state; - - decomp_rotate( const Fields & mesh_fields , - const int arg_current_state, - const int arg_previous_state) - : rotation( mesh_fields.rotation ) - , vel_grad( mesh_fields.vel_grad ) - , stretch( mesh_fields.stretch ) - , rot_stretch( mesh_fields.rot_stretch ) - , dt_value( mesh_fields.dt) - , current_state( arg_current_state) - , previous_state(arg_previous_state) - {} - - static void apply( const Fields & mesh_fields , - const int arg_current_state , - const int arg_previous_state ) - { - decomp_rotate op( mesh_fields , arg_current_state , arg_previous_state ); - Kokkos::parallel_for( mesh_fields.num_elements , op ); - } - - - KOKKOS_INLINE_FUNCTION - void additive_decomp(int ielem, Scalar * v_gr, Scalar * str_ten) const - { - // In addition to calculating stretching_tensor, - // use this as an opportunity to load global - // variables into a local space - - for ( int i = 0 ; i < 9 ; ++i ) { - v_gr[i] = vel_grad( ielem , i ); - } - - // - // Symmetric part - // - str_ten[K_S_XX] = v_gr[K_F_XX]; - str_ten[K_S_YY] = v_gr[K_F_YY]; - str_ten[K_S_ZZ] = v_gr[K_F_ZZ]; - str_ten[K_S_XY] = 0.5*(v_gr[K_F_XY] + v_gr[K_F_YX]); - str_ten[K_S_YZ] = 0.5*(v_gr[K_F_YZ] + v_gr[K_F_ZY]); - str_ten[K_S_ZX] = 0.5*(v_gr[K_F_ZX] + v_gr[K_F_XZ]); - } - - KOKKOS_INLINE_FUNCTION - void polar_decomp(int ielem, Scalar * v_gr, Scalar * str_ten, Scalar * str, Scalar * vort, Scalar * rot_old, Scalar * rot_new)const - { - const Scalar dt = *dt_value; - const Scalar dt_half = 0.5 * dt; - - // Skew Symmetric part - vort[K_V_XY] = 0.5*(v_gr[K_F_XY] - v_gr[K_F_YX]); - vort[K_V_YZ] = 0.5*(v_gr[K_F_YZ] - v_gr[K_F_ZY]); - vort[K_V_ZX] = 0.5*(v_gr[K_F_ZX] - v_gr[K_F_XZ]); - - // calculate the rates of rotation via gauss elimination. - for ( int i = 0 ; i < 6 ; ++i ) { - str[i] = stretch(ielem, i); - } - - Scalar z1 = str_ten[K_S_XY] * str[K_S_ZX] - - str_ten[K_S_ZX] * str[K_S_XY] + - str_ten[K_S_YY] * str[K_S_YZ] - - str_ten[K_S_YZ] * str[K_S_YY] + - str_ten[K_S_YZ] * str[K_S_ZZ] - - str_ten[K_S_ZZ] * str[K_S_YZ]; - - Scalar z2 = str_ten[K_S_ZX] * str[K_S_XX] - - str_ten[K_S_XX] * str[K_S_ZX] + - str_ten[K_S_YZ] * str[K_S_XY] - - str_ten[K_S_XY] * str[K_S_YZ] + - str_ten[K_S_ZZ] * str[K_S_ZX] - - str_ten[K_S_ZX] * str[K_S_ZZ]; - - Scalar z3 = str_ten[K_S_XX] * str[K_S_XY] - - str_ten[K_S_XY] * str[K_S_XX] + - str_ten[K_S_XY] * str[K_S_YY] - - str_ten[K_S_YY] * str[K_S_XY] + - str_ten[K_S_ZX] * str[K_S_YZ] - - str_ten[K_S_YZ] * str[K_S_ZX]; - - // forward elimination - const Scalar a1inv = 1.0 / (str[K_S_YY] + str[K_S_ZZ]); - - const Scalar a4BYa1 = -1 * str[K_S_XY] * a1inv; - - const Scalar a2inv = 1.0 / (str[K_S_ZZ] + str[K_S_XX] + str[K_S_XY] * a4BYa1); - - const Scalar a5 = -str[K_S_YZ] + str[K_S_ZX] * a4BYa1; - - z2 -= z1 * a4BYa1; - Scalar a6BYa1 = -1 * str[K_S_ZX] * a1inv; - const Scalar a5BYa2 = a5 * a2inv; - z3 -= z1 * a6BYa1 - z2 * a5BYa2; - - // backward substitution - - z3 /= (str[K_S_XX] + str[K_S_YY] + str[K_S_ZX] * a6BYa1 + a5 * a5BYa2); - z2 = (z2 - a5 * z3) * a2inv; - z1 = (z1*a1inv - a6BYa1 * z3 -a4BYa1 * z2); - - // calculate rotation rates - recall that spin_rate is an asymmetric tensor, - // so compute spin rate vector as dual of spin rate tensor, - // i.e w_i = e_ijk * spin_rate_jk - z1 += vort[K_V_YZ]; - z2 += vort[K_V_ZX]; - z3 += vort[K_V_XY]; - - // update rotation tensor: - // 1) premultiply old rotation tensor to get right-hand side. - - for ( int i = 0 ; i < 9 ; ++i ) { - rot_old[i] = rotation(ielem, i, previous_state); - } - - Scalar r_XX = rot_old[K_F_XX] + dt_half*( z3 * rot_old[K_F_YX] - z2 * rot_old[K_F_ZX] ); - Scalar r_YX = rot_old[K_F_YX] + dt_half*( z1 * rot_old[K_F_ZX] - z3 * rot_old[K_F_XX] ); - Scalar r_ZX = rot_old[K_F_ZX] + dt_half*( z2 * rot_old[K_F_XX] - z1 * rot_old[K_F_YX] ); - Scalar r_XY = rot_old[K_F_XY] + dt_half*( z3 * rot_old[K_F_YY] - z2 * rot_old[K_F_ZY] ); - Scalar r_YY = rot_old[K_F_YY] + dt_half*( z1 * rot_old[K_F_ZY] - z3 * rot_old[K_F_XY] ); - Scalar r_ZY = rot_old[K_F_ZY] + dt_half*( z2 * rot_old[K_F_XY] - z1 * rot_old[K_F_YY] ); - Scalar r_XZ = rot_old[K_F_XZ] + dt_half*( z3 * rot_old[K_F_YZ] - z2 * rot_old[K_F_ZZ] ); - Scalar r_YZ = rot_old[K_F_YZ] + dt_half*( z1 * rot_old[K_F_ZZ] - z3 * rot_old[K_F_XZ] ); - Scalar r_ZZ = rot_old[K_F_ZZ] + dt_half*( z2 * rot_old[K_F_XZ] - z1 * rot_old[K_F_YZ] ); - - - // 2) solve for new rotation tensor via gauss elimination. - // forward elimination - - Scalar a12 = - dt_half * z3; - Scalar a13 = dt_half * z2; - Scalar b32 = - dt_half * z1; - Scalar a22inv = 1.0 / (1.0 + a12 * a12); - - Scalar a13a12 = a13*a12; - Scalar a23 = b32 + a13a12; - r_YX += r_XX * a12; - r_YY += r_XY * a12; - r_YZ += r_XZ * a12; - - - b32 = (b32 - a13a12) * a22inv; - r_ZX += r_XX * a13 + r_YX * b32; - r_ZY += r_XY * a13 + r_YY * b32; - r_ZZ += r_XZ * a13 + r_YZ * b32; - - - // backward substitution - - const Scalar a33inv = 1.0 / (1.0 + a13 * a13 + a23 * b32); - - rot_new[K_F_ZX] = r_ZX * a33inv; - rot_new[K_F_ZY] = r_ZY * a33inv; - rot_new[K_F_ZZ] = r_ZZ * a33inv; - rot_new[K_F_YX] = ( r_YX - rot_new[K_F_ZX] * a23 ) * a22inv; - rot_new[K_F_YY] = ( r_YY - rot_new[K_F_ZY] * a23 ) * a22inv; - rot_new[K_F_YZ] = ( r_YZ - rot_new[K_F_ZZ] * a23 ) * a22inv; - rot_new[K_F_XX] = r_XX - rot_new[K_F_ZX] * a13 - rot_new[K_F_YX] * a12; - rot_new[K_F_XY] = r_XY - rot_new[K_F_ZY] * a13 - rot_new[K_F_YY] * a12; - rot_new[K_F_XZ] = r_XZ - rot_new[K_F_ZZ] * a13 - rot_new[K_F_YZ] * a12; - - for ( int i = 0 ; i < 9 ; ++i ) { - rotation(ielem, i, current_state) = rot_new[i] ; - } - - // update stretch tensor in the new configuration - - const Scalar a1 = str_ten[K_S_XY] + vort[K_V_XY]; - const Scalar a2 = str_ten[K_S_YZ] + vort[K_V_YZ]; - const Scalar a3 = str_ten[K_S_ZX] + vort[K_V_ZX]; - const Scalar b1 = str_ten[K_S_ZX] - vort[K_V_ZX]; - const Scalar b2 = str_ten[K_S_XY] - vort[K_V_XY]; - const Scalar b3 = str_ten[K_S_YZ] - vort[K_V_YZ]; - - const Scalar s_XX = str[K_S_XX]; - const Scalar s_YY = str[K_S_YY]; - const Scalar s_ZZ = str[K_S_ZZ]; - const Scalar s_XY = str[K_S_XY]; - const Scalar s_YZ = str[K_S_YZ]; - const Scalar s_ZX = str[K_S_ZX]; - - str[K_S_XX] += dt * (str_ten[K_S_XX] * s_XX + ( a1 + z3 ) * s_XY + ( b1 - z2 ) * s_ZX); - str[K_S_YY] += dt * (str_ten[K_S_YY] * s_YY + ( a2 + z1 ) * s_YZ + ( b2 - z3 ) * s_XY); - str[K_S_ZZ] += dt * (str_ten[K_S_ZZ] * s_ZZ + ( a3 + z2 ) * s_ZX + ( b3 - z1 ) * s_YZ); - str[K_S_XY] += dt * (str_ten[K_S_XX] * s_XY + ( a1 ) * s_YY + ( b1 ) * s_YZ - z3 * s_XX + z1 * s_ZX); - str[K_S_YZ] += dt * (str_ten[K_S_YY] * s_YZ + ( a2 ) * s_ZZ + ( b2 ) * s_ZX - z1 * s_YY + z2 * s_XY); - str[K_S_ZX] += dt * (str_ten[K_S_ZZ] * s_ZX + ( a3 ) * s_XX + ( b3 ) * s_XY - z2 * s_ZZ + z3 * s_YZ); - - } - - - KOKKOS_INLINE_FUNCTION - void rotate_tensor(int ielem, Scalar * str_ten, Scalar * str, Scalar * rot_new)const { - - Scalar t[9]; - Scalar rot_str[6]; // Rotated stretch - - t[0] = str_ten[K_S_XX]*rot_new[K_F_XX] + - str_ten[K_S_XY]*rot_new[K_F_YX] + - str_ten[K_S_XZ]*rot_new[K_F_ZX]; - - t[1] = str_ten[K_S_YX]*rot_new[K_F_XX] + - str_ten[K_S_YY]*rot_new[K_F_YX] + - str_ten[K_S_YZ]*rot_new[K_F_ZX]; - - t[2] = str_ten[K_S_ZX]*rot_new[K_F_XX] + - str_ten[K_S_ZY]*rot_new[K_F_YX] + - str_ten[K_S_ZZ]*rot_new[K_F_ZX]; - - t[3] = str_ten[K_S_XX]*rot_new[K_F_XY] + - str_ten[K_S_XY]*rot_new[K_F_YY] + - str_ten[K_S_XZ]*rot_new[K_F_ZY]; - - t[4] = str_ten[K_S_YX]*rot_new[K_F_XY] + - str_ten[K_S_YY]*rot_new[K_F_YY] + - str_ten[K_S_YZ]*rot_new[K_F_ZY]; - - t[5] = str_ten[K_S_ZX]*rot_new[K_F_XY] + - str_ten[K_S_ZY]*rot_new[K_F_YY] + - str_ten[K_S_ZZ]*rot_new[K_F_ZY]; - - t[6] = str_ten[K_S_XX]*rot_new[K_F_XZ] + - str_ten[K_S_XY]*rot_new[K_F_YZ] + - str_ten[K_S_XZ]*rot_new[K_F_ZZ]; - - t[7] = str_ten[K_S_YX]*rot_new[K_F_XZ] + - str_ten[K_S_YY]*rot_new[K_F_YZ] + - str_ten[K_S_YZ]*rot_new[K_F_ZZ]; - - t[8] = str_ten[K_S_ZX]*rot_new[K_F_XZ] + - str_ten[K_S_ZY]*rot_new[K_F_YZ] + - str_ten[K_S_ZZ]*rot_new[K_F_ZZ]; - - - rot_str[ K_S_XX ] = rot_new[K_F_XX] * t[0] + - rot_new[K_F_YX] * t[1] + - rot_new[K_F_ZX] * t[2]; - rot_str[ K_S_YY ] = rot_new[K_F_XY] * t[3] + - rot_new[K_F_YY] * t[4] + - rot_new[K_F_ZY] * t[5]; - rot_str[ K_S_ZZ ] = rot_new[K_F_XZ] * t[6] + - rot_new[K_F_YZ] * t[7] + - rot_new[K_F_ZZ] * t[8]; - - rot_str[ K_S_XY ] = rot_new[K_F_XX] * t[3] + - rot_new[K_F_YX] * t[4] + - rot_new[K_F_ZX] * t[5]; - rot_str[ K_S_YZ ] = rot_new[K_F_XY] * t[6] + - rot_new[K_F_YY] * t[7] + - rot_new[K_F_ZY] * t[8]; - rot_str[ K_S_ZX ] = rot_new[K_F_XZ] * t[0] + - rot_new[K_F_YZ] * t[1] + - rot_new[K_F_ZZ] * t[2]; - - for ( int i = 0 ; i < 6 ; ++i ) { - rot_stretch(ielem, i) = rot_str[i] ; - } - - for ( int i = 0 ; i < 6 ; ++i ) { - stretch(ielem, i) = str[i] ; - } - } - - KOKKOS_INLINE_FUNCTION - void operator()( int ielem )const { - - // Local scratch space to avoid multiple - // accesses to global memory. - Scalar str_ten[6]; // Stretching tensor - Scalar str[6]; // Stretch - Scalar rot_old[9]; // Rotation old - Scalar rot_new[9]; // Rotation new - Scalar vort[3]; // Vorticity - Scalar v_gr[9]; // Velocity gradient - - additive_decomp(ielem, v_gr, str_ten); - - polar_decomp(ielem, v_gr, str_ten, str, vort, rot_old, rot_new); - - rotate_tensor(ielem, str_ten, str, rot_new); - } -}; - -//---------------------------------------------------------------------------- - -template -struct internal_force -{ - typedef DeviceType execution_space ; - - typedef Explicit::Fields< Scalar , execution_space > Fields ; - - static const int ElemNodeCount = Fields::ElemNodeCount ; - - static const int K_F_XX = Fields::K_F_XX ; - static const int K_F_YY = Fields::K_F_YY ; - static const int K_F_ZZ = Fields::K_F_ZZ ; - static const int K_F_XY = Fields::K_F_XY ; - static const int K_F_YZ = Fields::K_F_YZ ; - static const int K_F_ZX = Fields::K_F_ZX ; - static const int K_F_YX = Fields::K_F_YX ; - static const int K_F_ZY = Fields::K_F_ZY ; - static const int K_F_XZ = Fields::K_F_XZ ; - - static const int K_S_XX = Fields::K_S_XX ; - static const int K_S_YY = Fields::K_S_YY ; - static const int K_S_ZZ = Fields::K_S_ZZ ; - static const int K_S_XY = Fields::K_S_XY ; - static const int K_S_YZ = Fields::K_S_YZ ; - static const int K_S_ZX = Fields::K_S_ZX ; - static const int K_S_YX = Fields::K_S_YX ; - static const int K_S_ZY = Fields::K_S_ZY ; - static const int K_S_XZ = Fields::K_S_XZ ; - - //-------------------------------------------------------------------------- - // Reduction: - - typedef Scalar value_type; - - KOKKOS_INLINE_FUNCTION - static void init(value_type &update) { - update = 1.0e32; - } - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update, - const volatile value_type & source ) - { - update = update < source ? update : source; - } - - // Final serial processing of reduction value: - KOKKOS_INLINE_FUNCTION - void final( value_type & result ) const - { - *prev_dt = *dt ; - *dt = result ; - }; - - //-------------------------------------------------------------------------- - - // Global arrays used by this functor. - - const typename Fields::elem_node_ids_type elem_node_connectivity ; - const typename Fields::node_coords_type model_coords ; - const typename Fields::scalar_type dt ; - const typename Fields::scalar_type prev_dt ; - const typename Fields::geom_state_array_type displacement ; - const typename Fields::geom_state_array_type velocity ; - const typename Fields::array_type elem_mass ; - const typename Fields::array_type internal_energy ; - const typename Fields::elem_sym_tensor_type stress_new ; - const typename Fields::elem_node_geom_type element_force ; - const typename Fields::elem_tensor_state_type rotation ; - const typename Fields::elem_sym_tensor_type rot_stretch ; - - const Scalar two_mu; - const Scalar bulk_modulus; - const Scalar lin_bulk_visc; - const Scalar quad_bulk_visc; - const Scalar user_dt; - const int current_state; - - internal_force( const Fields & mesh_fields, - const Scalar arg_user_dt, - const int arg_current_state ) - : elem_node_connectivity( mesh_fields.elem_node_connectivity ) - , model_coords( mesh_fields.model_coords ) - , dt( mesh_fields.dt ) - , prev_dt( mesh_fields.prev_dt ) - , displacement( mesh_fields.displacement ) - , velocity( mesh_fields.velocity ) - , elem_mass( mesh_fields.elem_mass ) - , internal_energy( mesh_fields.internal_energy ) - , stress_new( mesh_fields.stress_new ) - , element_force( mesh_fields.element_force ) - , rotation( mesh_fields.rotation ) - , rot_stretch( mesh_fields.rot_stretch ) - , two_mu( mesh_fields.two_mu ) - , bulk_modulus( mesh_fields.bulk_modulus ) - , lin_bulk_visc( mesh_fields.lin_bulk_visc ) - , quad_bulk_visc( mesh_fields.quad_bulk_visc ) - , user_dt( arg_user_dt ) - , current_state( arg_current_state ) - {} - - static void apply( const Fields & mesh_fields , - const Scalar arg_user_dt, - const int arg_current_state ) - { - internal_force op_force( mesh_fields , arg_user_dt , arg_current_state ); - - Kokkos::parallel_reduce( mesh_fields.num_elements, op_force ); - } - - //-------------------------------------------------------------------------- - - KOKKOS_INLINE_FUNCTION - void rotate_tensor_backward(int ielem , - const Scalar * const s_n , - Scalar * const rot_stress )const - { - const int rot_state = current_state ; // 1 ; - - // t : temporary variables - // s_n : stress_new in local memory space - // r_n : rotation_new in local memory space - Scalar t[9], r_n[9]; - - r_n[0] = rotation(ielem, 0, rot_state ); - r_n[1] = rotation(ielem, 1, rot_state ); - r_n[2] = rotation(ielem, 2, rot_state ); - r_n[3] = rotation(ielem, 3, rot_state ); - r_n[4] = rotation(ielem, 4, rot_state ); - r_n[5] = rotation(ielem, 5, rot_state ); - r_n[6] = rotation(ielem, 6, rot_state ); - r_n[7] = rotation(ielem, 7, rot_state ); - r_n[8] = rotation(ielem, 8, rot_state ); - - t[0] = s_n[K_S_XX]*r_n[K_F_XX]+ s_n[K_S_XY]*r_n[K_F_XY]+ s_n[K_S_XZ]*r_n[K_F_XZ]; - t[1] = s_n[K_S_YX]*r_n[K_F_XX]+ s_n[K_S_YY]*r_n[K_F_XY]+ s_n[K_S_YZ]*r_n[K_F_XZ]; - t[2] = s_n[K_S_ZX]*r_n[K_F_XX]+ s_n[K_S_ZY]*r_n[K_F_XY]+ s_n[K_S_ZZ]*r_n[K_F_XZ]; - t[3] = s_n[K_S_XX]*r_n[K_F_YX]+ s_n[K_S_XY]*r_n[K_F_YY]+ s_n[K_S_XZ]*r_n[K_F_YZ]; - t[4] = s_n[K_S_YX]*r_n[K_F_YX]+ s_n[K_S_YY]*r_n[K_F_YY]+ s_n[K_S_YZ]*r_n[K_F_YZ]; - t[5] = s_n[K_S_ZX]*r_n[K_F_YX]+ s_n[K_S_ZY]*r_n[K_F_YY]+ s_n[K_S_ZZ]*r_n[K_F_YZ]; - t[6] = s_n[K_S_XX]*r_n[K_F_ZX]+ s_n[K_S_XY]*r_n[K_F_ZY]+ s_n[K_S_XZ]*r_n[K_F_ZZ]; - t[7] = s_n[K_S_YX]*r_n[K_F_ZX]+ s_n[K_S_YY]*r_n[K_F_ZY]+ s_n[K_S_YZ]*r_n[K_F_ZZ]; - t[8] = s_n[K_S_ZX]*r_n[K_F_ZX]+ s_n[K_S_ZY]*r_n[K_F_ZY]+ s_n[K_S_ZZ]*r_n[K_F_ZZ]; - - rot_stress[ K_S_XX ] = r_n[K_F_XX]*t[0] + r_n[K_F_XY]*t[1] + r_n[K_F_XZ]*t[2]; - rot_stress[ K_S_YY ] = r_n[K_F_YX]*t[3] + r_n[K_F_YY]*t[4] + r_n[K_F_YZ]*t[5]; - rot_stress[ K_S_ZZ ] = r_n[K_F_ZX]*t[6] + r_n[K_F_ZY]*t[7] + r_n[K_F_ZZ]*t[8]; - - rot_stress[ K_S_XY ] = r_n[K_F_XX]*t[3] + r_n[K_F_XY]*t[4] + r_n[K_F_XZ]*t[5]; - rot_stress[ K_S_YZ ] = r_n[K_F_YX]*t[6] + r_n[K_F_YY]*t[7] + r_n[K_F_YZ]*t[8]; - rot_stress[ K_S_ZX ] = r_n[K_F_ZX]*t[0] + r_n[K_F_ZY]*t[1] + r_n[K_F_ZZ]*t[2]; - } - - //-------------------------------------------------------------------------- - - KOKKOS_INLINE_FUNCTION - void comp_force(int ielem, - const Scalar * const vx , - const Scalar * const vy , - const Scalar * const vz , - const Scalar * const grad_x , - const Scalar * const grad_y , - const Scalar * const grad_z , - Scalar * total_stress12th ) const - { - Scalar internal_energy_inc = 0 ; - - for(int inode = 0; inode < 8; ++inode) { - - const Scalar fx = - total_stress12th[K_S_XX] * grad_x[inode] + - total_stress12th[K_S_XY] * grad_y[inode] + - total_stress12th[K_S_XZ] * grad_z[inode] ; - - element_force(ielem, 0, inode) = fx ; - - const Scalar fy = - total_stress12th[K_S_YX] * grad_x[inode] + - total_stress12th[K_S_YY] * grad_y[inode] + - total_stress12th[K_S_YZ] * grad_z[inode] ; - - element_force(ielem, 1, inode) = fy ; - - const Scalar fz = - total_stress12th[K_S_ZX] * grad_x[inode] + - total_stress12th[K_S_ZY] * grad_y[inode] + - total_stress12th[K_S_ZZ] * grad_z[inode] ; - - element_force(ielem, 2, inode) = fz ; - - internal_energy_inc += - fx * vx[inode] + - fy * vy[inode] + - fz * vz[inode] ; - } - - internal_energy(ielem) = internal_energy_inc ; - } - - //---------------------------------------------------------------------------- - - KOKKOS_INLINE_FUNCTION - void get_stress(int ielem , Scalar * const s_n ) const - { - const int kxx = 0; - const int kyy = 1; - const int kzz = 2; - const int kxy = 3; - const int kyz = 4; - const int kzx = 5; - - const Scalar e = (rot_stretch(ielem,kxx)+rot_stretch(ielem,kyy)+rot_stretch(ielem,kzz))/3.0; - - s_n[kxx] = stress_new(ielem,kxx) += *dt * (two_mu * (rot_stretch(ielem,kxx)-e)+3*bulk_modulus*e); - s_n[kyy] = stress_new(ielem,kyy) += *dt * (two_mu * (rot_stretch(ielem,kyy)-e)+3*bulk_modulus*e); - s_n[kzz] = stress_new(ielem,kzz) += *dt * (two_mu * (rot_stretch(ielem,kzz)-e)+3*bulk_modulus*e); - - s_n[kxy] = stress_new(ielem,kxy) += *dt * two_mu * rot_stretch(ielem,kxy); - s_n[kyz] = stress_new(ielem,kyz) += *dt * two_mu * rot_stretch(ielem,kyz); - s_n[kzx] = stress_new(ielem,kzx) += *dt * two_mu * rot_stretch(ielem,kzx); - } - - //---------------------------------------------------------------------------- - - - KOKKOS_INLINE_FUNCTION - void operator()( int ielem, value_type & update )const - { - const Scalar ONE12TH = 1.0 / 12.0 ; - - Scalar x[8], y[8], z[8] ; - Scalar vx[8], vy[8], vz[8]; - Scalar grad_x[8], grad_y[8], grad_z[8]; - - // Position and velocity: - - for ( int i = 0 ; i < ElemNodeCount ; ++i ) { - const int n = elem_node_connectivity(ielem,i); - - x[i] = model_coords(n, 0) + displacement(n, 0, current_state) ; - y[i] = model_coords(n, 1) + displacement(n, 1, current_state) ; - z[i] = model_coords(n, 2) + displacement(n, 2, current_state) ; - - vx[i] = velocity(n, 0, current_state); - vy[i] = velocity(n, 1, current_state); - vz[i] = velocity(n, 2, current_state); - } - - // Gradient: - - comp_grad( x , y , z , grad_x , grad_y , grad_z ); - - - const Scalar mid_vol = dot8( x , grad_x ); - - const Scalar shr = two_mu ; - const Scalar dil = bulk_modulus + ((2.0*shr)/3.0); - - const Scalar aspect = 6.0 * mid_vol / - ( dot8( grad_x , grad_x ) + - dot8( grad_y , grad_y ) + - dot8( grad_z , grad_z ) ); - - const Scalar dtrial = sqrt(elem_mass(ielem) * aspect / dil); - const Scalar traced = (rot_stretch(ielem, 0) + rot_stretch(ielem, 1) + rot_stretch(ielem, 2)); - - const Scalar eps = traced < 0 ? (lin_bulk_visc - quad_bulk_visc * traced * dtrial) : lin_bulk_visc ; - - const Scalar bulkq = eps * dil * dtrial * traced; - - Scalar cur_time_step = dtrial * ( sqrt( 1.0 + eps * eps) - eps); - - // force fixed time step if input - - cur_time_step = user_dt > 0 ? user_dt : cur_time_step; - - update = update < cur_time_step ? update : cur_time_step; - - - Scalar s_n[ 6 ]; - - get_stress( ielem, s_n ); - - Scalar total_stress12th[6]; - - // Get rotated stress: - - rotate_tensor_backward(ielem, s_n , total_stress12th ); - - total_stress12th[0] = ONE12TH*( total_stress12th[ 0 ] + bulkq ); - total_stress12th[1] = ONE12TH*( total_stress12th[ 1 ] + bulkq ); - total_stress12th[2] = ONE12TH*( total_stress12th[ 2 ] + bulkq ); - total_stress12th[3] = ONE12TH*( total_stress12th[ 3 ] ); - total_stress12th[4] = ONE12TH*( total_stress12th[ 4 ] ); - total_stress12th[5] = ONE12TH*( total_stress12th[ 5 ] ); - - comp_force(ielem, vx, vy, vz, - grad_x, grad_y, grad_z, total_stress12th); - } -}; - -//---------------------------------------------------------------------------- - -template -struct nodal_step -{ - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type; - - typedef Explicit::Fields< Scalar , execution_space > Fields ; - - const typename Fields::scalar_type dt ; - const typename Fields::scalar_type prev_dt ; - const typename Fields::node_elem_ids_type node_elem_connectivity ; - const typename Fields::node_coords_type model_coords ; - const typename Fields::array_type nodal_mass ; - const typename Fields::geom_state_array_type displacement ; - const typename Fields::geom_state_array_type velocity ; - const typename Fields::geom_array_type acceleration ; - const typename Fields::geom_array_type internal_force ; - const typename Fields::elem_node_geom_type element_force ; - - const Scalar x_bc; - const int current_state; - const int next_state; - - - nodal_step( const Fields & mesh_fields , - const Scalar arg_x_bc, - const int arg_current_state, - const int arg_next_state) - : dt( mesh_fields.dt ) - , prev_dt( mesh_fields.prev_dt ) - , node_elem_connectivity( mesh_fields.node_elem_connectivity ) - , model_coords( mesh_fields.model_coords ) - , nodal_mass( mesh_fields.nodal_mass ) - , displacement( mesh_fields.displacement ) - , velocity( mesh_fields.velocity ) - , acceleration( mesh_fields.acceleration ) - , internal_force( mesh_fields.internal_force ) - , element_force( mesh_fields.element_force ) - , x_bc( arg_x_bc ) - , current_state( arg_current_state ) - , next_state( arg_next_state ) - { - //std::cout << "finish_step dt: " << dt << std::endl; - //std::cout << "finish_step prev_dt: " << prev_dt << std::endl; - } - - static void apply( const Fields & mesh_fields , - const Scalar arg_x_bc , - const int arg_current_state , - const int arg_next_state ) - { - nodal_step op( mesh_fields, arg_x_bc, arg_current_state, arg_next_state ); - - // Only update the owned nodes: - - Kokkos::parallel_for( mesh_fields.num_nodes_owned , op ); - } - - KOKKOS_INLINE_FUNCTION - void operator()(int inode) const - { - // Getting count as per 'CSR-like' data structure - const int begin = node_elem_connectivity.row_map[inode]; - const int end = node_elem_connectivity.row_map[inode+1]; - - double local_force[] = {0.0, 0.0, 0.0}; - - // Gather-sum internal force from - // each element that a node is attached to. - - for ( int i = begin; i < end ; ++i ){ - - // node_elem_offset is a cumulative structure, so - // node_elem_offset(inode) should be the index where - // a particular row's elem_IDs begin - const int nelem = node_elem_connectivity.entries( i, 0); - - // find the row in an element's stiffness matrix - // that corresponds to inode - const int elem_node_index = node_elem_connectivity.entries( i, 1); - - local_force[0] += element_force(nelem, 0, elem_node_index); - local_force[1] += element_force(nelem, 1, elem_node_index); - local_force[2] += element_force(nelem, 2, elem_node_index); - } - - internal_force(inode, 0) = local_force[0]; - internal_force(inode, 1) = local_force[1]; - internal_force(inode, 2) = local_force[2]; - - // Acceleration: - - Scalar v_new[3]; - Scalar a_current[3]; - - const Scalar tol = 1.0e-7; - - // If not on the boundary then: a = F / m - if ( tol < fabs(model_coords(inode,0)-x_bc) ) { - - const Scalar m = nodal_mass( inode ); - - acceleration(inode,0) = a_current[0] = -local_force[0] / m ; - acceleration(inode,1) = a_current[1] = -local_force[1] / m ; - acceleration(inode,2) = a_current[2] = -local_force[2] / m ; - } - else { //enforce fixed BC - acceleration(inode,0) = a_current[0] = 0; - acceleration(inode,1) = a_current[1] = 0; - acceleration(inode,2) = a_current[2] = 0; - } - - // Central difference time integration: - - const Scalar dt_disp = *dt ; - const Scalar dt_vel = ( *dt + *prev_dt ) / 2.0 ; - - velocity(inode,0,next_state) = v_new[0] = - velocity(inode,0,current_state) + dt_vel * a_current[0]; - - velocity(inode,1,next_state) = v_new[1] = - velocity(inode,1,current_state) + dt_vel * a_current[1]; - - velocity(inode,2,next_state) = v_new[2] = - velocity(inode,2,current_state) + dt_vel * a_current[2]; - - displacement(inode,0,next_state) = - displacement(inode,0,current_state) + dt_disp * v_new[0]; - - displacement(inode,1,next_state) = - displacement(inode,1,current_state) + dt_disp * v_new[1]; - - displacement(inode,2,next_state) = - displacement(inode,2,current_state) + dt_disp * v_new[2]; - } -}; - -//---------------------------------------------------------------------------- - -template< typename Scalar , class DeviceType > -struct pack_state -{ - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type ; - - typedef Explicit::Fields< Scalar , execution_space > Fields ; - - typedef typename Fields::geom_state_array_type::value_type value_type ; - typedef Kokkos::View< value_type* , execution_space > buffer_type ; - - static const unsigned value_count = 6 ; - - const typename Fields::geom_state_array_type displacement ; - const typename Fields::geom_state_array_type velocity ; - const buffer_type output ; - const size_type inode_base ; - const size_type state_next ; - - pack_state( const buffer_type & arg_output , - const Fields & mesh_fields , - const size_type arg_begin , - const size_type arg_state ) - : displacement( mesh_fields.displacement ) - , velocity( mesh_fields.velocity ) - , output( arg_output ) - , inode_base( arg_begin ) - , state_next( arg_state ) - {} - - static void apply( const buffer_type & arg_output , - const size_type arg_begin , - const size_type arg_count , - const Fields & mesh_fields , - const size_type arg_state ) - { - pack_state op( arg_output , mesh_fields , arg_begin , arg_state ); - - Kokkos::parallel_for( arg_count , op ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type i ) const - { - const size_type inode = inode_base + i ; - - size_type j = i * value_count ; - - output[j++] = displacement( inode , 0 , state_next ); - output[j++] = displacement( inode , 1 , state_next ); - output[j++] = displacement( inode , 2 , state_next ); - output[j++] = velocity( inode , 0 , state_next ); - output[j++] = velocity( inode , 1 , state_next ); - output[j++] = velocity( inode , 2 , state_next ); - } -}; - -template< typename Scalar , class DeviceType > -struct unpack_state -{ - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type ; - - typedef Explicit::Fields< Scalar , execution_space > Fields ; - - typedef typename Fields::geom_state_array_type::value_type value_type ; - typedef Kokkos::View< value_type* , execution_space > buffer_type ; - - static const unsigned value_count = 6 ; - - const typename Fields::geom_state_array_type displacement ; - const typename Fields::geom_state_array_type velocity ; - const buffer_type input ; - const size_type inode_base ; - const size_type state_next ; - - unpack_state( const buffer_type & arg_input , - const Fields & mesh_fields , - const size_type arg_begin , - const size_type arg_state ) - : displacement( mesh_fields.displacement ) - , velocity( mesh_fields.velocity ) - , input( arg_input ) - , inode_base( arg_begin ) - , state_next( arg_state ) - {} - - static void apply( const Fields & mesh_fields , - const size_type arg_state , - const buffer_type & arg_input , - const size_type arg_begin , - const size_type arg_count ) - { - unpack_state op( arg_input , mesh_fields , arg_begin , arg_state ); - - Kokkos::parallel_for( arg_count , op ); - } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type i ) const - { - const size_type inode = inode_base + i ; - - size_type j = i * value_count ; - - displacement( inode , 0 , state_next ) = input[j++] ; - displacement( inode , 1 , state_next ) = input[j++] ; - displacement( inode , 2 , state_next ) = input[j++] ; - velocity( inode , 0 , state_next ) = input[j++] ; - velocity( inode , 1 , state_next ) = input[j++] ; - velocity( inode , 2 , state_next ) = input[j++] ; - } -}; - -} /* namespace Explicit */ - -#endif /* #ifndef KOKKOS_EXPLICITFUNCTORS_HPP */ - - diff --git a/lib/kokkos/example/multi_fem/FEMesh.hpp b/lib/kokkos/example/multi_fem/FEMesh.hpp deleted file mode 100644 index 33468e2fbd..0000000000 --- a/lib/kokkos/example/multi_fem/FEMesh.hpp +++ /dev/null @@ -1,86 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_FEMESH_HPP -#define KOKKOS_FEMESH_HPP - -#include -#include -#include -#include -#include - -#include -#include - -#include -#include - -namespace HybridFEM { - -//---------------------------------------------------------------------------- -/** \brief Finite element mesh fixture for hybrid parallel performance tests. - */ -template< typename CoordScalarType , unsigned ElemNodeCount , class Device > -struct FEMesh { - - typedef typename Device::size_type size_type ; - - static const size_type element_node_count = ElemNodeCount ; - - typedef Kokkos::View< CoordScalarType*[3] , Device > node_coords_type ; - typedef Kokkos::View< size_type*[ElemNodeCount], Device > elem_node_ids_type ; - typedef Kokkos::StaticCrsGraph< size_type[2] , Device > node_elem_ids_type ; - - node_coords_type node_coords ; - elem_node_ids_type elem_node_ids ; - node_elem_ids_type node_elem_ids ; - Kokkos::ParallelDataMap parallel_data_map ; -}; - -//---------------------------------------------------------------------------- - -} /* namespace HybridFEM */ - -#endif /* #ifndef KOKKOS_FEMESH_HPP */ - diff --git a/lib/kokkos/example/multi_fem/HexElement.hpp b/lib/kokkos/example/multi_fem/HexElement.hpp deleted file mode 100644 index 7dec087cbd..0000000000 --- a/lib/kokkos/example/multi_fem/HexElement.hpp +++ /dev/null @@ -1,268 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef ELEMENTHEX_HPP -#define ELEMENTHEX_HPP - -namespace HybridFEM { - -template< unsigned NodeCount > -class HexElement_TensorData ; - -template< unsigned NodeCount , class Device > -class HexElement_TensorEval ; - -//---------------------------------------------------------------------------- -/** \brief Evaluate Hex element on interval [-1,1]^3 */ -template<> -class HexElement_TensorData< 8 > { -public: - - static const unsigned element_node_count = 8 ; - static const unsigned spatial_dimension = 3 ; - static const unsigned integration_count_1d = 2 ; - static const unsigned function_count_1d = 2 ; - - float values_1d [ function_count_1d ][ integration_count_1d ]; - float derivs_1d [ function_count_1d ][ integration_count_1d ]; - float weights_1d[ integration_count_1d ]; - - unsigned char eval_map[ element_node_count ][4] ; - - static float eval_value_1d( const unsigned jf , const float x ) - { - return 0 == jf ? 0.5 * ( 1.0 - x ) : ( - 1 == jf ? 0.5 * ( 1.0 + x ) : 0 ); - } - - static float eval_deriv_1d( const unsigned jf , const float ) - { - return 0 == jf ? -0.5 : ( - 1 == jf ? 0.5 : 0 ); - } - - HexElement_TensorData() - { - const unsigned char tmp_map[ element_node_count ][ spatial_dimension ] = - { { 0 , 0 , 0 }, - { 1 , 0 , 0 }, - { 1 , 1 , 0 }, - { 0 , 1 , 0 }, - { 0 , 0 , 1 }, - { 1 , 0 , 1 }, - { 1 , 1 , 1 }, - { 0 , 1 , 1 } }; - - weights_1d[0] = 1 ; - weights_1d[1] = 1 ; - - const float points_1d[ integration_count_1d ] = - { -0.577350269 , 0.577350269 }; - - for ( unsigned i = 0 ; i < element_node_count ; ++i ) { - eval_map[i][0] = tmp_map[i][0]; - eval_map[i][1] = tmp_map[i][1]; - eval_map[i][2] = tmp_map[i][2]; - } - - for ( unsigned xp = 0 ; xp < integration_count_1d ; ++xp ) { - for ( unsigned xf = 0 ; xf < function_count_1d ; ++xf ) { - values_1d[xp][xf] = eval_value_1d( xf , points_1d[xp] ); - derivs_1d[xp][xf] = eval_deriv_1d( xf , points_1d[xp] ); - }} - } -}; - -//---------------------------------------------------------------------------- - -template<> -class HexElement_TensorData< 27 > { -public: - - static const unsigned element_node_count = 27 ; - static const unsigned spatial_dimension = 3 ; - static const unsigned integration_count_1d = 3 ; - static const unsigned function_count_1d = 3 ; - - float values_1d [ function_count_1d ][ integration_count_1d ]; - float derivs_1d [ function_count_1d ][ integration_count_1d ]; - float weights_1d[ integration_count_1d ]; - - unsigned char eval_map[ element_node_count ][4] ; - - // sizeof(EvaluateElementHex) = 111 bytes = - // sizeof(float) * 9 + - // sizeof(float) * 9 + - // sizeof(float) * 3 + - // sizeof(char) * 27 - - static float eval_value_1d( const unsigned jf , const float p ) - { - return 0 == jf ? 0.5 * p * ( p - 1 ) : ( - 1 == jf ? 1.0 - p * p : ( - 2 == jf ? 0.5 * p * ( p + 1 ) : 0 )); - } - - static float eval_deriv_1d( const unsigned jf , const float p ) - { - return 0 == jf ? p - 0.5 : ( - 1 == jf ? -2.0 * p : ( - 2 == jf ? p + 0.5 : 0 )); - } - - HexElement_TensorData() - { - const unsigned char tmp_map[ element_node_count ][ spatial_dimension ] = - { { 0 , 0 , 0 }, - { 2 , 0 , 0 }, - { 2 , 2 , 0 }, - { 0 , 2 , 0 }, - { 0 , 0 , 2 }, - { 2 , 0 , 2 }, - { 2 , 2 , 2 }, - { 0 , 2 , 2 }, - { 1 , 0 , 0 }, - { 2 , 1 , 0 }, - { 1 , 2 , 0 }, - { 0 , 1 , 0 }, - { 0 , 0 , 1 }, - { 2 , 0 , 1 }, - { 2 , 2 , 1 }, - { 0 , 2 , 1 }, - { 1 , 0 , 2 }, - { 2 , 1 , 2 }, - { 1 , 2 , 2 }, - { 0 , 1 , 2 }, - { 1 , 1 , 1 }, - { 1 , 1 , 0 }, - { 1 , 1 , 2 }, - { 0 , 1 , 1 }, - { 2 , 1 , 1 }, - { 1 , 0 , 1 }, - { 1 , 2 , 1 } }; - - // Interval [-1,1] - - weights_1d[0] = 0.555555556 ; - weights_1d[1] = 0.888888889 ; - weights_1d[2] = 0.555555556 ; - - const float points_1d[3] = { -0.774596669 , - 0.000000000 , - 0.774596669 }; - - for ( unsigned i = 0 ; i < element_node_count ; ++i ) { - eval_map[i][0] = tmp_map[i][0]; - eval_map[i][1] = tmp_map[i][1]; - eval_map[i][2] = tmp_map[i][2]; - } - - for ( unsigned xp = 0 ; xp < integration_count_1d ; ++xp ) { - for ( unsigned xf = 0 ; xf < function_count_1d ; ++xf ) { - values_1d[xp][xf] = eval_value_1d( xf , points_1d[xp] ); - derivs_1d[xp][xf] = eval_deriv_1d( xf , points_1d[xp] ); - }} - } -}; - -//---------------------------------------------------------------------------- - -template< unsigned NodeCount > -class HexElement_Data { -public: - static const unsigned spatial_dimension = 3 ; - static const unsigned element_node_count = NodeCount ; - static const unsigned integration_count = NodeCount ; - static const unsigned function_count = NodeCount ; - - float weights[ integration_count ] ; - float values[ integration_count ][ function_count ]; - float gradients[ integration_count ][ spatial_dimension ][ function_count ]; - - HexElement_Data() - { - HexElement_TensorData< NodeCount > tensor_data ; - - for ( unsigned ip = 0 ; ip < integration_count ; ++ip ) { - - const unsigned ipx = tensor_data.eval_map[ip][0] ; - const unsigned ipy = tensor_data.eval_map[ip][1] ; - const unsigned ipz = tensor_data.eval_map[ip][2] ; - - weights[ip] = tensor_data.weights_1d[ ipx ] * - tensor_data.weights_1d[ ipy ] * - tensor_data.weights_1d[ ipz ] ; - - for ( unsigned jf = 0 ; jf < function_count ; ++jf ) { - - const unsigned jfx = tensor_data.eval_map[jf][0] ; - const unsigned jfy = tensor_data.eval_map[jf][1] ; - const unsigned jfz = tensor_data.eval_map[jf][2] ; - - values[ip][jf] = tensor_data.values_1d[ ipx ][ jfx ] * - tensor_data.values_1d[ ipy ][ jfy ] * - tensor_data.values_1d[ ipz ][ jfz ] ; - - gradients[ip][0][jf] = tensor_data.derivs_1d[ ipx ][ jfx ] * - tensor_data.values_1d[ ipy ][ jfy ] * - tensor_data.values_1d[ ipz ][ jfz ] ; - - gradients[ip][1][jf] = tensor_data.values_1d[ ipx ][ jfx ] * - tensor_data.derivs_1d[ ipy ][ jfy ] * - tensor_data.values_1d[ ipz ][ jfz ] ; - - gradients[ip][2][jf] = tensor_data.values_1d[ ipx ][ jfx ] * - tensor_data.values_1d[ ipy ][ jfy ] * - tensor_data.derivs_1d[ ipz ][ jfz ] ; - } - } - } -}; - -//---------------------------------------------------------------------------- - -} /* namespace HybridFEM */ - -#endif /* #ifndef ELEMENTHEX_HPP */ - - diff --git a/lib/kokkos/example/multi_fem/HexExplicitFunctions.hpp b/lib/kokkos/example/multi_fem/HexExplicitFunctions.hpp deleted file mode 100644 index 3c4ca58224..0000000000 --- a/lib/kokkos/example/multi_fem/HexExplicitFunctions.hpp +++ /dev/null @@ -1,443 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_HEXEXPLICITFUNCTIONS_HPP -#define KOKKOS_HEXEXPLICITFUNCTIONS_HPP - -#include - -namespace Explicit { - -struct Hex8Functions -{ - static const unsigned SpatialDim = 3 ; - static const unsigned ElemNodeCount = 8 ; - - // Indices for full 3x3 tensor: - - static const unsigned K_F_XX = 0 ; - static const unsigned K_F_YY = 1 ; - static const unsigned K_F_ZZ = 2 ; - static const unsigned K_F_XY = 3 ; - static const unsigned K_F_YZ = 4 ; - static const unsigned K_F_ZX = 5 ; - static const unsigned K_F_YX = 6 ; - static const unsigned K_F_ZY = 7 ; - static const unsigned K_F_XZ = 8 ; - static const unsigned K_F_SIZE = 9 ; - - // Indexes into a 3 by 3 symmetric tensor stored as a length 6 vector - - static const unsigned K_S_XX = 0 ; - static const unsigned K_S_YY = 1 ; - static const unsigned K_S_ZZ = 2 ; - static const unsigned K_S_XY = 3 ; - static const unsigned K_S_YZ = 4 ; - static const unsigned K_S_ZX = 5 ; - static const unsigned K_S_YX = 3 ; - static const unsigned K_S_ZY = 4 ; - static const unsigned K_S_XZ = 5 ; - static const unsigned K_S_SIZE = 6 ; - - // Indexes into a 3 by 3 skew symmetric tensor stored as a length 3 vector - - static const unsigned K_V_XY = 0 ; - static const unsigned K_V_YZ = 1 ; - static const unsigned K_V_ZX = 2 ; - static const unsigned K_V_SIZE = 3 ; - - //-------------------------------------------------------------------------- - - template< typename ScalarA , typename ScalarB > - KOKKOS_INLINE_FUNCTION static - double dot8( const ScalarA * const a , const ScalarB * const b ) - { return a[0] * b[0] + a[1] * b[1] + a[2] * b[2] + a[3] * b[3] + - a[4] * b[4] + a[5] * b[5] + a[6] * b[6] + a[7] * b[7] ; } - - //-------------------------------------------------------------------------- - - template< class ScalarPrecise , - class ScalarCompact > - KOKKOS_INLINE_FUNCTION static - void grad( const ScalarPrecise x[] , - const ScalarPrecise z[] , - ScalarCompact grad_y[] ) - { - const ScalarCompact R42=(x[3] - x[1]); - const ScalarCompact R52=(x[4] - x[1]); - const ScalarCompact R54=(x[4] - x[3]); - - const ScalarCompact R63=(x[5] - x[2]); - const ScalarCompact R83=(x[7] - x[2]); - const ScalarCompact R86=(x[7] - x[5]); - - const ScalarCompact R31=(x[2] - x[0]); - const ScalarCompact R61=(x[5] - x[0]); - const ScalarCompact R74=(x[6] - x[3]); - - const ScalarCompact R72=(x[6] - x[1]); - const ScalarCompact R75=(x[6] - x[4]); - const ScalarCompact R81=(x[7] - x[0]); - - const ScalarCompact t1=(R63 + R54); - const ScalarCompact t2=(R61 + R74); - const ScalarCompact t3=(R72 + R81); - - const ScalarCompact t4 =(R86 + R42); - const ScalarCompact t5 =(R83 + R52); - const ScalarCompact t6 =(R75 + R31); - - // Calculate Y gradient from X and Z data - - grad_y[0] = (z[1] * t1) - (z[2] * R42) - (z[3] * t5) + (z[4] * t4) + (z[5] * R52) - (z[7] * R54); - grad_y[1] = (z[2] * t2) + (z[3] * R31) - (z[0] * t1) - (z[5] * t6) + (z[6] * R63) - (z[4] * R61); - grad_y[2] = (z[3] * t3) + (z[0] * R42) - (z[1] * t2) - (z[6] * t4) + (z[7] * R74) - (z[5] * R72); - grad_y[3] = (z[0] * t5) - (z[1] * R31) - (z[2] * t3) + (z[7] * t6) + (z[4] * R81) - (z[6] * R83); - grad_y[4] = (z[5] * t3) + (z[6] * R86) - (z[7] * t2) - (z[0] * t4) - (z[3] * R81) + (z[1] * R61); - grad_y[5] = (z[6] * t5) - (z[4] * t3) - (z[7] * R75) + (z[1] * t6) - (z[0] * R52) + (z[2] * R72); - grad_y[6] = (z[7] * t1) - (z[5] * t5) - (z[4] * R86) + (z[2] * t4) - (z[1] * R63) + (z[3] * R83); - grad_y[7] = (z[4] * t2) - (z[6] * t1) + (z[5] * R75) - (z[3] * t6) - (z[2] * R74) + (z[0] * R54); - } - - template< class ScalarPrecise , - class ScalarCompact > - static KOKKOS_INLINE_FUNCTION - void grad( const ScalarPrecise x[] , - const ScalarPrecise y[] , - const ScalarPrecise z[] , - ScalarCompact grad_x[] , - ScalarCompact grad_y[] , - ScalarCompact grad_z[] ) - { - grad( x , z , grad_y ); - grad( z , y , grad_x ); - grad( y , x , grad_z ); - } - - //-------------------------------------------------------------------------- - - template< class ScalarPrecise , - class ScalarCompact > - KOKKOS_INLINE_FUNCTION static - void polar_decomp( const float dt , - const ScalarCompact v_gr[] , - ScalarPrecise stretch[] /* INOUT */ , - ScalarCompact str_ten[] /* OUT */ , - ScalarCompact rot[] /* OUT */ ) - { - const float dt_half = 0.5 * dt; - - ScalarCompact vort[ K_V_SIZE ]; // Vorticity - - // Symmetric part - str_ten[K_S_XX] = v_gr[K_F_XX]; - str_ten[K_S_YY] = v_gr[K_F_YY]; - str_ten[K_S_ZZ] = v_gr[K_F_ZZ]; - str_ten[K_S_XY] = 0.5 * ( v_gr[K_F_XY] + v_gr[K_F_YX] ); - str_ten[K_S_YZ] = 0.5 * ( v_gr[K_F_YZ] + v_gr[K_F_ZY] ); - str_ten[K_S_ZX] = 0.5 * ( v_gr[K_F_ZX] + v_gr[K_F_XZ] ); - - // Skew Symmetric part - vort[K_V_XY] = 0.5 * ( v_gr[K_F_XY] - v_gr[K_F_YX] ); - vort[K_V_YZ] = 0.5 * ( v_gr[K_F_YZ] - v_gr[K_F_ZY] ); - vort[K_V_ZX] = 0.5 * ( v_gr[K_F_ZX] - v_gr[K_F_XZ] ); - - // calculate the rates of rotation via gauss elimination. - - ScalarCompact z1 = str_ten[K_S_XY] * stretch[K_S_ZX] - - str_ten[K_S_ZX] * stretch[K_S_XY] + - str_ten[K_S_YY] * stretch[K_S_YZ] - - str_ten[K_S_YZ] * stretch[K_S_YY] + - str_ten[K_S_YZ] * stretch[K_S_ZZ] - - str_ten[K_S_ZZ] * stretch[K_S_YZ]; - - ScalarCompact z2 = str_ten[K_S_ZX] * stretch[K_S_XX] - - str_ten[K_S_XX] * stretch[K_S_ZX] + - str_ten[K_S_YZ] * stretch[K_S_XY] - - str_ten[K_S_XY] * stretch[K_S_YZ] + - str_ten[K_S_ZZ] * stretch[K_S_ZX] - - str_ten[K_S_ZX] * stretch[K_S_ZZ]; - - ScalarCompact z3 = str_ten[K_S_XX] * stretch[K_S_XY] - - str_ten[K_S_XY] * stretch[K_S_XX] + - str_ten[K_S_XY] * stretch[K_S_YY] - - str_ten[K_S_YY] * stretch[K_S_XY] + - str_ten[K_S_ZX] * stretch[K_S_YZ] - - str_ten[K_S_YZ] * stretch[K_S_ZX]; - - { - // forward elimination - - const ScalarCompact a1inv = 1.0 / (stretch[K_S_YY] + stretch[K_S_ZZ]); - const ScalarCompact a4BYa1 = -1 * stretch[K_S_XY] * a1inv; - const ScalarCompact a2inv = 1.0 / (stretch[K_S_ZZ] + stretch[K_S_XX] + stretch[K_S_XY] * a4BYa1); - - const ScalarCompact a5 = -stretch[K_S_YZ] + stretch[K_S_ZX] * a4BYa1; - - z2 -= z1 * a4BYa1; - const ScalarCompact a6BYa1 = -1 * stretch[K_S_ZX] * a1inv; - const ScalarCompact a5BYa2 = a5 * a2inv; - z3 -= z1 * a6BYa1 - z2 * a5BYa2; - - // backward substitution - - - z3 /= (stretch[K_S_XX] + stretch[K_S_YY] + stretch[K_S_ZX] * a6BYa1 + a5 * a5BYa2); - z2 = (z2 - a5 * z3) * a2inv; - z1 = (z1*a1inv - a6BYa1 * z3 -a4BYa1 * z2); - } - - // calculate rotation rates - recall that spin_rate is an asymmetric tensor, - // so compute spin rate vector as dual of spin rate tensor, - // i.e w_i = e_ijk * spin_rate_jk - - z1 += vort[K_V_YZ]; - z2 += vort[K_V_ZX]; - z3 += vort[K_V_XY]; - - { - // update rotation tensor: - // 1) premultiply old rotation tensor to get right-hand side. - - ScalarCompact r_XX = rot[K_F_XX] + dt_half*( z3 * rot[K_F_YX] - z2 * rot[K_F_ZX] ); - ScalarCompact r_YX = rot[K_F_YX] + dt_half*( z1 * rot[K_F_ZX] - z3 * rot[K_F_XX] ); - ScalarCompact r_ZX = rot[K_F_ZX] + dt_half*( z2 * rot[K_F_XX] - z1 * rot[K_F_YX] ); - ScalarCompact r_XY = rot[K_F_XY] + dt_half*( z3 * rot[K_F_YY] - z2 * rot[K_F_ZY] ); - ScalarCompact r_YY = rot[K_F_YY] + dt_half*( z1 * rot[K_F_ZY] - z3 * rot[K_F_XY] ); - ScalarCompact r_ZY = rot[K_F_ZY] + dt_half*( z2 * rot[K_F_XY] - z1 * rot[K_F_YY] ); - ScalarCompact r_XZ = rot[K_F_XZ] + dt_half*( z3 * rot[K_F_YZ] - z2 * rot[K_F_ZZ] ); - ScalarCompact r_YZ = rot[K_F_YZ] + dt_half*( z1 * rot[K_F_ZZ] - z3 * rot[K_F_XZ] ); - ScalarCompact r_ZZ = rot[K_F_ZZ] + dt_half*( z2 * rot[K_F_XZ] - z1 * rot[K_F_YZ] ); - - - // 2) solve for new rotation tensor via gauss elimination. - // forward elimination - - - const ScalarCompact a12 = - dt_half * z3; - const ScalarCompact a13 = dt_half * z2; - ScalarCompact b32 = - dt_half * z1; - const ScalarCompact a22inv = 1.0 / (1.0 + a12 * a12); - - const ScalarCompact a13a12 = a13*a12; - const ScalarCompact a23 = b32 + a13a12; - - r_YX += r_XX * a12; - r_YY += r_XY * a12; - r_YZ += r_XZ * a12; - - b32 = (b32 - a13a12) * a22inv; - - r_ZX += r_XX * a13 + r_YX * b32; - r_ZY += r_XY * a13 + r_YY * b32; - r_ZZ += r_XZ * a13 + r_YZ * b32; - - // backward substitution - - - const ScalarCompact a33inv = 1.0 / (1.0 + a13 * a13 + a23 * b32); - - rot[K_F_ZX] = r_ZX * a33inv; - rot[K_F_ZY] = r_ZY * a33inv; - rot[K_F_ZZ] = r_ZZ * a33inv; - rot[K_F_YX] = ( r_YX - rot[K_F_ZX] * a23 ) * a22inv; - rot[K_F_YY] = ( r_YY - rot[K_F_ZY] * a23 ) * a22inv; - rot[K_F_YZ] = ( r_YZ - rot[K_F_ZZ] * a23 ) * a22inv; - rot[K_F_XX] = r_XX - rot[K_F_ZX] * a13 - rot[K_F_YX] * a12; - rot[K_F_XY] = r_XY - rot[K_F_ZY] * a13 - rot[K_F_YY] * a12; - rot[K_F_XZ] = r_XZ - rot[K_F_ZZ] * a13 - rot[K_F_YZ] * a12; - } - - // update stretch tensor in the new configuration - - - const ScalarCompact a1 = str_ten[K_S_XY] + vort[K_V_XY]; - const ScalarCompact a2 = str_ten[K_S_YZ] + vort[K_V_YZ]; - const ScalarCompact a3 = str_ten[K_S_ZX] + vort[K_V_ZX]; - const ScalarCompact b1 = str_ten[K_S_ZX] - vort[K_V_ZX]; - const ScalarCompact b2 = str_ten[K_S_XY] - vort[K_V_XY]; - const ScalarCompact b3 = str_ten[K_S_YZ] - vort[K_V_YZ]; - - const ScalarCompact s_XX = stretch[K_S_XX]; - const ScalarCompact s_YY = stretch[K_S_YY]; - const ScalarCompact s_ZZ = stretch[K_S_ZZ]; - const ScalarCompact s_XY = stretch[K_S_XY]; - const ScalarCompact s_YZ = stretch[K_S_YZ]; - const ScalarCompact s_ZX = stretch[K_S_ZX]; - - stretch[K_S_XX] += dt * (str_ten[K_S_XX] * s_XX + ( a1 + z3 ) * s_XY + ( b1 - z2 ) * s_ZX); - stretch[K_S_YY] += dt * (str_ten[K_S_YY] * s_YY + ( a2 + z1 ) * s_YZ + ( b2 - z3 ) * s_XY); - stretch[K_S_ZZ] += dt * (str_ten[K_S_ZZ] * s_ZZ + ( a3 + z2 ) * s_ZX + ( b3 - z1 ) * s_YZ); - stretch[K_S_XY] += dt * (str_ten[K_S_XX] * s_XY + ( a1 ) * s_YY + ( b1 ) * s_YZ - z3 * s_XX + z1 * s_ZX); - stretch[K_S_YZ] += dt * (str_ten[K_S_YY] * s_YZ + ( a2 ) * s_ZZ + ( b2 ) * s_ZX - z1 * s_YY + z2 * s_XY); - stretch[K_S_ZX] += dt * (str_ten[K_S_ZZ] * s_ZX + ( a3 ) * s_XX + ( b3 ) * s_XY - z2 * s_ZZ + z3 * s_YZ); - } - - //-------------------------------------------------------------------------- - - template< typename ScalarCompact > - static KOKKOS_INLINE_FUNCTION - void rotate_tensor( const ScalarCompact str_ten[] , - const ScalarCompact rot[] , - ScalarCompact rot_str[] ) - { - ScalarCompact t[9]; - - t[0] = str_ten[K_S_XX]*rot[K_F_XX] + str_ten[K_S_XY]*rot[K_F_YX] + str_ten[K_S_XZ]*rot[K_F_ZX]; - t[1] = str_ten[K_S_YX]*rot[K_F_XX] + str_ten[K_S_YY]*rot[K_F_YX] + str_ten[K_S_YZ]*rot[K_F_ZX]; - t[2] = str_ten[K_S_ZX]*rot[K_F_XX] + str_ten[K_S_ZY]*rot[K_F_YX] + str_ten[K_S_ZZ]*rot[K_F_ZX]; - - t[3] = str_ten[K_S_XX]*rot[K_F_XY] + str_ten[K_S_XY]*rot[K_F_YY] + str_ten[K_S_XZ]*rot[K_F_ZY]; - t[4] = str_ten[K_S_YX]*rot[K_F_XY] + str_ten[K_S_YY]*rot[K_F_YY] + str_ten[K_S_YZ]*rot[K_F_ZY]; - t[5] = str_ten[K_S_ZX]*rot[K_F_XY] + str_ten[K_S_ZY]*rot[K_F_YY] + str_ten[K_S_ZZ]*rot[K_F_ZY]; - - t[6] = str_ten[K_S_XX]*rot[K_F_XZ] + str_ten[K_S_XY]*rot[K_F_YZ] + str_ten[K_S_XZ]*rot[K_F_ZZ]; - t[7] = str_ten[K_S_YX]*rot[K_F_XZ] + str_ten[K_S_YY]*rot[K_F_YZ] + str_ten[K_S_YZ]*rot[K_F_ZZ]; - t[8] = str_ten[K_S_ZX]*rot[K_F_XZ] + str_ten[K_S_ZY]*rot[K_F_YZ] + str_ten[K_S_ZZ]*rot[K_F_ZZ]; - - - rot_str[ K_S_XX ] = rot[K_F_XX] * t[0] + rot[K_F_YX] * t[1] + rot[K_F_ZX] * t[2]; - rot_str[ K_S_YY ] = rot[K_F_XY] * t[3] + rot[K_F_YY] * t[4] + rot[K_F_ZY] * t[5]; - rot_str[ K_S_ZZ ] = rot[K_F_XZ] * t[6] + rot[K_F_YZ] * t[7] + rot[K_F_ZZ] * t[8]; - - rot_str[ K_S_XY ] = rot[K_F_XX] * t[3] + rot[K_F_YX] * t[4] + rot[K_F_ZX] * t[5]; - rot_str[ K_S_YZ ] = rot[K_F_XY] * t[6] + rot[K_F_YY] * t[7] + rot[K_F_ZY] * t[8]; - rot_str[ K_S_ZX ] = rot[K_F_XZ] * t[0] + rot[K_F_YZ] * t[1] + rot[K_F_ZZ] * t[2]; - } - - //-------------------------------------------------------------------------- - - template< class ScalarPrecise , - class ScalarCompact > - static KOKKOS_INLINE_FUNCTION - void rotate_tensor_backward( const ScalarPrecise stress[] , - const ScalarCompact rot[] , - ScalarCompact rot_stress[] ) - { - ScalarCompact t[9] ; - - t[0] = stress[K_S_XX]*rot[K_F_XX]+ stress[K_S_XY]*rot[K_F_XY]+ stress[K_S_XZ]*rot[K_F_XZ]; - t[1] = stress[K_S_YX]*rot[K_F_XX]+ stress[K_S_YY]*rot[K_F_XY]+ stress[K_S_YZ]*rot[K_F_XZ]; - t[2] = stress[K_S_ZX]*rot[K_F_XX]+ stress[K_S_ZY]*rot[K_F_XY]+ stress[K_S_ZZ]*rot[K_F_XZ]; - t[3] = stress[K_S_XX]*rot[K_F_YX]+ stress[K_S_XY]*rot[K_F_YY]+ stress[K_S_XZ]*rot[K_F_YZ]; - t[4] = stress[K_S_YX]*rot[K_F_YX]+ stress[K_S_YY]*rot[K_F_YY]+ stress[K_S_YZ]*rot[K_F_YZ]; - t[5] = stress[K_S_ZX]*rot[K_F_YX]+ stress[K_S_ZY]*rot[K_F_YY]+ stress[K_S_ZZ]*rot[K_F_YZ]; - t[6] = stress[K_S_XX]*rot[K_F_ZX]+ stress[K_S_XY]*rot[K_F_ZY]+ stress[K_S_XZ]*rot[K_F_ZZ]; - t[7] = stress[K_S_YX]*rot[K_F_ZX]+ stress[K_S_YY]*rot[K_F_ZY]+ stress[K_S_YZ]*rot[K_F_ZZ]; - t[8] = stress[K_S_ZX]*rot[K_F_ZX]+ stress[K_S_ZY]*rot[K_F_ZY]+ stress[K_S_ZZ]*rot[K_F_ZZ]; - - rot_stress[ K_S_XX ] = rot[K_F_XX]*t[0] + rot[K_F_XY]*t[1] + rot[K_F_XZ]*t[2]; - rot_stress[ K_S_YY ] = rot[K_F_YX]*t[3] + rot[K_F_YY]*t[4] + rot[K_F_YZ]*t[5]; - rot_stress[ K_S_ZZ ] = rot[K_F_ZX]*t[6] + rot[K_F_ZY]*t[7] + rot[K_F_ZZ]*t[8]; - - rot_stress[ K_S_XY ] = rot[K_F_XX]*t[3] + rot[K_F_XY]*t[4] + rot[K_F_XZ]*t[5]; - rot_stress[ K_S_YZ ] = rot[K_F_YX]*t[6] + rot[K_F_YY]*t[7] + rot[K_F_YZ]*t[8]; - rot_stress[ K_S_ZX ] = rot[K_F_ZX]*t[0] + rot[K_F_ZY]*t[1] + rot[K_F_ZZ]*t[2]; - } - - //-------------------------------------------------------------------------- - - template< class ScalarPrecise , - class ScalarCompact > - KOKKOS_INLINE_FUNCTION static - void update_stress( const float dt , - const float two_mu , - const float bulk_modulus , - const ScalarCompact rot_str[] , - ScalarPrecise stress[] ) - { - const ScalarCompact e = rot_str[ K_S_XX ] + rot_str[ K_S_YY ] + rot_str[ K_S_ZZ ] ; - const ScalarCompact eb = e * bulk_modulus ; - const ScalarCompact e3 = e / 3.0 ; - - stress[K_S_XX] += dt * ( two_mu * ( rot_str[K_S_XX] - e3 ) + eb ); - stress[K_S_YY] += dt * ( two_mu * ( rot_str[K_S_YY] - e3 ) + eb ); - stress[K_S_ZZ] += dt * ( two_mu * ( rot_str[K_S_ZZ] - e3 ) + eb ); - - stress[K_S_XY] += dt * two_mu * rot_str[K_S_XY]; - stress[K_S_YZ] += dt * two_mu * rot_str[K_S_YZ]; - stress[K_S_ZX] += dt * two_mu * rot_str[K_S_ZX]; - } - - //-------------------------------------------------------------------------- - - template< class ScalarPrecise , - class ScalarCompact > - static KOKKOS_INLINE_FUNCTION - void comp_force( const ScalarPrecise vx[] , - const ScalarPrecise vy[] , - const ScalarPrecise vz[] , - const ScalarCompact grad_x[] , - const ScalarCompact grad_y[] , - const ScalarCompact grad_z[] , - const ScalarCompact total_stress12th[] , - ScalarCompact force[][ SpatialDim ] , - ScalarCompact & energy ) - { - ScalarPrecise internal_energy = 0 ; - - for ( unsigned inode = 0; inode < ElemNodeCount ; ++inode ) { - - force[inode][0] = total_stress12th[K_S_XX] * grad_x[inode] + - total_stress12th[K_S_XY] * grad_y[inode] + - total_stress12th[K_S_XZ] * grad_z[inode] ; - - force[inode][1] = total_stress12th[K_S_YX] * grad_x[inode] + - total_stress12th[K_S_YY] * grad_y[inode] + - total_stress12th[K_S_YZ] * grad_z[inode] ; - - force[inode][2] = total_stress12th[K_S_ZX] * grad_x[inode] + - total_stress12th[K_S_ZY] * grad_y[inode] + - total_stress12th[K_S_ZZ] * grad_z[inode] ; - - internal_energy += force[inode][0] * vx[inode] + - force[inode][1] * vy[inode] + - force[inode][2] * vz[inode] ; - } - - energy = internal_energy ; - } - - //-------------------------------------------------------------------------- -}; - -} // namespace Explicit - -#endif /* #ifndef KOKKOS_HEXEXPLICITFUNCTIONS_HPP */ - diff --git a/lib/kokkos/example/multi_fem/Implicit.hpp b/lib/kokkos/example/multi_fem/Implicit.hpp deleted file mode 100644 index 0017cb8e88..0000000000 --- a/lib/kokkos/example/multi_fem/Implicit.hpp +++ /dev/null @@ -1,341 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef HYBRIDFEM_IMPLICIT_HPP -#define HYBRIDFEM_IMPLICIT_HPP - -#include -#include -#include - -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace HybridFEM { -namespace Implicit { - -struct PerformanceData { - double mesh_time ; - double graph_time ; - double elem_time ; - double matrix_gather_fill_time ; - double matrix_boundary_condition_time ; - double cg_iteration_time ; - - PerformanceData() - : mesh_time(0) - , graph_time(0) - , elem_time(0) - , matrix_gather_fill_time(0) - , matrix_boundary_condition_time(0) - , cg_iteration_time(0) - {} - - void best( const PerformanceData & rhs ) - { - mesh_time = std::min( mesh_time , rhs.mesh_time ); - graph_time = std::min( graph_time , rhs.graph_time ); - elem_time = std::min( elem_time , rhs.elem_time ); - matrix_gather_fill_time = std::min( matrix_gather_fill_time , rhs.matrix_gather_fill_time ); - matrix_boundary_condition_time = std::min( matrix_boundary_condition_time , rhs.matrix_boundary_condition_time ); - cg_iteration_time = std::min( cg_iteration_time , rhs.cg_iteration_time ); - } -}; - -//---------------------------------------------------------------------------- - -template< typename Scalar , class FixtureType > -PerformanceData run( const typename FixtureType::FEMeshType & mesh , - const int , // global_max_x , - const int , // global_max_y , - const int global_max_z , - const bool print_sample ) -{ - typedef Scalar scalar_type ; - typedef FixtureType fixture_type ; - typedef typename fixture_type::execution_space execution_space; - //typedef typename execution_space::size_type size_type ; // unused - - typedef typename fixture_type::FEMeshType mesh_type ; - typedef typename fixture_type::coordinate_scalar_type coordinate_scalar_type ; - - enum { ElementNodeCount = fixture_type::element_node_count }; - - const comm::Machine machine = mesh.parallel_data_map.machine ; - - const size_t element_count = mesh.elem_node_ids.dimension_0(); - - const size_t iteration_limit = 200 ; - const double residual_tolerance = 1e-14 ; - - size_t iteration_count = 0 ; - double residual_norm = 0 ; - - PerformanceData perf_data ; - - //------------------------------------ - // Sparse linear system types: - - typedef Kokkos::View< scalar_type* , execution_space > vector_type ; - typedef Kokkos::CrsMatrix< scalar_type , execution_space > matrix_type ; - typedef typename matrix_type::graph_type matrix_graph_type ; - typedef typename matrix_type::coefficients_type matrix_coefficients_type ; - - typedef GraphFactory< matrix_graph_type , mesh_type > graph_factory ; - - //------------------------------------ - // Problem setup types: - - typedef ElementComputation< scalar_type , scalar_type , execution_space > ElementFunctor ; - typedef DirichletBoundary< scalar_type , scalar_type , execution_space > BoundaryFunctor ; - - typedef typename ElementFunctor::elem_matrices_type elem_matrices_type ; - typedef typename ElementFunctor::elem_vectors_type elem_vectors_type ; - - typedef GatherFill< matrix_type , - mesh_type , - elem_matrices_type , - elem_vectors_type > GatherFillFunctor ; - - //------------------------------------ - - const scalar_type elem_coeff_K = 2 ; - const scalar_type elem_load_Q = 1 ; - - matrix_type linsys_matrix ; - vector_type linsys_rhs ; - vector_type linsys_solution ; - - typename graph_factory::element_map_type element_map ; - - Kokkos::Impl::Timer wall_clock ; - - //------------------------------------ - // Generate sparse matrix graph and element->graph map. - - graph_factory::create( mesh , linsys_matrix.graph , element_map ); - - execution_space::fence(); - perf_data.graph_time = comm::max( machine , wall_clock.seconds() ); - - //------------------------------------ - // Allocate linear system coefficients and rhs: - - const size_t local_owned_length = - linsys_matrix.graph.row_map.dimension_0() - 1 ; - - linsys_matrix.coefficients = - matrix_coefficients_type( "coeff" , linsys_matrix.graph.entries.dimension_0() ); - - linsys_rhs = vector_type( "rhs" , local_owned_length ); - linsys_solution = vector_type( "solution" , local_owned_length ); - - //------------------------------------ - // Fill linear system - { - elem_matrices_type elem_matrices ; - elem_vectors_type elem_vectors ; - - if ( element_count ) { - elem_matrices = elem_matrices_type( std::string("elem_matrices"), element_count ); - elem_vectors = elem_vectors_type ( std::string("elem_vectors"), element_count ); - } - - //------------------------------------ - // Compute element matrices and vectors: - - wall_clock.reset(); - - ElementFunctor::apply( mesh , - elem_matrices , elem_vectors , - elem_coeff_K , elem_load_Q ); - - execution_space::fence(); - perf_data.elem_time = comm::max( machine , wall_clock.seconds() ); - - //------------------------------------ - // Fill linear system coefficients: - - wall_clock.reset(); - - GatherFillFunctor::apply( linsys_matrix , linsys_rhs , - mesh , element_map , elem_matrices , elem_vectors ); - - execution_space::fence(); - perf_data.matrix_gather_fill_time = comm::max( machine , wall_clock.seconds() ); - - // Apply boundary conditions: - - wall_clock.reset(); - - BoundaryFunctor::apply( linsys_matrix , linsys_rhs , mesh , - 0 , global_max_z , 0 , global_max_z ); - - execution_space::fence(); - perf_data.matrix_boundary_condition_time = comm::max( machine , wall_clock.seconds() ); - } - - //------------------------------------ - // Solve linear sytem - - cgsolve( mesh.parallel_data_map , - linsys_matrix , linsys_rhs , linsys_solution , - iteration_count , residual_norm , - perf_data.cg_iteration_time , - iteration_limit , residual_tolerance ); - - //------------------------------------ - - if ( print_sample ) { - - typename mesh_type::node_coords_type::HostMirror coords_h = - Kokkos::create_mirror( mesh.node_coords ); - - typename vector_type::HostMirror X_h = - Kokkos::create_mirror( linsys_solution ); - - Kokkos::deep_copy( coords_h , mesh.node_coords ); - Kokkos::deep_copy( X_h , linsys_solution ); - - for ( size_t i = 0 ; i < mesh.parallel_data_map.count_owned ; ++i ) { - const coordinate_scalar_type x = coords_h(i,0); - const coordinate_scalar_type y = coords_h(i,1); - const coordinate_scalar_type z = coords_h(i,2); - - if ( x <= 0 && y <= 0 ) { - std::cout << " node( " << x << " " << y << " " << z << " ) = " - << X_h(i) << std::endl ; - } - } - } - - return perf_data ; -} - -//---------------------------------------------------------------------------- - -template< typename Scalar , class Device > -void driver( const char * const label , - comm::Machine machine , - const int gang_count , - const int elem_count_beg , - const int elem_count_end , - const int runs ) -{ - typedef Scalar scalar_type ; - typedef Device execution_space ; - typedef double coordinate_scalar_type ; - typedef FixtureElementHex8 fixture_element_type ; - - typedef BoxMeshFixture< coordinate_scalar_type , - execution_space , - fixture_element_type > fixture_type ; - - typedef typename fixture_type::FEMeshType mesh_type ; - - const size_t proc_count = comm::size( machine ); - const size_t proc_rank = comm::rank( machine ); - - if ( elem_count_beg == 0 || elem_count_end == 0 || runs == 0 ) return ; - - if ( comm::rank( machine ) == 0 ) { - std::cout << std::endl ; - std::cout << "\"Kokkos::HybridFE::Implicit " << label << "\"" << std::endl; - std::cout << "\"Size\" , \"Graphing\" , \"Element\" , \"Fill\" , \"Boundary\" , \"CG-Iter\"" << std::endl - << "\"elems\" , \"millisec\" , \"millisec\" , \"millisec\" , \"millisec\" , \"millisec\"" << std::endl ; - } - - for(int i = elem_count_beg ; i < elem_count_end ; i *= 2 ) - { - const int ix = std::max( 1 , (int) cbrt( ((double) i) / 2.0 ) ); - const int iy = ix + 1 ; - const int iz = 2 * iy ; - const int n = ix * iy * iz ; - - mesh_type mesh = - fixture_type::create( proc_count , proc_rank , gang_count , - ix , iy , iz ); - - mesh.parallel_data_map.machine = machine ; - - PerformanceData perf_data , perf_best ; - - for(int j = 0; j < runs; j++){ - - perf_data = run(mesh,ix,iy,iz, false ); - - if( j == 0 ) { - perf_best = perf_data ; - } - else { - perf_best.best( perf_data ); - } - } - - if ( comm::rank( machine ) == 0 ) { - - std::cout << std::setw(8) << n << " , " - << std::setw(10) << perf_best.graph_time * 1000 << " , " - << std::setw(10) << perf_best.elem_time * 1000 << " , " - << std::setw(10) << perf_best.matrix_gather_fill_time * 1000 << " , " - << std::setw(10) << perf_best.matrix_boundary_condition_time * 1000 << " , " - << std::setw(10) << perf_best.cg_iteration_time * 1000 - << std::endl ; - } - } -} - -//---------------------------------------------------------------------------- - -} /* namespace Implicit */ -} /* namespace HybridFEM */ - - -#endif /* #ifndef HYBRIDFEM_IMPLICIT_HPP */ - diff --git a/lib/kokkos/example/multi_fem/ImplicitFunctors.hpp b/lib/kokkos/example/multi_fem/ImplicitFunctors.hpp deleted file mode 100644 index 9d9aa77163..0000000000 --- a/lib/kokkos/example/multi_fem/ImplicitFunctors.hpp +++ /dev/null @@ -1,585 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include - -namespace HybridFEM { -namespace Implicit { - -//---------------------------------------------------------------------------- - -template< typename Scalar , unsigned Dim , unsigned N > -struct TensorIntegration ; - -template -struct TensorIntegration { - Scalar pts[1] ; - Scalar wts[1] ; - - TensorIntegration() { pts[0] = 0 ; wts[0] = 2 ; } -}; - -template -struct TensorIntegration -{ - Scalar pts[2] ; - Scalar wts[2] ; - - TensorIntegration() - { - const Scalar x2 = 0.577350269 ; - pts[0] = -x2; wts[0] = 1.0; - pts[1] = x2; wts[1] = 1.0; - } -}; - -template -struct TensorIntegration -{ - Scalar pts[3] ; - Scalar wts[3] ; - - TensorIntegration() - { - const Scalar x3 = 0.774596669 ; - const Scalar w1 = 0.555555556 ; - const Scalar w2 = 0.888888889 ; - pts[0] = -x3 ; wts[0] = w1 ; - pts[1] = 0 ; wts[1] = w2 ; - pts[2] = x3 ; wts[2] = w1 ; - } -}; - -template< typename Scalar , unsigned Order > -struct TensorIntegration -{ - static const unsigned N = Order * Order * Order ; - - Scalar pts[N][3] ; - Scalar wts[N]; - - TensorIntegration() - { - TensorIntegration oneD ; - - unsigned n = 0 ; - for ( unsigned k = 0 ; k < Order ; ++k ) { - for ( unsigned j = 0 ; j < Order ; ++j ) { - for ( unsigned i = 0 ; i < Order ; ++i , ++n ) { - pts[n][0] = oneD.pts[i] ; - pts[n][1] = oneD.pts[j] ; - pts[n][2] = oneD.pts[k] ; - wts[n] = oneD.wts[i] * oneD.wts[j] * oneD.wts[k] ; - }}} - } -}; - -//---------------------------------------------------------------------------- - -template< typename Scalar > -struct ShapeFunctionEvaluation { - - static const unsigned FunctionCount = 8 ; - static const unsigned SpatialDimension = 3 ; - static const unsigned IntegrationOrder = 2 ; - - typedef TensorIntegration< Scalar , SpatialDimension , IntegrationOrder > - TensorIntegrationType ; - - static const unsigned PointCount = TensorIntegrationType::N ; - - Scalar value [ PointCount ][ FunctionCount ] ; - Scalar gradient[ PointCount ][ FunctionCount * SpatialDimension ]; - Scalar weight [ PointCount ]; - - ShapeFunctionEvaluation() - { - const TensorIntegration< Scalar , SpatialDimension , IntegrationOrder > - integration ; - - const Scalar ONE8TH = 0.125 ; - - for ( unsigned i = 0 ; i < PointCount ; ++i ) { - - const Scalar u = 1.0 - integration.pts[i][0]; - const Scalar v = 1.0 - integration.pts[i][1]; - const Scalar w = 1.0 - integration.pts[i][2]; - - const Scalar up1 = 1.0 + integration.pts[i][0]; - const Scalar vp1 = 1.0 + integration.pts[i][1]; - const Scalar wp1 = 1.0 + integration.pts[i][2]; - - weight[i] = integration.wts[i] ; - - // Vaues: - value[i][0] = ONE8TH * u * v * w ; - value[i][1] = ONE8TH * up1 * v * w ; - value[i][2] = ONE8TH * up1 * vp1 * w ; - value[i][3] = ONE8TH * u * vp1 * w ; - - value[i][4] = ONE8TH * u * v * wp1 ; - value[i][5] = ONE8TH * up1 * v * wp1 ; - value[i][6] = ONE8TH * up1 * vp1 * wp1 ; - value[i][7] = ONE8TH * u * vp1 * wp1 ; - - //fn 0 = u * v * w - gradient[i][ 0] = ONE8TH * -1 * v * w ; - gradient[i][ 1] = ONE8TH * u * -1 * w ; - gradient[i][ 2] = ONE8TH * u * v * -1 ; - - //fn 1 = up1 * v * w - gradient[i][ 3] = ONE8TH * 1 * v * w ; - gradient[i][ 4] = ONE8TH * up1 * -1 * w ; - gradient[i][ 5] = ONE8TH * up1 * v * -1 ; - - //fn 2 = up1 * vp1 * w - gradient[i][ 6] = ONE8TH * 1 * vp1 * w ; - gradient[i][ 7] = ONE8TH * up1 * 1 * w ; - gradient[i][ 8] = ONE8TH * up1 * vp1 * -1 ; - - //fn 3 = u * vp1 * w - gradient[i][ 9] = ONE8TH * -1 * vp1 * w ; - gradient[i][10] = ONE8TH * u * 1 * w ; - gradient[i][11] = ONE8TH * u * vp1 * -1 ; - - //fn 4 = u * v * wp1 - gradient[i][12] = ONE8TH * -1 * v * wp1 ; - gradient[i][13] = ONE8TH * u * -1 * wp1 ; - gradient[i][14] = ONE8TH * u * v * 1 ; - - //fn 5 = up1 * v * wp1 - gradient[i][15] = ONE8TH * 1 * v * wp1 ; - gradient[i][16] = ONE8TH * up1 * -1 * wp1 ; - gradient[i][17] = ONE8TH * up1 * v * 1 ; - - //fn 6 = up1 * vp1 * wp1 - gradient[i][18] = ONE8TH * 1 * vp1 * wp1 ; - gradient[i][19] = ONE8TH * up1 * 1 * wp1 ; - gradient[i][20] = ONE8TH * up1 * vp1 * 1 ; - - //fn 7 = u * vp1 * wp1 - gradient[i][21] = ONE8TH * -1 * vp1 * wp1 ; - gradient[i][22] = ONE8TH * u * 1 * wp1 ; - gradient[i][23] = ONE8TH * u * vp1 * 1 ; - } - } -}; - -//---------------------------------------------------------------------------- - -template< typename ScalarType , typename ScalarCoordType , class DeviceType > -struct ElementComputation -{ - typedef DeviceType execution_space; - typedef ScalarType scalar_type ; - typedef typename execution_space::size_type size_type ; - - static const size_type ElementNodeCount = 8 ; - - typedef FEMesh< ScalarCoordType , ElementNodeCount , execution_space > mesh_type ; - typedef Kokkos::View< scalar_type[][ElementNodeCount][ElementNodeCount] , execution_space > elem_matrices_type ; - typedef Kokkos::View< scalar_type[][ElementNodeCount] , execution_space > elem_vectors_type ; - - typedef ShapeFunctionEvaluation< scalar_type > shape_function_data ; - - static const unsigned SpatialDim = shape_function_data::SpatialDimension ; - static const unsigned FunctionCount = shape_function_data::FunctionCount ; - -private: - - const shape_function_data shape_eval ; - typename mesh_type::elem_node_ids_type elem_node_ids ; - typename mesh_type::node_coords_type node_coords ; - elem_matrices_type element_matrices ; - elem_vectors_type element_vectors ; - scalar_type coeff_K ; - scalar_type coeff_Q ; - - ElementComputation( const mesh_type & arg_mesh , - const elem_matrices_type & arg_element_matrices , - const elem_vectors_type & arg_element_vectors , - const scalar_type arg_coeff_K , - const scalar_type arg_coeff_Q ) - : shape_eval() - , elem_node_ids( arg_mesh.elem_node_ids ) - , node_coords( arg_mesh.node_coords ) - , element_matrices( arg_element_matrices ) - , element_vectors( arg_element_vectors ) - , coeff_K( arg_coeff_K ) - , coeff_Q( arg_coeff_Q ) - {} - -public: - - static void apply( const mesh_type & mesh , - const elem_matrices_type & elem_matrices , - const elem_vectors_type & elem_vectors , - const scalar_type elem_coeff_K , - const scalar_type elem_coeff_Q ) - { - ElementComputation comp( mesh , elem_matrices , elem_vectors , elem_coeff_K , elem_coeff_Q ); - const size_t elem_count = mesh.elem_node_ids.dimension_0(); - - parallel_for( elem_count , comp ); - } - - //------------------------------------ - - static const unsigned FLOPS_jacobian = - FunctionCount * SpatialDim * SpatialDim * 2 ; - - KOKKOS_INLINE_FUNCTION - void jacobian( const ScalarCoordType * x, - const ScalarCoordType * y, - const ScalarCoordType * z, - const scalar_type * grad_vals, - scalar_type * J) const - { - int i_grad = 0 ; - - for( unsigned i = 0; i < ElementNodeCount ; ++i , i_grad += SpatialDim ) { - const scalar_type g0 = grad_vals[ i_grad ]; - const scalar_type g1 = grad_vals[ i_grad + 1 ]; - const scalar_type g2 = grad_vals[ i_grad + 2 ]; - const scalar_type x0 = x[i] ; - const scalar_type x1 = y[i] ; - const scalar_type x2 = z[i] ; - - J[0] += g0 * x0 ; - J[1] += g0 * x1 ; - J[2] += g0 * x2 ; - - J[3] += g1 * x0 ; - J[4] += g1 * x1 ; - J[5] += g1 * x2 ; - - J[6] += g2 * x0 ; - J[7] += g2 * x1 ; - J[8] += g2 * x2 ; - } - } - - //------------------------------------ - - static const unsigned FLOPS_inverse_and_det = 46 ; - - KOKKOS_INLINE_FUNCTION - scalar_type inverse_and_determinant3x3( scalar_type * const J ) const - { - const scalar_type J00 = J[0]; - const scalar_type J01 = J[1]; - const scalar_type J02 = J[2]; - - const scalar_type J10 = J[3]; - const scalar_type J11 = J[4]; - const scalar_type J12 = J[5]; - - const scalar_type J20 = J[6]; - const scalar_type J21 = J[7]; - const scalar_type J22 = J[8]; - - const scalar_type term0 = J22*J11 - J21*J12; - const scalar_type term1 = J22*J01 - J21*J02; - const scalar_type term2 = J12*J01 - J11*J02; - - const scalar_type detJ = J00*term0 - J10*term1 + J20*term2; - const scalar_type inv_detJ = 1.0/detJ; - - J[0] = term0*inv_detJ; - J[1] = -term1*inv_detJ; - J[2] = term2*inv_detJ; - - J[3] = -(J22*J10 - J20*J12)*inv_detJ; - J[4] = (J22*J00 - J20*J02)*inv_detJ; - J[5] = -(J12*J00 - J10*J02)*inv_detJ; - - J[6] = (J21*J10 - J20*J11)*inv_detJ; - J[7] = -(J21*J00 - J20*J01)*inv_detJ; - J[8] = (J11*J00 - J10*J01)*inv_detJ; - - return detJ ; - } - - //------------------------------------ - - KOKKOS_INLINE_FUNCTION - void matTransMat3x3_X_3xn( const scalar_type * A, int n, - const scalar_type * B, - scalar_type * C ) const - { - //A is 3x3, B is 3xn. So C is also 3xn. - //A,B,C are all assumed to be ordered such that columns are contiguous. - - scalar_type * Cj = C; - const scalar_type * Bj = B; - - for(int j=0; j -struct DirichletBoundary -{ - typedef DeviceType execution_space; - typedef typename execution_space::size_type size_type ; - - static const size_type ElementNodeCount = 8 ; - - typedef Kokkos::CrsMatrix< ScalarType , execution_space > matrix_type ; - typedef Kokkos::View< ScalarType[] , execution_space > vector_type ; - - typedef FEMesh< ScalarCoordType , ElementNodeCount , execution_space > mesh_type ; - - typename mesh_type::node_coords_type node_coords ; - matrix_type matrix ; - vector_type rhs ; - ScalarCoordType bc_lower_z ; - ScalarCoordType bc_upper_z ; - ScalarType bc_lower_value ; - ScalarType bc_upper_value ; - - KOKKOS_INLINE_FUNCTION - void operator()( size_type inode ) const - { - // Apply a dirichlet boundary condition to 'irow' - // to maintain the symmetry of the original - // global stiffness matrix, zero out the columns - // that correspond to boundary conditions, and - // adjust the load vector accordingly - - const size_type iBeg = matrix.graph.row_map[inode]; - const size_type iEnd = matrix.graph.row_map[inode+1]; - - const ScalarCoordType z = node_coords(inode,2); - const bool bc_lower = z <= bc_lower_z ; - const bool bc_upper = bc_upper_z <= z ; - - if ( bc_lower || bc_upper ) { - const ScalarType bc_value = bc_lower ? bc_lower_value - : bc_upper_value ; - - rhs(inode) = bc_value ; // set the rhs vector - - // zero each value on the row, and leave a one - // on the diagonal - - for( size_type i = iBeg ; i < iEnd ; i++) { - matrix.coefficients(i) = - (int) inode == matrix.graph.entries(i) ? 1 : 0 ; - } - } - else { - // Find any columns that are boundary conditions. - // Clear them and adjust the load vector - - for( size_type i = iBeg ; i < iEnd ; i++ ) { - const size_type cnode = matrix.graph.entries(i) ; - - const ScalarCoordType zc = node_coords(cnode,2); - const bool c_bc_lower = zc <= bc_lower_z ; - const bool c_bc_upper = bc_upper_z <= zc ; - - if ( c_bc_lower || c_bc_upper ) { - - const ScalarType c_bc_value = c_bc_lower ? bc_lower_value - : bc_upper_value ; - - rhs( inode ) -= c_bc_value * matrix.coefficients(i); - - matrix.coefficients(i) = 0 ; - } - } - } - } - - - static void apply( const matrix_type & linsys_matrix , - const vector_type & linsys_rhs , - const mesh_type & mesh , - const ScalarCoordType bc_lower_z , - const ScalarCoordType bc_upper_z , - const ScalarType bc_lower_value , - const ScalarType bc_upper_value ) - { - const size_t row_count = linsys_matrix.graph.row_map.dimension_0() - 1 ; - DirichletBoundary op ; - op.node_coords = mesh.node_coords ; - op.matrix = linsys_matrix ; - op.rhs = linsys_rhs ; - op.bc_lower_z = bc_lower_z ; - op.bc_upper_z = bc_upper_z ; - op.bc_lower_value = bc_lower_value ; - op.bc_upper_value = bc_upper_value ; - parallel_for( row_count , op ); - } -}; - -//---------------------------------------------------------------------------- - -} /* namespace Implicit */ -} /* namespace HybridFEM */ - diff --git a/lib/kokkos/example/multi_fem/LinAlgBLAS.hpp b/lib/kokkos/example/multi_fem/LinAlgBLAS.hpp deleted file mode 100644 index 2478fa9aed..0000000000 --- a/lib/kokkos/example/multi_fem/LinAlgBLAS.hpp +++ /dev/null @@ -1,567 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef USESCASES_LINALG_BLAS_HPP -#define USESCASES_LINALG_BLAS_HPP - -#include -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< class Scalar , class Layout , class DeviceType > struct Dot ; - -template< class Scalar , class Layout , class DeviceType > struct Dot1 ; - -template< typename ScalarA , - typename ScalarY , - class Layout , class Device > -struct Scale ; - -template< typename ScalarA , - typename ScalarY , - class Layout , class Device > -struct Fill ; - -template< typename ScalarA , - typename ScalarX , - typename ScalarY , - class Layout , class Device > -struct AXPY ; - -template< typename ScalarX , - typename ScalarB , - typename ScalarY , - class Layout , class Device > -struct XPBY ; - -template< typename ScalarA , - typename ScalarX , - typename ScalarB , - typename ScalarY , - typename ScalarW , - class Layout , class Device > -struct WAXPBY ; - -} -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_HAVE_MPI ) - -template< typename ScalarX /* Allow mix of const and non-const */ , - typename ScalarY /* Allow mix of const and non-const */ , - class L , class D , - class MX /* Allow any management type */ , - class MY /* Allow any management type */ > -inline -double dot( const size_t n , - const View< ScalarX * , L , D , MX > & x , - const View< ScalarY * , L , D , MY > & y , - comm::Machine machine ) -{ - double global_result = 0 ; - double local_result = 0 ; - - Impl::Dot< ScalarX , L , D >( n , x , y , local_result ); - - MPI_Allreduce( & local_result , & global_result , 1 , - MPI_DOUBLE , MPI_SUM , machine.mpi_comm ); - - return global_result ; -} - -#else - -template< typename ScalarX /* Allow mix of const and non-const */ , - typename ScalarY /* Allow mix of const and non-const */ , - class L , class D , - class MX /* Allow any management type */ , - class MY /* Allow any management type */ > -inline -double dot( const size_t n , - const View< ScalarX * , L , D , MX > & x , - const View< ScalarY * , L , D , MY > & y , - comm::Machine ) -{ - double global_result = 0 ; - - Impl::Dot< ScalarX , L , D >( n , x , y , global_result ); - - return global_result ; -} - -#endif - -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_HAVE_MPI ) - -template< typename ScalarX /* Allow mix of const and non-const */ , - class L , class D , - class MX /* Allow any management type */ > -inline -double dot( const size_t n , - const View< ScalarX * , L , D , MX > & x , - comm::Machine machine ) -{ - double global_result = 0 ; - double local_result = 0 ; - - Impl::Dot1< ScalarX , L , D >( n , x , local_result ); - - MPI_Allreduce( & local_result , & global_result , 1 , - MPI_DOUBLE , MPI_SUM , machine.mpi_comm ); - - return global_result ; -} - -#else - -template< typename ScalarX /* Allow mix of const and non-const */ , - class L , class D , - class MX /* Allow any management type */ > -inline -double dot( const size_t n , - const View< ScalarX * , L , D , MX > & x , - comm::Machine ) -{ - double global_result = 0 ; - - Impl::Dot1< ScalarX , L , D >( n , x , global_result ); - - return global_result ; -} - -#endif - -//---------------------------------------------------------------------------- - -template< typename ScalarX /* Allow mix of const and non-const */ , - class L , class D , - class MX /* Allow any management type */ > -inline -double norm2( const size_t n , - const View< ScalarX * , L , D , MX > & x , - comm::Machine machine ) -{ - return std::sqrt( dot( n , x , machine ) ); -} - -//---------------------------------------------------------------------------- - -template< typename ScalarA , - typename ScalarX , - class L , - class D , - class MX > -void scale( const size_t n , - const ScalarA & alpha , - const View< ScalarX * , L , D , MX > & x ) -{ - Impl::Scale< ScalarA , ScalarX , L , D >( n , alpha , x ); -} - -template< typename ScalarA , - typename ScalarX , - class L , - class D , - class MX > -void fill( const size_t n , - const ScalarA & alpha , - const View< ScalarX * , L , D , MX > & x ) -{ - Impl::Fill< ScalarA , ScalarX , L , D >( n , alpha , x ); -} - -//---------------------------------------------------------------------------- - -template< typename ScalarA , - typename ScalarX , - typename ScalarY , - class L , - class D , - class MX , - class MY > -void axpy( const size_t n , - const ScalarA & alpha , - const View< ScalarX *, L , D , MX > & x , - const View< ScalarY *, L , D , MY > & y ) -{ - Impl::AXPY< ScalarA, ScalarX, ScalarY , L , D >( n, alpha, x, y ); -} - -//---------------------------------------------------------------------------- - -template< typename ScalarX , - typename ScalarB , - typename ScalarY , - class L , - class D , - class MX , - class MY > -void xpby( const size_t n , - const View< ScalarX *, L , D , MX > & x , - const ScalarB & beta , - const View< ScalarY *, L , D , MY > & y ) -{ - Impl::XPBY< ScalarX, ScalarB, ScalarY , L , D >( n, x, beta, y ); -} - -//---------------------------------------------------------------------------- -// w = alpha * x + beta * y - -template< typename ScalarA , - typename ScalarX , - typename ScalarB , - typename ScalarY , - typename ScalarW , - class L , class D , - class MX , class MY , class MW > -void waxpby( const size_t n , - const ScalarA & alpha , - const View< ScalarX * , L , D , MX > & x , - const ScalarB & beta , - const View< ScalarY * , L , D , MY > & y , - const View< ScalarW * , L , D , MW > & w ) -{ - Impl::WAXPBY - ( n , alpha , x , beta , y , w ); -} - -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< typename Scalar , class L , class D > -struct Dot -{ -private: - - typedef View< const Scalar*, L, D, MemoryUnmanaged > vector_const_type ; - - const vector_const_type x ; - const vector_const_type y ; - -public: - - typedef typename vector_const_type::execution_space execution_space ; // Manycore device - typedef double value_type ; // Reduction value - - template< class ArgX , class ArgY > - inline - Dot( const size_t n , const ArgX & arg_x , const ArgY & arg_y , double & result ) - : x( arg_x ), y( arg_y ) - { - parallel_reduce( n , *this , result ); - } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - void operator()( const iType & i , value_type & update ) const - { update += x(i) * y(i); } - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & source ) - { update += source; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } -}; // Dot - -//---------------------------------------------------------------------------- - -template< typename Scalar , class L , class D > -struct Dot1 -{ -private: - - typedef View< const Scalar*, L, D , MemoryUnmanaged > vector_const_type ; - - const vector_const_type x ; - -public: - - typedef typename vector_const_type::execution_space execution_space ; // Manycore device - typedef double value_type ; // Reduction value - - template< class ArgX > - inline - Dot1( const size_t n , const ArgX & arg_x , double & result ) - : x( arg_x ) - { - parallel_reduce( n , *this , result ); - } - - template< typename iType > - KOKKOS_INLINE_FUNCTION - void operator()( const iType & i , value_type & update ) const - { update += x(i) * x(i) ; } - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & source ) - { update += source ; } - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } -}; // Dot - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -template < typename ScalarA , - typename ScalarX , - typename ScalarB , - typename ScalarY , - typename ScalarW , - class L , class D > -struct WAXPBY -{ -private: - - typedef View< ScalarW *, L , D , MemoryUnmanaged > ViewW ; - typedef View< const ScalarX *, L , D , MemoryUnmanaged > ViewX ; - typedef View< const ScalarY *, L , D , MemoryUnmanaged > ViewY ; - - const ViewW w ; - const ViewX x ; - const ViewY y ; - const ScalarA alpha ; - const ScalarB beta ; - -public: - - typedef typename ViewW::execution_space execution_space ; - - template< typename iType > - KOKKOS_INLINE_FUNCTION - void operator()( const iType inode ) const - { - w(inode) = alpha * x(inode) + beta * y(inode); - } - - template< class ArgX , class ArgY , class ArgW > - inline - WAXPBY( const size_t n , - const ScalarA & arg_alpha , - const ArgX & arg_x , - const ScalarB & arg_beta , - const ArgY & arg_y , - const ArgW & arg_w ) - : w( arg_w ), x( arg_x ), y( arg_y ) - , alpha( arg_alpha ), beta( arg_beta ) - { - parallel_for( n , *this ); - } -}; // WAXPBY - -//---------------------------------------------------------------------------- - -template < typename ScalarB , - typename ScalarW , - class L , class D > -struct Scale -{ -private: - - typedef View< ScalarW *, L , D , MemoryUnmanaged > ViewW ; - const ViewW w ; - const ScalarB beta ; - -public: - - typedef typename ViewW::execution_space execution_space ; - - template< typename iType > - KOKKOS_INLINE_FUNCTION - void operator()( const iType & i ) const - { w(i) *= beta ; } - - template< class ArgW > - inline - Scale( const size_t n , const ScalarB & arg_beta , const ArgW & arg_w ) - : w( arg_w ) - , beta( arg_beta ) - { - parallel_for( n , *this ); - } -}; - -template < typename ScalarB , - typename ScalarW , - class L , class D > -struct Fill -{ -private: - - typedef View< ScalarW *, L , D , MemoryUnmanaged > ViewW ; - const ViewW w ; - const ScalarB beta ; - -public: - - typedef typename ViewW::execution_space execution_space ; - - template< typename iType > - KOKKOS_INLINE_FUNCTION - void operator()( const iType & i ) const - { w(i) = beta ; } - - template< class ArgW > - inline - Fill( const size_t n , const ScalarB & arg_beta , const ArgW & arg_w ) - : w( arg_w ) - , beta( arg_beta ) - { - parallel_for( n , *this ); - } -}; - -//---------------------------------------------------------------------------- - -template < typename ScalarA , - typename ScalarX , - typename ScalarW , - class L , class D > -struct AXPY -{ -private: - - typedef View< ScalarW *, L , D , MemoryUnmanaged > ViewW ; - typedef View< const ScalarX *, L , D , MemoryUnmanaged > ViewX ; - - const ViewW w ; - const ViewX x ; - const ScalarA alpha ; - -public: - - typedef typename ViewW::execution_space execution_space ; - - template< typename iType > - KOKKOS_INLINE_FUNCTION - void operator()( const iType & i ) const - { w(i) += alpha * x(i); } - - template< class ArgX , class ArgW > - inline - AXPY( const size_t n , - const ScalarA & arg_alpha , - const ArgX & arg_x , - const ArgW & arg_w ) - : w( arg_w ), x( arg_x ) - , alpha( arg_alpha ) - { - parallel_for( n , *this ); - } -}; // AXPY - -template< typename ScalarX , - typename ScalarB , - typename ScalarW , - class L , class D > -struct XPBY -{ -private: - - typedef View< ScalarW *, L , D , MemoryUnmanaged > ViewW ; - typedef View< const ScalarX *, L , D , MemoryUnmanaged > ViewX ; - - const ViewW w ; - const ViewX x ; - const ScalarB beta ; - -public: - - typedef typename ViewW::execution_space execution_space ; - - template< typename iType > - KOKKOS_INLINE_FUNCTION - void operator()( const iType & i ) const - { w(i) = x(i) + beta * w(i); } - - template< class ArgX , class ArgW > - inline - XPBY( const size_t n , - const ArgX & arg_x , - const ScalarB & arg_beta , - const ArgW & arg_w ) - : w( arg_w ), x( arg_x ) - , beta( arg_beta ) - { - parallel_for( n , *this ); - } -}; // XPBY - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef USESCASES_LINALG_BLAS_HPP */ - - diff --git a/lib/kokkos/example/multi_fem/Nonlinear.hpp b/lib/kokkos/example/multi_fem/Nonlinear.hpp deleted file mode 100644 index 96a05b97a9..0000000000 --- a/lib/kokkos/example/multi_fem/Nonlinear.hpp +++ /dev/null @@ -1,573 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef HYBRIDFEM_NONLINEAR_HPP -#define HYBRIDFEM_NONLINEAR_HPP - -#include -#include -#include - -#include -#include -#include -#include - -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace HybridFEM { -namespace Nonlinear { - -struct PerformanceData { - double mesh_time ; - double graph_time ; - double elem_time ; - double matrix_gather_fill_time ; - double matrix_boundary_condition_time ; - double cg_iteration_time ; - size_t cg_iteration_count ; - size_t newton_iteration_count ; - double error_max ; - - PerformanceData() - : mesh_time(0) - , graph_time(0) - , elem_time(0) - , matrix_gather_fill_time(0) - , matrix_boundary_condition_time(0) - , cg_iteration_time(0) - , cg_iteration_count(0) - , newton_iteration_count(0) - , error_max(0) - {} - - void best( const PerformanceData & rhs ) - { - mesh_time = std::min( mesh_time , rhs.mesh_time ); - graph_time = std::min( graph_time , rhs.graph_time ); - elem_time = std::min( elem_time , rhs.elem_time ); - matrix_gather_fill_time = std::min( matrix_gather_fill_time , rhs.matrix_gather_fill_time ); - matrix_boundary_condition_time = std::min( matrix_boundary_condition_time , rhs.matrix_boundary_condition_time ); - cg_iteration_time = std::min( cg_iteration_time , rhs.cg_iteration_time ); - cg_iteration_count = std::min( cg_iteration_count , rhs.cg_iteration_count ); - newton_iteration_count = std::min( newton_iteration_count , rhs.newton_iteration_count ); - error_max = std::min( error_max , rhs.error_max ); - } -}; - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -class ManufacturedSolution { -public: - - // Manufactured solution for one dimensional nonlinear PDE - // - // -K T_zz + T^2 = 0 ; T(zmin) = T_zmin ; T(zmax) = T_zmax - // - // Has an analytic solution of the form: - // - // T(z) = ( a ( z - zmin ) + b )^(-2) where K = 1 / ( 6 a^2 ) - // - // Given T_0 and T_L compute K for this analytic solution. - // - // Two analytic solutions: - // - // Solution with singularity: - // , a( ( 1.0 / sqrt(T_zmax) + 1.0 / sqrt(T_zmin) ) / ( zmax - zmin ) ) - // , b( -1.0 / sqrt(T_zmin) ) - // - // Solution without singularity: - // , a( ( 1.0 / sqrt(T_zmax) - 1.0 / sqrt(T_zmin) ) / ( zmax - zmin ) ) - // , b( 1.0 / sqrt(T_zmin) ) - - const double zmin ; - const double zmax ; - const double T_zmin ; - const double T_zmax ; - const double a ; - const double b ; - const double K ; - - ManufacturedSolution( const double arg_zmin , - const double arg_zmax , - const double arg_T_zmin , - const double arg_T_zmax ) - : zmin( arg_zmin ) - , zmax( arg_zmax ) - , T_zmin( arg_T_zmin ) - , T_zmax( arg_T_zmax ) - , a( ( 1.0 / sqrt(T_zmax) - 1.0 / sqrt(T_zmin) ) / ( zmax - zmin ) ) - , b( 1.0 / sqrt(T_zmin) ) - , K( 1.0 / ( 6.0 * a * a ) ) - {} - - double operator()( const double z ) const - { - const double tmp = a * ( z - zmin ) + b ; - return 1.0 / ( tmp * tmp ); - } -}; - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -template< typename Scalar , class FixtureType > -PerformanceData run( const typename FixtureType::FEMeshType & mesh , - const int , // global_max_x , - const int , // global_max_y , - const int global_max_z , - const bool print_error ) -{ - typedef Scalar scalar_type ; - typedef FixtureType fixture_type ; - typedef typename fixture_type::execution_space execution_space; - //typedef typename execution_space::size_type size_type ; // unused - - typedef typename fixture_type::FEMeshType mesh_type ; - typedef typename fixture_type::coordinate_scalar_type coordinate_scalar_type ; - - enum { ElementNodeCount = fixture_type::element_node_count }; - - const comm::Machine machine = mesh.parallel_data_map.machine ; - - const size_t element_count = mesh.elem_node_ids.dimension_0(); - - //------------------------------------ - // The amount of nonlinearity is proportional to the ratio - // between T(zmax) and T(zmin). For the manufactured solution - // 0 < T(zmin) and 0 < T(zmax) - - const ManufacturedSolution - exact_solution( /* zmin */ 0 , - /* zmax */ global_max_z , - /* T(zmin) */ 1 , - /* T(zmax) */ 20 ); - - //----------------------------------- - // Convergence Criteria and perf data: - - const size_t cg_iteration_limit = 200 ; - const double cg_tolerance = 1e-14 ; - - const size_t newton_iteration_limit = 150 ; - const double newton_tolerance = 1e-14 ; - - size_t cg_iteration_count_total = 0 ; - double cg_iteration_time = 0 ; - - size_t newton_iteration_count = 0 ; - double residual_norm_init = 0 ; - double residual_norm = 0 ; - - PerformanceData perf_data ; - - //------------------------------------ - // Sparse linear system types: - - typedef Kokkos::View< scalar_type* , execution_space > vector_type ; - typedef Kokkos::CrsMatrix< scalar_type , execution_space > matrix_type ; - typedef typename matrix_type::graph_type matrix_graph_type ; - typedef typename matrix_type::coefficients_type matrix_coefficients_type ; - - typedef GraphFactory< matrix_graph_type , mesh_type > graph_factory ; - - //------------------------------------ - // Problem setup types: - - typedef ElementComputation < mesh_type , scalar_type > ElementFunctor ; - typedef DirichletSolution < mesh_type , scalar_type > DirichletSolutionFunctor ; - typedef DirichletResidual < mesh_type , scalar_type > DirichletResidualFunctor ; - - typedef typename ElementFunctor::elem_matrices_type elem_matrices_type ; - typedef typename ElementFunctor::elem_vectors_type elem_vectors_type ; - - typedef GatherFill< matrix_type , - mesh_type , - elem_matrices_type , - elem_vectors_type > GatherFillFunctor ; - - //------------------------------------ - - matrix_type jacobian ; - vector_type residual ; - vector_type delta ; - vector_type nodal_solution ; - - typename graph_factory::element_map_type element_map ; - - //------------------------------------ - // Generate mesh and corresponding sparse matrix graph - - Kokkos::Impl::Timer wall_clock ; - - //------------------------------------ - // Generate sparse matrix graph and element->graph map. - - wall_clock.reset(); - - graph_factory::create( mesh , jacobian.graph , element_map ); - - execution_space::fence(); - - perf_data.graph_time = comm::max( machine , wall_clock.seconds() ); - - //------------------------------------ - // Allocate linear system coefficients and rhs: - - const size_t local_owned_length = jacobian.graph.row_map.dimension_0() - 1 ; - const size_t local_total_length = mesh.node_coords.dimension_0(); - - jacobian.coefficients = - matrix_coefficients_type( "jacobian_coeff" , jacobian.graph.entries.dimension_0() ); - - // Nonlinear residual for owned nodes: - residual = vector_type( "residual" , local_owned_length ); - - // Nonlinear solution for owned and ghosted nodes: - nodal_solution = vector_type( "solution" , local_total_length ); - - // Nonlinear solution update for owned nodes: - delta = vector_type( "delta" , local_owned_length ); - - //------------------------------------ - // Allocation of arrays to fill the linear system - - elem_matrices_type elem_matrices ; // Jacobian matrices - elem_vectors_type elem_vectors ; // Residual vectors - - if ( element_count ) { - elem_matrices = elem_matrices_type( std::string("elem_matrices"), element_count ); - elem_vectors = elem_vectors_type( std::string("elem_vectors"), element_count ); - } - - //------------------------------------ - // For boundary condition set the correct values in the solution vector - // The 'zmin' face is assigned to 'T_zmin'. - // The 'zmax' face is assigned to 'T_zmax'. - // The resulting solution is one dimensional along the 'Z' axis. - - DirichletSolutionFunctor::apply( nodal_solution , mesh , - exact_solution.zmin , - exact_solution.zmax , - exact_solution.T_zmin , - exact_solution.T_zmax ); - - for(;;) { // Nonlinear loop - -#if defined( KOKKOS_HAVE_MPI ) - - { //------------------------------------ - // Import off-processor nodal solution values - // for residual and jacobian computations - - Kokkos::AsyncExchange< typename vector_type::value_type , execution_space , - Kokkos::ParallelDataMap > - exchange( mesh.parallel_data_map , 1 ); - - Kokkos::PackArray< vector_type > - ::pack( exchange.buffer() , - mesh.parallel_data_map.count_interior , - mesh.parallel_data_map.count_send , - nodal_solution ); - - exchange.setup(); - - exchange.send_receive(); - - Kokkos::UnpackArray< vector_type > - ::unpack( nodal_solution , exchange.buffer() , - mesh.parallel_data_map.count_owned , - mesh.parallel_data_map.count_receive ); - } - -#endif - - //------------------------------------ - // Compute element matrices and vectors: - - wall_clock.reset(); - - ElementFunctor( mesh , - elem_matrices , - elem_vectors , - nodal_solution , - exact_solution.K ); - - execution_space::fence(); - perf_data.elem_time += comm::max( machine , wall_clock.seconds() ); - - //------------------------------------ - // Fill linear system coefficients: - - wall_clock.reset(); - - fill( jacobian.coefficients.dimension_0(), 0 , jacobian.coefficients ); - fill( residual.dimension_0() , 0 , residual ); - - GatherFillFunctor::apply( jacobian , - residual , - mesh , - element_map , - elem_matrices , - elem_vectors ); - - execution_space::fence(); - perf_data.matrix_gather_fill_time += comm::max( machine , wall_clock.seconds() ); - - // Apply boundary conditions: - - wall_clock.reset(); - - // Updates jacobian matrix to 1 on the diagonal, zero elsewhere, - // and 0 in the residual due to the solution vector having the correct value - DirichletResidualFunctor::apply( jacobian, residual, mesh , - exact_solution.zmin , - exact_solution.zmax ); - - execution_space::fence(); - perf_data.matrix_boundary_condition_time += - comm::max( machine , wall_clock.seconds() ); - - //------------------------------------ - // Has the residual converged? - - residual_norm = norm2( mesh.parallel_data_map.count_owned, - residual, - mesh.parallel_data_map.machine ); - - if ( 0 == newton_iteration_count ) { - residual_norm_init = residual_norm ; - } - - if ( residual_norm / residual_norm_init < newton_tolerance ) { - break ; - } - - //------------------------------------ - // Solve linear sytem - - size_t cg_iteration_count = 0 ; - double cg_residual_norm = 0 ; - - cgsolve( mesh.parallel_data_map , - jacobian , residual , delta , - cg_iteration_count , - cg_residual_norm , - cg_iteration_time , - cg_iteration_limit , cg_tolerance ) ; - - perf_data.cg_iteration_time += cg_iteration_time ; - cg_iteration_count_total += cg_iteration_count ; - - // Update non-linear solution with delta... - // delta is : - Dx = [Jacobian]^1 * Residual which is the negative update - // LaTeX: - // \vec {x}_{n+1} = \vec {x}_{n} - ( - \Delta \vec{x}_{n} ) - // text: - // x[n+1] = x[n] + Dx - - axpy( mesh.parallel_data_map.count_owned , - -1.0, delta, nodal_solution); - - ++newton_iteration_count ; - - if ( newton_iteration_limit < newton_iteration_count ) { - break ; - } - }; - - if ( newton_iteration_count ) { - perf_data.elem_time /= newton_iteration_count ; - perf_data.matrix_gather_fill_time /= newton_iteration_count ; - perf_data.matrix_boundary_condition_time /= newton_iteration_count ; - } - - if ( cg_iteration_count_total ) { - perf_data.cg_iteration_time /= cg_iteration_count_total ; - } - - perf_data.newton_iteration_count = newton_iteration_count ; - perf_data.cg_iteration_count = cg_iteration_count_total ; - - //------------------------------------ - - { - // For extracting the nodal solution and its coordinates: - - typename mesh_type::node_coords_type::HostMirror node_coords_host = - Kokkos::create_mirror( mesh.node_coords ); - - typename vector_type::HostMirror nodal_solution_host = - Kokkos::create_mirror( nodal_solution ); - - Kokkos::deep_copy( node_coords_host , mesh.node_coords ); - Kokkos::deep_copy( nodal_solution_host , nodal_solution ); - - double tmp = 0 ; - - for ( size_t i = 0 ; i < mesh.parallel_data_map.count_owned ; ++i ) { - const coordinate_scalar_type x = node_coords_host(i,0); - const coordinate_scalar_type y = node_coords_host(i,1); - const coordinate_scalar_type z = node_coords_host(i,2); - - const double Tx = exact_solution(z); - const double Ts = nodal_solution_host(i); - const double Te = std::abs( Tx - Ts ) / std::abs( Tx ); - - tmp = std::max( tmp , Te ); - - if ( print_error && 0.02 < Te ) { - std::cout << " node( " << x << " " << y << " " << z << " ) = " - << Ts << " != exact_solution " << Tx - << std::endl ; - } - } - perf_data.error_max = comm::max( machine , tmp ); - } - - return perf_data ; -} - -//---------------------------------------------------------------------------- - -template< typename Scalar , class Device , class FixtureElement > -void driver( const char * const label , - comm::Machine machine , - const int gang_count , - const int elem_count_beg , - const int elem_count_end , - const int runs ) -{ - typedef Scalar scalar_type ; - typedef Device execution_space ; - typedef double coordinate_scalar_type ; - typedef FixtureElement fixture_element_type ; - - typedef BoxMeshFixture< coordinate_scalar_type , - execution_space , - fixture_element_type > fixture_type ; - - typedef typename fixture_type::FEMeshType mesh_type ; - - const size_t proc_count = comm::size( machine ); - const size_t proc_rank = comm::rank( machine ); - - if ( elem_count_beg == 0 || elem_count_end == 0 || runs == 0 ) return ; - - if ( comm::rank( machine ) == 0 ) { - std::cout << std::endl ; - std::cout << "\"Kokkos::HybridFE::Nonlinear " << label << "\"" << std::endl; - std::cout - << "\"Size\" , \"Size\" , \"Graphing\" , \"Element\" , \"Fill\" , \"Boundary\" , \"CG-Iter\" , \"CG-Iter\" , \"Newton-Iter\" , \"Max-node-error\"" - << std::endl - << "\"elems\" , \"nodes\" , \"millisec\" , \"millisec\" , \"millisec\" , \"millisec\" , \"millisec\" , \"total-count\" , \"total-count\" , \"ratio\"" - << std::endl ; - } - - const bool print_sample = 0 ; - const double x_curve = 1.0 ; - const double y_curve = 1.0 ; - const double z_curve = 0.8 ; - - for(int i = elem_count_beg ; i < elem_count_end ; i *= 2 ) - { - const int ix = std::max( 1 , (int) cbrt( ((double) i) / 2.0 ) ); - const int iy = 1 + ix ; - const int iz = 2 * iy ; - const int global_elem_count = ix * iy * iz ; - const int global_node_count = ( 2 * ix + 1 ) * - ( 2 * iy + 1 ) * - ( 2 * iz + 1 ); - - mesh_type mesh = - fixture_type::create( proc_count , proc_rank , gang_count , - ix , iy , iz , - x_curve , y_curve , z_curve ); - - mesh.parallel_data_map.machine = machine ; - - - PerformanceData perf_data , perf_best ; - - for(int j = 0; j < runs; j++){ - - perf_data = run(mesh,ix,iy,iz, print_sample ); - - if( j == 0 ) { - perf_best = perf_data ; - } - else { - perf_best.best( perf_data ); - } - } - - if ( comm::rank( machine ) == 0 ) { - - std::cout << std::setw(8) << global_elem_count << " , " - << std::setw(8) << global_node_count << " , " - << std::setw(10) << perf_best.graph_time * 1000 << " , " - << std::setw(10) << perf_best.elem_time * 1000 << " , " - << std::setw(10) << perf_best.matrix_gather_fill_time * 1000 << " , " - << std::setw(10) << perf_best.matrix_boundary_condition_time * 1000 << " , " - << std::setw(10) << perf_best.cg_iteration_time * 1000 << " , " - << std::setw(7) << perf_best.cg_iteration_count << " , " - << std::setw(3) << perf_best.newton_iteration_count << " , " - << std::setw(10) << perf_best.error_max - << std::endl ; - } - } -} - -//---------------------------------------------------------------------------- - -} /* namespace Nonlinear */ -} /* namespace HybridFEM */ - - -#endif /* #ifndef HYBRIDFEM_IMPLICIT_HPP */ - diff --git a/lib/kokkos/example/multi_fem/NonlinearElement_Cuda.hpp b/lib/kokkos/example/multi_fem/NonlinearElement_Cuda.hpp deleted file mode 100644 index b2adc2adab..0000000000 --- a/lib/kokkos/example/multi_fem/NonlinearElement_Cuda.hpp +++ /dev/null @@ -1,390 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#include - -#include -#include -#include -#include -#include - -#include -#include -#include - -namespace HybridFEM { -namespace Nonlinear { - -template< class MeshType , typename ScalarType > struct ElementComputation ; - -//---------------------------------------------------------------------------- - -template<> -struct ElementComputation< FEMesh< double , 27 , Kokkos::Cuda > , double > -{ - typedef Kokkos::Cuda execution_space ; - - static const unsigned ElementNodeCount = 27 ; - - typedef HexElement_Data< ElementNodeCount > element_data_type ; - typedef FEMesh< double , ElementNodeCount , execution_space > mesh_type ; - - static const unsigned SpatialDim = element_data_type::spatial_dimension ; - static const unsigned FunctionCount = element_data_type::function_count ; - static const unsigned IntegrationCount = element_data_type::integration_count ; - static const unsigned TensorDim = SpatialDim * SpatialDim ; - - typedef Kokkos::View< double[][FunctionCount][FunctionCount] , execution_space > elem_matrices_type ; - typedef Kokkos::View< double[][FunctionCount] , execution_space > elem_vectors_type ; - typedef Kokkos::View< double[] , execution_space > value_vector_type ; - -private: - - const element_data_type elem_data ; - const typename mesh_type::elem_node_ids_type elem_node_ids ; - const typename mesh_type::node_coords_type node_coords ; - const value_vector_type nodal_values ; - const elem_matrices_type element_matrices ; - const elem_vectors_type element_vectors ; - const float coeff_K ; - const unsigned elem_count ; - unsigned invJacIndex[9][4] ; - - static const unsigned j11 = 0 , j12 = 1 , j13 = 2 , - j21 = 3 , j22 = 4 , j23 = 5 , - j31 = 6 , j32 = 7 , j33 = 8 ; - - // Can only handle up to 16 warps: - static const unsigned BlockDimX = 32 ; - static const unsigned BlockDimY = 7 ; - - struct WorkSpace { - double sum[ BlockDimY ][ BlockDimX ]; - - double value_at_integ[ IntegrationCount ]; - double gradx_at_integ[ IntegrationCount ]; - double grady_at_integ[ IntegrationCount ]; - double gradz_at_integ[ IntegrationCount ]; - - float spaceJac[ BlockDimY ][ 9 ]; - float spaceInvJac[ BlockDimY ][ 9 ]; - - float detJweight[ IntegrationCount ]; - - float dpsidx[ FunctionCount ][ IntegrationCount ]; - float dpsidy[ FunctionCount ][ IntegrationCount ]; - float dpsidz[ FunctionCount ][ IntegrationCount ]; - }; - -public: - - ElementComputation ( const mesh_type & arg_mesh , - const elem_matrices_type & arg_element_matrices , - const elem_vectors_type & arg_element_vectors , - const value_vector_type & arg_nodal_values , - const float arg_coeff_K ) - : elem_data() - , elem_node_ids( arg_mesh.elem_node_ids ) - , node_coords( arg_mesh.node_coords ) - , nodal_values( arg_nodal_values ) - , element_matrices( arg_element_matrices ) - , element_vectors( arg_element_vectors ) - , coeff_K( arg_coeff_K ) - , elem_count( arg_mesh.elem_node_ids.dimension_0() ) - { - const unsigned jInvJ[9][4] = - { { j22 , j33 , j23 , j32 } , - { j13 , j32 , j12 , j33 } , - { j12 , j23 , j13 , j22 } , - - { j23 , j31 , j21 , j33 } , - { j11 , j33 , j13 , j31 } , - { j13 , j21 , j11 , j23 } , - - { j21 , j32 , j22 , j31 } , - { j12 , j31 , j11 , j32 } , - { j11 , j22 , j12 , j21 } }; - - for ( unsigned i = 0 ; i < 9 ; ++i ) { - for ( unsigned j = 0 ; j < 4 ; ++j ) { - invJacIndex[i][j] = jInvJ[i][j] ; - } - } - - const unsigned shmem = sizeof(WorkSpace); - const unsigned grid_max = 65535 ; - const unsigned grid_count = std::min( grid_max , elem_count ); - - // For compute capability 2.x up to 1024 threads per block - const dim3 block( BlockDimX , BlockDimY , 1 ); - const dim3 grid( grid_count , 1 , 1 ); - - Kokkos::Impl::CudaParallelLaunch< ElementComputation >( *this , grid , block , shmem ); - } - -public: - - //------------------------------------ - // Sum among the threadIdx.x - - template< typename Type > - __device__ inline static - void sum_x( Type & result , const double value ) - { - extern __shared__ WorkSpace work_data[] ; - - volatile double * const base_sum = - & work_data->sum[ threadIdx.y ][ threadIdx.x ] ; - - base_sum[ 0] = value ; - - if ( threadIdx.x < 16 ) { - base_sum[0] += base_sum[16]; - base_sum[0] += base_sum[ 8]; - base_sum[0] += base_sum[ 4]; - base_sum[0] += base_sum[ 2]; - base_sum[0] += base_sum[ 1]; - } - - if ( 0 == threadIdx.x ) { - result = base_sum[0] ; - } - } - - __device__ inline static - void sum_x_clear() - { - extern __shared__ WorkSpace work_data[] ; - - work_data->sum[ threadIdx.y ][ threadIdx.x ] = 0 ; - } - - //------------------------------------ - //------------------------------------ - - __device__ inline - void evaluateFunctions( const unsigned ielem ) const - { - extern __shared__ WorkSpace work_data[] ; - - // Each warp (threadIdx.y) computes an integration point - // Each thread is responsible for a node / function. - - const unsigned iFunc = threadIdx.x ; - const bool hasFunc = iFunc < FunctionCount ; - - //------------------------------------ - // Each warp gathers a different variable into 'elem_mat' shared memory. - - if ( hasFunc ) { - - const unsigned node = elem_node_ids( ielem , iFunc ); - - for ( unsigned iy = threadIdx.y ; iy < 4 ; iy += blockDim.y ) { - switch( iy ) { - case 0 : work_data->sum[0][iFunc] = node_coords(node,0); break ; - case 1 : work_data->sum[1][iFunc] = node_coords(node,1); break ; - case 2 : work_data->sum[2][iFunc] = node_coords(node,2); break ; - case 3 : work_data->sum[3][iFunc] = nodal_values(node); break ; - default: break ; - } - } - } - - __syncthreads(); // Wait for all warps to finish gathering - - // now get local 'const' copies in register space: - - const double x = work_data->sum[0][ iFunc ]; - const double y = work_data->sum[1][ iFunc ]; - const double z = work_data->sum[2][ iFunc ]; - const double dof_val = work_data->sum[3][ iFunc ]; - - __syncthreads(); // Wait for all warps to finish extracting - - sum_x_clear(); // Make sure summation scratch is zero - - //------------------------------------ - // Each warp is now on its own computing an integration point - // so no further explicit synchronizations are required. - - if ( hasFunc ) { - - float * const J = work_data->spaceJac[ threadIdx.y ]; - float * const invJ = work_data->spaceInvJac[ threadIdx.y ]; - - for ( unsigned iInt = threadIdx.y ; - iInt < IntegrationCount ; iInt += blockDim.y ) { - - const float val = elem_data.values[iInt][iFunc] ; - const float gx = elem_data.gradients[iInt][0][iFunc] ; - const float gy = elem_data.gradients[iInt][1][iFunc] ; - const float gz = elem_data.gradients[iInt][2][iFunc] ; - - sum_x( J[j11], gx * x ); - sum_x( J[j12], gx * y ); - sum_x( J[j13], gx * z ); - - sum_x( J[j21], gy * x ); - sum_x( J[j22], gy * y ); - sum_x( J[j23], gy * z ); - - sum_x( J[j31], gz * x ); - sum_x( J[j32], gz * y ); - sum_x( J[j33], gz * z ); - - // Inverse jacobian, only enough parallel work for 9 threads in the warp - - if ( iFunc < TensorDim ) { - - invJ[ iFunc ] = - J[ invJacIndex[iFunc][0] ] * J[ invJacIndex[iFunc][1] ] - - J[ invJacIndex[iFunc][2] ] * J[ invJacIndex[iFunc][3] ] ; - - // Let all threads in the warp compute determinant into a register - - const float detJ = J[j11] * invJ[j11] + - J[j21] * invJ[j12] + - J[j31] * invJ[j13] ; - - invJ[ iFunc ] /= detJ ; - - if ( 0 == iFunc ) { - work_data->detJweight[ iInt ] = detJ * elem_data.weights[ iInt ] ; - } - } - - // Transform bases gradients and compute value and gradient - - const float dx = gx * invJ[j11] + gy * invJ[j12] + gz * invJ[j13]; - const float dy = gx * invJ[j21] + gy * invJ[j22] + gz * invJ[j23]; - const float dz = gx * invJ[j31] + gy * invJ[j32] + gz * invJ[j33]; - - work_data->dpsidx[iFunc][iInt] = dx ; - work_data->dpsidy[iFunc][iInt] = dy ; - work_data->dpsidz[iFunc][iInt] = dz ; - - sum_x( work_data->gradx_at_integ[iInt] , dof_val * dx ); - sum_x( work_data->grady_at_integ[iInt] , dof_val * dy ); - sum_x( work_data->gradz_at_integ[iInt] , dof_val * dz ); - sum_x( work_data->value_at_integ[iInt] , dof_val * val ); - } - } - - __syncthreads(); // All shared data must be populated at return. - } - - __device__ inline - void contributeResidualJacobian( const unsigned ielem ) const - { - extern __shared__ WorkSpace work_data[] ; - - sum_x_clear(); // Make sure summation scratch is zero - - // $$ R_i = \int_{\Omega} \nabla \phi_i \cdot (k \nabla T) + \phi_i T^2 d \Omega $$ - // $$ J_{i,j} = \frac{\partial R_i}{\partial T_j} = \int_{\Omega} k \nabla \phi_i \cdot \nabla \phi_j + 2 \phi_i \phi_j T d \Omega $$ - - const unsigned iInt = threadIdx.x ; - - if ( iInt < IntegrationCount ) { - - const double value_at_integ = work_data->value_at_integ[ iInt ] ; - const double gradx_at_integ = work_data->gradx_at_integ[ iInt ] ; - const double grady_at_integ = work_data->grady_at_integ[ iInt ] ; - const double gradz_at_integ = work_data->gradz_at_integ[ iInt ] ; - - const float detJweight = work_data->detJweight[ iInt ] ; - const float coeff_K_detJweight = coeff_K * detJweight ; - - for ( unsigned iRow = threadIdx.y ; - iRow < FunctionCount ; iRow += blockDim.y ) { - - const float value_row = elem_data.values[ iInt ][ iRow ] * detJweight ; - const float dpsidx_row = work_data->dpsidx[ iRow ][ iInt ] * coeff_K_detJweight ; - const float dpsidy_row = work_data->dpsidy[ iRow ][ iInt ] * coeff_K_detJweight ; - const float dpsidz_row = work_data->dpsidz[ iRow ][ iInt ] * coeff_K_detJweight ; - - const double res_del = dpsidx_row * gradx_at_integ + - dpsidy_row * grady_at_integ + - dpsidz_row * gradz_at_integ ; - - const double res_val = value_at_integ * value_at_integ * value_row ; - const double jac_val_row = 2 * value_at_integ * value_row ; - - sum_x( element_vectors( ielem , iRow ) , res_del + res_val ); - - for ( unsigned iCol = 0 ; iCol < FunctionCount ; ++iCol ) { - - const float jac_del = - dpsidx_row * work_data->dpsidx[iCol][iInt] + - dpsidy_row * work_data->dpsidy[iCol][iInt] + - dpsidz_row * work_data->dpsidz[iCol][iInt] ; - - const double jac_val = - jac_val_row * elem_data.values[ iInt ][ iCol ] ; - - sum_x( element_matrices( ielem , iRow , iCol ) , jac_del + jac_val ); - } - } - } - - __syncthreads(); // All warps finish before refilling shared data - } - - __device__ inline - void operator()(void) const - { - extern __shared__ WorkSpace work_data[] ; - - for ( unsigned ielem = blockIdx.x ; ielem < elem_count ; ielem += gridDim.x ) { - - evaluateFunctions( ielem ); - - contributeResidualJacobian( ielem ); - } - } - -}; /* ElementComputation */ - -} /* namespace Nonlinear */ -} /* namespace HybridFEM */ - diff --git a/lib/kokkos/example/multi_fem/NonlinearFunctors.hpp b/lib/kokkos/example/multi_fem/NonlinearFunctors.hpp deleted file mode 100644 index 9628236181..0000000000 --- a/lib/kokkos/example/multi_fem/NonlinearFunctors.hpp +++ /dev/null @@ -1,482 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_NONLINEARFUNCTORS_HPP -#define KOKKOS_NONLINEARFUNCTORS_HPP - -#include -#include -#include -#include -#include - -namespace HybridFEM { -namespace Nonlinear { - -template< class MeshType , typename ScalarType > struct ElementComputation ; -template< class MeshType , typename ScalarType > struct DirichletSolution ; -template< class MeshType , typename ScalarType > struct DirichletResidual ; - -} -} - -/* A Cuda-specific specialization for the element computation functor. */ -#if defined( __CUDACC__ ) -#include -#endif - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace HybridFEM { -namespace Nonlinear { - -template< typename ScalarCoordType , unsigned ElemNode , class DeviceType , - typename ScalarType > -struct ElementComputation< - FEMesh< ScalarCoordType , ElemNode , DeviceType > , ScalarType > -{ - typedef DeviceType execution_space; - typedef ScalarType scalar_type ; - - static const unsigned ElementNodeCount = ElemNode ; - - typedef FEMesh< ScalarCoordType , ElementNodeCount , execution_space > mesh_type ; - - typedef HexElement_Data< ElementNodeCount > element_data_type ; - - static const unsigned SpatialDim = element_data_type::spatial_dimension ; - static const unsigned FunctionCount = element_data_type::function_count ; - static const unsigned IntegrationCount = element_data_type::integration_count ; - static const unsigned TensorDim = SpatialDim * SpatialDim ; - - typedef Kokkos::View< scalar_type[][FunctionCount][FunctionCount] , execution_space > elem_matrices_type ; - typedef Kokkos::View< scalar_type[][FunctionCount] , execution_space > elem_vectors_type ; - typedef Kokkos::View< scalar_type[] , execution_space > value_vector_type ; - - -private: - - const element_data_type elem_data ; - typename mesh_type::elem_node_ids_type elem_node_ids ; - typename mesh_type::node_coords_type node_coords ; - value_vector_type nodal_values ; - elem_matrices_type element_matrices ; - elem_vectors_type element_vectors ; - scalar_type coeff_K ; - -public: - - ElementComputation( const mesh_type & arg_mesh , - const elem_matrices_type & arg_element_matrices , - const elem_vectors_type & arg_element_vectors , - const value_vector_type & arg_nodal_values , - const scalar_type arg_coeff_K ) - : elem_data() - , elem_node_ids( arg_mesh.elem_node_ids ) - , node_coords( arg_mesh.node_coords ) - , nodal_values( arg_nodal_values ) - , element_matrices( arg_element_matrices ) - , element_vectors( arg_element_vectors ) - , coeff_K( arg_coeff_K ) - { - const size_t elem_count = arg_mesh.elem_node_ids.dimension_0(); - - parallel_for( elem_count , *this ); - } - - //------------------------------------ - - static const unsigned FLOPS_transform_gradients = - /* Jacobian */ FunctionCount * TensorDim * 2 + - /* Inverse jacobian */ TensorDim * 6 + 6 + - /* Gradient transform */ FunctionCount * 15 ; - - KOKKOS_INLINE_FUNCTION - float transform_gradients( - const float grad[][ FunctionCount ] , // Gradient of bases master element - const double x[] , - const double y[] , - const double z[] , - float dpsidx[] , - float dpsidy[] , - float dpsidz[] ) const - { - enum { j11 = 0 , j12 = 1 , j13 = 2 , - j21 = 3 , j22 = 4 , j23 = 5 , - j31 = 6 , j32 = 7 , j33 = 8 }; - - // Jacobian accumulation: - - double J[ TensorDim ] = { 0, 0, 0, 0, 0, 0, 0, 0, 0 }; - - for( unsigned i = 0; i < FunctionCount ; ++i ) { - const double x1 = x[i] ; - const double x2 = y[i] ; - const double x3 = z[i] ; - - const float g1 = grad[0][i] ; - const float g2 = grad[1][i] ; - const float g3 = grad[2][i] ; - - J[j11] += g1 * x1 ; - J[j12] += g1 * x2 ; - J[j13] += g1 * x3 ; - - J[j21] += g2 * x1 ; - J[j22] += g2 * x2 ; - J[j23] += g2 * x3 ; - - J[j31] += g3 * x1 ; - J[j32] += g3 * x2 ; - J[j33] += g3 * x3 ; - } - - // Inverse jacobian: - - float invJ[ TensorDim ] = { - static_cast( J[j22] * J[j33] - J[j23] * J[j32] ) , - static_cast( J[j13] * J[j32] - J[j12] * J[j33] ) , - static_cast( J[j12] * J[j23] - J[j13] * J[j22] ) , - - static_cast( J[j23] * J[j31] - J[j21] * J[j33] ) , - static_cast( J[j11] * J[j33] - J[j13] * J[j31] ) , - static_cast( J[j13] * J[j21] - J[j11] * J[j23] ) , - - static_cast( J[j21] * J[j32] - J[j22] * J[j31] ) , - static_cast( J[j12] * J[j31] - J[j11] * J[j32] ) , - static_cast( J[j11] * J[j22] - J[j12] * J[j21] ) }; - - const float detJ = J[j11] * invJ[j11] + - J[j21] * invJ[j12] + - J[j31] * invJ[j13] ; - - const float detJinv = 1.0 / detJ ; - - for ( unsigned i = 0 ; i < TensorDim ; ++i ) { invJ[i] *= detJinv ; } - - // Transform gradients: - - for( unsigned i = 0; i < FunctionCount ; ++i ) { - const float g0 = grad[0][i]; - const float g1 = grad[1][i]; - const float g2 = grad[2][i]; - - dpsidx[i] = g0 * invJ[j11] + g1 * invJ[j12] + g2 * invJ[j13]; - dpsidy[i] = g0 * invJ[j21] + g1 * invJ[j22] + g2 * invJ[j23]; - dpsidz[i] = g0 * invJ[j31] + g1 * invJ[j32] + g2 * invJ[j33]; - } - - return detJ ; - } - - KOKKOS_INLINE_FUNCTION - void contributeResidualJacobian( - const float coeff_k , - const double dof_values[] , - const float dpsidx[] , - const float dpsidy[] , - const float dpsidz[] , - const float detJ , - const float integ_weight , - const float bases_vals[] , - double elem_res[] , - double elem_mat[][ FunctionCount ] ) const - { - double value_at_pt = 0 ; - double gradx_at_pt = 0 ; - double grady_at_pt = 0 ; - double gradz_at_pt = 0 ; - - for ( unsigned m = 0 ; m < FunctionCount ; m++ ) { - value_at_pt += dof_values[m] * bases_vals[m] ; - gradx_at_pt += dof_values[m] * dpsidx[m] ; - grady_at_pt += dof_values[m] * dpsidy[m] ; - gradz_at_pt += dof_values[m] * dpsidz[m] ; - } - - const scalar_type k_detJ_weight = coeff_k * detJ * integ_weight ; - const double res_val = value_at_pt * value_at_pt * detJ * integ_weight ; - const double mat_val = 2.0 * value_at_pt * detJ * integ_weight ; - - // $$ R_i = \int_{\Omega} \nabla \phi_i \cdot (k \nabla T) + \phi_i T^2 d \Omega $$ - // $$ J_{i,j} = \frac{\partial R_i}{\partial T_j} = \int_{\Omega} k \nabla \phi_i \cdot \nabla \phi_j + 2 \phi_i \phi_j T d \Omega $$ - - for ( unsigned m = 0; m < FunctionCount; m++) { - double * const mat = elem_mat[m] ; - const float bases_val_m = bases_vals[m]; - const float dpsidx_m = dpsidx[m] ; - const float dpsidy_m = dpsidy[m] ; - const float dpsidz_m = dpsidz[m] ; - - elem_res[m] += k_detJ_weight * ( dpsidx_m * gradx_at_pt + - dpsidy_m * grady_at_pt + - dpsidz_m * gradz_at_pt ) + - res_val * bases_val_m ; - - for( unsigned n = 0; n < FunctionCount; n++) { - - mat[n] += k_detJ_weight * ( dpsidx_m * dpsidx[n] + - dpsidy_m * dpsidy[n] + - dpsidz_m * dpsidz[n] ) + - mat_val * bases_val_m * bases_vals[n]; - } - } - } - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned ielem ) const - { - // Gather nodal coordinates and solution vector: - - double x[ FunctionCount ] ; - double y[ FunctionCount ] ; - double z[ FunctionCount ] ; - double val[ FunctionCount ] ; - - for ( unsigned i = 0 ; i < ElementNodeCount ; ++i ) { - const unsigned node_index = elem_node_ids( ielem , i ); - - x[i] = node_coords( node_index , 0 ); - y[i] = node_coords( node_index , 1 ); - z[i] = node_coords( node_index , 2 ); - - val[i] = nodal_values( node_index ); - } - - double elem_vec[ FunctionCount ] ; - double elem_mat[ FunctionCount ][ FunctionCount ] ; - - for( unsigned i = 0; i < FunctionCount ; i++ ) { - elem_vec[i] = 0 ; - for( unsigned j = 0; j < FunctionCount ; j++){ - elem_mat[i][j] = 0 ; - } - } - - for ( unsigned i = 0 ; i < IntegrationCount ; ++i ) { - float dpsidx[ FunctionCount ] ; - float dpsidy[ FunctionCount ] ; - float dpsidz[ FunctionCount ] ; - - const float detJ = - transform_gradients( elem_data.gradients[i] , x , y , z , - dpsidx , dpsidy , dpsidz ); - - contributeResidualJacobian( coeff_K , - val , dpsidx , dpsidy , dpsidz , - detJ , - elem_data.weights[i] , - elem_data.values[i] , - elem_vec , elem_mat ); - } - - for( unsigned i = 0; i < FunctionCount ; i++){ - element_vectors(ielem, i) = elem_vec[i] ; - for( unsigned j = 0; j < FunctionCount ; j++){ - element_matrices(ielem, i, j) = elem_mat[i][j] ; - } - } - } - -}; /* ElementComputation */ - -//---------------------------------------------------------------------------- - -template< typename ScalarCoordType , unsigned ElemNode , class DeviceType , - typename ScalarType > -struct DirichletSolution< - FEMesh< ScalarCoordType , ElemNode , DeviceType > , - ScalarType > -{ - typedef DeviceType execution_space; - - static const unsigned ElementNodeCount = ElemNode ; - - typedef Kokkos::View< ScalarType[] , execution_space > vector_type ; - - typedef FEMesh< ScalarCoordType , ElementNodeCount , execution_space > mesh_type ; - - typename mesh_type::node_coords_type node_coords ; - - vector_type solution ; - ScalarCoordType bc_lower_z ; - ScalarCoordType bc_upper_z ; - ScalarType bc_lower_value ; - ScalarType bc_upper_value ; - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned inode ) const - { - - // Apply dirichlet boundary condition on the Solution vector. - // Define boundary node values to be either bc_lower_value or - // bc_upper_value, depending on which boundary face they lie on. - // Non-boundary terms will be left at their previous value. - - const ScalarCoordType z = node_coords(inode,2); - const bool bc_lower = z <= bc_lower_z ; - const bool bc_upper = bc_upper_z <= z ; - - if ( bc_lower || bc_upper ) { - const ScalarType bc_value = bc_lower ? bc_lower_value - : bc_upper_value ; - - solution(inode) = bc_value ; // set the solution vector - } - } - - static void apply( const vector_type & solution , - const mesh_type & mesh , - const ScalarCoordType bc_lower_z , - const ScalarCoordType bc_upper_z , - const ScalarType bc_lower_value , - const ScalarType bc_upper_value ) - { - DirichletSolution op ; - op.node_coords = mesh.node_coords ; - op.solution = solution ; - op.bc_lower_z = bc_lower_z ; - op.bc_upper_z = bc_upper_z ; - op.bc_lower_value = bc_lower_value ; - op.bc_upper_value = bc_upper_value ; - parallel_for( solution.dimension_0() , op ); - } -}; - -//---------------------------------------------------------------------------- - -template< typename ScalarCoordType , unsigned ElemNode , class DeviceType , - typename ScalarType > -struct DirichletResidual< - FEMesh< ScalarCoordType , ElemNode , DeviceType > , ScalarType > -{ - typedef DeviceType execution_space; - typedef typename execution_space::size_type size_type ; - - static const unsigned ElementNodeCount = ElemNode ; - - typedef Kokkos::CrsMatrix< ScalarType , execution_space > matrix_type ; - typedef Kokkos::View< ScalarType[] , execution_space > vector_type ; - - typedef FEMesh< ScalarCoordType , ElementNodeCount , execution_space > mesh_type ; - - typename mesh_type::node_coords_type node_coords ; - matrix_type matrix ; - vector_type rhs ; - ScalarCoordType bc_lower_z ; - ScalarCoordType bc_upper_z ; - - KOKKOS_INLINE_FUNCTION - void operator()( const unsigned inode ) const - { - // Apply a dirichlet boundary condition to 'irow' - // to maintain the symmetry of the original - // global stiffness matrix, zero out the columns - // that correspond to boundary conditions, and - // adjust the load vector accordingly - - const size_type iBeg = matrix.graph.row_map[inode]; - const size_type iEnd = matrix.graph.row_map[inode+1]; - - const ScalarCoordType z = node_coords(inode,2); - const bool bc_lower = z <= bc_lower_z ; - const bool bc_upper = bc_upper_z <= z ; - - if ( bc_lower || bc_upper ) { - rhs(inode) = 0 ; // set the residual vector - - // zero each value on the row, and leave a one - // on the diagonal - - for( size_type i = iBeg ; i < iEnd ; i++) { - matrix.coefficients(i) = - (int) inode == matrix.graph.entries(i) ? 1 : 0 ; - } - } - else { - - // Find any columns that are boundary conditions. - // Clear them and adjust the load vector - - for( size_type i = iBeg ; i < iEnd ; i++ ) { - const size_type cnode = matrix.graph.entries(i) ; - - const ScalarCoordType zc = node_coords(cnode,2); - const bool c_bc_lower = zc <= bc_lower_z ; - const bool c_bc_upper = bc_upper_z <= zc ; - - if ( c_bc_lower || c_bc_upper ) { - - matrix.coefficients(i) = 0 ; - } - } - } - } - - - static void apply( const matrix_type & linsys_matrix , - const vector_type & linsys_rhs , - const mesh_type & mesh , - const ScalarCoordType bc_lower_z , - const ScalarCoordType bc_upper_z) - { - const size_t row_count = linsys_matrix.graph.row_map.dimension_0() - 1 ; - - DirichletResidual op ; - op.node_coords = mesh.node_coords ; - op.matrix = linsys_matrix ; - op.rhs = linsys_rhs ; - op.bc_lower_z = bc_lower_z ; - op.bc_upper_z = bc_upper_z ; - parallel_for( row_count , op ); - } -}; - -//---------------------------------------------------------------------------- - -} /* namespace Nonlinear */ -} /* namespace HybridFEM */ - -#endif /* #ifndef KOKKOS_NONLINEARFUNCTORS_HPP */ - diff --git a/lib/kokkos/example/multi_fem/ParallelComm.hpp b/lib/kokkos/example/multi_fem/ParallelComm.hpp deleted file mode 100644 index 163e84a958..0000000000 --- a/lib/kokkos/example/multi_fem/ParallelComm.hpp +++ /dev/null @@ -1,167 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef PARALLELCOMM_HPP -#define PARALLELCOMM_HPP - -//------------------------------------------------------------------------ - -#include - -//------------------------------------------------------------------------ - -#if defined( KOKKOS_HAVE_MPI ) - -#include -#include - -namespace comm { - -struct Machine { - MPI_Comm mpi_comm ; - - Machine() : mpi_comm( MPI_COMM_NULL ) {} - - Machine( const Machine & rhs ) - : mpi_comm( rhs.mpi_comm ) {} - - Machine( MPI_Comm c ) : mpi_comm( c ) {} - - static Machine init( int * argc , char *** argv ) - { - MPI_Init( argc , argv ); - return Machine( MPI_COMM_WORLD ); - } - - static void finalize() { MPI_Finalize(); } -}; - -inline -unsigned size( Machine machine ) -{ - int np ; MPI_Comm_size( machine.mpi_comm , & np ); return np ; -} - -inline -unsigned rank( Machine machine ) -{ - int ip ; MPI_Comm_rank( machine.mpi_comm , & ip ); return ip ; -} - -inline -double max( Machine machine , double local ) -{ - double global = 0; - MPI_Allreduce( & local , & global , 1 , MPI_DOUBLE , MPI_MAX , machine.mpi_comm ); - return global ; -} - -inline -std::string command_line( Machine machine , const int argc , const char * const * const argv ) -{ - std::string argline ; - - if ( 0 == rank( machine ) ) { - for ( int i = 1 ; i < argc ; ++i ) { - argline.append(" ").append( argv[i] ); - } - } - - int length = argline.length(); - MPI_Bcast( & length , 1 , MPI_INT , 0 , machine.mpi_comm ); - argline.resize( length , ' ' ); - MPI_Bcast( (void*) argline.data() , length , MPI_CHAR , 0 , machine.mpi_comm ); - - return argline ; -} - -} - -#else /* ! defined( KOKKOS_HAVE_MPI ) */ - -#include - -namespace comm { - -// Stub for non-parallel - -struct Machine { - static Machine init( int * , char *** ) - { return Machine(); } - - static void finalize() {} -}; - -inline -unsigned size( Machine ) { return 1 ; } - -inline -unsigned rank( Machine ) { return 0 ; } - -inline -double max( Machine , double local ) -{ return local ; } - -inline -std::string command_line( Machine machine , const int argc , const char * const * const argv ) -{ - std::string argline ; - - if ( 0 == rank( machine ) ) { - for ( int i = 1 ; i < argc ; ++i ) { - argline.append(" ").append( argv[i] ); - } - } - - return argline ; -} - -} - -#endif /* ! defined( KOKKOS_HAVE_MPI ) */ - -//------------------------------------------------------------------------ - -#endif /* #ifndef PARALLELCOMM_HPP */ - - diff --git a/lib/kokkos/example/multi_fem/ParallelDataMap.hpp b/lib/kokkos/example/multi_fem/ParallelDataMap.hpp deleted file mode 100644 index 22a1cfefa1..0000000000 --- a/lib/kokkos/example/multi_fem/ParallelDataMap.hpp +++ /dev/null @@ -1,517 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef KOKKOS_PARALLELDATAMAP_HPP -#define KOKKOS_PARALLELDATAMAP_HPP - -#include -#include -#include -#include -#include - -#include -#include - -namespace Kokkos { - -//---------------------------------------------------------------------------- -/** \brief Parallel distributed data mapping - * - * ordering { interior : { owned items not sent elsewhere } - * send : { owned items sent } - * receive : { not-owned items received } } - * - * recv { { N ghosted items from process P : ( P , N ) } } - * - * send { { N send items to process P : ( P , N ) } } - * - * send_item { send item offsets within 'send' range } - */ -struct ParallelDataMap { - typedef View< unsigned*[2], HostSpace > host_recv_type ; - typedef View< unsigned*[2], HostSpace > host_send_type ; - typedef View< unsigned* , HostSpace > host_send_item_type ; - - comm::Machine machine ; - host_recv_type host_recv ; - host_send_type host_send ; - host_send_item_type host_send_item ; - unsigned count_interior ; - unsigned count_send ; - unsigned count_owned ; // = count_interior + count_send - unsigned count_receive ; - - void assign( const unsigned arg_count_interior , - const unsigned arg_count_owned , - const unsigned arg_count_total , - const unsigned arg_recv_msg , - const unsigned arg_send_msg , - const unsigned arg_send_count ) - { - const std::string label("Kokkos::ParallelDataMap buffer"); - - count_interior = arg_count_interior ; - count_owned = arg_count_owned ; - count_send = arg_count_owned - arg_count_interior ; - count_receive = arg_count_total - arg_count_owned ; - - host_recv = host_recv_type( label , arg_recv_msg ); - host_send = host_send_type( label , arg_send_msg ); - host_send_item = host_send_item_type( label , arg_send_count ); - } -}; - -//---------------------------------------------------------------------------- -//PackArray -//---------------------------------------------------------------------------- -template< class ArrayType , class Rank = void > -struct PackArray ; - -template< typename DeviceType, typename ValueType > -struct PackArray< View< ValueType* , DeviceType > , void > -{ - typedef DeviceType execution_space ; - typedef typename DeviceType::size_type size_type ; - typedef View< ValueType* , execution_space > array_type ; - typedef View< ValueType* , execution_space > buffer_type ; - -private: - - buffer_type output ; - array_type input ; - size_type base ; - -public: - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type i ) const - { output[i] = input(base+i); } - - inline - static - void pack( const buffer_type & arg_output , - const size_type arg_begin , - const size_type arg_count , - const array_type & arg_input ) - { - PackArray op ; - op.output = arg_output ; - op.input = arg_input ; - op.base = arg_begin ; - parallel_for( arg_count , op ); - } -}; - -template< typename DeviceType, typename ValueType , unsigned N1 > -struct PackArray< View< ValueType*[N1] , DeviceType > , void > -{ - typedef DeviceType execution_space ; - typedef typename DeviceType::size_type size_type ; - typedef View< ValueType*[N1] , execution_space > array_type ; - typedef View< ValueType* , execution_space > buffer_type ; - -private: - - buffer_type output ; - array_type input ; - size_type base ; - -public: - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type i ) const - { - for ( size_type j = 0 , k = i * N1 ; j < N1 ; ++j , ++k ) { - output[k] = input(base+i,j); - } - } - - inline static - void pack( const buffer_type & arg_output , - const size_type arg_begin , - const size_type arg_count , - const array_type & arg_input ) - { - if ( arg_count ) { - PackArray op ; - op.output = arg_output ; - op.input = arg_input ; - op.base = arg_begin ; - parallel_for( arg_count , op ); - } - } -}; - -//---------------------------------------------------------------------------- -//UnpackArray -//---------------------------------------------------------------------------- -template< class ArrayType , class Rank = void > struct UnpackArray ; - -template< typename DeviceType, typename ValueType > -struct UnpackArray< View< ValueType* , DeviceType > , void > -{ - typedef DeviceType execution_space ; - typedef typename DeviceType::size_type size_type ; - typedef View< ValueType* , execution_space > array_type ; - typedef View< ValueType* , execution_space > buffer_type ; - -private: - - array_type output ; - buffer_type input ; - size_type base ; - -public: - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type i ) const - { output(base+i) = input[i]; } - - inline - static - void unpack( const array_type & arg_output , - const buffer_type & arg_input , - const size_type arg_begin , - const size_type arg_count ) - { - UnpackArray op ; - op.output = arg_output ; - op.input = arg_input ; - op.base = arg_begin ; - parallel_for( arg_count , op ); - } -}; - -template< typename DeviceType, typename ValueType , unsigned N1 > -struct UnpackArray< View< ValueType*[N1] , DeviceType > , void > -{ - typedef DeviceType execution_space ; - typedef typename DeviceType::size_type size_type ; - typedef View< ValueType* , execution_space > buffer_type ; - typedef View< ValueType*[N1] , execution_space > array_type ; - -private: - - array_type output ; - buffer_type input ; - size_type base ; - -public: - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type i ) const - { - for ( size_type j = 0 , k = i * N1 ; j < N1 ; ++j , ++k ) { - output(base+i,j) = input(k); - } - } - - inline - static - void unpack( const array_type & arg_output , - const buffer_type & arg_input , - const size_type arg_begin , - const size_type arg_count ) - { - if ( arg_count ) { - UnpackArray op ; - op.output = arg_output ; - op.input = arg_input ; - op.base = arg_begin ; - parallel_for( arg_count , op ); - } - } -}; -//---------------------------------------------------------------------------- -template< class ValueType , class Device , class DataMap > -class AsyncExchange ; - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -// Application call procedure: -// -// construct: AsyncExchange object -// * pack send buffer on device -// initiate: copy send buffer from device to host -// * dispatch asynchronous local work -// complete: send/receive on host, copy receive buffer to device -// * unpack receive buffer on device -// destroy: AsyncExchange object -// -//---------------------------------------------------------------------------- - -#ifdef KOKKOS_HAVE_MPI - -namespace Kokkos { - -template< class ValueType , class Device > -class AsyncExchange< ValueType, Device , Kokkos::ParallelDataMap > { -public: - - typedef Device execution_space ; - typedef Kokkos::ParallelDataMap data_map_type ; - typedef Kokkos::View< ValueType* , execution_space > buffer_dev_type ; - typedef typename buffer_dev_type::HostMirror buffer_host_type ; - -private: - - static const int mpi_tag = 11 ; - - const data_map_type data_map ; - unsigned chunk_size ; - unsigned send_count_max ; - buffer_host_type host_recv_buffer ; - buffer_host_type host_send_buffer ; - buffer_host_type send_msg_buffer ; - buffer_dev_type dev_buffer ; - buffer_dev_type dev_send_buffer ; // Subview for send - buffer_dev_type dev_recv_buffer ; // Subview for receive - std::vector< MPI_Request > recv_request ; - -public: - - const buffer_dev_type & buffer() const { return dev_buffer ; } - - AsyncExchange( const data_map_type & arg_data_map , - const size_t arg_chunk ) - : data_map( arg_data_map ) - , chunk_size( arg_chunk ) - , send_count_max( 0 ) - , host_recv_buffer() - , host_send_buffer() - , send_msg_buffer() - , dev_buffer() - , dev_send_buffer() - , dev_recv_buffer() - , recv_request() - { - const size_t send_msg_count = arg_data_map.host_send.dimension_0(); - const size_t recv_msg_count = arg_data_map.host_recv.dimension_0(); - - const size_t send_msg_length = arg_chunk * arg_data_map.count_send ; - const size_t recv_msg_length = arg_chunk * arg_data_map.count_receive ; - - for ( size_t i = 0 ; i < send_msg_count ; ++i ) { - send_count_max = std::max( send_count_max , - (unsigned) arg_data_map.host_send(i,1) ); - } - - // A single shared buffer on the device can be used for - // send and receive message buffers. - dev_buffer = buffer_dev_type( - std::string("AsyncExchange dev_buffer") , - std::max( send_msg_length , recv_msg_length ) ); - - // Total send subview of the device buffer - dev_send_buffer = - Kokkos::subview( dev_buffer , std::pair( 0 , send_msg_length ) ); - - // Total receive subview of the device buffer - dev_recv_buffer = - Kokkos::subview( dev_buffer , std::pair( 0 , recv_msg_length ) ); - - // Total receive message buffer on the host: - host_recv_buffer = buffer_host_type( - std::string("AsyncExchange host_recv_buffer") , - recv_msg_length ); - - // Total send message buffer on the host: - host_send_buffer = buffer_host_type( - std::string("AsyncExchange host_send_buffer") , - send_msg_length ); - - // Individual send message buffer on the host: - send_msg_buffer = buffer_host_type( - std::string("AsyncExchange send_msg_buffer") , - arg_chunk * send_count_max ); - - // MPI asynchronous receive request handles: - recv_request.assign( recv_msg_count , MPI_REQUEST_NULL ); - } - - //------------------------------------------------------------------------ - - void setup() - { - { // Post receives: - const size_t recv_msg_count = data_map.host_recv.dimension_0(); - - ValueType * ptr = host_recv_buffer.ptr_on_device(); - - for ( size_t i = 0 ; i < recv_msg_count ; ++i ) { - const int proc = data_map.host_recv(i,0); - const int count = data_map.host_recv(i,1) * chunk_size ; - - MPI_Irecv( ptr , count * sizeof(ValueType) , MPI_BYTE , - proc , mpi_tag , data_map.machine.mpi_comm , - & recv_request[i] ); - - ptr += count ; - } - } - - // Copy send buffer from the device to host memory for sending - - Kokkos::deep_copy( host_send_buffer , dev_send_buffer ); - - // Done with the device until communication is complete. - // Application can dispatch asynchronous work on the device. - } - - // Application can dispatch local work to device ... - // No communication progress until main thread calls 'send_receive' - - void send_receive() - { - const size_t recv_msg_count = data_map.host_recv.dimension_0(); - const size_t send_msg_count = data_map.host_send.dimension_0(); - - // Pack and send: - - for ( size_t i = 0 , j = 0 ; i < send_msg_count ; ++i ) { - const int proc = data_map.host_send(i,0); - const int count = data_map.host_send(i,1); - - for ( int k = 0 , km = 0 ; k < count ; ++k , ++j ) { - const int km_end = km + chunk_size ; - int ki = chunk_size * data_map.host_send_item(j); - - for ( ; km < km_end ; ++km , ++ki ) { - send_msg_buffer[km] = host_send_buffer[ki]; - } - } - - // MPI_Ssend blocks until - // (1) a receive is matched for the message and - // (2) the send buffer can be re-used. - // - // It is suggested that MPI_Ssend will have the best performance: - // http://www.mcs.anl.gov/research/projects/mpi/sendmode.html . - - MPI_Ssend( send_msg_buffer.ptr_on_device(), - count * chunk_size * sizeof(ValueType) , MPI_BYTE , - proc , mpi_tag , data_map.machine.mpi_comm ); - } - - // Wait for receives and verify: - - for ( size_t i = 0 ; i < recv_msg_count ; ++i ) { - MPI_Status recv_status ; - int recv_which = 0 ; - int recv_size = 0 ; - - MPI_Waitany( recv_msg_count , & recv_request[0] , - & recv_which , & recv_status ); - - const int recv_proc = recv_status.MPI_SOURCE ; - - MPI_Get_count( & recv_status , MPI_BYTE , & recv_size ); - - // Verify message properly received: - - const int expected_proc = data_map.host_recv(recv_which,0); - const int expected_size = data_map.host_recv(recv_which,1) * - chunk_size * sizeof(ValueType); - - if ( ( expected_proc != recv_proc ) || - ( expected_size != recv_size ) ) { - std::ostringstream msg ; - msg << "AsyncExchange error:" - << " P" << comm::rank( data_map.machine ) - << " received from P" << recv_proc - << " size " << recv_size - << " expected " << expected_size - << " from P" << expected_proc ; - throw std::runtime_error( msg.str() ); - } - } - - // Copy received data to device memory. - - Kokkos::deep_copy( dev_recv_buffer , host_recv_buffer ); - } -}; - -} // namespace Kokkos - -#else /* ! #ifdef KOKKOS_HAVE_MPI */ - -namespace Kokkos { - -template< class ValueType , class Device > -class AsyncExchange< ValueType, Device , Kokkos::ParallelDataMap > { -public: - - typedef Device execution_space ; - typedef Kokkos::ParallelDataMap data_map_type ; - typedef Kokkos::View< ValueType* , execution_space > buffer_dev_type ; - typedef typename buffer_dev_type::HostMirror buffer_host_type ; - - buffer_dev_type dev_buffer ; - -public: - - const buffer_dev_type & buffer() const { return dev_buffer ; } - - AsyncExchange( const data_map_type & , const size_t ) - : dev_buffer() - { } - - //------------------------------------------------------------------------ - - void setup() { } - - void send_receive() { } -}; - -} // namespace Kokkos - -#endif /* ! #ifdef KOKKOS_HAVE_MPI */ - -//---------------------------------------------------------------------------- - -#endif /* #ifndef KOKKOS_PARALLELDATAMAP_HPP */ - - diff --git a/lib/kokkos/example/multi_fem/ParallelMachine.cpp b/lib/kokkos/example/multi_fem/ParallelMachine.cpp deleted file mode 100644 index 0953cab760..0000000000 --- a/lib/kokkos/example/multi_fem/ParallelMachine.cpp +++ /dev/null @@ -1,178 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#if 0 - -#include -#include - -#include - -#include - -#if ! defined( KOKKOS_HAVE_MPI ) -#define MPI_COMM_NULL 0 -#endif - -//------------------------------------------------------------------------ - -namespace Parallel { - -Machine::Machine( int * argc , char *** argv ) - : m_mpi_comm( MPI_COMM_NULL ) - , m_mpi_size(0) - , m_mpi_rank(0) - , m_mpi_gpu(0) -{ - -#if defined( KOKKOS_HAVE_CUDA ) - //------------------------------------ - // Might be using a Cuda aware version of MPI. - // Must select Cuda device before initializing MPI. - { - int i = 1 ; - for ( ; i < *argc && strcmp((*argv)[i],"mpi_cuda") ; ++i ); - - if ( i < *argc ) { - // Determine, if possible, what will be the node-local - // rank of the MPI process once MPI has been initialized. - // This rank is needed to set the Cuda device before 'mvapich' - // is initialized. - - const char * const mvapich_local_rank = getenv("MV2_COMM_WORLD_LOCAL_RANK"); - const char * const slurm_local_rank = getenv("SLURM_LOCALID"); - - const int pre_mpi_local_rank = - 0 != mvapich_local_rank ? atoi( mvapich_local_rank ) : ( - 0 != slurm_local_rank ? atoi( slurm_local_rank ) : ( - -1 ) ); - - if ( 0 <= pre_mpi_local_rank ) { - - const int ngpu = Kokkos::Cuda::detect_device_count(); - - const int cuda_device_rank = pre_mpi_local_rank % ngpu ; - - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice( cuda_device_rank ) ); - - m_mpi_gpu = 1 ; - } - } - } -#endif - - //------------------------------------ - -#if defined( KOKKOS_HAVE_MPI ) - MPI_Init( argc , argv ); - m_mpi_comm = MPI_COMM_WORLD ; - MPI_Comm_size( m_mpi_comm , & m_mpi_size ); - MPI_Comm_rank( m_mpi_comm , & m_mpi_rank ); -#endif - - // Query hwloc after MPI initialization to allow MPI binding: - //------------------------------------ - // Request to use host device: - { - int i = 1 ; - for ( ; i < *argc && strcmp((*argv)[i],"host") ; ++i ); - - if ( i < *argc ) { - - unsigned team_count = Kokkos::hwloc::get_available_numa_count(); - unsigned threads_per_team = Kokkos::hwloc::get_available_cores_per_numa() * - Kokkos::hwloc::get_available_threads_per_core(); - - if ( i + 2 < *argc ) { - team_count = atoi( (*argv)[i+1] ); - threads_per_team = atoi( (*argv)[i+2] ); - } - - Kokkos::Threads::initialize( team_count * threads_per_team ); - } - } - -#if defined( KOKKOS_HAVE_CUDA ) - //------------------------------------ - // Request to use Cuda device and not already initialized. - if ( ! m_mpi_gpu ) { - int i = 1 ; - for ( ; i < *argc && strcmp((*argv)[i],"mpi_cuda") && strcmp((*argv)[i],"cuda") ; ++i ); - - if ( i < *argc ) { - - const int ngpu = Kokkos::Cuda::detect_device_count(); - - const int cuda_device_rank = m_mpi_rank % ngpu ; - - Kokkos::Cuda::initialize( Kokkos::Cuda::SelectDevice( cuda_device_rank ) ); - } - } -#endif - -} - -Machine::~Machine() -{ - Kokkos::Threads::finalize(); -#if defined( KOKKOS_HAVE_CUDA ) - Kokkos::Cuda::finalize(); -#endif -#if defined( KOKKOS_HAVE_MPI ) - MPI_Finalize(); -#endif -} - -void Machine::print_configuration( std::ostream & msg ) const -{ - msg << "MPI [ " << m_mpi_rank << " / " << m_mpi_size << " ]" << std::endl ; - Kokkos::Threads::print_configuration( msg ); -#if defined( KOKKOS_HAVE_CUDA ) - Kokkos::Cuda::print_configuration( msg ); -#endif -} - -} - -#endif /* #if 0 */ - diff --git a/lib/kokkos/example/multi_fem/ParallelMachine.hpp b/lib/kokkos/example/multi_fem/ParallelMachine.hpp deleted file mode 100644 index 1ddf50ab3b..0000000000 --- a/lib/kokkos/example/multi_fem/ParallelMachine.hpp +++ /dev/null @@ -1,118 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#error "ParallelMachine" - -#ifndef PARALLELMACHINE_HPP -#define PARALLELMACHINE_HPP - -//------------------------------------------------------------------------ - -#include - -#include - -//------------------------------------------------------------------------ - -#if defined( KOKKOS_HAVE_MPI ) -#include -#else - typedef int MPI_Comm ; -#endif - -//------------------------------------------------------------------------ -//------------------------------------------------------------------------ - -namespace Parallel { - -/** \brief Hybrid parallel machine with MPI+Kokkos::Threads or MPI+Kokkos::Cuda. - * - * Initialization of MPI and Kokkos device has interdependencies which this - * class manages. The command line and environment variables are queried to initialize - * the Threads or Cuda device: - * - * 1) cuda : initializes Cuda device - * 2) host : initializes Threads device with all hwloc detected cores. - * 3) host #gang #worker : initializes Threads with specified - */ -class Machine { -private: - - MPI_Comm m_mpi_comm ; - int m_mpi_size ; - int m_mpi_rank ; - unsigned m_mpi_gpu ; - unsigned m_gpu_arch ; - - Machine(); - Machine( const Machine & ); - Machine & operator = ( const Machine & ); - -public: - - /** \brief Coordinated initialize MPI, Cuda, or Threads devices from 'main'. */ - Machine( int * argc , char *** argv ); - - ~Machine(); - - MPI_Comm mpi_comm() const { return m_mpi_comm ; } - - int mpi_size() const { return m_mpi_size ; } - int mpi_rank() const { return m_mpi_rank ; } - - /** \brief If using MPI that can directly operate on GPU memory */ - bool mpi_gpu() const { return m_mpi_gpu ; } - - /** \brief If using GPU then what architecture */ - unsigned gpu_arch() const { return m_gpu_arch ; } - - void print_configuration( std::ostream & ) const ; -}; - -} - -//------------------------------------------------------------------------ - -#endif /* #ifndef PARALLELMACHINE_HPP */ - - diff --git a/lib/kokkos/example/multi_fem/SparseLinearSystem.hpp b/lib/kokkos/example/multi_fem/SparseLinearSystem.hpp deleted file mode 100644 index 6ab42da50c..0000000000 --- a/lib/kokkos/example/multi_fem/SparseLinearSystem.hpp +++ /dev/null @@ -1,400 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef SPARSELINEARSYSTEM_HPP -#define SPARSELINEARSYSTEM_HPP - -#include -#include - -#include -#include - -#include - -namespace Kokkos { - -template< typename ScalarType , class Device > -struct CrsMatrix { - typedef Device execution_space ; - typedef ScalarType value_type ; - - typedef StaticCrsGraph< int , execution_space , void , int > graph_type ; - typedef View< value_type* , execution_space > coefficients_type ; - - graph_type graph ; - coefficients_type coefficients ; -}; - -//---------------------------------------------------------------------------- - -namespace Impl { - -template< class Matrix , class OutputVector , class InputVector > -struct Multiply ; - -} -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -template< typename AScalarType , - typename VScalarType , - class DeviceType > -struct Multiply< CrsMatrix , - View , - View > -{ - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type ; - - typedef View< VScalarType*, execution_space, MemoryUnmanaged > vector_type ; - typedef View< const VScalarType*, execution_space, MemoryUnmanaged > vector_const_type ; - - typedef CrsMatrix< AScalarType , execution_space > matrix_type ; - -private: - - matrix_type m_A ; - vector_const_type m_x ; - vector_type m_y ; - -public: - - //-------------------------------------------------------------------------- - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type iRow ) const - { - const size_type iEntryBegin = m_A.graph.row_map[iRow]; - const size_type iEntryEnd = m_A.graph.row_map[iRow+1]; - - double sum = 0 ; - -#if defined( __INTEL_COMPILER ) -#pragma simd reduction(+:sum) -#pragma ivdep - for ( size_type iEntry = iEntryBegin ; iEntry < iEntryEnd ; ++iEntry ) { - sum += m_A.coefficients(iEntry) * m_x( m_A.graph.entries(iEntry) ); - } -#else - for ( size_type iEntry = iEntryBegin ; iEntry < iEntryEnd ; ++iEntry ) { - sum += m_A.coefficients(iEntry) * m_x( m_A.graph.entries(iEntry) ); - } -#endif - - m_y(iRow) = sum ; - } - - Multiply( const matrix_type & A , - const size_type nrow , - const size_type , // ncol , - const vector_type & x , - const vector_type & y ) - : m_A( A ), m_x( x ), m_y( y ) - { - parallel_for( nrow , *this ); - } -}; - -//---------------------------------------------------------------------------- - -} // namespace Impl -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Kokkos { - -//---------------------------------------------------------------------------- - -template< typename AScalarType , - typename VScalarType , - class Device > -class Operator { - typedef CrsMatrix matrix_type ; - typedef View vector_type ; - -private: - const CrsMatrix A ; - - ParallelDataMap data_map ; - AsyncExchange< VScalarType , Device , ParallelDataMap > exchange ; - -public: - - Operator( const ParallelDataMap & arg_data_map , - const CrsMatrix & arg_A ) - : A( arg_A ) - , data_map( arg_data_map ) - , exchange( arg_data_map , 1 ) - {} - - void apply( const View & x , - const View & y ) - { - // Gather off-processor data for 'x' - - PackArray< vector_type >::pack( exchange.buffer() , - data_map.count_interior , - data_map.count_send , x ); - - exchange.setup(); - - // If interior & boundary matrices then could launch interior multiply - - exchange.send_receive(); - - UnpackArray< vector_type >::unpack( x , exchange.buffer() , - data_map.count_owned , - data_map.count_receive ); - - const typename Device::size_type nrow = data_map.count_owned ; - const typename Device::size_type ncol = data_map.count_owned + - data_map.count_receive ; - - Impl::Multiply( A, nrow, ncol, x, y); - } -}; - -//---------------------------------------------------------------------------- - -template< typename AScalarType , typename VScalarType , class Device > -void cgsolve( - const ParallelDataMap data_map , - const CrsMatrix A , - const View b , - const View x , - size_t & iteration , - double & normr , - double & iter_time , - const size_t maximum_iteration = 200 , - const double tolerance = std::numeric_limits::epsilon() ) -{ - typedef View vector_type ; - //typedef View value_type ; // unused - - const size_t count_owned = data_map.count_owned ; - const size_t count_total = data_map.count_owned + data_map.count_receive ; - - Operator matrix_operator( data_map , A ); - - // Need input vector to matvec to be owned + received - vector_type pAll ( "cg::p" , count_total ); - - vector_type p = Kokkos::subview( pAll , std::pair(0,count_owned) ); - vector_type r ( "cg::r" , count_owned ); - vector_type Ap( "cg::Ap", count_owned ); - - /* r = b - A * x ; */ - - /* p = x */ deep_copy( p , x ); - /* Ap = A * p */ matrix_operator.apply( pAll , Ap ); - /* r = b - Ap */ waxpby( count_owned , 1.0 , b , -1.0 , Ap , r ); - /* p = r */ deep_copy( p , r ); - - double old_rdot = dot( count_owned , r , data_map.machine ); - - normr = sqrt( old_rdot ); - iteration = 0 ; - - Kokkos::Impl::Timer wall_clock ; - - while ( tolerance < normr && iteration < maximum_iteration ) { - - /* pAp_dot = dot( p , Ap = A * p ) */ - - /* Ap = A * p */ matrix_operator.apply( pAll , Ap ); - - const double pAp_dot = dot( count_owned , p , Ap , data_map.machine ); - const double alpha = old_rdot / pAp_dot ; - - /* x += alpha * p ; */ axpy( count_owned, alpha, p , x ); - /* r -= alpha * Ap ; */ axpy( count_owned, -alpha, Ap, r ); - - const double r_dot = dot( count_owned , r , data_map.machine ); - const double beta = r_dot / old_rdot ; - - /* p = r + beta * p ; */ xpby( count_owned , r , beta , p ); - - normr = sqrt( old_rdot = r_dot ); - ++iteration ; - } - - iter_time = wall_clock.seconds(); -} - -//---------------------------------------------------------------------------- - -} // namespace Kokkos - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#if defined( KOKKOS_HAVE_CUDA ) - -#if ( CUDA_VERSION < 6000 ) -#pragma message "cusparse_v2.h" -#include -#else -#pragma message "cusparse.h" -#include -#endif - -namespace Kokkos { -namespace Impl { - -struct CudaSparseSingleton { - cusparseHandle_t handle; - cusparseMatDescr_t descra; - - CudaSparseSingleton() - { - cusparseCreate( & handle ); - cusparseCreateMatDescr( & descra ); - cusparseSetMatType( descra , CUSPARSE_MATRIX_TYPE_GENERAL ); - cusparseSetMatIndexBase( descra , CUSPARSE_INDEX_BASE_ZERO ); - } - - static CudaSparseSingleton & singleton(); - -}; - -template<> -struct Multiply< CrsMatrix , - View , - View > -{ - typedef Cuda execution_space ; - typedef execution_space::size_type size_type ; - typedef double scalar_type ; - typedef View< scalar_type* , execution_space > vector_type ; - typedef CrsMatrix< scalar_type , execution_space > matrix_type ; - -public: - - Multiply( const matrix_type & A , - const size_type nrow , - const size_type ncol , - const vector_type & x , - const vector_type & y ) - { - CudaSparseSingleton & s = CudaSparseSingleton::singleton(); - const scalar_type alpha = 1 , beta = 0 ; - - cusparseStatus_t status = - cusparseDcsrmv( s.handle , - CUSPARSE_OPERATION_NON_TRANSPOSE , - nrow , ncol , A.coefficients.dimension_0() , - &alpha , - s.descra , - A.coefficients.ptr_on_device() , - A.graph.row_map.ptr_on_device() , - A.graph.entries.ptr_on_device() , - x.ptr_on_device() , - &beta , - y.ptr_on_device() ); - - if ( CUSPARSE_STATUS_SUCCESS != status ) { - throw std::runtime_error( std::string("ERROR - cusparseDcsrmv " ) ); - } - } -}; - - -template<> -struct Multiply< CrsMatrix , - View , - View > -{ - typedef Cuda execution_space ; - typedef execution_space::size_type size_type ; - typedef float scalar_type ; - typedef View< scalar_type* , execution_space > vector_type ; - typedef CrsMatrix< scalar_type , execution_space > matrix_type ; - -public: - - Multiply( const matrix_type & A , - const size_type nrow , - const size_type ncol , - const vector_type & x , - const vector_type & y ) - { - CudaSparseSingleton & s = CudaSparseSingleton::singleton(); - const scalar_type alpha = 1 , beta = 0 ; - - cusparseStatus_t status = - cusparseScsrmv( s.handle , - CUSPARSE_OPERATION_NON_TRANSPOSE , - nrow , ncol , A.coefficients.dimension_0() , - &alpha , - s.descra , - A.coefficients.ptr_on_device() , - A.graph.row_map.ptr_on_device() , - A.graph.entries.ptr_on_device() , - x.ptr_on_device() , - &beta , - y.ptr_on_device() ); - - if ( CUSPARSE_STATUS_SUCCESS != status ) { - throw std::runtime_error( std::string("ERROR - cusparseDcsrmv " ) ); - } - } -}; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -#endif /* #if defined( KOKKOS_HAVE_CUDA ) */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef SPARSELINEARSYSTEM_HPP */ - diff --git a/lib/kokkos/example/multi_fem/SparseLinearSystemFill.hpp b/lib/kokkos/example/multi_fem/SparseLinearSystemFill.hpp deleted file mode 100644 index 78680cfb6a..0000000000 --- a/lib/kokkos/example/multi_fem/SparseLinearSystemFill.hpp +++ /dev/null @@ -1,276 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef SPARSELINEARSYSTEMFILL_HPP -#define SPARSELINEARSYSTEMFILL_HPP - -#include -#include -#include - -#include -#include - -//---------------------------------------------------------------------------- - -namespace HybridFEM { - -template< class MatrixType , class MeshType , - class elem_matrices_type , - class elem_vectors_type > struct GatherFill ; - - -template< typename ScalarType , - class DeviceType , - unsigned ElemNode , - typename CoordScalarType , - class elem_matrices_type , - class elem_vectors_type > -struct GatherFill< - Kokkos::CrsMatrix< ScalarType , DeviceType > , - FEMesh< CoordScalarType , ElemNode , DeviceType > , - elem_matrices_type , elem_vectors_type > -{ - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type ; - - static const size_type ElemNodeCount = ElemNode ; - - typedef Kokkos::CrsMatrix< ScalarType , execution_space > matrix_type ; - typedef typename matrix_type::coefficients_type coefficients_type ; - typedef Kokkos::View< ScalarType[] , execution_space > vector_type ; - typedef Kokkos::View< size_type[][ElemNodeCount][ElemNodeCount] , execution_space > elem_graph_type ; - - typedef FEMesh< CoordScalarType , ElemNodeCount , execution_space > mesh_type ; - typedef typename mesh_type::node_elem_ids_type node_elem_ids_type ; - -private: - - node_elem_ids_type node_elem_ids ; - elem_graph_type elem_graph ; - elem_matrices_type elem_matrices ; - elem_vectors_type elem_vectors ; - coefficients_type system_coeff ; - vector_type system_rhs ; - -public: - - KOKKOS_INLINE_FUNCTION - void operator()( size_type irow ) const - { - const size_type node_elem_begin = node_elem_ids.row_map[irow]; - const size_type node_elem_end = node_elem_ids.row_map[irow+1]; - - // for each element that a node belongs to - - for ( size_type i = node_elem_begin ; i < node_elem_end ; i++ ) { - - const size_type elem_id = node_elem_ids.entries( i, 0); - const size_type row_index = node_elem_ids.entries( i, 1); - - system_rhs(irow) += elem_vectors(elem_id, row_index); - - // for each node in a particular related element - // gather the contents of the element stiffness - // matrix that belong in irow - - for ( size_type j = 0 ; j < ElemNodeCount ; ++j ){ - const size_type A_index = elem_graph( elem_id , row_index , j ); - - system_coeff( A_index ) += elem_matrices( elem_id, row_index, j ); - } - } - } - - - static void apply( const matrix_type & matrix , - const vector_type & rhs , - const mesh_type & mesh , - const elem_graph_type & elem_graph , - const elem_matrices_type & elem_matrices , - const elem_vectors_type & elem_vectors ) - { - const size_t row_count = matrix.graph.row_map.dimension_0() - 1 ; - GatherFill op ; - op.node_elem_ids = mesh.node_elem_ids ; - op.elem_graph = elem_graph ; - op.elem_matrices = elem_matrices ; - op.elem_vectors = elem_vectors ; - op.system_coeff = matrix.coefficients ; - op.system_rhs = rhs ; - - parallel_for( row_count , op ); - } -}; - -} /* namespace HybridFEM */ - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace HybridFEM { - -template< class GraphType , class MeshType > -struct GraphFactory { - typedef GraphType graph_type ; - typedef MeshType mesh_type ; - typedef typename graph_type::execution_space execution_space ; - typedef typename execution_space::size_type size_type ; - - static const unsigned ElemNodeCount = mesh_type::element_node_count ; - - typedef Kokkos::View< size_type[][ElemNodeCount][ElemNodeCount] , execution_space > element_map_type ; - - static - void - create( const mesh_type & mesh , - graph_type & graph , - element_map_type & elem_map ) - { - typename mesh_type::node_elem_ids_type::HostMirror - node_elem_ids = create_mirror( mesh.node_elem_ids ); - - typename mesh_type::elem_node_ids_type::HostMirror - elem_node_ids = create_mirror( mesh.elem_node_ids ); - - typedef typename element_map_type::HostMirror element_map_host_type ; - - deep_copy( elem_node_ids , mesh.elem_node_ids ); - deep_copy( node_elem_ids.entries , mesh.node_elem_ids.entries ); - - const size_t owned_node = mesh.parallel_data_map.count_owned ; - const size_t total_elem = mesh.elem_node_ids.dimension_0(); - - if ( total_elem ) { - elem_map = element_map_type( std::string("element_map"), total_elem ); - } - - element_map_host_type elem_map_host = create_mirror( elem_map ); - - //------------------------------------ - // Node->node mapping for the CrsMatrix graph - - std::vector< std::vector< unsigned > > node_node_ids( owned_node ); - std::vector< unsigned > node_node_begin( owned_node ); - - size_t offset = 0 ; - for ( size_t i = 0 ; i < owned_node ; ++i ) { - const size_t j_end = node_elem_ids.row_map[i+1]; - size_t j = node_elem_ids.row_map[i]; - - node_node_begin[i] = offset ; - - std::vector< unsigned > & work = node_node_ids[i] ; - - for ( ; j < j_end ; ++j ) { - const size_t elem_id = node_elem_ids.entries(j,0); - for ( size_t k = 0 ; k < ElemNodeCount ; ++k ) { - work.push_back( elem_node_ids( elem_id , k ) ); - } - } - - std::sort( work.begin() , work.end() ); - - work.erase( std::unique( work.begin() , work.end() ) , work.end() ); - - offset += work.size(); - } - - graph = Kokkos::create_staticcrsgraph< graph_type >( "node_node_ids" , node_node_ids ); - - //------------------------------------ - // ( element , node_row , node_column ) -> matrix_crs_column - - for ( size_t elem_id = 0 ; elem_id < total_elem ; ++elem_id ) { - for ( size_t i = 0 ; i < ElemNodeCount ; ++i ) { - - const size_t node_row = elem_node_ids( elem_id , i ); - const size_t node_row_begin = node_node_begin[ node_row ]; - const std::vector< unsigned > & column = node_node_ids[ node_row ] ; - - if ( owned_node <= node_row ) { - for ( unsigned j = 0 ; j < ElemNodeCount ; ++j ) { - elem_map_host( elem_id , i , j ) = std::numeric_limits::max(); - } - } - else { - - for ( unsigned j = 0 ; j < ElemNodeCount ; ++j ) { - const size_type node_col = elem_node_ids( elem_id , j ); - - int col_search = 0 ; - - for ( int len = column.size() ; 0 < len ; ) { - - const int half = len >> 1; - const int middle = col_search + half ; - - if ( column[middle] < node_col ){ - col_search = middle + 1 ; - len -= half + 1 ; - } - else { - len = half ; - } - } -if ( node_col != column[col_search] ) { - throw std::runtime_error(std::string("Failed")); -} - elem_map_host( elem_id , i , j ) = col_search + node_row_begin ; - } - } - } - } - - deep_copy( elem_map , elem_map_host ); - } -}; - -} // namespace HybridFEM - - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -#endif /* #ifndef SPARSELINEARSYSTEMFILL_HPP */ - diff --git a/lib/kokkos/example/multi_fem/SparseLinearSystem_Cuda.hpp b/lib/kokkos/example/multi_fem/SparseLinearSystem_Cuda.hpp deleted file mode 100644 index 3b22d4c5d0..0000000000 --- a/lib/kokkos/example/multi_fem/SparseLinearSystem_Cuda.hpp +++ /dev/null @@ -1,164 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef SPARSELINEARSYSTEM_CUDA_HPP -#define SPARSELINEARSYSTEM_CUDA_HPP - -#if defined( BUILD_FROM_CU_FILE ) - -#include -#include - -namespace Kokkos { -namespace Impl { - - -struct CudaSparseSingleton { - cusparseHandle_t handle; - cusparseMatDescr_t descra; - - CudaSparseSingleton() - { - cusparseCreate( & handle ); - cusparseCreateMatDescr( & descra ); - cusparseSetMatType( descra , CUSPARSE_MATRIX_TYPE_GENERAL ); - cusparseSetMatIndexBase( descra , CUSPARSE_INDEX_BASE_ZERO ); - } - - static CudaSparseSingleton & singleton(); - -}; - -CudaSparseSingleton & CudaSparseSingleton::singleton() -{ static CudaSparseSingleton s ; return s ; } - - -template<> -struct Multiply< CrsMatrix , - View , - View > -{ - typedef Cuda execution_space ; - typedef execution_space::size_type size_type ; - typedef double scalar_type ; - typedef View< scalar_type* , execution_space > vector_type ; - typedef CrsMatrix< scalar_type , execution_space > matrix_type ; - -public: - - Multiply( const matrix_type & A , - const size_type nrow , - const size_type ncol , - const vector_type & x , - const vector_type & y ) - { - CudaSparseSingleton & s = CudaSparseSingleton::singleton(); - const scalar_type alpha = 1 , beta = 0 ; - - cusparseStatus_t status = - cusparseDcsrmv( s.handle , - CUSPARSE_OPERATION_NON_TRANSPOSE , - nrow , ncol , A.coefficients.dimension_0() , - &alpha , - s.descra , - A.coefficients.ptr_on_device() , - A.graph.row_map.ptr_on_device() , - A.graph.entries.ptr_on_device() , - x.ptr_on_device() , - &beta , - y.ptr_on_device() ); - - if ( CUSPARSE_STATUS_SUCCESS != status ) { - throw std::runtime_error( std::string("ERROR - cusparseDcsrmv " ) ); - } - } -}; - - -template<> -struct Multiply< CrsMatrix , - View , - View > -{ - typedef Cuda execution_space ; - typedef execution_space::size_type size_type ; - typedef float scalar_type ; - typedef View< scalar_type* , execution_space > vector_type ; - typedef CrsMatrix< scalar_type , execution_space > matrix_type ; - -public: - - Multiply( const matrix_type & A , - const size_type nrow , - const size_type ncol , - const vector_type & x , - const vector_type & y ) - { - CudaSparseSingleton & s = CudaSparseSingleton::singleton(); - const scalar_type alpha = 1 , beta = 0 ; - - cusparseStatus_t status = - cusparseScsrmv( s.handle , - CUSPARSE_OPERATION_NON_TRANSPOSE , - nrow , ncol , A.coefficients.dimension_0() , - &alpha , - s.descra , - A.coefficients.ptr_on_device() , - A.graph.row_map.ptr_on_device() , - A.graph.entries.ptr_on_device() , - x.ptr_on_device() , - &beta , - y.ptr_on_device() ); - - if ( CUSPARSE_STATUS_SUCCESS != status ) { - throw std::runtime_error( std::string("ERROR - cusparseDcsrmv " ) ); - } - } -}; - -} /* namespace Impl */ -} /* namespace Kokkos */ - -#endif /* #if defined( __CUDACC__ ) */ -#endif /* #ifndef SPARSELINEARSYSTEM_CUDA_HPP */ - diff --git a/lib/kokkos/example/multi_fem/TestBoxMeshFixture.hpp b/lib/kokkos/example/multi_fem/TestBoxMeshFixture.hpp deleted file mode 100644 index 9cc32b6b10..0000000000 --- a/lib/kokkos/example/multi_fem/TestBoxMeshFixture.hpp +++ /dev/null @@ -1,242 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef TESTFEMESHBOXFIXTURE_HPP -#define TESTFEMESHBOXFIXTURE_HPP - -#include -#include -#include -#include -#include -#include - -#include - -//---------------------------------------------------------------------------- - -namespace TestFEMesh { - -template< class ViewType > -struct VerifyUnpack ; - -template< typename DeviceType, typename T > -struct VerifyUnpack< Kokkos::View< T*[3] , DeviceType > > -{ - typedef DeviceType execution_space ; - typedef typename execution_space::size_type size_type ; - typedef size_type value_type ; - - typedef Kokkos::View< T* , execution_space > buffer_type ; - typedef Kokkos::View< T*[3] , execution_space > array_type ; - -private: - - array_type node_coords ; - buffer_type buffer ; - size_type node_begin ; - -public: - - KOKKOS_INLINE_FUNCTION - static void init( value_type & update ) - { update = 0 ; } - - KOKKOS_INLINE_FUNCTION - static void join( volatile value_type & update , - const volatile value_type & source ) - { update += source ; } - - KOKKOS_INLINE_FUNCTION - void operator()( const size_type i , value_type & update ) const - { - const size_type node_id = i + node_begin ; - const size_type k = i * 3 ; - - const long xb = buffer[k]; - const long yb = buffer[k+1]; - const long zb = buffer[k+2]; - const long xn = node_coords(node_id,0); - const long yn = node_coords(node_id,1); - const long zn = node_coords(node_id,2); - - if ( xb != xn || yb != yn || zb != zn ) { - printf("TestFEMesh::VerifyUnpack failed at %d : node %d : { %ld %ld %ld } != { %ld %ld %ld }\n", - (int)i,(int)node_id, xb,yb,zb, xn, yn, zn ); - ++update ; - } - } - - static inline - size_type unpack( const array_type & arg_node_coords , - const size_type arg_node_begin , - const size_type arg_node_count , - const buffer_type & arg_buffer ) - { - VerifyUnpack op ; - op.node_coords = arg_node_coords ; - op.buffer = arg_buffer ; - op.node_begin = arg_node_begin ; - size_type count = 0 ; - Kokkos::parallel_reduce( arg_node_count , op , count ); - return count ; - } -}; - -} - -//---------------------------------------------------------------------------- - -#ifdef KOKKOS_HAVE_MPI - -namespace TestFEMesh { - -template< typename coordinate_scalar_type , - unsigned ElemNodeCount , - class Device > -void verify_parallel( - const HybridFEM::FEMesh< coordinate_scalar_type , - ElemNodeCount , - Device > & mesh ) -{ - typedef HybridFEM::FEMesh< coordinate_scalar_type, ElemNodeCount, Device > femesh_type ; - typedef typename femesh_type::node_coords_type node_coords_type ; - - comm::Machine machine = mesh.parallel_data_map.machine ; - - // Communicate node coordinates to verify communication and setup. - - const size_t chunk_size = 3 ; - - Kokkos::AsyncExchange< coordinate_scalar_type, Device, Kokkos::ParallelDataMap > - exchange( mesh.parallel_data_map , chunk_size ); - - const size_t send_begin = mesh.parallel_data_map.count_interior ; - const size_t send_count = mesh.parallel_data_map.count_send ; - - const size_t recv_begin = mesh.parallel_data_map.count_owned ; - const size_t recv_count = mesh.parallel_data_map.count_receive ; - - typedef Kokkos::PackArray< node_coords_type > pack_type ; - - pack_type::pack( exchange.buffer(), send_begin, send_count, mesh.node_coords ); - - exchange.setup(); - - // Launch local-action device kernels - - exchange.send_receive(); - - unsigned long local[3] ; - local[0] = mesh.parallel_data_map.count_owned ; - local[1] = mesh.parallel_data_map.count_receive ; - local[2] = TestFEMesh::VerifyUnpack< node_coords_type >::unpack( mesh.node_coords, recv_begin, recv_count, exchange.buffer() ); - - unsigned long global[3] = { 0 , 0 , 0 }; - - MPI_Allreduce( local , global , - 3 , MPI_UNSIGNED_LONG , MPI_SUM , machine.mpi_comm ); - - if ( 0 == comm::rank( machine ) ) { - std::cout << ( global[2] ? "FAILED" : "PASSED" ) - << ": TestFEMesh::verify_parallel " - << "NP(" << comm::size( machine ) - << ") total_node(" << global[0] - << ") verified_nodes(" << global[1] - << ") failed_nodes(" << global[2] - << ")" << std::endl ; - } -} - -} // namespace TestFEMesh - -#else /* ! #ifdef KOKKOS_HAVE_MPI */ - -namespace TestFEMesh { - -template< typename coordinate_scalar_type , - unsigned ElemNodeCount , - class Device > -void verify_parallel( - const HybridFEM::FEMesh< coordinate_scalar_type , - ElemNodeCount , - Device > & ) -{} - -} // namespace TestFEMesh - -#endif /* ! #ifdef KOKKOS_HAVE_MPI */ - -//---------------------------------------------------------------------------- - -template< class Device > -void test_box_fixture( comm::Machine machine , - const size_t gang_count , - const size_t nodes_nx , - const size_t nodes_ny , - const size_t nodes_nz ) -{ - typedef long coordinate_scalar_type ; - typedef FixtureElementHex8 fixture_element_type ; - - typedef BoxMeshFixture< coordinate_scalar_type , - Device , - fixture_element_type > fixture_type ; - - typedef typename fixture_type::FEMeshType mesh_type ; - - const size_t proc_count = comm::size( machine ); - const size_t proc_local = comm::rank( machine ) ; - - mesh_type mesh = - fixture_type::create( proc_count , proc_local , gang_count , - nodes_nx - 1 , nodes_ny - 1 , nodes_nz - 1 ); - - mesh.parallel_data_map.machine = machine ; - - TestFEMesh::verify_parallel( mesh ); -} - -#endif /* #ifndef TESTFEMESHBOXFIXTURE_HPP */ - - diff --git a/lib/kokkos/example/multi_fem/TestBoxMeshPartition.cpp b/lib/kokkos/example/multi_fem/TestBoxMeshPartition.cpp deleted file mode 100644 index ffaeeb6af5..0000000000 --- a/lib/kokkos/example/multi_fem/TestBoxMeshPartition.cpp +++ /dev/null @@ -1,172 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -void test_box_partition( bool print ) -{ - const size_t np_max = 10000 ; - - const BoxBoundsLinear use_box ; - - BoxType root_box ; - - root_box[0][0] = 0 ; root_box[0][1] = 100 ; - root_box[1][0] = 0 ; root_box[1][1] = 200 ; - root_box[2][0] = 0 ; root_box[2][1] = 300 ; - - const size_t cell_total = - ( root_box[0][1] - root_box[0][0] ) * - ( root_box[1][1] - root_box[1][0] ) * - ( root_box[2][1] - root_box[2][0] ); - - for ( size_t np = 2 ; np < np_max ; np = 2 * ( np + 1 ) ) { - - std::vector part_boxes( np ); - - box_partition_rcb( root_box , part_boxes ); - - size_t cell_goal = ( cell_total + np - 1 ) / np ; - size_t cell_max = 0 ; - - for ( size_t i = 0 ; i < np ; ++i ) { - cell_max = std::max( cell_max , count( part_boxes[i] ) ); - } - - if ( print ) { - std::cout << std::endl - << "box_part( " << np - << " ) max( " << cell_max - << " ) goal( " << cell_goal - << " ) ratio( " << double(cell_max) / double(cell_goal) - << " )" << std::endl ; - } - - const size_t nsample = std::min(np,(size_t)4); - const size_t stride = ( np + nsample - 1 ) / nsample ; - - for ( size_t my_part = 0 ; my_part < np ; my_part += stride ) { - BoxType my_use_box ; - std::vector my_use_id_map ; - size_t my_count_interior ; - size_t my_count_owned ; - size_t my_count_uses ; - std::vector my_recv_counts ; - std::vector > my_send_map ; - - size_t count_verify = 0 ; - - box_partition_maps( root_box , part_boxes , - use_box , my_part , - my_use_box , my_use_id_map , - my_count_interior , - my_count_owned , - my_count_uses , - my_recv_counts , - my_send_map ); - - count_verify = my_count_owned ; - - if ( print ) { - std::cout << " my_part(" << my_part << ") layout { " - << "P" << my_part - << "(" << my_count_interior - << "," << ( my_count_owned - my_count_interior ) - << ")" ; - } - - for ( size_t i = 1 ; i < np ; ++i ) { - if ( my_recv_counts[i] ) { - count_verify += my_recv_counts[i] ; - const size_t ip = ( my_part + i ) % np ; - - if ( print ) { - std::cout << " P" << ip << "(" << my_recv_counts[i] << ")" ; - } - - // Compare recv & send lists - - BoxType ip_use_box ; - std::vector ip_use_id_map ; - size_t ip_count_interior ; - size_t ip_count_owned ; - size_t ip_count_uses ; - std::vector ip_recv_counts ; - std::vector > ip_send_map ; - - box_partition_maps( root_box , part_boxes , - use_box , ip , - ip_use_box , ip_use_id_map , - ip_count_interior , - ip_count_owned , - ip_count_uses , - ip_recv_counts , - ip_send_map ); - - // Sent by ip, received by my_part: - - const BoxType recv_send = intersect( part_boxes[ip] , my_use_box ); - const size_t recv_send_count = count( recv_send ); - - const size_t j = ( my_part + np - ip ) % np ; - - if ( recv_send_count != my_recv_counts[i] || - recv_send_count != ip_send_map[j].size() ) { - throw std::runtime_error( std::string("bad recv/send map") ); - } - } - } - if ( print ) { std::cout << " }" << std::endl ; } - - if ( count_verify != my_count_uses ) { - throw std::runtime_error( std::string("bad partition map") ); - } - } - } -} - - diff --git a/lib/kokkos/example/multi_fem/TestCuda.cpp b/lib/kokkos/example/multi_fem/TestCuda.cpp deleted file mode 100644 index 11370a5350..0000000000 --- a/lib/kokkos/example/multi_fem/TestCuda.cpp +++ /dev/null @@ -1,192 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include - -#include -#include -#include -#include - -#include - -#if defined( KOKKOS_HAVE_CUDA ) - -//---------------------------------------------------------------------------- - -namespace Kokkos { -namespace Impl { - -CudaSparseSingleton & CudaSparseSingleton::singleton() -{ static CudaSparseSingleton s ; return s ; } - -} -} - -//---------------------------------------------------------------------------- - -void test_cuda_query( comm::Machine machine ) -{ - const size_t comm_rank = comm::rank( machine ); - std::cout << "P" << comm_rank - << ": Cuda device_count = " - << Kokkos::Cuda::detect_device_count() - << std::endl ; -} - -//---------------------------------------------------------------------------- - -void test_cuda_fixture( comm::Machine machine , - size_t nx , size_t ny , size_t nz ) -{ - const size_t comm_rank = comm::rank( machine ); - const size_t comm_size = comm::size( machine ); - const size_t dev_count = Kokkos::Cuda::detect_device_count(); - const size_t dev_rank = - dev_count && dev_count <= comm_size ? comm_rank % dev_count : 0 ; - const size_t gang_count = 0 ; - - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::SelectDevice select_device( dev_rank ); - Kokkos::Cuda::initialize( select_device ); - test_box_fixture( machine , gang_count , nx , ny , nz ); - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); -} - -//---------------------------------------------------------------------------- - -void test_cuda_implicit( comm::Machine machine , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ) -{ - const size_t comm_rank = comm::rank( machine ); - const size_t comm_size = comm::size( machine ); - const size_t dev_count = Kokkos::Cuda::detect_device_count(); - const size_t dev_rank = - dev_count && dev_count <= comm_size ? comm_rank % dev_count : 0 ; - const size_t gang_count = 0 ; - - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::SelectDevice select_device( dev_rank ); - Kokkos::Cuda::initialize( select_device ); - HybridFEM::Implicit::driver( "Cuda" , machine , gang_count , elem_count_begin , elem_count_end , count_run ); - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); -} - -//---------------------------------------------------------------------------- - -void test_cuda_explicit( comm::Machine machine , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ) -{ - const size_t comm_rank = comm::rank( machine ); - const size_t comm_size = comm::size( machine ); - const size_t dev_count = Kokkos::Cuda::detect_device_count(); - const size_t dev_rank = - dev_count && dev_count <= comm_size ? comm_rank % dev_count : 0 ; - const size_t gang_count = 0 ; - - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::SelectDevice select_device( dev_rank ); - Kokkos::Cuda::initialize( select_device ); - Explicit::driver( "Cuda" , machine , gang_count , elem_count_begin , elem_count_end , count_run ); - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); -} - -//---------------------------------------------------------------------------- - -void test_cuda_nonlinear( comm::Machine machine , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ) -{ - const size_t comm_rank = comm::rank( machine ); - const size_t comm_size = comm::size( machine ); - const size_t dev_count = Kokkos::Cuda::detect_device_count(); - const size_t dev_rank = - dev_count && dev_count <= comm_size ? comm_rank % dev_count : 0 ; - const size_t gang_count = 0 ; - - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::SelectDevice select_device( dev_rank ); - Kokkos::Cuda::initialize( select_device ); - - typedef Kokkos::Cuda device ; - typedef FixtureElementHex8 hex8 ; - HybridFEM::Nonlinear::driver( "Cuda" , machine , gang_count , elem_count_begin , elem_count_end , count_run ); - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); -} - -void test_cuda_nonlinear_quadratic( comm::Machine machine , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ) -{ - const size_t comm_rank = comm::rank( machine ); - const size_t comm_size = comm::size( machine ); - const size_t dev_count = Kokkos::Cuda::detect_device_count(); - const size_t dev_rank = - dev_count && dev_count <= comm_size ? comm_rank % dev_count : 0 ; - const size_t gang_count = 0 ; - - Kokkos::HostSpace::execution_space::initialize(); - Kokkos::Cuda::SelectDevice select_device( dev_rank ); - Kokkos::Cuda::initialize( select_device ); - - typedef Kokkos::Cuda device ; - typedef FixtureElementHex27 hex27 ; - HybridFEM::Nonlinear::driver( "Cuda" , machine , gang_count , elem_count_begin , elem_count_end , count_run ); - Kokkos::Cuda::finalize(); - Kokkos::HostSpace::execution_space::finalize(); -} - -//---------------------------------------------------------------------------- - -#endif /* #if defined( KOKKOS_HAVE_CUDA ) */ - diff --git a/lib/kokkos/example/multi_fem/TestHost.cpp b/lib/kokkos/example/multi_fem/TestHost.cpp deleted file mode 100644 index facdd0f28a..0000000000 --- a/lib/kokkos/example/multi_fem/TestHost.cpp +++ /dev/null @@ -1,137 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -// Must be included first on Intel-Phi systems due to -// redefinition of SEEK_SET in . - -#include - -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -#include - -#include -#include -#include -#include -#include -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -void test_host_fixture( comm::Machine machine , - size_t gang_count , - size_t gang_worker_count , - size_t nx , size_t ny , size_t nz ) -{ - Kokkos::HostSpace::execution_space::initialize( gang_count * gang_worker_count ); - test_box_fixture( machine , gang_count , nx , ny , nz ); - Kokkos::HostSpace::execution_space::finalize(); -} - -//---------------------------------------------------------------------------- - -void test_host_implicit( comm::Machine machine , - size_t gang_count , - size_t gang_worker_count , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ) -{ - Kokkos::HostSpace::execution_space::initialize( gang_count * gang_worker_count ); - HybridFEM::Implicit::driver( "Threads" , machine , gang_count , elem_count_begin , elem_count_end , count_run ); - Kokkos::HostSpace::execution_space::finalize(); -} - -//---------------------------------------------------------------------------- - -void test_host_explicit( comm::Machine machine , - size_t gang_count , - size_t gang_worker_count , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ) -{ - Kokkos::HostSpace::execution_space::initialize( gang_count * gang_worker_count ); - Explicit::driver( "Threads" , machine , gang_count , elem_count_begin , elem_count_end , count_run ); - Kokkos::HostSpace::execution_space::finalize(); -} - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -void test_host_nonlinear( comm::Machine machine , - size_t gang_count , - size_t gang_worker_count , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ) -{ - Kokkos::HostSpace::execution_space::initialize( gang_count * gang_worker_count ); - typedef FixtureElementHex8 hex8 ; - typedef Kokkos::HostSpace::execution_space device ; - HybridFEM::Nonlinear::driver( "Threads" , machine , gang_count , elem_count_begin , elem_count_end , count_run ); - Kokkos::HostSpace::execution_space::finalize(); -} - -void test_host_nonlinear_quadratic( comm::Machine machine , - size_t gang_count , - size_t gang_worker_count , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ) -{ - Kokkos::HostSpace::execution_space::initialize( gang_count * gang_worker_count ); - typedef FixtureElementHex27 hex27 ; - typedef Kokkos::HostSpace::execution_space device ; - HybridFEM::Nonlinear::driver( "Threads" , machine , gang_count , elem_count_begin , elem_count_end , count_run ); - Kokkos::HostSpace::execution_space::finalize(); -} - -//---------------------------------------------------------------------------- - - diff --git a/lib/kokkos/example/multi_fem/TestHybridFEM.cpp b/lib/kokkos/example/multi_fem/TestHybridFEM.cpp deleted file mode 100644 index 1bbd74e4d7..0000000000 --- a/lib/kokkos/example/multi_fem/TestHybridFEM.cpp +++ /dev/null @@ -1,348 +0,0 @@ -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER - -// Must be included first on Intel-Phi systems due to -// redefinition of SEEK_SET in . - -#include - -#include -#include -#include -#include - -//---------------------------------------------------------------------------- - -void test_box_partition( bool print ); - -//---------------------------------------------------------------------------- - -void test_host_fixture( comm::Machine machine , - size_t gang_count , - size_t gang_worker_count , - size_t nx , size_t ny , size_t nz ); - -void test_host_implicit( comm::Machine machine , - size_t gang_count , - size_t gang_worker_count , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ); - -void test_host_explicit( comm::Machine machine , - size_t gang_count , - size_t gang_worker_count , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ); - -void test_host_nonlinear( comm::Machine machine , - size_t gang_count , - size_t gang_worker_count , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ); - -void test_host_nonlinear_quadratic( comm::Machine machine , - size_t gang_count , - size_t gang_worker_count , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ); - - -//---------------------------------------------------------------------------- - -void test_cuda_query( comm::Machine ); - -void test_cuda_fixture( comm::Machine machine , - size_t nx , size_t ny , size_t nz ); - -void test_cuda_implicit( comm::Machine machine , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ); - -void test_cuda_explicit( comm::Machine machine , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ); - -void test_cuda_nonlinear( comm:: Machine machine , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ); - -void test_cuda_nonlinear_quadratic( comm::Machine machine , - size_t elem_count_begin , - size_t elem_count_end , - size_t count_run ); - - -//---------------------------------------------------------------------------- - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace { - -bool run_host( std::istream & input , - comm::Machine machine , - const size_t host_gang_count , - const size_t host_gang_worker_count ) -{ - bool cmd_error = false ; - - std::string which ; input >> which ; - - if ( which == std::string("fixture") ) { - - size_t nx = 0 , ny = 0 , nz = 0 ; - input >> nx >> ny >> nz ; - test_host_fixture( machine , host_gang_count , host_gang_worker_count , nx , ny , nz ); - - } - else if ( which == std::string("explicit") ) { - - size_t mesh_node_begin = 100 ; - size_t mesh_node_end = 300 ; - size_t run = 1 ; - input >> mesh_node_begin >> mesh_node_end >> run ; - test_host_explicit( machine , host_gang_count , host_gang_worker_count , mesh_node_begin , mesh_node_end , run ); - - } - else if ( which == std::string("implicit") ) { - - size_t mesh_node_begin = 100 ; - size_t mesh_node_end = 300 ; - size_t run = 1 ; - input >> mesh_node_begin >> mesh_node_end >> run ; - test_host_implicit( machine , host_gang_count , host_gang_worker_count , mesh_node_begin , mesh_node_end , run ); - - } - else if ( which == std::string("nonlinear") ) { - - size_t mesh_node_begin = 100 ; - size_t mesh_node_end = 300 ; - size_t run = 1 ; - input >> mesh_node_begin >> mesh_node_end >> run ; - test_host_nonlinear( machine , host_gang_count , host_gang_worker_count , mesh_node_begin , mesh_node_end , run ); - - } - else if ( which == std::string("nonlinear_quadratic") ) { - - size_t mesh_node_begin = 100 ; - size_t mesh_node_end = 300 ; - size_t run = 1 ; - input >> mesh_node_begin >> mesh_node_end >> run ; - test_host_nonlinear_quadratic( machine , host_gang_count , host_gang_worker_count , mesh_node_begin , mesh_node_end , run ); - - } - else { - cmd_error = true ; - } - - return cmd_error ; -} - -#if defined( KOKKOS_HAVE_CUDA ) -bool run_cuda( std::istream & input , comm::Machine machine ) -{ - bool cmd_error = false ; - - std::string which ; input >> which ; - - if ( which == std::string("fixture") ) { - - size_t nx = 0 , ny = 0 , nz = 0 ; - input >> nx >> ny >> nz ; - test_cuda_fixture( machine , nx , ny , nz ); - - } - else if ( which == std::string("explicit") ) { - - size_t mesh_node_begin = 100 ; - size_t mesh_node_end = 300 ; - size_t run = 1 ; - input >> mesh_node_begin >> mesh_node_end >> run ; - test_cuda_explicit( machine , mesh_node_begin , mesh_node_end , run ); - - } - else if ( which == std::string("implicit") ) { - - size_t mesh_node_begin = 100 ; - size_t mesh_node_end = 300 ; - size_t run = 1 ; - input >> mesh_node_begin >> mesh_node_end >> run ; - test_cuda_implicit( machine , mesh_node_begin , mesh_node_end , run ); - - } - else if ( which == std::string("nonlinear") ) { - - size_t mesh_node_begin = 100 ; - size_t mesh_node_end = 300 ; - size_t run = 1 ; - input >> mesh_node_begin >> mesh_node_end >> run ; - test_cuda_nonlinear( machine , mesh_node_begin , mesh_node_end , run ); - - } - else if ( which == std::string("nonlinear_quadratic") ) { - - size_t mesh_node_begin = 100 ; - size_t mesh_node_end = 300 ; - size_t run = 1 ; - input >> mesh_node_begin >> mesh_node_end >> run ; - test_cuda_nonlinear_quadratic( machine , mesh_node_begin , mesh_node_end , run ); - - } - else { - cmd_error = true ; - } - - return cmd_error ; -} -#endif - -void run( const std::string & argline , comm::Machine machine ) -{ - const unsigned numa_count = Kokkos::hwloc::get_available_numa_count(); - const unsigned cores_per_numa = Kokkos::hwloc::get_available_cores_per_numa(); - const unsigned threads_per_core = Kokkos::hwloc::get_available_threads_per_core(); - - std::istringstream input( argline ); - - bool cmd_error = false ; - - std::string which ; input >> which ; - - if ( which == std::string("query") ) { - std::cout << "P" << comm::rank( machine ) - << ": hwloc { NUMA[" << numa_count << "]" - << " CORE[" << cores_per_numa << "]" - << " PU[" << threads_per_core << "] }" - << std::endl ; -#if defined( KOKKOS_HAVE_CUDA ) - test_cuda_query( machine ); -#endif - } - else if ( which == std::string("partition") ) { - if ( 0 == comm::rank( machine ) ) { - test_box_partition( false /* print flag */ ); - } - } - else { - if ( which == std::string("host") ) { - size_t host_gang_count = 0 ; - size_t host_gang_worker_count = 1 ; - - input >> host_gang_count ; - input >> host_gang_worker_count ; - - cmd_error = run_host( input , machine , host_gang_count , host_gang_worker_count ); - } - else if ( which == std::string("host-all") ) { - size_t host_gang_count = numa_count ; - size_t host_gang_worker_count = cores_per_numa * threads_per_core ; - - cmd_error = run_host( input , machine , host_gang_count , host_gang_worker_count ); - } - else if ( which == std::string("host-most") ) { - size_t host_gang_count = numa_count ; - size_t host_gang_worker_count = ( cores_per_numa - 1 ) * threads_per_core ; - - cmd_error = run_host( input , machine , host_gang_count , host_gang_worker_count ); - } -#if defined( KOKKOS_HAVE_CUDA ) - else if ( which == std::string("cuda") ) { - cmd_error = run_cuda( input , machine ); - } -#endif - else { - cmd_error = true ; - } - } - - if ( cmd_error && 0 == comm::rank( machine ) ) { - std::cout << "Expecting command line with" << std::endl - << " query" << std::endl - << " partition" << std::endl - << " host NumNumaNode NumThreadPerNode " << std::endl - << " host-all " << std::endl - << " host-most " << std::endl - << " cuda " << std::endl - << "where is" << std::endl - << " fixture NumElemX NumElemY NumElemZ" << std::endl - << " implicit NumElemBegin NumElemEnd NumRun" << std::endl - << " explicit NumElemBegin NumElemEnd NumRun" << std::endl - << " nonlinear NumElemBegin NumElemEnd NumRun" << std::endl - << " nonlinear_quadratic NumElemBegin NumElemEnd NumRun" << std::endl ; - - } -} - -} // namespace - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -int main( int argc , char ** argv ) -{ - comm::Machine machine = comm::Machine::init( & argc , & argv ); - - const unsigned comm_rank = comm::rank( machine ); - - const std::string argline = comm::command_line( machine , argc , argv ); - - try { - run( argline , machine ); - } - catch( const std::exception & x ) { - std::cerr << "P" << comm_rank << " throw: " << x.what() << std::endl ; - } - catch( ... ) { - std::cerr << "P" << comm_rank << " throw: unknown exception" << std::endl ; - } - - comm::Machine::finalize(); - - return 0 ; -} - diff --git a/lib/kokkos/example/query_device/query_device.cpp b/lib/kokkos/example/query_device/query_device.cpp deleted file mode 100644 index ced8cc4e95..0000000000 --- a/lib/kokkos/example/query_device/query_device.cpp +++ /dev/null @@ -1,100 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -#include - -#if defined( KOKKOS_HAVE_MPI ) -#include -#endif - -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -int main( int argc , char ** argv ) -{ - std::ostringstream msg ; - -#if defined( KOKKOS_HAVE_MPI ) - - MPI_Init( & argc , & argv ); - - int mpi_rank = 0 ; - - MPI_Comm_rank( MPI_COMM_WORLD , & mpi_rank ); - - msg << "MPI rank(" << mpi_rank << ") " ; - -#endif - - msg << "{" << std::endl ; - - if ( Kokkos::hwloc::available() ) { - msg << "hwloc( NUMA[" << Kokkos::hwloc::get_available_numa_count() - << "] x CORE[" << Kokkos::hwloc::get_available_cores_per_numa() - << "] x HT[" << Kokkos::hwloc::get_available_threads_per_core() - << "] )" - << std::endl ; - } - -#if defined( KOKKOS_HAVE_CUDA ) - Kokkos::Cuda::print_configuration( msg ); -#endif - - msg << "}" << std::endl ; - - std::cout << msg.str(); - -#if defined( KOKKOS_HAVE_MPI ) - - MPI_Finalize(); - -#endif - - return 0 ; -} - diff --git a/lib/kokkos/example/sort_array/main.cpp b/lib/kokkos/example/sort_array/main.cpp deleted file mode 100644 index 74c4ab154c..0000000000 --- a/lib/kokkos/example/sort_array/main.cpp +++ /dev/null @@ -1,95 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include - -#include - -#include - - -int main( int argc , char ** argv ) -{ -#if defined( KOKKOS_HAVE_CUDA ) || defined( KOKKOS_HAVE_PTHREAD ) || defined( KOKKOS_HAVE_OPENMP ) - Kokkos::initialize( argc , argv ); - - int length_array = 100000 ; - - for ( int i = 0 ; i < argc ; ++i ) { - if ( 0 == strcmp( argv[i] , "length_array" ) ) { - length_array = atoi( argv[i+1] ); - } - } - - int length_total_array = length_array * 100; - -#if defined( KOKKOS_HAVE_CUDA ) - if ( Kokkos::Cuda::is_initialized() ) { - std::cout << "Kokkos::Cuda" << std::endl ; - Example::sort_array< Kokkos::Cuda >( length_array , length_total_array ); - } -#endif - -#if defined( KOKKOS_HAVE_PTHREAD ) - if ( Kokkos::Threads::is_initialized() ) { - std::cout << "Kokkos::Threads" << std::endl ; - Example::sort_array< Kokkos::Threads >( length_array , length_total_array ); - } -#endif - -#if defined( KOKKOS_HAVE_OPENMP ) - if ( Kokkos::OpenMP::is_initialized() ) { - std::cout << "Kokkos::OpenMP" << std::endl ; - Example::sort_array< Kokkos::OpenMP >( length_array , length_total_array ); - } -#endif - - Kokkos::finalize(); -#endif - - return 0 ; -} - diff --git a/lib/kokkos/example/sort_array/sort_array.hpp b/lib/kokkos/example/sort_array/sort_array.hpp deleted file mode 100644 index 018b1ee8e8..0000000000 --- a/lib/kokkos/example/sort_array/sort_array.hpp +++ /dev/null @@ -1,190 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#ifndef EXAMPLE_SORT_ARRAY -#define EXAMPLE_SORT_ARRAY - -#include -#include - -#include - -#include - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Example { - -template< class Device > -struct SortView { - - template< typename ValueType > - SortView( const Kokkos::View v , int begin , int end ) - { - std::sort( v.ptr_on_device() + begin , v.ptr_on_device() + end ); - } -}; - -} - -#if defined(KOKKOS_HAVE_CUDA) - -#include -#include - -namespace Example { - -template<> -struct SortView< Kokkos::Cuda > { - template< typename ValueType > - SortView( const Kokkos::View v , int begin , int end ) - { - thrust::sort( thrust::device_ptr( v.ptr_on_device() + begin ) - , thrust::device_ptr( v.ptr_on_device() + end ) ); - } -}; - -} - -#endif - -//---------------------------------------------------------------------------- -//---------------------------------------------------------------------------- - -namespace Example { - -template< class Device > -void sort_array( const size_t array_length /* length of spans of array to sort */ - , const size_t total_length /* total length of array */ - , const int print = 1 ) -{ - typedef Device execution_space ; - typedef Kokkos::View device_array_type ; - -#if defined( KOKKOS_HAVE_CUDA ) - - typedef typename - Kokkos::Impl::if_c< Kokkos::Impl::is_same< Device , Kokkos::Cuda >::value - , Kokkos::View - , typename device_array_type::HostMirror - >::type host_array_type ; - -#else - - typedef typename device_array_type::HostMirror host_array_type ; - -#endif - - Kokkos::Impl::Timer timer; - - const device_array_type work_array("work_array" , array_length ); - const host_array_type host_array("host_array" , total_length ); - - std::cout << "sort_array length( " << total_length << " )" - << " in chunks( " << array_length << " )" - << std::endl ; - - double sec = timer.seconds(); - std::cout << "declaring Views took " - << sec << " seconds" << std::endl; - timer.reset(); - - for ( size_t i = 0 ; i < total_length ; ++i ) { - host_array(i) = ( lrand48() * total_length ) >> 31 ; - } - - sec = timer.seconds(); - std::cout << "initializing " << total_length << " elements on host took " - << sec << " seconds" << std::endl; - timer.reset(); - - double sec_copy_in = 0 ; - double sec_sort = 0 ; - double sec_copy_out = 0 ; - double sec_error = 0 ; - size_t error_count = 0 ; - - for ( size_t begin = 0 ; begin < total_length ; begin += array_length ) { - - const size_t end = begin + array_length < total_length - ? begin + array_length : total_length ; - - const std::pair host_range(begin,end); - - const host_array_type host_subarray = Kokkos::subview( host_array , host_range ); - - timer.reset(); - - Kokkos::deep_copy( work_array , host_subarray ); - - sec_copy_in += timer.seconds(); timer.reset(); - - SortView< execution_space >( work_array , 0 , end - begin ); - - sec_sort += timer.seconds(); timer.reset(); - - Kokkos::deep_copy( host_subarray , work_array ); - - sec_copy_out += timer.seconds(); timer.reset(); - - for ( size_t i = begin + 1 ; i < end ; ++i ) { - if ( host_array(i) < host_array(i-1) ) ++error_count ; - } - - sec_error += timer.seconds(); timer.reset(); - } - - std::cout << "copy to device " << sec_copy_in << " seconds" << std::endl - << "sort on device " << sec_sort << " seconds" << std::endl - << "copy from device " << sec_copy_out << " seconds" << std::endl - << "errors " << error_count << " took " << sec_error << " seconds" << std::endl - ; -} - -} // namespace Example - -//---------------------------------------------------------------------------- - -#endif /* #ifndef EXAMPLE_SORT_ARRAY */ - diff --git a/lib/kokkos/example/tutorial/01_hello_world/Makefile b/lib/kokkos/example/tutorial/01_hello_world/Makefile deleted file mode 100644 index 38fb1b8f86..0000000000 --- a/lib/kokkos/example/tutorial/01_hello_world/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/01_hello_world/hello_world.cpp b/lib/kokkos/example/tutorial/01_hello_world/hello_world.cpp deleted file mode 100644 index 459b9b094f..0000000000 --- a/lib/kokkos/example/tutorial/01_hello_world/hello_world.cpp +++ /dev/null @@ -1,130 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include - -// -// "Hello world" parallel_for example: -// 1. Start up Kokkos -// 2. Execute a parallel for loop in the default execution space, -// using a functor to define the loop body -// 3. Shut down Kokkos -// -// If Kokkos was built with C++11 enabled, try comparing this example -// to 01_hello_world_lambda. The latter uses C++11 lambdas (anonymous -// functions) to define the loop body of the parallel_for. That makes -// the code much more concise and readable. On the other hand, -// breaking out the loop body into an explicit functor makes it easier -// to test the loop independently of the parallel pattern. -// - -// Functor that defines the parallel_for's loop body. -// -// A "functor" is just a class or struct with a public operator() -// instance method. -struct hello_world { - // If a functor has an "execution_space" (or "execution_space", for - // backwards compatibility) public typedef, parallel_* will only run - // the functor in that execution space. That's a good way to mark a - // functor as specific to an execution space. If the functor lacks - // this typedef, parallel_for will run it in the default execution - // space, unless you tell it otherwise (that's an advanced topic; - // see "execution policies"). - - // The functor's operator() defines the loop body. It takes an - // integer argument which is the parallel for loop index. Other - // arguments are possible; see the "hierarchical parallelism" part - // of the tutorial. - // - // The operator() method must be const, and must be marked with the - // KOKKOS_INLINE_FUNCTION macro. If building with CUDA, this macro - // will mark your method as suitable for running on the CUDA device - // (as well as on the host). If not building with CUDA, the macro - // is unnecessary but harmless. - KOKKOS_INLINE_FUNCTION - void operator() (const int i) const { - printf ("Hello from i = %i\n", i); - } -}; - -int main (int argc, char* argv[]) { - // You must call initialize() before you may call Kokkos. - // - // With no arguments, this initializes the default execution space - // (and potentially its host execution space) with default - // parameters. You may also pass in argc and argv, analogously to - // MPI_Init(). It reads and removes command-line arguments that - // start with "--kokkos-". - Kokkos::initialize (argc, argv); - - // Print the name of Kokkos' default execution space. We're using - // typeid here, so the name might get a bit mangled by the linker, - // but you should still be able to figure out what it is. - printf ("Hello World on Kokkos execution space %s\n", - typeid (Kokkos::DefaultExecutionSpace).name ()); - - // Run the above functor on the default Kokkos execution space in - // parallel, with a parallel for loop count of 15. - // - // The Kokkos::DefaultExecutionSpace typedef gives the default - // execution space. Depending on how Kokkos was configured, this - // could be OpenMP, Threads, Cuda, Serial, or even some other - // execution space. - // - // The following line of code would look like this in OpenMP: - // - // #pragma omp parallel for - // for (int i = 0; i < 15; ++i) { - // printf ("Hello from i = %i\n", i); - // } - // - // You may notice that the printed numbers do not print out in - // order. Parallel for loops may execute in any order. - Kokkos::parallel_for ("HelloWorld",15, hello_world ()); - - // You must call finalize() after you are done using Kokkos. - Kokkos::finalize (); -} - diff --git a/lib/kokkos/example/tutorial/01_hello_world_lambda/Makefile b/lib/kokkos/example/tutorial/01_hello_world_lambda/Makefile deleted file mode 100644 index bd2371382a..0000000000 --- a/lib/kokkos/example/tutorial/01_hello_world_lambda/Makefile +++ /dev/null @@ -1,44 +0,0 @@ -KOKKOS_PATH = ../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -KOKKOS_CUDA_OPTIONS = "enable_lambda" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/01_hello_world_lambda/hello_world_lambda.cpp b/lib/kokkos/example/tutorial/01_hello_world_lambda/hello_world_lambda.cpp deleted file mode 100644 index b6c9cc5e43..0000000000 --- a/lib/kokkos/example/tutorial/01_hello_world_lambda/hello_world_lambda.cpp +++ /dev/null @@ -1,109 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include - -// -// "Hello world" parallel_for example: -// 1. Start up Kokkos -// 2. Execute a parallel for loop in the default execution space, -// using a C++11 lambda to define the loop body -// 3. Shut down Kokkos -// -// This example only builds if C++11 is enabled. Compare this example -// to 01_hello_world, which uses functors (explicitly defined classes) -// to define the loop body of the parallel_for. Both functors and -// lambdas have their places. -// - -int main (int argc, char* argv[]) { - // You must call initialize() before you may call Kokkos. - // - // With no arguments, this initializes the default execution space - // (and potentially its host execution space) with default - // parameters. You may also pass in argc and argv, analogously to - // MPI_Init(). It reads and removes command-line arguments that - // start with "--kokkos-". - Kokkos::initialize (argc, argv); - - // Print the name of Kokkos' default execution space. We're using - // typeid here, so the name might get a bit mangled by the linker, - // but you should still be able to figure out what it is. - printf ("Hello World on Kokkos execution space %s\n", - typeid (Kokkos::DefaultExecutionSpace).name ()); - - // Run lambda on the default Kokkos execution space in parallel, - // with a parallel for loop count of 15. The lambda's argument is - // an integer which is the parallel for's loop index. As you learn - // about different kinds of parallelism, you will find out that - // there are other valid argument types as well. - // - // For a single level of parallelism, we prefer that you use the - // KOKKOS_LAMBDA macro. If CUDA is disabled, this just turns into - // [=]. That captures variables from the surrounding scope by - // value. Do NOT capture them by reference! If CUDA is enabled, - // this macro may have a special definition that makes the lambda - // work correctly with CUDA. Compare to the KOKKOS_INLINE_FUNCTION - // macro, which has a special meaning if CUDA is enabled. - // - // The following parallel_for would look like this if we were using - // OpenMP by itself, instead of Kokkos: - // - // #pragma omp parallel for - // for (int i = 0; i < 15; ++i) { - // printf ("Hello from i = %i\n", i); - // } - // - // You may notice that the printed numbers do not print out in - // order. Parallel for loops may execute in any order. - Kokkos::parallel_for (15, KOKKOS_LAMBDA (const int i) { - // printf works in a CUDA parallel kernel; std::ostream does not. - printf ("Hello from i = %i\n", i); - }); - - // You must call finalize() after you are done using Kokkos. - Kokkos::finalize (); -} - diff --git a/lib/kokkos/example/tutorial/02_simple_reduce/Makefile b/lib/kokkos/example/tutorial/02_simple_reduce/Makefile deleted file mode 100644 index 38fb1b8f86..0000000000 --- a/lib/kokkos/example/tutorial/02_simple_reduce/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/02_simple_reduce/simple_reduce.cpp b/lib/kokkos/example/tutorial/02_simple_reduce/simple_reduce.cpp deleted file mode 100644 index 236618f7be..0000000000 --- a/lib/kokkos/example/tutorial/02_simple_reduce/simple_reduce.cpp +++ /dev/null @@ -1,101 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -// -// First reduction (parallel_reduce) example: -// 1. Start up Kokkos -// 2. Execute a parallel_reduce loop in the default execution space, -// using a functor to define the loop body -// 3. Shut down Kokkos -// -// Compare this example to 02_simple_reduce_lambda, which uses a C++11 -// lambda to define the loop body of the parallel_reduce. -// - -// Reduction functor for computing the sum of squares. -// -// More advanced reduction examples will show how to control the -// reduction's "join" operator. If the join operator is not provided, -// it defaults to binary operator+ (adding numbers together). -struct squaresum { - // Specify the type of the reduction value with a "value_type" - // typedef. In this case, the reduction value has type int. - typedef int value_type; - - // The reduction functor's operator() looks a little different than - // the parallel_for functor's operator(). For the reduction, we - // pass in both the loop index i, and the intermediate reduction - // value lsum. The latter MUST be passed in by nonconst reference. - // (If the reduction type is an array like int[], indicating an - // array reduction result, then the second argument is just int[].) - KOKKOS_INLINE_FUNCTION - void operator () (const int i, int& lsum) const { - lsum += i*i; // compute the sum of squares - } -}; - -int main (int argc, char* argv[]) { - Kokkos::initialize (argc, argv); - const int n = 10; - - // Compute the sum of squares of integers from 0 to n-1, in - // parallel, using Kokkos. - int sum = 0; - Kokkos::parallel_reduce (n, squaresum (), sum); - printf ("Sum of squares of integers from 0 to %i, " - "computed in parallel, is %i\n", n - 1, sum); - - // Compare to a sequential loop. - int seqSum = 0; - for (int i = 0; i < n; ++i) { - seqSum += i*i; - } - printf ("Sum of squares of integers from 0 to %i, " - "computed sequentially, is %i\n", n - 1, seqSum); - Kokkos::finalize (); - return (sum == seqSum) ? 0 : -1; -} - diff --git a/lib/kokkos/example/tutorial/02_simple_reduce_lambda/Makefile b/lib/kokkos/example/tutorial/02_simple_reduce_lambda/Makefile deleted file mode 100644 index bd2371382a..0000000000 --- a/lib/kokkos/example/tutorial/02_simple_reduce_lambda/Makefile +++ /dev/null @@ -1,44 +0,0 @@ -KOKKOS_PATH = ../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -KOKKOS_CUDA_OPTIONS = "enable_lambda" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/02_simple_reduce_lambda/simple_reduce_lambda.cpp b/lib/kokkos/example/tutorial/02_simple_reduce_lambda/simple_reduce_lambda.cpp deleted file mode 100644 index a403633a8a..0000000000 --- a/lib/kokkos/example/tutorial/02_simple_reduce_lambda/simple_reduce_lambda.cpp +++ /dev/null @@ -1,86 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -// -// First reduction (parallel_reduce) example: -// 1. Start up Kokkos -// 2. Execute a parallel_reduce loop in the default execution space, -// using a C++11 lambda to define the loop body -// 3. Shut down Kokkos -// -// This example only builds if C++11 is enabled. Compare this example -// to 02_simple_reduce, which uses a functor to define the loop body -// of the parallel_reduce. -// - -int main (int argc, char* argv[]) { - Kokkos::initialize (argc, argv); - const int n = 10; - - // Compute the sum of squares of integers from 0 to n-1, in - // parallel, using Kokkos. This time, use a lambda instead of a - // functor. The lambda takes the same arguments as the functor's - // operator(). - int sum = 0; - // The KOKKOS_LAMBDA macro replaces the capture-by-value clause [=]. - // It also handles any other syntax needed for CUDA. - Kokkos::parallel_reduce (n, KOKKOS_LAMBDA (const int i, int& lsum) { - lsum += i*i; - }, sum); - printf ("Sum of squares of integers from 0 to %i, " - "computed in parallel, is %i\n", n - 1, sum); - - // Compare to a sequential loop. - int seqSum = 0; - for (int i = 0; i < n; ++i) { - seqSum += i*i; - } - printf ("Sum of squares of integers from 0 to %i, " - "computed sequentially, is %i\n", n - 1, seqSum); - Kokkos::finalize (); - return (sum == seqSum) ? 0 : -1; -} - diff --git a/lib/kokkos/example/tutorial/03_simple_view/Makefile b/lib/kokkos/example/tutorial/03_simple_view/Makefile deleted file mode 100644 index 38fb1b8f86..0000000000 --- a/lib/kokkos/example/tutorial/03_simple_view/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/03_simple_view/simple_view.cpp b/lib/kokkos/example/tutorial/03_simple_view/simple_view.cpp deleted file mode 100644 index dbbb9d867d..0000000000 --- a/lib/kokkos/example/tutorial/03_simple_view/simple_view.cpp +++ /dev/null @@ -1,142 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -// -// First Kokkos::View (multidimensional array) example: -// 1. Start up Kokkos -// 2. Allocate a Kokkos::View -// 3. Execute a parallel_for and a parallel_reduce over that View's data -// 4. Shut down Kokkos -// -// Compare this example to 03_simple_view_lambda, which uses C++11 -// lambdas to define the loop bodies of the parallel_for and -// parallel_reduce. -// - -#include -#include - -// A Kokkos::View is an array of zero or more dimensions. The number -// of dimensions is specified at compile time, as part of the type of -// the View. This array has two dimensions. The first one -// (represented by the asterisk) is a run-time dimension, and the -// second (represented by [3]) is a compile-time dimension. Thus, -// this View type is an N x 3 array of type double, where N is -// specified at run time in the View's constructor. -// -// The first dimension of the View is the dimension over which it is -// efficient for Kokkos to parallelize. -typedef Kokkos::View view_type; - -// parallel_for functor that fills the View given to its constructor. -// The View must already have been allocated. -struct InitView { - view_type a; - - // Views have "view semantics." This means that they behave like - // pointers, not like std::vector. Their copy constructor and - // operator= only do shallow copies. Thus, you can pass View - // objects around by "value"; they won't do a deep copy unless you - // explicitly ask for a deep copy. - InitView (view_type a_) : - a (a_) - {} - - // Fill the View with some data. The parallel_for loop will iterate - // over the View's first dimension N. - KOKKOS_INLINE_FUNCTION - void operator () (const int i) const { - // Acesss the View just like a Fortran array. The layout depends - // on the View's memory space, so don't rely on the View's - // physical memory layout unless you know what you're doing. - a(i,0) = 1.0*i; - a(i,1) = 1.0*i*i; - a(i,2) = 1.0*i*i*i; - } -}; - -// Reduction functor that reads the View given to its constructor. -struct ReduceFunctor { - view_type a; - - // Constructor takes View by "value"; this does a shallow copy. - ReduceFunctor (view_type a_) : a (a_) {} - - // If you write a functor to do a reduction, you must specify the - // type of the reduction result via a public 'value_type' typedef. - typedef double value_type; - - KOKKOS_INLINE_FUNCTION - void operator() (int i, double &lsum) const { - lsum += a(i,0)*a(i,1)/(a(i,2)+0.1); - } -}; - -int main (int argc, char* argv[]) { - Kokkos::initialize (argc, argv); - const int N = 10; - - // Allocate the View. The first dimension is a run-time parameter - // N. We set N = 10 here. The second dimension is a compile-time - // parameter, 3. We don't specify it here because we already set it - // by declaring the type of the View. - // - // Views get initialized to zero by default. This happens in - // parallel, using the View's memory space's default execution - // space. Parallel initialization ensures first-touch allocation. - // There is a way to shut off default initialization. - // - // You may NOT allocate a View inside of a parallel_{for, reduce, - // scan}. Treat View allocation as a "thread collective." - // - // The string "A" is just the label; it only matters for debugging. - // Different Views may have the same label. - view_type a ("A", N); - - Kokkos::parallel_for (N, InitView (a)); - double sum = 0; - Kokkos::parallel_reduce (N, ReduceFunctor (a), sum); - printf ("Result: %f\n", sum); - Kokkos::finalize (); -} - diff --git a/lib/kokkos/example/tutorial/03_simple_view_lambda/Makefile b/lib/kokkos/example/tutorial/03_simple_view_lambda/Makefile deleted file mode 100644 index bd2371382a..0000000000 --- a/lib/kokkos/example/tutorial/03_simple_view_lambda/Makefile +++ /dev/null @@ -1,44 +0,0 @@ -KOKKOS_PATH = ../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -KOKKOS_CUDA_OPTIONS = "enable_lambda" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/03_simple_view_lambda/simple_view_lambda.cpp b/lib/kokkos/example/tutorial/03_simple_view_lambda/simple_view_lambda.cpp deleted file mode 100644 index 974af74776..0000000000 --- a/lib/kokkos/example/tutorial/03_simple_view_lambda/simple_view_lambda.cpp +++ /dev/null @@ -1,116 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -// -// First Kokkos::View (multidimensional array) example: -// 1. Start up Kokkos -// 2. Allocate a Kokkos::View -// 3. Execute a parallel_for and a parallel_reduce over that View's data -// 4. Shut down Kokkos -// -// Compare this example to 03_simple_view, which uses functors to -// define the loop bodies of the parallel_for and parallel_reduce. -// - -#include -#include - -// A Kokkos::View is an array of zero or more dimensions. The number -// of dimensions is specified at compile time, as part of the type of -// the View. This array has two dimensions. The first one -// (represented by the asterisk) is a run-time dimension, and the -// second (represented by [3]) is a compile-time dimension. Thus, -// this View type is an N x 3 array of type double, where N is -// specified at run time in the View's constructor. -// -// The first dimension of the View is the dimension over which it is -// efficient for Kokkos to parallelize. -typedef Kokkos::View view_type; - -int main (int argc, char* argv[]) { - Kokkos::initialize (argc, argv); - - // Allocate the View. The first dimension is a run-time parameter - // N. We set N = 10 here. The second dimension is a compile-time - // parameter, 3. We don't specify it here because we already set it - // by declaring the type of the View. - // - // Views get initialized to zero by default. This happens in - // parallel, using the View's memory space's default execution - // space. Parallel initialization ensures first-touch allocation. - // There is a way to shut off default initialization. - // - // You may NOT allocate a View inside of a parallel_{for, reduce, - // scan}. Treat View allocation as a "thread collective." - // - // The string "A" is just the label; it only matters for debugging. - // Different Views may have the same label. - view_type a ("A", 10); - - // Fill the View with some data. The parallel_for loop will iterate - // over the View's first dimension N. - // - // Note that the View is passed by value into the lambda. The macro - // KOKKOS_LAMBDA includes the "capture by value" clause [=]. This - // tells the lambda to "capture all variables in the enclosing scope - // by value." Views have "view semantics"; they behave like - // pointers, not like std::vector. Passing them by value does a - // shallow copy. A deep copy never happens unless you explicitly - // ask for one. - Kokkos::parallel_for (10, KOKKOS_LAMBDA (const int i) { - // Acesss the View just like a Fortran array. The layout depends - // on the View's memory space, so don't rely on the View's - // physical memory layout unless you know what you're doing. - a(i,0) = 1.0*i; - a(i,1) = 1.0*i*i; - a(i,2) = 1.0*i*i*i; - }); - // Reduction functor that reads the View given to its constructor. - double sum = 0; - Kokkos::parallel_reduce (10, KOKKOS_LAMBDA (const int i, double& lsum) { - lsum += a(i,0)*a(i,1)/(a(i,2)+0.1); - }, sum); - printf ("Result: %f\n", sum); - Kokkos::finalize (); -} - diff --git a/lib/kokkos/example/tutorial/04_simple_memoryspaces/Makefile b/lib/kokkos/example/tutorial/04_simple_memoryspaces/Makefile deleted file mode 100644 index 38fb1b8f86..0000000000 --- a/lib/kokkos/example/tutorial/04_simple_memoryspaces/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/04_simple_memoryspaces/simple_memoryspaces.cpp b/lib/kokkos/example/tutorial/04_simple_memoryspaces/simple_memoryspaces.cpp deleted file mode 100644 index c6a4bebfa5..0000000000 --- a/lib/kokkos/example/tutorial/04_simple_memoryspaces/simple_memoryspaces.cpp +++ /dev/null @@ -1,101 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -// The type of a two-dimensional N x 3 array of double. -// It lives in Kokkos' default memory space. -typedef Kokkos::View view_type; - -// The "HostMirror" type corresponding to view_type above is also a -// two-dimensional N x 3 array of double. However, it lives in the -// host memory space corresponding to view_type's memory space. For -// example, if view_type lives in CUDA device memory, host_view_type -// lives in host (CPU) memory. Furthermore, declaring host_view_type -// as the host mirror of view_type means that host_view_type has the -// same layout as view_type. This makes it easier to copy between the -// two Views. -// Advanced issues: If a memory space is accessible from the host without -// performance penalties then it is its own host_mirror_space. This is -// the case for HostSpace, CudaUVMSpace and CudaHostPinnedSpace. - -typedef view_type::HostMirror host_view_type; - -struct ReduceFunctor { - view_type a; - ReduceFunctor (view_type a_) : a (a_) {} - typedef int value_type; //Specify type for reduction value, lsum - - KOKKOS_INLINE_FUNCTION - void operator() (int i, int &lsum) const { - lsum += a(i,0)-a(i,1)+a(i,2); - } -}; - -int main() { - Kokkos::initialize(); - - view_type a ("A", 10); - // If view_type and host_mirror_type live in the same memory space, - // a "mirror view" is just an alias, and deep_copy does nothing. - // Otherwise, a mirror view of a device View lives in host memory, - // and deep_copy does a deep copy. - host_view_type h_a = Kokkos::create_mirror_view (a); - - // The View h_a lives in host (CPU) memory, so it's legal to fill - // the view sequentially using ordinary code, like this. - for (int i = 0; i < 10; i++) { - for (int j = 0; j < 3; j++) { - h_a(i,j) = i*10 + j; - } - } - Kokkos::deep_copy (a, h_a); // Copy from host to device. - - int sum = 0; - Kokkos::parallel_reduce (10, ReduceFunctor (a), sum); - printf ("Result is %i\n",sum); - - Kokkos::finalize (); -} - diff --git a/lib/kokkos/example/tutorial/05_simple_atomics/Makefile b/lib/kokkos/example/tutorial/05_simple_atomics/Makefile deleted file mode 100644 index 38fb1b8f86..0000000000 --- a/lib/kokkos/example/tutorial/05_simple_atomics/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/05_simple_atomics/simple_atomics.cpp b/lib/kokkos/example/tutorial/05_simple_atomics/simple_atomics.cpp deleted file mode 100644 index de9c219d5b..0000000000 --- a/lib/kokkos/example/tutorial/05_simple_atomics/simple_atomics.cpp +++ /dev/null @@ -1,137 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include - -// Type of a one-dimensional length-N array of int. -typedef Kokkos::View view_type; -typedef view_type::HostMirror host_view_type; -// This is a "zero-dimensional" View, that is, a View of a single -// value (an int, in this case). Access the value using operator() -// with no arguments: e.g., 'count()'. -// -// Zero-dimensional Views are useful for reduction results that stay -// resident in device memory, as well as for irregularly updated -// shared state. We use it for the latter in this example. -typedef Kokkos::View count_type; -typedef count_type::HostMirror host_count_type; - - -// Functor for finding a list of primes in a given set of numbers. If -// run in parallel, the order of results is nondeterministic, because -// hardware atomic updates do not guarantee an order of execution. -struct findprimes { - view_type data; - view_type result; - count_type count; - - findprimes (view_type data_, view_type result_, count_type count_) : - data (data_), result (result_), count (count_) - {} - - // Test if data(i) is prime. If it is, increment the count of - // primes (stored in the zero-dimensional View 'count') and add the - // value to the current list of primes 'result'. - KOKKOS_INLINE_FUNCTION - void operator() (const int i) const { - const int number = data(i); // the current number - - // Test all numbers from 3 to ceiling(sqrt(data(i))), to see if - // they are factors of data(i). It's not the most efficient prime - // test, but it works. - const int upper_bound = sqrt(1.0*number)+1; - bool is_prime = !(number%2 == 0); - int k = 3; - while (k < upper_bound && is_prime) { - is_prime = !(number%k == 0); - k += 2; // don't have to test even numbers - } - - if (is_prime) { - // Use an atomic update both to update the current count of - // primes, and to find a place in the current list of primes for - // the new result. - // - // atomic_fetch_add results the _current_ count, but increments - // it (by 1 in this case). The current count of primes indexes - // into the first unoccupied position of the 'result' array. - const int idx = Kokkos::atomic_fetch_add (&count(), 1); - result(idx) = number; - } - } - -}; - -int main () { - Kokkos::initialize (); - - srand (61391); // Set the random seed - - int nnumbers = 100000; - view_type data ("RND", nnumbers); - view_type result ("Prime", nnumbers); - count_type count ("Count"); - - host_view_type h_data = Kokkos::create_mirror_view (data); - host_view_type h_result = Kokkos::create_mirror_view (result); - host_count_type h_count = Kokkos::create_mirror_view (count); - - typedef view_type::size_type size_type; - // Fill the 'data' array on the host with random numbers. We assume - // that they come from some process which is only implemented on the - // host, via some library. (That's true in this case.) - for (size_type i = 0; i < data.dimension_0 (); ++i) { - h_data(i) = rand () % nnumbers; - } - Kokkos::deep_copy (data, h_data); // copy from host to device - - Kokkos::parallel_for (data.dimension_0 (), findprimes (data, result, count)); - Kokkos::deep_copy (h_count, count); // copy from device to host - - printf ("Found %i prime numbers in %i random numbers\n", h_count(), nnumbers); - Kokkos::finalize (); -} - diff --git a/lib/kokkos/example/tutorial/Advanced_Views/01_data_layouts/Makefile b/lib/kokkos/example/tutorial/Advanced_Views/01_data_layouts/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/01_data_layouts/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Advanced_Views/01_data_layouts/data_layouts.cpp b/lib/kokkos/example/tutorial/Advanced_Views/01_data_layouts/data_layouts.cpp deleted file mode 100644 index e61e8af59b..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/01_data_layouts/data_layouts.cpp +++ /dev/null @@ -1,171 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include - -// These two View types are both 2-D arrays of double. However, they -// have different layouts in memory. left_type has "layout left," -// which means "column major," the same as in Fortran, the BLAS, or -// LAPACK. right_type has "layout right," which means "row major," -// the same as in C, C++, or Java. -typedef Kokkos::View left_type; -typedef Kokkos::View right_type; -// This is a one-dimensional View, so the layout matters less. -// However, it still has a layout! Since its layout is not specified -// explicitly in the type, its layout is a function of the memory -// space. For example, the default Cuda layout is LayoutLeft, and the -// default Host layout is LayoutRight. -typedef Kokkos::View view_type; - -// parallel_for functor that fills the given View with some data. It -// expects to access the View by rows in parallel: each call i of -// operator() accesses a row. -template -struct init_view { - ViewType a; - init_view (ViewType a_) : a (a_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (const typename ViewType::size_type i) const { - // On CPUs this loop could be vectorized so j should do stride 1 - // access on a for optimal performance. I.e. a should be LayoutRight. - // On GPUs threads should do coalesced loads and stores. That means - // that i should be the stride one access for optimal performance. - for (typename ViewType::size_type j = 0; j < a.dimension_1 (); ++j) { - a(i,j) = 1.0*a.dimension_0()*i + 1.0*j; - } - } -}; - -// Compute a contraction of v1 and v2 into a: -// -// a(i) := sum_j (v1(i,j) * v2(j,i)) -// -// Since the functor is templated on the ViewTypes itself it doesn't matter what -// there layouts are. That means you can use different layouts on different -// architectures. -template -struct contraction { - view_type a; - typename ViewType1::const_type v1; - typename ViewType2::const_type v2; - contraction (view_type a_, ViewType1 v1_, ViewType2 v2_) : - a (a_), v1 (v1_), v2 (v2_) - {} - - // As with the initialization functor the performance of this operator - // depends on the architecture and the chosen data layouts. - // On CPUs optimal would be to vectorize the inner loop, so j should be the - // stride 1 access. That means v1 should be LayoutRight and v2 LayoutLeft. - // In order to get coalesced access on GPUs where i corresponds closely to - // the thread Index, i must be the stride 1 dimension. That means v1 should be - // LayoutLeft and v2 LayoutRight. - KOKKOS_INLINE_FUNCTION - void operator() (const view_type::size_type i) const { - for (view_type::size_type j = 0; j < v1.dimension_1 (); ++j) { - a(i) = v1(i,j)*v2(j,i); - } - } -}; - -// Compute a dot product. This is used for result verification. -struct dot { - view_type a; - dot (view_type a_) : a (a_) {} - typedef double value_type; //Specify type for reduction target, lsum - KOKKOS_INLINE_FUNCTION - void operator() (const view_type::size_type i, double &lsum) const { - lsum += a(i)*a(i); - } -}; - -int main (int narg, char* arg[]) { - // When initializing Kokkos, you may pass in command-line arguments, - // just like with MPI_Init(). Kokkos reserves the right to remove - // arguments from the list that start with '--kokkos-'. - Kokkos::initialize (narg, arg); - - int size = 10000; - view_type a("A",size); - - // Define two views with LayoutLeft and LayoutRight. - left_type l("L",size,10000); - right_type r("R",size,10000); - - // Initialize the data in the views. - Kokkos::parallel_for(size,init_view(l)); - Kokkos::parallel_for(size,init_view(r)); - Kokkos::fence(); - - // Measure time to execute the contraction kernel when giving it a - // LayoutLeft view for v1 and a LayoutRight view for v2. This should be - // fast on GPUs and slow on CPUs - Kokkos::Impl::Timer time1; - Kokkos::parallel_for(size,contraction(a,l,r)); - Kokkos::fence(); - double sec1 = time1.seconds(); - - double sum1 = 0; - Kokkos::parallel_reduce(size,dot(a),sum1); - Kokkos::fence(); - - // Measure time to execute the contraction kernel when giving it a - // LayoutRight view for v1 and a LayoutLeft view for v2. This should be - // fast on CPUs and slow on GPUs - Kokkos::Impl::Timer time2; - Kokkos::parallel_for(size,contraction(a,r,l)); - Kokkos::fence(); - double sec2 = time2.seconds(); - - double sum2 = 0; - Kokkos::parallel_reduce(size,dot(a),sum2); - - // Kokkos' reductions are deterministic. - // The results should always be equal. - printf("Result Left/Right %f Right/Left %f (equal result: %i)\n",sec1,sec2,sum2==sum1); - - Kokkos::finalize(); -} - diff --git a/lib/kokkos/example/tutorial/Advanced_Views/02_memory_traits/Makefile b/lib/kokkos/example/tutorial/Advanced_Views/02_memory_traits/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/02_memory_traits/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Advanced_Views/02_memory_traits/memory_traits.cpp b/lib/kokkos/example/tutorial/Advanced_Views/02_memory_traits/memory_traits.cpp deleted file mode 100644 index 8317c78bc9..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/02_memory_traits/memory_traits.cpp +++ /dev/null @@ -1,141 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include - -typedef Kokkos::View view_type; -// Kokkos::Views have an MemoryTraits template parameter which -// allows users to specify usage scenarios of a View. -// Some of those act simply as hints, which can be used to insert -// optimal load and store paths, others change the symantics of the -// access. The trait Kokkos::Atomic is one of the latter. A view with -// that MemoryTrait will perform any access atomicly (read, write, update). -// -// In this example we use a view with a usage hint for RandomAccess. -// Kokkos::RandomAccess means that we expect to use this view -// with indirect indexing. -// -// In CUDA, RandomAccess allows accesses through the texture -// cache. This only works if the View is read-only, which we enforce -// through the first template parameter. -// -// Note that we are still talking about views of the data, its not a new allocation. -// For example you can have an atomic view of a default view. While you even -// could use both in the same kernel, this could lead to undefined behaviour because -// one of your access paths is not atomic. Think of it in the same way as you think of -// pointers to const data and pointers to non-const data (i.e. const double* and double*). -// While these pointers can point to the same data you should not use them together if that -// brakes the const guarantee of the first pointer. -typedef Kokkos::View > view_type_rnd; -typedef Kokkos::View idx_type; -typedef idx_type::HostMirror idx_type_host; - -// We template this functor on the ViewTypes to show the effect of the RandomAccess trait. -template -struct localsum { - idx_type::const_type idx; - DestType dest; - SrcType src; - localsum (idx_type idx_, DestType dest_, SrcType src_) : - idx (idx_), dest (dest_), src (src_) - {} - - // Calculate a local sum of values - KOKKOS_INLINE_FUNCTION - void operator() (const int i) const { - double tmp = 0.0; - for (int j = 0; j < (int) idx.dimension_1 (); ++j) { - // This is an indirect access on src - const double val = src(idx(i,j)); - tmp += val*val + 0.5*(idx.dimension_0()*val -idx.dimension_1()*val); - } - dest(i) = tmp; - } -}; - -int main(int narg, char* arg[]) { - Kokkos::initialize (narg, arg); - - int size = 1000000; - - idx_type idx("Idx",size,64); - idx_type_host h_idx = Kokkos::create_mirror_view (idx); - - view_type dest ("Dest", size); - view_type src ("Src", size); - - srand(134231); - - for (int i = 0; i < size; i++) { - for (view_type::size_type j = 0; j < h_idx.dimension_1 (); ++j) { - h_idx(i,j) = (size + i + (rand () % 500 - 250)) % size; - } - } - - // Deep copy the initial data to the device - Kokkos::deep_copy(idx,h_idx); - // Run the first kernel to warmup caches - Kokkos::parallel_for(size,localsum(idx,dest,src)); - Kokkos::fence(); - - // Run the localsum functor using the RandomAccess trait. On CPUs there should - // not be any different in performance to not using the RandomAccess trait. - // On GPUs where can be a dramatic difference - Kokkos::Impl::Timer time1; - Kokkos::parallel_for(size,localsum(idx,dest,src)); - Kokkos::fence(); - double sec1 = time1.seconds(); - - Kokkos::Impl::Timer time2; - Kokkos::parallel_for(size,localsum(idx,dest,src)); - Kokkos::fence(); - double sec2 = time2.seconds(); - - printf("Time with Trait RandomAccess: %f with Plain: %f \n",sec1,sec2); - - Kokkos::finalize(); -} - diff --git a/lib/kokkos/example/tutorial/Advanced_Views/03_subviews/Makefile b/lib/kokkos/example/tutorial/Advanced_Views/03_subviews/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/03_subviews/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Advanced_Views/03_subviews/subviews.cpp b/lib/kokkos/example/tutorial/Advanced_Views/03_subviews/subviews.cpp deleted file mode 100644 index c8001ebaa6..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/03_subviews/subviews.cpp +++ /dev/null @@ -1,190 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -// This example simulates one timestep of an explicit -// finite-difference discretization of a time-dependent partial -// differential equation (PDE). It shows how to take subviews of the -// mesh in order to represent particular boundaries or the interior of -// the mesh. - -#include -#include -#include - -typedef Kokkos::View mesh_type; - -// These View types represent subviews of the mesh. Some of the Views -// have layout LayoutStride, meaning that they have run-time "strides" -// in each dimension which may differ from that dimension. For -// example, inner_mesh_type (which represents the interior of the -// mesh) has to skip over the boundaries when computing its stride; -// the dimensions of the interior mesh differ from these strides. You -// may safely always use a LayoutStride layout when taking a subview -// of a LayoutRight or LayoutLeft subview, but strided accesses may -// cost a bit more, especially for 1-D Views. -typedef Kokkos::View xz_plane_type; -typedef Kokkos::View yz_plane_type; -typedef Kokkos::View xy_plane_type; -typedef Kokkos::View inner_mesh_type; - -// Functor to set all entries of a boundary of the mesh to a constant -// value. The functor is templated on ViewType because different -// boundaries may have different layouts. -template -struct set_boundary { - ViewType a; - double value; - - set_boundary (ViewType a_, double value_) : - a (a_), value (value_) - {} - - KOKKOS_INLINE_FUNCTION - void operator() (const typename ViewType::size_type i) const { - for (typename ViewType::size_type j = 0; j < a.dimension_1 (); ++j) { - a(i,j) = value; - } - } -}; - -// Functor to set all entries of a boundary of the mesh to a constant -// value. The functor is templated on ViewType because different -// boundaries may have different layouts. -template -struct set_inner { - ViewType a; - double value; - - set_inner (ViewType a_, double value_) : - a (a_), value (value_) - {} - - KOKKOS_INLINE_FUNCTION - void operator () (const typename ViewType::size_type i) const { - typedef typename ViewType::size_type size_type; - for (size_type j = 0; j < a.dimension_1 (); ++j) { - for (size_type k = 0; k < a.dimension_2 (); ++k) { - a(i,j,k) = value; - } - } - } -}; - -// Update the interior of the mesh. This simulates one timestep of a -// finite-difference method. -template -struct update { - ViewType a; - const double dt; - - update (ViewType a_, const double dt_) : - a (a_), dt (dt_) - {} - - KOKKOS_INLINE_FUNCTION - void operator() (typename ViewType::size_type i) const { - typedef typename ViewType::size_type size_type; - i++; - for (size_type j = 1; j < a.dimension_1()-1; j++) { - for (size_type k = 1; k < a.dimension_2()-1; k++) { - a(i,j,k) += dt* (a(i,j,k+1) - a(i,j,k-1) + - a(i,j+1,k) - a(i,j-1,k) + - a(i+1,j,k) - a(i-1,j,k)); - } - } - } -}; - - -int main (int narg, char* arg[]) { - using Kokkos::ALL; - using Kokkos::pair; - using Kokkos::parallel_for; - using Kokkos::subview; - typedef mesh_type::size_type size_type; - - Kokkos::initialize (narg, arg); - - // The number of mesh points along each dimension of the mesh, not - // including boundaries. - const size_type size = 100; - - // A is the full cubic 3-D mesh, including the boundaries. - mesh_type A ("A", size+2, size+2, size+2); - // Ai is the "inner" part of A, _not_ including the boundaries. - // - // A pair of indices in a particular dimension means the contiguous - // zero-based index range in that dimension, including the first - // entry of the pair but _not_ including the second entry. - inner_mesh_type Ai = subview(A, pair (1, size+1), - pair (1, size+1), - pair (1, size+1)); - // A has six boundaries, one for each face of the cube. - // Create a View of each of these boundaries. - // ALL() means "select all indices in that dimension." - xy_plane_type Zneg_halo = subview(A, ALL (), ALL (), 0); - xy_plane_type Zpos_halo = subview(A, ALL (), ALL (), 101); - xz_plane_type Yneg_halo = subview(A, ALL (), 0, ALL ()); - xz_plane_type Ypos_halo = subview(A, ALL (), 101, ALL ()); - yz_plane_type Xneg_halo = subview(A, 0, ALL (), ALL ()); - yz_plane_type Xpos_halo = subview(A, 101, ALL (), ALL ()); - - // Set the boundaries to their initial conditions. - parallel_for (Zneg_halo.dimension_0 (), set_boundary (Zneg_halo, 1)); - parallel_for (Zpos_halo.dimension_0 (), set_boundary (Zpos_halo, -1)); - parallel_for (Yneg_halo.dimension_0 (), set_boundary (Yneg_halo, 2)); - parallel_for (Ypos_halo.dimension_0 (), set_boundary (Ypos_halo, -2)); - parallel_for (Xneg_halo.dimension_0 (), set_boundary (Xneg_halo, 3)); - parallel_for (Xpos_halo.dimension_0 (), set_boundary (Xpos_halo, -3)); - - // Set the interior of the mesh to its initial condition. - parallel_for (Ai.dimension_0 (), set_inner (Ai, 0)); - - // Update the interior of the mesh. - // This simulates one timestep with dt = 0.1. - parallel_for (Ai.dimension_0 (), update (A, 0.1)); - - printf ("Done\n"); - Kokkos::finalize (); -} - diff --git a/lib/kokkos/example/tutorial/Advanced_Views/04_dualviews/Makefile b/lib/kokkos/example/tutorial/Advanced_Views/04_dualviews/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/04_dualviews/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Advanced_Views/04_dualviews/dual_view.cpp b/lib/kokkos/example/tutorial/Advanced_Views/04_dualviews/dual_view.cpp deleted file mode 100644 index 62ddb9c18a..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/04_dualviews/dual_view.cpp +++ /dev/null @@ -1,214 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include - -// DualView helps you manage data and computations that take place on -// two different memory spaces. Examples include CUDA device memory -// and (CPU) host memory (currently implemented), or Intel Knights -// Landing MCDRAM and DRAM (not yet implemented). For example, if you -// have ported only some parts of you application to run in CUDA, -// DualView can help manage moving data between the parts of your -// application that work best with CUDA, and the parts that work -// better on the CPU. -// -// A DualView takes the same template parameters as a View, but -// contains two Views: One that lives in the DualView's memory space, -// and one that lives in that memory space's host mirror space. If -// both memory spaces are the same, then the two Views just alias one -// another. This means that you can use DualView all the time, even -// when not running in a memory space like CUDA. DualView's -// operations to help you manage memory take almost no time in that -// case. This makes your code even more performance portable. - -typedef Kokkos::DualView view_type; -typedef Kokkos::DualView idx_type; - - -template -struct localsum { - // If the functor has a public 'execution_space' typedef, that defines - // the functor's execution space (where it runs in parallel). This - // overrides Kokkos' default execution space. - typedef ExecutionSpace execution_space; - - typedef typename Kokkos::Impl::if_c::value , - idx_type::memory_space, idx_type::host_mirror_space>::type memory_space; - - // Get the view types on the particular device for which the functor - // is instantiated. - // - // "const_data_type" is a typedef in View (and DualView) which is - // the const version of the first template parameter of the View. - // For example, the const_data_type version of double** is const - // double**. - Kokkos::View idx; - // "array_intrinsic_type" is a typedef in ViewTraits (and DualView) which is the - // array version of the value(s) stored in the View. - Kokkos::View dest; - Kokkos::View src; - - // Constructor takes DualViews, synchronizes them to the device, - // then marks them as modified on the device. - localsum (idx_type dv_idx, view_type dv_dest, view_type dv_src) - { - // Extract the view on the correct Device (i.e., the correct - // memory space) from the DualView. DualView has a template - // method, view(), which is templated on the memory space. If the - // DualView has a View from that memory space, view() returns the - // View in that space. - idx = dv_idx.view (); - dest = dv_dest.template view (); - src = dv_src.template view (); - - // Synchronize the DualView to the correct Device. - // - // DualView's sync() method is templated on a memory space, and - // synchronizes the DualView in a one-way fashion to that memory - // space. "Synchronizing" means copying, from the other memory - // space to the Device memory space. sync() does _nothing_ if the - // Views on the two memory spaces are in sync. DualView - // determines this by the user manually marking one side or the - // other as modified; see the modify() call below. - - dv_idx.sync (); - dv_dest.template sync (); - dv_src.template sync (); - - // Mark dest as modified on Device. - dv_dest.template modify (); - } - - KOKKOS_INLINE_FUNCTION - void operator() (const int i) const { - double tmp = 0.0; - for (int j = 0; j < (int) idx.dimension_1(); ++j) { - const double val = src(idx(i,j)); - tmp += val*val + 0.5*(idx.dimension_0()*val -idx.dimension_1()*val); - } - dest(i) += tmp; - } -}; - -class ParticleType { - public: - double q; - double m; - double q_over_m; - KOKKOS_INLINE_FUNCTION - ParticleType(double q_ = -1, double m_ = 1): - q(q_), m(m_), q_over_m(q/m) {} -protected: -}; - - typedef Kokkos::DualView ParticleTypes; -int main (int narg, char* arg[]) { - Kokkos::initialize (narg, arg); - - ParticleTypes test("Test"); - Kokkos::fence(); - test.h_view(0) = ParticleType(-1e4,1); - Kokkos::fence(); - - int size = 1000000; - - // Create DualViews. This will allocate on both the device and its - // host_mirror_device. - idx_type idx ("Idx",size,64); - view_type dest ("Dest",size); - view_type src ("Src",size); - - - srand (134231); - - // Get a reference to the host view of idx directly (equivalent to - // idx.view() ) - idx_type::t_host h_idx = idx.h_view; - for (int i = 0; i < size; ++i) { - for (view_type::size_type j = 0; j < h_idx.dimension_1 (); ++j) { - h_idx(i,j) = (size + i + (rand () % 500 - 250)) % size; - } - } - - // Mark idx as modified on the host_mirror_space so that a - // sync to the device will actually move data. The sync happens in - // the functor's constructor. - idx.modify (); - - // Run on the device. This will cause a sync of idx to the device, - // since it was marked as modified on the host. - Kokkos::Impl::Timer timer; - Kokkos::parallel_for(size,localsum(idx,dest,src)); - Kokkos::fence(); - double sec1_dev = timer.seconds(); - - timer.reset(); - Kokkos::parallel_for(size,localsum(idx,dest,src)); - Kokkos::fence(); - double sec2_dev = timer.seconds(); - - // Run on the host's default execution space (could be the same as device). - // This will cause a sync back to the host of dest. Note that if the Device is CUDA, - // the data layout will not be optimal on host, so performance is - // lower than what it would be for a pure host compilation. - timer.reset(); - Kokkos::parallel_for(size,localsum(idx,dest,src)); - Kokkos::fence(); - double sec1_host = timer.seconds(); - - timer.reset(); - Kokkos::parallel_for(size,localsum(idx,dest,src)); - Kokkos::fence(); - double sec2_host = timer.seconds(); - - printf("Device Time with Sync: %f without Sync: %f \n",sec1_dev,sec2_dev); - printf("Host Time with Sync: %f without Sync: %f \n",sec1_host,sec2_host); - - Kokkos::finalize(); -} - diff --git a/lib/kokkos/example/tutorial/Advanced_Views/05_NVIDIA_UVM/Makefile b/lib/kokkos/example/tutorial/Advanced_Views/05_NVIDIA_UVM/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/05_NVIDIA_UVM/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Advanced_Views/05_NVIDIA_UVM/uvm_example.cpp b/lib/kokkos/example/tutorial/Advanced_Views/05_NVIDIA_UVM/uvm_example.cpp deleted file mode 100644 index a7d460a1cc..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/05_NVIDIA_UVM/uvm_example.cpp +++ /dev/null @@ -1,134 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include - -typedef Kokkos::View view_type; -typedef Kokkos::View idx_type; - - -template -struct localsum { - // Define the execution space for the functor (overrides the DefaultExecutionSpace) - typedef Device execution_space; - - // Get the view types on the particular device the functor is instantiated for - idx_type::const_type idx; - view_type dest; - Kokkos::View src; - - localsum(idx_type idx_, view_type dest_, - view_type src_):idx(idx_),dest(dest_),src(src_) { - } - - KOKKOS_INLINE_FUNCTION - void operator() (int i) const { - double tmp = 0.0; - for(int j = 0; j < idx.dimension_1(); j++) { - const double val = src(idx(i,j)); - tmp += val*val + 0.5*(idx.dimension_0()*val -idx.dimension_1()*val); - } - dest(i) += tmp; - } -}; - -int main(int narg, char* arg[]) { - Kokkos::initialize(narg,arg); - - int size = 1000000; - - // Create Views - idx_type idx("Idx",size,64); - view_type dest("Dest",size); - view_type src("Src",size); - - srand(134231); - - // When using UVM Cuda views can be accessed on the Host directly - for(int i=0; i(idx,dest,src)); - Kokkos::fence(); - double sec1_dev = timer.seconds(); - - // No data transfer will happen now, since nothing is accessed on the host - timer.reset(); - Kokkos::parallel_for(size,localsum(idx,dest,src)); - Kokkos::fence(); - double sec2_dev = timer.seconds(); - - // Run on the host - // This will cause a sync back to the host of dest which was changed on the device - // Compare runtime here with the dual_view example: dest will be copied back in 4k blocks - // when they are accessed the first time during the parallel_for. Due to the latency of a memcpy - // this gives lower effective bandwidth when doing a manual copy via dual views - timer.reset(); - Kokkos::parallel_for(size,localsum(idx,dest,src)); - Kokkos::fence(); - double sec1_host = timer.seconds(); - - // No data transfers will happen now - timer.reset(); - Kokkos::parallel_for(size,localsum(idx,dest,src)); - Kokkos::fence(); - double sec2_host = timer.seconds(); - - - - printf("Device Time with Sync: %lf without Sync: %lf \n",sec1_dev,sec2_dev); - printf("Host Time with Sync: %lf without Sync: %lf \n",sec1_host,sec2_host); - - Kokkos::finalize(); -} - diff --git a/lib/kokkos/example/tutorial/Advanced_Views/06_AtomicViews/Makefile b/lib/kokkos/example/tutorial/Advanced_Views/06_AtomicViews/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/06_AtomicViews/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Advanced_Views/07_Overlapping_DeepCopy/Makefile b/lib/kokkos/example/tutorial/Advanced_Views/07_Overlapping_DeepCopy/Makefile deleted file mode 100644 index 06955b3641..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/07_Overlapping_DeepCopy/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 --default-stream per-thread -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Advanced_Views/07_Overlapping_DeepCopy/overlapping_deepcopy.cpp b/lib/kokkos/example/tutorial/Advanced_Views/07_Overlapping_DeepCopy/overlapping_deepcopy.cpp deleted file mode 100644 index 8c7e26c850..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/07_Overlapping_DeepCopy/overlapping_deepcopy.cpp +++ /dev/null @@ -1,148 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include - -struct FillDevice { - double value; - Kokkos::View a; - FillDevice(const double& val, const Kokkos::View& d_a): - value(val),a(d_a){} - - KOKKOS_INLINE_FUNCTION - void operator() (const int& i) const { - a(i) = value; - } -}; - -struct ComputeADevice { - int iter; - Kokkos::View a; - Kokkos::View b; - ComputeADevice(const int& iter_, - const Kokkos::View& d_a, - const Kokkos::View& d_b): - iter(iter_),a(d_a),b(d_b){} - - KOKKOS_INLINE_FUNCTION - void operator() (const int& i) const { - for(int j=1;j a; - Kokkos::View b; - ComputeAHost( const Kokkos::View& d_a, - const Kokkos::View& d_b): - a(d_a),b(d_b){} - - KOKKOS_INLINE_FUNCTION - void operator() (const int& i) const { - a(i) += b(i); - } -}; - -struct MergeDevice { - Kokkos::View a; - Kokkos::View b; - MergeDevice( - const Kokkos::View& d_a, - const Kokkos::View& d_b): - a(d_a),b(d_b){} - - KOKKOS_INLINE_FUNCTION - void operator() (const int& i) const { - a(i) += b(i); - } -}; - -int main(int argc, char * argv[]) { - int size = 100000000; - Kokkos::initialize(); - int synch = atoi(argv[1]); - Kokkos::View d_a("Device A",size); - Kokkos::View d_b("Device B",size); - Kokkos::View d_tmp("Device tmp",size); - Kokkos::View h_a("Host A",size); - Kokkos::View h_b("Host B",size); - - Kokkos::parallel_for(Kokkos::RangePolicy(0,size),FillDevice(0.0,d_a)); - Kokkos::parallel_for(Kokkos::RangePolicy(0,size),FillDevice(1.3513,d_b)); - Kokkos::fence(); - Kokkos::Impl::Timer timer; - Kokkos::parallel_for(Kokkos::RangePolicy(0,size),ComputeADevice(20,d_a,d_b)); - - if(synch==1) - Kokkos::deep_copy(Kokkos::OpenMP(),h_b,d_b); - if(synch==2) - Kokkos::deep_copy(h_b,d_b); - - - Kokkos::parallel_for(Kokkos::RangePolicy(0,size),[=] (const int& i) { - h_a(i) = 0.0; - }); - Kokkos::parallel_for(Kokkos::RangePolicy(0,size),ComputeAHost(h_a,h_b)); - Kokkos::OpenMP::fence(); - if(synch==1) - Kokkos::deep_copy(Kokkos::OpenMP(), d_tmp,h_a); - if(synch==2) - Kokkos::deep_copy(d_tmp,h_a); - Kokkos::fence(); - - std::cout << "Time " << timer.seconds() << std::endl; - Kokkos::parallel_for(Kokkos::RangePolicy(0,size),MergeDevice(d_a,d_tmp)); - - Kokkos::deep_copy(h_a,d_a); - std::cout << "h_a(0): " << h_a(0) << " ( Correct: 27.4154 )" << std::endl; - Kokkos::finalize(); -} - - - diff --git a/lib/kokkos/example/tutorial/Advanced_Views/Makefile b/lib/kokkos/example/tutorial/Advanced_Views/Makefile deleted file mode 100644 index 19053b61b0..0000000000 --- a/lib/kokkos/example/tutorial/Advanced_Views/Makefile +++ /dev/null @@ -1,84 +0,0 @@ -default: - cd ./01_data_layouts; \ - make -j 4 - cd ./02_memory_traits; \ - make -j 4 - cd ./03_subviews; \ - make -j 4 - cd ./04_dualviews; \ - make -j 4 - cd ./05_NVIDIA_UVM; \ - make -j 4 - cd ./06_AtomicViews; \ - make -j 4 - -openmp: - cd ./01_data_layouts; \ - make -j 4 KOKKOS_DEVICES=OpenMP - cd ./02_memory_traits; \ - make -j 4 KOKKOS_DEVICES=OpenMP - cd ./03_subviews; \ - make -j 4 KOKKOS_DEVICES=OpenMP - cd ./04_dualviews; \ - make -j 4 KOKKOS_DEVICES=OpenMP - cd ./05_NVIDIA_UVM; \ - make -j 4 KOKKOS_DEVICES=OpenMP - cd ./06_AtomicViews; \ - make -j 4 KOKKOS_DEVICES=OpenMP - -pthreads: - cd ./01_data_layouts; \ - make -j 4 KOKKOS_DEVICES=Pthreads - cd ./02_memory_traits; \ - make -j 4 KOKKOS_DEVICES=Pthreads - cd ./03_subviews; \ - make -j 4 KOKKOS_DEVICES=Pthreads - cd ./04_dualviews; \ - make -j 4 KOKKOS_DEVICES=Pthreads - cd ./05_NVIDIA_UVM; \ - make -j 4 KOKKOS_DEVICES=Pthreads - cd ./06_AtomicViews; \ - make -j 4 KOKKOS_DEVICES=Pthreads - -serial: - cd ./01_data_layouts; \ - make -j 4 KOKKOS_DEVICES=Serial - cd ./02_memory_traits; \ - make -j 4 KOKKOS_DEVICES=Serial - cd ./03_subviews; \ - make -j 4 KOKKOS_DEVICES=Serial - cd ./04_dualviews; \ - make -j 4 KOKKOS_DEVICES=Serial - cd ./05_NVIDIA_UVM; \ - make -j 4 KOKKOS_DEVICES=Serial - cd ./06_AtomicViews; \ - make -j 4 KOKKOS_DEVICES=Serial - -cuda: - cd ./01_data_layouts; \ - make -j 4 KOKKOS_DEVICES=Cuda,Serial - cd ./02_memory_traits; \ - make -j 4 KOKKOS_DEVICES=Cuda,Serial - cd ./03_subviews; \ - make -j 4 KOKKOS_DEVICES=Cuda,Serial - cd ./04_dualviews; \ - make -j 4 KOKKOS_DEVICES=Cuda,Serial - cd ./05_NVIDIA_UVM; \ - make -j 4 KOKKOS_DEVICES=Cuda,Serial - cd ./06_AtomicViews; \ - make -j 4 KOKKOS_DEVICES=Cuda,Serial - -clean: - cd ./01_data_layouts; \ - make clean - cd ./02_memory_traits; \ - make clean - cd ./03_subviews; \ - make clean - cd ./04_dualviews; \ - make clean - cd ./05_NVIDIA_UVM; \ - make clean - cd ./06_AtomicViews; \ - make clean - diff --git a/lib/kokkos/example/tutorial/Algorithms/01_random_numbers/Makefile b/lib/kokkos/example/tutorial/Algorithms/01_random_numbers/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Algorithms/01_random_numbers/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Algorithms/01_random_numbers/random_numbers.cpp b/lib/kokkos/example/tutorial/Algorithms/01_random_numbers/random_numbers.cpp deleted file mode 100644 index 52816333c2..0000000000 --- a/lib/kokkos/example/tutorial/Algorithms/01_random_numbers/random_numbers.cpp +++ /dev/null @@ -1,152 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include - -typedef Kokkos::HostSpace::execution_space DefaultHostType; - -// Kokkos provides two different random number generators with a 64 bit and a 1024 bit state. -// These generators are based on Vigna, Sebastiano (2014). "An experimental exploration of Marsaglia's xorshift generators, scrambled" -// See: http://arxiv.org/abs/1402.6246 -// The generators can be used fully independently on each thread and have been tested to -// produce good statistics for both inter and intra thread numbers. -// Note that within a kernel NO random number operations are (team) collective operations. -// Everything can be called within branches. This is a difference to the curand library where -// certain operations are required to be called by all threads in a block. -// -// In Kokkos you are required to create a pool of generator states, so that threads can -// grep their own. On CPU architectures the pool size is equal to the thread number, -// on CUDA about 128k states are generated (enough to give every potentially simultaneously -// running thread its own state). With a kernel a thread is required to aquire a state from the -// pool and later return it. -// On CPUs the Random number generator is deterministic if using the same number of threads. -// On GPUs (i.e. using the CUDA backend it is not deterministic because threads aquire states via -// atomics. - -// A Functor for generating uint64_t random numbers templated on the GeneratorPool type -template -struct generate_random { - - // The GeneratorPool - GeneratorPool rand_pool; - - // Output View for the random numbers - Kokkos::View vals; - int samples; - - // Initialize all members - generate_random(Kokkos::View vals_, - GeneratorPool rand_pool_, - int samples_): - vals(vals_),rand_pool(rand_pool_),samples(samples_) {} - - KOKKOS_INLINE_FUNCTION - void operator() (int i) const { - // Get a random number state from the pool for the active thread - typename GeneratorPool::generator_type rand_gen = rand_pool.get_state(); - - // Draw samples numbers from the pool as urand64 between 0 and rand_pool.MAX_URAND64 - // Note there are function calls to get other type of scalars, and also to specify - // Ranges or get a normal distributed float. - for(int k = 0;k rand_pool64(5374857); - Kokkos::Random_XorShift1024_Pool<> rand_pool1024(5374857); - Kokkos::DualView vals("Vals",size*samples); - - // Run some performance comparisons - Kokkos::Impl::Timer timer; - Kokkos::parallel_for(size,generate_random >(vals.d_view,rand_pool64,samples)); - Kokkos::fence(); - - timer.reset(); - Kokkos::parallel_for(size,generate_random >(vals.d_view,rand_pool64,samples)); - Kokkos::fence(); - double time_64 = timer.seconds(); - - Kokkos::parallel_for(size,generate_random >(vals.d_view,rand_pool1024,samples)); - Kokkos::fence(); - - timer.reset(); - Kokkos::parallel_for(size,generate_random >(vals.d_view,rand_pool1024,samples)); - Kokkos::fence(); - double time_1024 = timer.seconds(); - - printf("#Time XorShift64*: %lf %lf\n",time_64,1.0e-9*samples*size/time_64 ); - printf("#Time XorShift1024*: %lf %lf\n",time_1024,1.0e-9*samples*size/time_1024 ); - - Kokkos::deep_copy(vals.h_view,vals.d_view); - - Kokkos::finalize(); - } - return 0; -} - - diff --git a/lib/kokkos/example/tutorial/Algorithms/Makefile b/lib/kokkos/example/tutorial/Algorithms/Makefile deleted file mode 100644 index edc2a36024..0000000000 --- a/lib/kokkos/example/tutorial/Algorithms/Makefile +++ /dev/null @@ -1,24 +0,0 @@ -default: - cd ./01_random_numbers; \ - make -j 4 - -openmp: - cd ./01_random_numbers; \ - make -j 4 KOKKOS_DEVICES=OpenMP - -pthreads: - cd ./01_random_numbers; \ - make -j 4 KOKKOS_DEVICES=Pthreads - -serial: - cd ./01_random_numbers; \ - make -j 4 KOKKOS_DEVICES=Serial - -cuda: - cd ./01_random_numbers; \ - make -j 4 KOKKOS_DEVICES=Cuda,Serial - -clean: - cd ./01_random_numbers; \ - make clean - diff --git a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams/Makefile b/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams/thread_teams.cpp b/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams/thread_teams.cpp deleted file mode 100644 index f2de0809a7..0000000000 --- a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams/thread_teams.cpp +++ /dev/null @@ -1,94 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -// Using default execution space define a TeamPolicy and its member_type -// The member_type is what the operator of a functor or Lambda gets, for -// a simple RangePolicy the member_type is simply an integer -// For a TeamPolicy its a much richer object, since it provides all information -// to identify a thread uniquely and some team related function calls such as a -// barrier (which will be used in a subsequent example). -// A ThreadTeam consists of 1 to n threads where the maxmimum value of n is -// determined by the hardware. On a dual socket CPU machine with 8 cores per socket -// the maximum size of a team is 8. The number of teams (i.e. the league_size) is -// not limited by physical constraints. Its a pure logical number. - -typedef Kokkos::TeamPolicy<> team_policy ; -typedef team_policy::member_type team_member ; - -// Define a functor which can be launched using the TeamPolicy -struct hello_world { - typedef int value_type; //Specify value type for reduction target, sum - - // This is a reduction operator which now takes as first argument the - // TeamPolicy member_type. Every member of the team contributes to the - // total sum. - // It is helpful to think of this operator as a parallel region for a team - // (i.e. every team member is active and will execute the code). - KOKKOS_INLINE_FUNCTION - void operator() ( const team_member & thread, int& sum) const { - sum+=1; - // The TeamPolicy<>::member_type provides functions to query the multi - // dimensional index of a thread as well as the number of thread-teams and the size - // of each team. - printf("Hello World: %i %i // %i %i\n",thread.league_rank(),thread.team_rank(),thread.league_size(),thread.team_size()); - } -}; - -int main(int narg, char* args[]) { - Kokkos::initialize(narg,args); - - // Launch 12 teams of the maximum number of threads per team - const team_policy policy( 12 , team_policy::team_size_max( hello_world() ) ); - - int sum = 0; - Kokkos::parallel_reduce( policy , hello_world() , sum ); - - // The result will be 12*team_policy::team_size_max( hello_world()) - printf("Result %i\n",sum); - - Kokkos::finalize(); -} - diff --git a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams_lambda/Makefile b/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams_lambda/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams_lambda/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams_lambda/thread_teams_lambda.cpp b/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams_lambda/thread_teams_lambda.cpp deleted file mode 100644 index 5d081bf62b..0000000000 --- a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/01_thread_teams_lambda/thread_teams_lambda.cpp +++ /dev/null @@ -1,93 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -// Demonstrate a parallel reduction using thread teams (TeamPolicy). -// -// A thread team consists of 1 to n threads. The hardware determines -// the maxmimum value of n. On a dual-socket CPU machine with 8 cores -// per socket, the maximum size of a team is 8. The number of teams -// (the league_size) is not limited by physical constraints (up to -// some reasonable bound, which eventually depends upon the hardware -// and programming model implementation). - -int main (int narg, char* args[]) { - using Kokkos::parallel_reduce; - typedef Kokkos::TeamPolicy<> team_policy; - typedef typename team_policy::member_type team_member; - - Kokkos::initialize (narg, args); - - // Set up a policy that launches 12 teams, with the maximum number - // of threads per team. - const team_policy policy (12, team_policy::team_size_max ( [=]{} )); - - // This is a reduction with a team policy. The team policy changes - // the first argument of the lambda. Rather than an integer index - // (as with RangePolicy), it's now TeamPolicy::member_type. This - // object provides all information to identify a thread uniquely. - // It also provides some team-related function calls such as a team - // barrier (which a subsequent example will use). - // - // Every member of the team contributes to the total sum. It is - // helpful to think of the lambda's body as a "team parallel - // region." That is, every team member is active and will execute - // the body of the lambda. - int sum = 0; - parallel_reduce (policy, KOKKOS_LAMBDA (const team_member& thread, int& lsum) { - lsum += 1; - // TeamPolicy<>::member_type provides functions to query the - // multidimensional index of a thread, as well as the number of - // thread teams and the size of each team. - printf ("Hello World: %i %i // %i %i\n", thread.league_rank (), - thread.team_rank (), thread.league_size (), thread.team_size ()); - }, sum); - - // The result will be 12*team_policy::team_size_max([=]{}) - printf ("Result %i\n",sum); - - Kokkos::finalize (); -} - diff --git a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/02_nested_parallel_for/Makefile b/lib/kokkos/example/tutorial/Hierarchical_Parallelism/02_nested_parallel_for/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/02_nested_parallel_for/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/02_nested_parallel_for/nested_parallel_for.cpp b/lib/kokkos/example/tutorial/Hierarchical_Parallelism/02_nested_parallel_for/nested_parallel_for.cpp deleted file mode 100644 index 4357b4fa1a..0000000000 --- a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/02_nested_parallel_for/nested_parallel_for.cpp +++ /dev/null @@ -1,89 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include - -// See 01_thread_teams for an explanation of a basic TeamPolicy -typedef Kokkos::TeamPolicy<> team_policy ; -typedef typename team_policy::member_type team_member ; - -struct hello_world { - typedef int value_type; //Specify value type for reduction target, sum - KOKKOS_INLINE_FUNCTION - void operator() ( const team_member & thread, int& sum) const { - sum+=1; - // When using the TeamPolicy Kokkos allows for nested parallel loops. - // All three Kokkos parallel patterns are allowed (for, reduce, scan) and they - // largely follow the same syntax as on the global level. - // The execution policy for the Thread level nesting (the Vector level is in the next - // tutorial example) is Kokkos::TeamThreadRange. This means the loop will be executed - // by all members of the team and the loop count will be split between threads of the - // team. Its arguments are the team_member, and a loop count. - // Not every thread will do the same amount of iterations. On a GPU for example with - // a team_size() larger than 31 only the first 31 threads would actually do anything. - // On a CPU with 8 threads 7 would execute 4 loop iterations, and 1 thread would do - // 3. Note also that the mode of splitting the count is architecture dependent similar - // to what the RangePolicy on a global level does. - // The call itself is not guaranteed to be synchronous. Also keep in mind that the - // operator using a team_policy acts like a parallel region for the team. That means - // that everything outside of the nested parallel_for is also executed by all threads - // of the team. - Kokkos::parallel_for(Kokkos::TeamThreadRange(thread,31), [&] (const int& i) { - printf("Hello World: (%i , %i) executed loop %i \n",thread.league_rank(),thread.team_rank(),i); - }); - } -}; - -int main(int narg, char* args[]) { - Kokkos::initialize(narg,args); - - // Launch 3 teams of the maximum number of threads per team - const team_policy policy( 3 , team_policy::team_size_max( hello_world() ) ); - - int sum = 0; - Kokkos::parallel_reduce( policy , hello_world() , sum ); - printf("Result %i\n",sum); - - Kokkos::finalize(); -} diff --git a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/03_vectorization/Makefile b/lib/kokkos/example/tutorial/Hierarchical_Parallelism/03_vectorization/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/03_vectorization/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/03_vectorization/vectorization.cpp b/lib/kokkos/example/tutorial/Hierarchical_Parallelism/03_vectorization/vectorization.cpp deleted file mode 100644 index 0eac4309a9..0000000000 --- a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/03_vectorization/vectorization.cpp +++ /dev/null @@ -1,162 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include - -#ifdef KOKKOS_HAVE_CXX11 - -// The TeamPolicy actually supports 3D parallelism: Teams, Threads, Vector -// Kokkos::parallel_{for/reduce/scan} calls can be completely free nested. -// The execution policies for the nested layers are TeamThreadRange and -// ThreadVectorRange. -// The only restriction on nesting is that a given level can only be nested in a -// higher one. e.g. a ThreadVectorRange can be nested inside a TeamPolicy operator -// and inside a TeamThreadRange, but you can not nest a ThreadVectorRange or a -// TeamThreadRange inside another ThreadVectorRange. -// As with the 2D execution of TeamPolicy the operator has to be considered as -// a parallel region even with respect to VectorLanes. That means even outside -// a TeamThread or VectorThread loop all threads of a team and all vector lanes -// of a thread execute every line of the operator as long as there are no restricitons -// on them. -// Code lines can be restricted using Kokkos::single to either execute once PerThread -// or execute once PerTeam. -typedef typename Kokkos::TeamPolicy<>::member_type team_member ; - -struct SomeCorrelation { - typedef int value_type; //Specify value type for reduction target, sum - typedef Kokkos::DefaultExecutionSpace::scratch_memory_space shared_space; - typedef Kokkos::View shared_1d_int; - - Kokkos::View data; - Kokkos::View gsum; - - SomeCorrelation(Kokkos::View data_in, - Kokkos::View sum):data(data_in),gsum(sum){} - - KOKKOS_INLINE_FUNCTION - void operator() ( const team_member & thread) const { - int i = thread.league_rank(); - - // Allocate a shared array for the team. - shared_1d_int count(thread.team_shmem(),data.dimension_1()); - - // With each team run a parallel_for with its threads - Kokkos::parallel_for(Kokkos::TeamThreadRange(thread,data.dimension_1()), [=] (const int& j) { - int tsum; - // Run a vector loop reduction over the inner dimension of data - // Count how many values are multiples of 4 - // Every vector lane gets the same reduction value (tsum) back, it is broadcast to all vector lanes - Kokkos::parallel_reduce(Kokkos::ThreadVectorRange(thread,data.dimension_2()), [=] (const int& k, int & vsum) { - vsum+= (data(i,j,k) % 4 == 0)?1:0; - },tsum); - - // Make sure only one vector lane adds the reduction value to the shared array, i.e. execute - // the next line only once PerThread - Kokkos::single(Kokkos::PerThread(thread),[=] () { - count(j) = tsum; - }); - }); - - // Wait for all threads to finish the parallel_for so that all shared memory writes are done - thread.team_barrier(); - - // Check with one vector lane from each thread how many consecutive - // data segments have the same number of values divisible by 4 - // The team reduction value is again broadcast to every team member (and every vector lane) - int team_sum = 0; - Kokkos::parallel_reduce(Kokkos::TeamThreadRange(thread, data.dimension_1()-1), [=] (const int& j, int& thread_sum) { - // It is not valid to directly add to thread_sum - // Use a single function with broadcast instead - // team_sum will be used as input to the operator (i.e. it is used to initialize sum) - // the end value of sum will be broadcast to all vector lanes in the thread. - Kokkos::single(Kokkos::PerThread(thread),[=] (int& sum) { - if(count(j)==count(j+1)) sum++; - },thread_sum); - },team_sum); - - // Add with one thread and vectorlane of the team the team_sum to the global value - Kokkos::single(Kokkos::PerTeam(thread),[=] () { - Kokkos::atomic_add(&gsum(),team_sum); - }); - } - - // The functor needs to define how much shared memory it requests given a team_size. - size_t team_shmem_size( int team_size ) const { - return shared_1d_int::shmem_size(data.dimension_1()); - } -}; - -int main(int narg, char* args[]) { - Kokkos::initialize(narg,args); - - // Produce some 3D random data (see Algorithms/01_random_numbers for more info) - Kokkos::View data("Data",512,512,32); - Kokkos::Random_XorShift64_Pool<> rand_pool64(5374857); - Kokkos::fill_random(data,rand_pool64,100); - - // A global value to put the result in - Kokkos::View gsum("Sum"); - - // Each team handles a slice of the data - // Set up TeamPolicy with 512 teams with maximum number of threads per team and 16 vector lanes. - // The team_size_max function will determine the maximum number of threads taking into account - // shared memory requirements of the Functor. - // The maximum vector length is hardware dependent but can always be smaller than the hardware allows. - // The vector length must be a power of 2. - const Kokkos::TeamPolicy<> policy( 512 , Kokkos::TeamPolicy<>::team_size_max(SomeCorrelation(data,gsum)) , 16); - - Kokkos::parallel_for( policy , SomeCorrelation(data,gsum) ); - - Kokkos::fence(); - - // Copy result value back - int sum = 0; - Kokkos::deep_copy(sum,gsum); - printf("Result %i\n",sum); - - Kokkos::finalize(); -} - -#endif //KOKKOS_HAVE_CXX11 diff --git a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/04_team_scan/Makefile b/lib/kokkos/example/tutorial/Hierarchical_Parallelism/04_team_scan/Makefile deleted file mode 100644 index 3d056537c3..0000000000 --- a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/04_team_scan/Makefile +++ /dev/null @@ -1,43 +0,0 @@ -KOKKOS_PATH = ../../../.. -SRC = $(wildcard *.cpp) - -default: build - echo "Start Build" - -ifneq (,$(findstring Cuda,$(KOKKOS_DEVICES))) -CXX = nvcc_wrapper -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.cuda) -KOKKOS_DEVICES = "Cuda,OpenMP" -KOKKOS_ARCH = "SNB,Kepler35" -else -CXX = g++ -CXXFLAGS = -O3 -LINK = ${CXX} -LINKFLAGS = -EXE = $(SRC:.cpp=.host) -KOKKOS_DEVICES = "OpenMP" -KOKKOS_ARCH = "SNB" -endif - -DEPFLAGS = -M - -OBJ = $(SRC:.cpp=.o) -LIB = - -include $(KOKKOS_PATH)/Makefile.kokkos - -build: $(EXE) - -$(EXE): $(OBJ) $(KOKKOS_LINK_DEPENDS) - $(LINK) $(KOKKOS_LDFLAGS) $(LINKFLAGS) $(EXTRA_PATH) $(OBJ) $(KOKKOS_LIBS) $(LIB) -o $(EXE) - -clean: kokkos-clean - rm -f *.o *.cuda *.host - -# Compilation rules - -%.o:%.cpp $(KOKKOS_CPP_DEPENDS) - $(CXX) $(KOKKOS_CPPFLAGS) $(KOKKOS_CXXFLAGS) $(CXXFLAGS) $(EXTRA_INC) -c $< diff --git a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/04_team_scan/team_scan.cpp b/lib/kokkos/example/tutorial/Hierarchical_Parallelism/04_team_scan/team_scan.cpp deleted file mode 100644 index a9b20da1ae..0000000000 --- a/lib/kokkos/example/tutorial/Hierarchical_Parallelism/04_team_scan/team_scan.cpp +++ /dev/null @@ -1,141 +0,0 @@ -/* -//@HEADER -// ************************************************************************ -// -// Kokkos v. 2.0 -// Copyright (2014) Sandia Corporation -// -// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, -// the U.S. Government retains certain rights in this software. -// -// Redistribution and use in source and binary forms, with or without -// modification, are permitted provided that the following conditions are -// met: -// -// 1. Redistributions of source code must retain the above copyright -// notice, this list of conditions and the following disclaimer. -// -// 2. Redistributions in binary form must reproduce the above copyright -// notice, this list of conditions and the following disclaimer in the -// documentation and/or other materials provided with the distribution. -// -// 3. Neither the name of the Corporation nor the names of the -// contributors may be used to endorse or promote products derived from -// this software without specific prior written permission. -// -// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY -// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE -// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, -// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, -// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// -// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) -// -// ************************************************************************ -//@HEADER -*/ - -#include -#include -#include -#include -#include - -typedef Kokkos::DefaultExecutionSpace Device ; -typedef Kokkos::HostSpace::execution_space Host ; - -typedef Kokkos::TeamPolicy< Device > team_policy ; -typedef team_policy::member_type team_member ; - -static const int TEAM_SIZE = 16 ; - -struct find_2_tuples { - int chunk_size; - Kokkos::View data; - Kokkos::View histogram; - - find_2_tuples(int chunk_size_, Kokkos::DualView data_, - Kokkos::DualView histogram_):chunk_size(chunk_size_), - data(data_.d_view),histogram(histogram_.d_view) { - data_.sync(); - histogram_.sync(); - histogram_.modify(); - } - - KOKKOS_INLINE_FUNCTION - void operator() ( const team_member & dev) const { - Kokkos::View l_histogram(dev.team_shmem(),TEAM_SIZE,TEAM_SIZE); - Kokkos::View l_data(dev.team_shmem(),chunk_size+1); - - const int i = dev.league_rank() * chunk_size; - for(int j = dev.team_rank(); j data("data",nchunks*chunk_size+1); - - srand(1231093); - - for(int i = 0; i < (int) data.dimension_0(); i++) { - data.h_view(i) = rand()%TEAM_SIZE; - } - data.modify(); - data.sync(); - - Kokkos::DualView histogram("histogram",TEAM_SIZE,TEAM_SIZE); - - - Kokkos::Impl::Timer timer; - // threads/team is automatically limited to maximum supported by the device. - Kokkos::parallel_for( team_policy( nchunks , TEAM_SIZE ) - , find_2_tuples(chunk_size,data,histogram) ); - Kokkos::fence(); - double time = timer.seconds(); - - histogram.sync(); - - printf("Time: %f \n\n",time); - int sum = 0; - for(int k=0; k 0 ]] -do -key="$1" - -case $key in - --kokkos-path*) - KOKKOS_PATH="${key#*=}" - ;; - --prefix*) - PREFIX="${key#*=}" - ;; - --with-cuda) - KOKKOS_DEVICES="${KOKKOS_DEVICES},Cuda" - CUDA_PATH_NVCC=`which nvcc` - CUDA_PATH=${CUDA_PATH_NVCC%/bin/nvcc} - ;; - --with-cuda*) - KOKKOS_DEVICES="${KOKKOS_DEVICES},Cuda" - CUDA_PATH="${key#*=}" - ;; - --with-openmp) - KOKKOS_DEVICES="${KOKKOS_DEVICES},OpenMP" - ;; - --with-pthread) - KOKKOS_DEVICES="${KOKKOS_DEVICES},Pthread" - ;; - --with-serial) - KOKKOS_DEVICES="${KOKKOS_DEVICES},Serial" - ;; - --with-qthread*) - KOKKOS_DEVICES="${KOKKOS_DEVICES},Qthread" - QTHREAD_PATH="${key#*=}" - ;; - --with-devices*) - DEVICES="${key#*=}" - KOKKOS_DEVICES="${KOKKOS_DEVICES},${DEVICES}" - ;; - --with-gtest*) - GTEST_PATH="${key#*=}" - ;; - --with-hwloc*) - HWLOC_PATH="${key#*=}" - ;; - --arch*) - KOKKOS_ARCH="${key#*=}" - ;; - --cxxflags*) - CXXFLAGS="${key#*=}" - ;; - --ldflags*) - LDFLAGS="${key#*=}" - ;; - --debug|-dbg) - KOKKOS_DEBUG=yes - ;; - --compiler*) - COMPILER="${key#*=}" - ;; - --help) - echo "Kokkos configure options:" - echo "--kokkos-path=/Path/To/Kokkos: Path to the Kokkos root directory" - echo "" - echo "--with-cuda[=/Path/To/Cuda]: enable Cuda and set path to Cuda Toolkit" - echo "--with-openmp: enable OpenMP backend" - echo "--with-pthread: enable Pthreads backend" - echo "--with-serial: enable Serial backend" - echo "--with-qthread=/Path/To/Qthread: enable Qthread backend" - echo "--with-devices: explicitly add a set of backends" - echo "" - echo "--arch=[OPTIONS]: set target architectures. Options are:" - echo " SNB = Intel Sandy/Ivy Bridge CPUs" - echo " HSW = Intel Haswell CPUs" - echo " KNC = Intel Knights Corner Xeon Phi" - echo " Kepler30 = NVIDIA Kepler generation CC 3.0" - echo " Kepler35 = NVIDIA Kepler generation CC 3.5" - echo " Kepler37 = NVIDIA Kepler generation CC 3.7" - echo " Maxwell50 = NVIDIA Maxwell generation CC 5.0" - echo " Power8 = IBM Power 8 CPUs" - echo "" - echo "--compiler=/Path/To/Compiler set the compiler" - echo "--debug,-dbg: enable Debugging" - echo "--cxxflags=[FLAGS] overwrite CXXFLAGS for library build and test build" - echo " This will still set certain required flags via" - echo " KOKKOS_CXXFLAGS (such as -fopenmp, --std=c++11, etc.)" - echo "--ldflags=[FLAGS] overwrite LDFLAGS for library build and test build" - echo " This will still set certain required flags via" - echo " KOKKOS_LDFLAGS (such as -fopenmp, -lpthread, etc.)" - echo "--with-gtest=/Path/To/Gtest: set path to gtest (used in unit and performance tests" - echo "--with-hwloc=/Path/To/Hwloc: set path to hwloc" - exit 0 - ;; - *) - # unknown option - ;; -esac -shift -done - -# If KOKKOS_PATH undefined, assume parent dir of this -# script is the KOKKOS_PATH -if [ -z "$KOKKOS_PATH" ]; then - KOKKOS_PATH=$( cd "$( dirname "${BASH_SOURCE[0]}" )" && pwd ) -else - # Ensure KOKKOS_PATH is abs path - KOKKOS_PATH=$( cd $KOKKOS_PATH && pwd ) -fi - -KOKKOS_OPTIONS="KOKKOS_PATH=${KOKKOS_PATH}" - -if [ ${#COMPILER} -gt 0 ]; then -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} CXX=${COMPILER}" -fi -if [ ${#PREFIX} -gt 0 ]; then -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} PREFIX=${PREFIX}" -fi -if [ ${#KOKKOS_DEVICES} -gt 0 ]; then -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} KOKKOS_DEVICES=${KOKKOS_DEVICES}" -fi -if [ ${#KOKKOS_ARCH} -gt 0 ]; then -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} KOKKOS_ARCH=${KOKKOS_ARCH}" -fi -if [ ${#KOKKOS_DEBUG} -gt 0 ]; then -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} KOKKOS_DEBUG=${KOKKOS_DEBUG}" -fi -if [ ${#CUDA_PATH} -gt 0 ]; then -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} CUDA_PATH=${CUDA_PATH}" -fi -if [ ${#CXXFLAGS} -gt 0 ]; then -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} CXXFLAGS=\"${CXXFLAGS}\"" -fi -if [ ${#LDFLAGS} -gt 0 ]; then -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} LDFLAGS=\"${LDFLAGS}\"" -fi -if [ ${#GTEST_PATH} -gt 0 ]; then -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} GTEST_PATH=${GTEST_PATH}" -else -GTEST_PATH=${KOKKOS_PATH}/tpls/gtest -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} GTEST_PATH=${GTEST_PATH}" -fi -if [ ${#HWLOC_PATH} -gt 0 ]; then -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} HWLOC_PATH=${HWLOC_PATH} KOKKOS_USE_TPLS=hwloc" -fi -if [ ${#QTHREAD_PATH} -gt 0 ]; then -KOKKOS_OPTIONS="${KOKKOS_OPTIONS} QTHREAD_PATH=${QTHREAD_PATH}" -fi -mkdir core -mkdir core/unit_test -mkdir core/perf_test -mkdir containers -mkdir containers/unit_tests -mkdir containers/performance_tests -mkdir algorithms -mkdir algorithms/unit_tests -mkdir algorithms/performance_tests -mkdir example -mkdir example/fixture -mkdir example/feint -mkdir example/fenl - - -echo "Generating Makefile with options " ${KOKKOS_OPTIONS} -echo "KOKKOS_OPTIONS=${KOKKOS_OPTIONS}" > Makefile -echo "" >> Makefile -echo "lib:" >> Makefile -echo -e "\tcd core; \\" >> Makefile -echo -e "\tmake -j -j -f ${KOKKOS_PATH}/core/src/Makefile ${KOKKOS_OPTIONS}" >> Makefile -echo "" >> Makefile -echo "install: lib" >> Makefile -echo -e "\tcd core; \\" >> Makefile -echo -e "\tmake -j -f ${KOKKOS_PATH}/core/src/Makefile ${KOKKOS_OPTIONS} install" >> Makefile -echo "" >> Makefile -echo "build-test:" >> Makefile -echo -e "\tcd core/unit_test; \\" >> Makefile -echo -e "\tmake -j -f ${KOKKOS_PATH}/core/unit_test/Makefile ${KOKKOS_OPTIONS}" >> Makefile -echo -e "\tcd core/perf_test; \\" >> Makefile -echo -e "\tmake -j -f ${KOKKOS_PATH}/core/perf_test/Makefile ${KOKKOS_OPTIONS}" >> Makefile -echo -e "\tcd containers/unit_tests; \\" >> Makefile -echo -e "\tmake -j -f ${KOKKOS_PATH}/containers/unit_tests/Makefile ${KOKKOS_OPTIONS}" >> Makefile -echo -e "\tcd containers/performance_tests; \\" >> Makefile -echo -e "\tmake -j -f ${KOKKOS_PATH}/containers/performance_tests/Makefile ${KOKKOS_OPTIONS}" >> Makefile -echo -e "\tcd algorithms/unit_tests; \\" >> Makefile -echo -e "\tmake -j -f ${KOKKOS_PATH}/algorithms/unit_tests/Makefile ${KOKKOS_OPTIONS}" >> Makefile -echo -e "\tcd example/fixture; \\" >> Makefile -echo -e "\tmake -f ${KOKKOS_PATH}/example/fixture/Makefile ${KOKKOS_OPTIONS}" >> Makefile -echo -e "\tcd example/feint; \\" >> Makefile -echo -e "\tmake -f ${KOKKOS_PATH}/example/feint/Makefile ${KOKKOS_OPTIONS}" >> Makefile -echo -e "\tcd example/fenl; \\" >> Makefile -echo -e "\tmake -f ${KOKKOS_PATH}/example/fenl/Makefile ${KOKKOS_OPTIONS}" >> Makefile -echo "" >> Makefile -echo "test: build-test" >> Makefile -echo -e "\tcd core/unit_test; \\" >> Makefile -echo -e "\tmake -f ${KOKKOS_PATH}/core/unit_test/Makefile ${KOKKOS_OPTIONS} test" >> Makefile -echo -e "\tcd core/perf_test; \\" >> Makefile -echo -e "\tmake -f ${KOKKOS_PATH}/core/perf_test/Makefile ${KOKKOS_OPTIONS} test" >> Makefile -echo -e "\tcd containers/unit_tests; \\" >> Makefile -echo -e "\tmake -f ${KOKKOS_PATH}/containers/unit_tests/Makefile ${KOKKOS_OPTIONS} test" >> Makefile -echo -e "\tcd containers/performance_tests; \\" >> Makefile -echo -e "\tmake -f ${KOKKOS_PATH}/containers/performance_tests/Makefile ${KOKKOS_OPTIONS} test" >> Makefile -echo -e "\tcd algorithms/unit_tests; \\" >> Makefile -echo -e "\tmake -f ${KOKKOS_PATH}/algorithms/unit_tests/Makefile ${KOKKOS_OPTIONS} test" >> Makefile -echo -e "\tcd example/fixture; \\" >> Makefile -echo -e "\tmake -f ${KOKKOS_PATH}/example/fixture/Makefile ${KOKKOS_OPTIONS} test" >> Makefile -echo -e "\tcd example/feint; \\" >> Makefile -echo -e "\tmake -f ${KOKKOS_PATH}/example/feint/Makefile ${KOKKOS_OPTIONS} test" >> Makefile -echo -e "\tcd example/fenl; \\" >> Makefile -echo -e "\tmake -f ${KOKKOS_PATH}/example/fenl/Makefile ${KOKKOS_OPTIONS} test" >> Makefile - -