FM / cpu

/usr/local/lib64/python3.6/site-packages/torch/include/ATen/native/cpu/

/usr/local/lib64/python3.6/site-packages/torch/include/ATen/native/cpu

Name	Size	Mode	Actions
AtomicAddFloat.h	750	0644	edit dl rm
avx_mathfun.h	17448	0644	edit dl rm
CatKernel.h	252	0644	edit dl rm
DepthwiseConvKernel.h	447	0644	edit dl rm
DistributionTemplates.h	14051	0644	edit dl rm
GridSamplerKernel.h	592	0644	edit dl rm
Intrinsics.h	1212	0644	edit dl rm
IsContiguous.h	2414	0644	edit dl rm
Loops.h	14411	0644	edit dl rm
MaxUnpoolKernel.h	483	0644	edit dl rm
moments_utils.h	4245	0644	edit dl rm
Reduce.h	10955	0644	edit dl rm
SoftmaxKernel.h	636	0644	edit dl rm
StackKernel.h	315	0644	edit dl rm
utils.h	1093	0644	edit dl rm
zmath.h	6480	0644	edit dl rm

Edit: /usr/local/lib64/python3.6/site-packages/torch/include/ATen/native/cpu/utils.h (1093B)

#pragma once

#include <ATen/cpu/vec/vec.h>
#include <c10/util/llvmMathExtras.h>

namespace at {
namespace native {

namespace {

template <typename T>
inline T data_index_init(T offset) {
  return offset;
}

template <typename T, typename... Args>
inline T data_index_init(T offset, T& x, const T& X, Args&&... args) {
  offset = data_index_init(offset, std::forward<Args>(args)...);
  x = offset % X;
  return offset / X;
}

inline bool data_index_step() {
  return true;
}

template <typename T, typename... Args>
inline bool data_index_step(T& x, const T& X, Args&&... args) {
  if (data_index_step(std::forward<Args>(args)...)) {
    x = ((x + 1) == X) ? 0 : (x + 1);
    return x == 0;
  }
  return false;
}

} // namespace

namespace utils {

template <typename T>
T CeilLog2(const T& x) {
  if (x <= 2) {
    return 1;
  }
  // Last set bit is floor(log2(x)), floor + 1 is ceil
  // except when x is an exact powers of 2, so subtract 1 first
  return static_cast<T>(llvm::findLastSet(static_cast<uint64_t>(x) - 1)) + 1;
}

} // namespace utils

} // namespace native
} // namespace at

#pragma once #include #include namespace at { namespace native { namespace { template inline T data_index_init(T offset) { return offset; } template inline T data_index_init(T offset, T& x, const T& X, Args&&... args) { offset = data_index_init(offset, std::forward(args)...); x = offset % X; return offset / X; } inline bool data_index_step() { return true; } template inline bool data_index_step(T& x, const T& X, Args&&... args) { if (data_index_step(std::forward(args)...)) { x = ((x + 1) == X) ? 0 : (x + 1); return x == 0; } return false; } } // namespace namespace utils { template T CeilLog2(const T& x) { if (x <= 2) { return 1; } // Last set bit is floor(log2(x)), floor + 1 is ceil // except when x is an exact powers of 2, so subtract 1 first return static_cast(llvm::findLastSet(static_cast(x) - 1)) + 1; } } // namespace utils } // namespace native } // namespace at