mirror of
https://github.com/facebookresearch/pytorch3d.git
synced 2025-08-02 11:52:50 +08:00
Summary: This is mostly replacing the old PackedTensorAccessor with the new PackedTensorAccessor64. Reviewed By: gkioxari Differential Revision: D21088773 fbshipit-source-id: 5973e5a29d934eafb7c70ec5ec154ca076b64d27
203 lines
7.4 KiB
Plaintext
203 lines
7.4 KiB
Plaintext
// Copyright (c) Facebook, Inc. and its affiliates. All rights reserved.
|
|
|
|
#include <torch/extension.h>
|
|
|
|
#include <cuda.h>
|
|
#include <cuda_runtime.h>
|
|
|
|
#include <stdio.h>
|
|
#include <vector>
|
|
|
|
__constant__ const float kEpsilon = 1e-4;
|
|
|
|
// TODO(gkioxari) support all data types once AtomicAdd supports doubles.
|
|
// Currently, support is for floats only.
|
|
__global__ void weightedSumNormCudaForwardKernel(
|
|
// clang-format off
|
|
torch::PackedTensorAccessor64<float, 4, torch::RestrictPtrTraits> result,
|
|
const torch::PackedTensorAccessor64<float, 2, torch::RestrictPtrTraits> features,
|
|
const torch::PackedTensorAccessor64<float, 4, torch::RestrictPtrTraits> alphas,
|
|
const torch::PackedTensorAccessor64<int64_t, 4, torch::RestrictPtrTraits> points_idx) {
|
|
// clang-format on
|
|
const int64_t batch_size = result.size(0);
|
|
const int64_t C = features.size(0);
|
|
const int64_t H = points_idx.size(2);
|
|
const int64_t W = points_idx.size(3);
|
|
|
|
// Get the batch and index
|
|
const int batch = blockIdx.x;
|
|
|
|
const int num_pixels = C * W * H;
|
|
const int num_threads = gridDim.y * blockDim.x;
|
|
const int tid = blockIdx.y * blockDim.x + threadIdx.x;
|
|
|
|
// Parallelize over each feature in each pixel in images of size H * W,
|
|
// for each image in the batch of size batch_size
|
|
for (int pid = tid; pid < num_pixels; pid += num_threads) {
|
|
int ch = pid / (W * H);
|
|
int j = (pid % (W * H)) / H;
|
|
int i = (pid % (W * H)) % H;
|
|
|
|
// Store the accumulated alpha value
|
|
float cum_alpha = 0.;
|
|
// Iterate through the closest K points for this pixel
|
|
for (int k = 0; k < points_idx.size(1); ++k) {
|
|
int n_idx = points_idx[batch][k][j][i];
|
|
// Sentinel value is -1 indicating no point overlaps the pixel
|
|
if (n_idx < 0) {
|
|
continue;
|
|
}
|
|
|
|
cum_alpha += alphas[batch][k][j][i];
|
|
}
|
|
|
|
if (cum_alpha < kEpsilon) {
|
|
cum_alpha = kEpsilon;
|
|
}
|
|
|
|
// Iterate through the closest K points for this pixel
|
|
for (int k = 0; k < points_idx.size(1); ++k) {
|
|
int n_idx = points_idx[batch][k][j][i];
|
|
// Sentinel value is -1 indicating no point overlaps the pixel
|
|
if (n_idx < 0) {
|
|
continue;
|
|
}
|
|
float alpha = alphas[batch][k][j][i];
|
|
// TODO(gkioxari) It might be more efficient to have threads write in a
|
|
// local variable, and move atomicAdd outside of the loop such that
|
|
// atomicAdd is executed once per thread.
|
|
atomicAdd(
|
|
&result[batch][ch][j][i], features[ch][n_idx] * alpha / cum_alpha);
|
|
}
|
|
}
|
|
}
|
|
|
|
// TODO(gkioxari) support all data types once AtomicAdd supports doubles.
|
|
// Currently, support is for floats only.
|
|
__global__ void weightedSumNormCudaBackwardKernel(
|
|
// clang-format off
|
|
torch::PackedTensorAccessor64<float, 2, torch::RestrictPtrTraits> grad_features,
|
|
torch::PackedTensorAccessor64<float, 4, torch::RestrictPtrTraits> grad_alphas,
|
|
const torch::PackedTensorAccessor64<float, 4, torch::RestrictPtrTraits> grad_outputs,
|
|
const torch::PackedTensorAccessor64<float, 2, torch::RestrictPtrTraits> features,
|
|
const torch::PackedTensorAccessor64<float, 4, torch::RestrictPtrTraits> alphas,
|
|
const torch::PackedTensorAccessor64<int64_t, 4, torch::RestrictPtrTraits> points_idx) {
|
|
// clang-format on
|
|
const int64_t batch_size = points_idx.size(0);
|
|
const int64_t C = features.size(0);
|
|
const int64_t H = points_idx.size(2);
|
|
const int64_t W = points_idx.size(3);
|
|
|
|
// Get the batch and index
|
|
const int batch = blockIdx.x;
|
|
|
|
const int num_pixels = C * W * H;
|
|
const int num_threads = gridDim.y * blockDim.x;
|
|
const int tid = blockIdx.y * blockDim.x + threadIdx.x;
|
|
|
|
// Parallelize over each feature in each pixel in images of size H * W,
|
|
// for each image in the batch of size batch_size
|
|
for (int pid = tid; pid < num_pixels; pid += num_threads) {
|
|
int ch = pid / (W * H);
|
|
int j = (pid % (W * H)) / H;
|
|
int i = (pid % (W * H)) % H;
|
|
|
|
float sum_alpha = 0.;
|
|
float sum_alphafs = 0.;
|
|
// Iterate through the closest K points for this pixel to calculate the
|
|
// cumulative sum of the alphas for this pixel
|
|
for (int k = 0; k < points_idx.size(1); ++k) {
|
|
int n_idx = points_idx[batch][k][j][i];
|
|
// Sentinel value is -1 indicating no point overlaps the pixel
|
|
if (n_idx < 0) {
|
|
continue;
|
|
}
|
|
|
|
sum_alpha += alphas[batch][k][j][i];
|
|
sum_alphafs += alphas[batch][k][j][i] * features[ch][n_idx];
|
|
}
|
|
|
|
if (sum_alpha < kEpsilon) {
|
|
sum_alpha = kEpsilon;
|
|
}
|
|
|
|
// Iterate again through the closest K points for this pixel to calculate
|
|
// the gradient.
|
|
for (int k = 0; k < points_idx.size(1); ++k) {
|
|
int n_idx = points_idx[batch][k][j][i];
|
|
|
|
// Sentinel value is -1 indicating no point overlaps the pixel
|
|
if (n_idx < 0) {
|
|
continue;
|
|
}
|
|
float alpha = alphas[batch][k][j][i];
|
|
|
|
// TODO(gkioxari) It might be more efficient to have threads write in a
|
|
// local variable, and move atomicAdd outside of the loop such that
|
|
// atomicAdd is executed once per thread.
|
|
atomicAdd(
|
|
&grad_alphas[batch][k][j][i],
|
|
(features[ch][n_idx] * sum_alpha - sum_alphafs) /
|
|
(sum_alpha * sum_alpha) * grad_outputs[batch][ch][j][i]);
|
|
atomicAdd(
|
|
&grad_features[ch][n_idx],
|
|
alpha * grad_outputs[batch][ch][j][i] / sum_alpha);
|
|
}
|
|
}
|
|
}
|
|
|
|
torch::Tensor weightedSumNormCudaForward(
|
|
const torch::Tensor& features,
|
|
const torch::Tensor& alphas,
|
|
const torch::Tensor& points_idx) {
|
|
const int64_t batch_size = points_idx.size(0);
|
|
const int64_t C = features.size(0);
|
|
const int64_t H = points_idx.size(2);
|
|
const int64_t W = points_idx.size(3);
|
|
|
|
auto result = torch::zeros({batch_size, C, H, W}, features.options());
|
|
|
|
const dim3 threadsPerBlock(64);
|
|
const dim3 numBlocks(batch_size, 1024 / batch_size + 1);
|
|
|
|
// TODO(gkioxari) add AT_DISPATCH_FLOATING_TYPES once atomicAdd supports
|
|
// doubles. Currently, support is for floats only.
|
|
// clang-format off
|
|
weightedSumNormCudaForwardKernel<<<numBlocks, threadsPerBlock>>>(
|
|
result.packed_accessor64<float, 4, torch::RestrictPtrTraits>(),
|
|
features.packed_accessor64<float, 2, torch::RestrictPtrTraits>(),
|
|
alphas.packed_accessor64<float, 4, torch::RestrictPtrTraits>(),
|
|
points_idx.packed_accessor64<int64_t, 4, torch::RestrictPtrTraits>());
|
|
// clang-format on
|
|
|
|
return result;
|
|
}
|
|
|
|
std::tuple<torch::Tensor, torch::Tensor> weightedSumNormCudaBackward(
|
|
const torch::Tensor& grad_outputs,
|
|
const torch::Tensor& features,
|
|
const torch::Tensor& alphas,
|
|
const torch::Tensor& points_idx) {
|
|
auto grad_features = torch::zeros_like(features);
|
|
auto grad_alphas = torch::zeros_like(alphas);
|
|
|
|
const int64_t bs = points_idx.size(0);
|
|
|
|
const dim3 threadsPerBlock(64);
|
|
const dim3 numBlocks(bs, 1024 / bs + 1);
|
|
|
|
// TODO(gkioxari) add AT_DISPATCH_FLOATING_TYPES once atomicAdd supports
|
|
// doubles. Currently, support is for floats only.
|
|
weightedSumNormCudaBackwardKernel<<<numBlocks, threadsPerBlock>>>(
|
|
// clang-format off
|
|
grad_features.packed_accessor64<float, 2, torch::RestrictPtrTraits>(),
|
|
grad_alphas.packed_accessor64<float, 4, torch::RestrictPtrTraits>(),
|
|
grad_outputs.packed_accessor64<float, 4, torch::RestrictPtrTraits>(),
|
|
features.packed_accessor64<float, 2, torch::RestrictPtrTraits>(),
|
|
alphas.packed_accessor64<float, 4, torch::RestrictPtrTraits>(),
|
|
points_idx.packed_accessor64<int64_t, 4, torch::RestrictPtrTraits>());
|
|
// clang-format on
|
|
|
|
return std::make_tuple(grad_features, grad_alphas);
|
|
}
|