/usr/include/thrust/detail/overlapped_copy.h is in libthrust-dev 1.7.0-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 | /*
* Copyright 2008-2012 NVIDIA Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#pragma once
#include <thrust/detail/config.h>
#include <thrust/iterator/iterator_traits.h>
#include <thrust/iterator/detail/minimum_system.h>
#include <thrust/detail/copy.h>
#include <thrust/detail/temporary_array.h>
#include <thrust/system/cpp/detail/execution_policy.h>
namespace thrust
{
namespace detail
{
template<typename InputIterator,
typename OutputIterator>
OutputIterator sequential_copy(InputIterator first,
InputIterator last,
OutputIterator result)
{
for(; first != last; ++first, ++result)
{
*result = *first;
} // end for
return result;
} // end sequential_copy()
template<typename BidirectionalIterator1,
typename BidirectionalIterator2>
BidirectionalIterator2 sequential_copy_backward(BidirectionalIterator1 first,
BidirectionalIterator1 last,
BidirectionalIterator2 result)
{
// yes, we preincrement
// the ranges are open on the right, i.e. [first, last)
while(first != last)
{
*--result = *--last;
} // end while
return result;
} // end sequential_copy_backward()
namespace dispatch
{
template<typename DerivedPolicy,
typename RandomAccessIterator1,
typename RandomAccessIterator2>
RandomAccessIterator2 overlapped_copy(thrust::system::cpp::detail::execution_policy<DerivedPolicy> &,
RandomAccessIterator1 first,
RandomAccessIterator1 last,
RandomAccessIterator2 result)
{
if(first < last && first <= result && result < last)
{
// result lies in [first, last)
// it's safe to use std::copy_backward here
thrust::detail::sequential_copy_backward(first, last, result + (last - first));
result += (last - first);
} // end if
else
{
// result + (last - first) lies in [first, last)
// it's safe to use sequential_copy here
result = thrust::detail::sequential_copy(first, last, result);
} // end else
return result;
} // end overlapped_copy()
template<typename DerivedPolicy,
typename RandomAccessIterator1,
typename RandomAccessIterator2>
RandomAccessIterator2 overlapped_copy(thrust::execution_policy<DerivedPolicy> &exec,
RandomAccessIterator1 first,
RandomAccessIterator1 last,
RandomAccessIterator2 result)
{
typedef typename thrust::iterator_value<RandomAccessIterator1>::type value_type;
// make a temporary copy of [first,last), and copy into it first
thrust::detail::temporary_array<value_type, DerivedPolicy> temp(exec, first, last);
return thrust::copy(exec, temp.begin(), temp.end(), result);
} // end overlapped_copy()
} // end dispatch
template<typename RandomAccessIterator1,
typename RandomAccessIterator2>
RandomAccessIterator2 overlapped_copy(RandomAccessIterator1 first,
RandomAccessIterator1 last,
RandomAccessIterator2 result)
{
typedef typename thrust::iterator_system<RandomAccessIterator2>::type System1;
typedef typename thrust::iterator_system<RandomAccessIterator2>::type System2;
typedef typename thrust::detail::minimum_system<System1, System2>::type System;
// XXX presumes System is default constructible
System system;
return thrust::detail::dispatch::overlapped_copy(system, first, last, result);
} // end overlapped_copy()
} // end detail
} // end thrust
|