mirror of
https://github.com/pytorch/pytorch.git
synced 2025-10-20 21:14:14 +08:00
1433160a36
Summary: Pull Request resolved: https://github.com/pytorch/pytorch/pull/66742 Modified loops in files under fbsource/fbcode/caffe2/ from the format `for(TYPE var=x0;var<x_max;x++)` to the format `for(const auto var: irange(xmax))` This was achieved by running r-barnes's loop upgrader script (D28874212) with some modification to exclude all files under /torch/jit and a number of reversions or unused variable suppression warnings added by hand. Test Plan: Sandcastle Reviewed By: malfet Differential Revision: D31705366 fbshipit-source-id: be58222426c192406a7f93c21582c3f6f2082401
80 lines
2.2 KiB
C++
80 lines
2.2 KiB
C++
#ifndef CAFFE2_OPERATORS_INDEX_HASH_OPS_H_
|
|
#define CAFFE2_OPERATORS_INDEX_HASH_OPS_H_
|
|
|
|
#include "caffe2/core/export_caffe2_op_to_c10.h"
|
|
#include <c10/util/irange.h>
|
|
#include "caffe2/core/logging.h"
|
|
#include "caffe2/core/operator.h"
|
|
|
|
C10_DECLARE_EXPORT_CAFFE2_OP_TO_C10(IndexHash);
|
|
|
|
namespace caffe2 {
|
|
|
|
template <class Context>
|
|
class IndexHashOp : public Operator<Context> {
|
|
public:
|
|
USE_OPERATOR_CONTEXT_FUNCTIONS;
|
|
template <class... Args>
|
|
explicit IndexHashOp(Args&&... args)
|
|
: Operator<Context>(std::forward<Args>(args)...),
|
|
seed_(this->template GetSingleArgument<int64_t>("seed", 0)),
|
|
modulo_(this->template GetSingleArgument<int64_t>("modulo", 0)) {
|
|
CAFFE_ENFORCE_GT(modulo_, 0, "MODULO should be > 0");
|
|
}
|
|
|
|
bool RunOnDevice() override {
|
|
return DispatchHelper<TensorTypes<int32_t, int64_t>>::call(
|
|
this, Input(INDICES));
|
|
}
|
|
|
|
template <typename T>
|
|
bool DoRunWithType() {
|
|
auto& indices = Input(INDICES);
|
|
|
|
auto* hashed_indices =
|
|
Output(HASHED_INDICES, indices.sizes(), at::dtype<T>());
|
|
|
|
CAFFE_ENFORCE_GE(
|
|
static_cast<int64_t>(std::numeric_limits<T>::max()),
|
|
modulo_,
|
|
"MODULO shouldn't be larger than the numeric limit of the indices");
|
|
|
|
auto N = indices.numel();
|
|
auto* indices_data = indices.template data<T>();
|
|
auto* hashed_indices_data = hashed_indices->template mutable_data<T>();
|
|
|
|
for (const auto i : c10::irange(N)) {
|
|
hashed_indices_data[i] = hash(indices_data[i]);
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
protected:
|
|
template <typename T>
|
|
__ubsan_ignore_signed_int_overflow__
|
|
T hash(T id) {
|
|
int8_t* bytes = (int8_t*)&id;
|
|
T hashed = seed_ * 0xDEADBEEF;
|
|
// NOLINTNEXTLINE(clang-diagnostic-sign-compare)
|
|
for (int i = 0; i < sizeof(T) / sizeof(int8_t); i++) {
|
|
hashed = hashed * 65537 + bytes[i];
|
|
}
|
|
// We want the result of the modulo to be positive. This works under the
|
|
// assumption that modulo_ > 0 which is enforced in the constructor.
|
|
auto modHashed = hashed % modulo_;
|
|
return modHashed >= 0 ? modHashed : modHashed + modulo_;
|
|
}
|
|
|
|
private:
|
|
INPUT_TAGS(INDICES);
|
|
OUTPUT_TAGS(HASHED_INDICES);
|
|
|
|
int64_t seed_;
|
|
int64_t modulo_;
|
|
};
|
|
|
|
} // namespace caffe2
|
|
|
|
#endif // CAFFE2_OPERATORS_INDEX_HASH_OPS_H_
|