160 lines
5.5 KiB
C++
160 lines
5.5 KiB
C++
// Copyright (c) 2022 PaddlePaddle Authors. All Rights Reserved.
|
|
//
|
|
// 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 <string>
|
|
#include <vector>
|
|
#include "paddle/common/ddim.h"
|
|
#include "paddle/fluid/framework/details/op_registry.h"
|
|
#include "paddle/fluid/framework/op_proto_maker.h"
|
|
#include "paddle/fluid/framework/operator.h"
|
|
#include "paddle/fluid/prim/api/generated_prim/prim_generated_api.h"
|
|
#include "paddle/phi/api/include/tensor.h"
|
|
#include "paddle/phi/common/data_type.h"
|
|
#include "paddle/phi/common/int_array.h"
|
|
#include "paddle/phi/common/place.h"
|
|
#include "paddle/phi/kernels/funcs/blas/blas.h"
|
|
#include "paddle/phi/kernels/funcs/common_infer_shape_functions.h"
|
|
|
|
namespace paddle {
|
|
class Tensor;
|
|
namespace prim {
|
|
|
|
// We put some api like utils here
|
|
template <typename T>
|
|
Tensor empty(const paddle::experimental::IntArray& shape,
|
|
DataType dtype,
|
|
const Place& place);
|
|
|
|
template <typename T>
|
|
Tensor empty_like(const Tensor& x, DataType dtype, const Place& place);
|
|
|
|
// copy tensor for output ptr, in static need use assign op
|
|
template <typename T>
|
|
void by_pass(const Tensor& x, Tensor* out);
|
|
|
|
// set output ptr impl with tmp ptr impl,in dygraph OutGradMeta should be set
|
|
template <typename T>
|
|
void set_output(const Tensor& x_tmp, Tensor* x);
|
|
|
|
// These method don't need to be specified
|
|
static DDim get_reduce_dims_from_out(const DDim& dout_dims,
|
|
const DDim& in_dims) {
|
|
int bat = dout_dims.size() - in_dims.size();
|
|
std::vector<int64_t> result(bat);
|
|
std::iota(result.begin(), result.end(), 0);
|
|
|
|
for (int i = 0; i < in_dims.size(); ++i) {
|
|
if (in_dims[i] == 1) {
|
|
if (dout_dims[i + bat] > 1) {
|
|
// no need to reduce when dout_dims[i + bat] == 1 though in_dims[i] == 1
|
|
result.push_back(i + bat);
|
|
}
|
|
} else {
|
|
PADDLE_ENFORCE_EQ(
|
|
in_dims[i],
|
|
dout_dims[i + bat],
|
|
common::errors::InvalidArgument(
|
|
"ReduceDims dimension mismatch. Operands could "
|
|
"not be broadcast together with the shape of X = [%s] and "
|
|
"the shape of Y = [%s]. X.shape[%d](%d) is not equal to "
|
|
"Y.shape[%d](%d).",
|
|
dout_dims,
|
|
in_dims,
|
|
i + bat,
|
|
dout_dims[i + bat],
|
|
i,
|
|
in_dims[i]));
|
|
}
|
|
}
|
|
return common::make_ddim(result);
|
|
}
|
|
|
|
static DDim get_reduce_dims(const DDim& x_dims, const DDim& y_dims) {
|
|
/*
|
|
@brief Computing reduction dim(s) from z=f(x, y) to x with right-alignment
|
|
broadcast rule.
|
|
|
|
* x_dims = [10, 1, 4, 1, 5]
|
|
* y_dims = [2, 1, 6, 1] <-- shaped are right-aligned for comparison
|
|
* <-- broadcast -->
|
|
* z_dims = [10, 2, 4, 6, 5]
|
|
* ==> reduce_dims_from_z_to_x = [1, 3]
|
|
* ==> reduce_dims_from_z_to_y = [0, 2, 4]
|
|
*/
|
|
auto out_dims = phi::funcs::BroadcastTwoDims(x_dims, y_dims);
|
|
return get_reduce_dims_from_out(out_dims, x_dims);
|
|
}
|
|
|
|
static std::vector<int> get_reduce_dims(const Tensor& dx,
|
|
const int& dout_ndim,
|
|
const int& x_ndim,
|
|
std::vector<int64_t>* x_dims) {
|
|
// this branch for broadcast with 1dim, we make 1dim to 2dim which make
|
|
// ddout_ndim > dout_dim, but ddout_ndim just can be used when grad_out_grad
|
|
// != nullptr
|
|
if (dout_ndim < x_ndim) {
|
|
return std::vector<int>({});
|
|
}
|
|
const std::vector<std::int64_t> dx_dims = common::vectorize(dx.dims());
|
|
std::vector<std::int64_t> broadcast_dims(dout_ndim);
|
|
std::fill(
|
|
broadcast_dims.data(), broadcast_dims.data() + dout_ndim - x_ndim, 1);
|
|
std::copy(x_dims->data(),
|
|
x_dims->data() + x_ndim,
|
|
broadcast_dims.data() + dout_ndim - x_ndim);
|
|
std::vector<int> reduce_dims;
|
|
for (int i = 0; i <= dout_ndim - 3; i++) {
|
|
if (dx_dims[i] != 1 && broadcast_dims[i] == 1) {
|
|
reduce_dims.push_back(i);
|
|
}
|
|
}
|
|
return reduce_dims;
|
|
}
|
|
|
|
// TODO(cxxly): Check and throws InvalidCastException when overflow.
|
|
template <typename SRC_T, typename DST_T>
|
|
static std::vector<DST_T> unsafe_vector_cast(const std::vector<SRC_T>& src) {
|
|
std::vector<DST_T> dst(src.begin(), src.end());
|
|
return dst;
|
|
}
|
|
|
|
// This function compute unsqueeze dims for reshape to replace unsqueeze.
|
|
static std::vector<int64_t> get_unsqueeze_dims(
|
|
const Tensor& origin, const std::vector<int64_t>& axis) {
|
|
auto origin_dims = origin.shape();
|
|
auto total_shape_size = origin_dims.size() + axis.size();
|
|
std::vector<int64_t> result;
|
|
size_t j = 0, k = 0;
|
|
for (size_t i = 0; i < total_shape_size; ++i) {
|
|
if (j < axis.size() && axis[j] == int64_t(i)) {
|
|
result.push_back(1);
|
|
j++;
|
|
} else {
|
|
PADDLE_ENFORCE_LT(
|
|
k,
|
|
origin_dims.size(),
|
|
common::errors::OutOfRange("Your index [%lu] exceeds the number of "
|
|
"elements in origin_dims[%lu].",
|
|
k,
|
|
origin_dims.size()));
|
|
result.push_back(origin_dims[k]);
|
|
k++;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
} // namespace prim
|
|
} // namespace paddle
|