/* Copyright 2020 The TensorFlow 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. ==============================================================================*/ #include "tensorflow/c/eager/gradients.h" #include #include #include #include #include #include #include "absl/status/status.h" #include "absl/strings/str_cat.h" #include "absl/strings/string_view.h" #include "absl/types/span.h" #include "tensorflow/c/eager/abstract_context.h" #include "tensorflow/c/eager/abstract_operation.h" #include "tensorflow/c/eager/abstract_tensor_handle.h" #include "tensorflow/c/eager/c_api_unified_experimental_internal.h" #include "tensorflow/c/eager/gradients_internal.h" #include "tensorflow/c/eager/tape.h" #include "tensorflow/c/tensor_interface.h" #include "xla/tsl/platform/errors.h" #include "tensorflow/core/common_runtime/eager/attr_builder.h" #include "tensorflow/core/framework/tensor_shape.h" #include "tensorflow/core/lib/gtl/array_slice.h" #include "tensorflow/core/lib/llvm_rtti/llvm_rtti.h" #include "tensorflow/core/platform/types.h" namespace tensorflow { namespace gradients { namespace { // TODO(b/172558015): Using the pointer address as the identifier for the tensor // may lead to collisions. Introduce another way to get a unique id for this // tensor. int64_t ToId(const AbstractTensorHandle* t) { return static_cast(reinterpret_cast(t)); } } // namespace absl::Status GradientRegistry::Register( const std::string& op_name, GradientFunctionFactory gradient_function_factory) { auto iter = registry_.find(op_name); if (iter != registry_.end()) { return absl::AlreadyExistsError( absl::StrCat("Gradient already exists for op: ", op_name, ".")); } registry_.insert({op_name, gradient_function_factory}); return absl::OkStatus(); } absl::Status GradientRegistry::Lookup( const ForwardOperation& op, std::unique_ptr* gradient_function) const { auto iter = registry_.find(op.op_name); if (iter == registry_.end()) { return absl::NotFoundError( absl::StrCat("No gradient defined for op: ", op.op_name, ".")); } gradient_function->reset(iter->second(op)); return absl::OkStatus(); } TapeTensor::TapeTensor(AbstractTensorHandle* handle) : handle_(handle) { if (handle_) { handle_->Ref(); } } TapeTensor::TapeTensor(const TapeTensor& other) { handle_ = other.handle_; if (handle_) { handle_->Ref(); } } TapeTensor& TapeTensor::operator=(const TapeTensor& other) { if (this != &other) { if (other.handle_) { other.handle_->Ref(); } if (handle_) { handle_->Unref(); } handle_ = other.handle_; } return *this; } TapeTensor::TapeTensor(TapeTensor&& other) noexcept : handle_(other.handle_) { other.handle_ = nullptr; } TapeTensor& TapeTensor::operator=(TapeTensor&& other) noexcept { if (this != &other) { if (handle_) { handle_->Unref(); } handle_ = other.handle_; other.handle_ = nullptr; } return *this; } TapeTensor::~TapeTensor() { if (handle_) { handle_->Unref(); } } int64_t TapeTensor::GetID() const { return ToId(handle_); } tensorflow::DataType TapeTensor::GetDType() const { if (handle_ == nullptr) { return DT_INVALID; } return handle_->DataType(); } AbstractTensorHandle* TapeTensor::GetHandle() const { return handle_; } AbstractTensorHandle* TapeTensor::ZerosLike() const { return nullptr; } class TapeVSpace : public eager::VSpace { public: explicit TapeVSpace(AbstractContext* ctx) : ctx_(ctx) {} ~TapeVSpace() override = default; // Returns the number of elements in the gradient tensor. int64_t NumElements(AbstractTensorHandle* tensor) const override; // Consumes references to the tensors in the gradient_tensors list and returns // a tensor with the result. AbstractTensorHandle* AggregateGradients( absl::Span gradient_tensors) const override; // Calls the passed-in backward function. // op_type is the op's name provided in RecordOperation. absl::Status CallBackwardFunction( const std::string& op_type, GradientFunction* gradient_function, const std::vector& unneeded_gradients, absl::Span output_gradients, absl::Span result) const override; // Builds a tensor filled with ones with the same shape and dtype as `t`. absl::Status BuildOnesLike(const TapeTensor& t, AbstractTensorHandle** result) const override; // Looks up the ID of a Gradient. int64_t TensorId(AbstractTensorHandle* tensor) const override; // Converts a Gradient to a TapeTensor. TapeTensor TapeTensorFromGradient(AbstractTensorHandle* g) const override; void MarkAsResult(AbstractTensorHandle* gradient) const override; void DeleteGradient(AbstractTensorHandle* gradient) const override; private: // The context where the aggregation op `Add` is to be created. AbstractContext* ctx_; }; // Returns the number of elements in the gradient tensor. int64_t TapeVSpace::NumElements(AbstractTensorHandle* tensor) const { // TODO(srbs): It seems like this is used only for performance optimization // and not for correctness. The only downside of keeping this 1 seems to be // that the gradient accumulation is unbounded and we will never // aggressively aggregate accumulated gradients to recover memory. // Revisit and fix. return 1; } // Consumes references to the tensors in the gradient_tensors list and returns // a tensor with the result. AbstractTensorHandle* TapeVSpace::AggregateGradients( absl::Span gradient_tensors) const { if (gradient_tensors.size() == 1) { return gradient_tensors[0]; } AbstractOperationPtr op(ctx_->CreateOperation()); absl::Status s = op->Reset("AddN", /*raw_device_name=*/nullptr); if (!s.ok()) { return nullptr; } s = op->AddInputList(gradient_tensors); if (!s.ok()) { return nullptr; } int num_outputs = 1; std::vector outputs(num_outputs); s = op->Execute(absl::Span(outputs), &num_outputs); if (!s.ok()) { return nullptr; } return outputs[0]; } // Calls the passed-in backward function. // op_type is the op's name provided in RecordOperation. absl::Status TapeVSpace::CallBackwardFunction( const std::string& op_type, GradientFunction* gradient_function, const std::vector& unneeded_gradients, absl::Span output_gradients, absl::Span result) const { if (gradient_function == nullptr) { return absl::InvalidArgumentError(absl::StrCat( "Provided null gradient_function for '", op_type, "'.\n", "If the intent is to treat this op as non-differentiable consider ", "using RegisterNotDifferentiable or ", "NotDifferentiableGradientFunction.")); } return gradient_function->Compute(ctx_, output_gradients, result); } absl::Status TapeVSpace::BuildOnesLike(const TapeTensor& t, AbstractTensorHandle** result) const { AbstractOperationPtr op(ctx_->CreateOperation()); TF_RETURN_IF_ERROR(op->Reset("OnesLike", /*raw_device_name=*/nullptr)); if (isa(op.get())) { TF_RETURN_IF_ERROR(dyn_cast(op.get())->SetOpName( absl::StrCat("OnesLike", ToId(t.GetHandle())).c_str())); } TF_RETURN_IF_ERROR(op->AddInput(t.GetHandle())); int num_outputs = 1; std::vector outputs(num_outputs); TF_RETURN_IF_ERROR( op->Execute(absl::Span(outputs), &num_outputs)); *result = outputs[0]; return absl::OkStatus(); } // Looks up the ID of a Gradient. int64_t TapeVSpace::TensorId(AbstractTensorHandle* tensor) const { return ToId(tensor); } // Converts a Gradient to a TapeTensor. TapeTensor TapeVSpace::TapeTensorFromGradient(AbstractTensorHandle* g) const { return TapeTensor(g); } void TapeVSpace::MarkAsResult(AbstractTensorHandle* gradient) const {} void TapeVSpace::DeleteGradient(AbstractTensorHandle* gradient) const { gradient->Unref(); } void Tape::Watch(const AbstractTensorHandle* t) { GradientTape::Watch(ToId(t)); } void Tape::RecordOperation(absl::Span inputs, absl::Span outputs, GradientFunction* gradient_function, const std::string& op_name) { std::vector input_ids(inputs.size()); std::vector input_dtypes(inputs.size()); for (int i = 0; i < inputs.size(); i++) { input_ids[i] = ToId(inputs[i]); input_dtypes[i] = inputs[i]->DataType(); } std::vector tape_tensors; tape_tensors.reserve(outputs.size()); for (auto t : outputs) { tape_tensors.push_back(TapeTensor(t)); } GradientTape::RecordOperation( op_name, tape_tensors, input_ids, input_dtypes, [gradient_function]() -> GradientFunction* { return gradient_function; }, [](GradientFunction* ptr) { if (ptr) { delete ptr; } }); } bool Tape::ShouldRecord( absl::Span tensors) const { std::vector tensor_ids(tensors.size()); std::vector tensor_dtypes(tensors.size()); for (int i = 0; i < tensors.size(); i++) { tensor_ids[i] = ToId(tensors[i]); tensor_dtypes[i] = tensors[i]->DataType(); } return GradientTape::ShouldRecord(tensor_ids, tensor_dtypes); } void Tape::DeleteTrace(const AbstractTensorHandle* t) { GradientTape::DeleteTrace(ToId(t)); } std::vector MakeTensorIDList( absl::Span tensors) { std::vector ids(tensors.size()); for (int i = 0; i < tensors.size(); i++) { ids[i] = ToId(tensors[i]); } return ids; } absl::Status Tape::ComputeGradient( AbstractContext* ctx, absl::Span targets, absl::Span sources, absl::Span output_gradients, absl::Span result) { TapeVSpace vspace(ctx); std::vector target_tensor_ids = MakeTensorIDList(targets); std::vector source_tensor_ids = MakeTensorIDList(sources); tensorflow::gtl::FlatSet sources_set(source_tensor_ids.begin(), source_tensor_ids.end()); std::unordered_map sources_that_are_targets; for (int i = 0; i < target_tensor_ids.size(); ++i) { int64_t target_id = target_tensor_ids[i]; if (sources_set.find(target_id) != sources_set.end()) { auto tensor = targets[i]; sources_that_are_targets.insert( std::make_pair(target_id, TapeTensor(tensor))); } } TF_RETURN_IF_ERROR(GradientTape::ComputeGradient( vspace, target_tensor_ids, source_tensor_ids, sources_that_are_targets, output_gradients, result, /*build_default_zeros_grads*/ false)); return absl::OkStatus(); } // Helper functions which delegate to `AbstractOperation`, update // the state of the ForwardOperation and call the tape as appropriate. // These APIs are mainly to facilitate testing and are subject to change. namespace internal { absl::Status Reset(AbstractOperation* op_, const char* op, const char* raw_device_name, ForwardOperation* forward_op_) { forward_op_->op_name = op; forward_op_->attrs.Reset(op); return op_->Reset(op, raw_device_name); } absl::Status AddInput(AbstractOperation* op_, AbstractTensorHandle* input, ForwardOperation* forward_op_) { TF_RETURN_IF_ERROR(op_->AddInput(input)); forward_op_->inputs.push_back(input); return absl::OkStatus(); } absl::Status AddInputList(AbstractOperation* op_, absl::Span inputs, ForwardOperation* forward_op_) { TF_RETURN_IF_ERROR(op_->AddInputList(inputs)); for (auto input : inputs) { forward_op_->inputs.push_back(input); } return absl::OkStatus(); } absl::Status SetAttrString(AbstractOperation* op_, const char* attr_name, const char* data, size_t length, ForwardOperation* forward_op_) { forward_op_->attrs.Set(attr_name, absl::string_view(data, length)); return op_->SetAttrString(attr_name, data, length); } absl::Status SetAttrInt(AbstractOperation* op_, const char* attr_name, int64_t value, ForwardOperation* forward_op_) { forward_op_->attrs.Set(attr_name, static_cast(value)); return op_->SetAttrInt(attr_name, value); } absl::Status SetAttrFloat(AbstractOperation* op_, const char* attr_name, float value, ForwardOperation* forward_op_) { forward_op_->attrs.Set(attr_name, value); return op_->SetAttrFloat(attr_name, value); } absl::Status SetAttrBool(AbstractOperation* op_, const char* attr_name, bool value, ForwardOperation* forward_op_) { forward_op_->attrs.Set(attr_name, value); return op_->SetAttrBool(attr_name, value); } absl::Status SetAttrType(AbstractOperation* op_, const char* attr_name, DataType value, ForwardOperation* forward_op_) { forward_op_->attrs.Set(attr_name, value); return op_->SetAttrType(attr_name, value); } absl::Status SetAttrShape(AbstractOperation* op_, const char* attr_name, const int64_t* dims, const int num_dims, ForwardOperation* forward_op_) { if (num_dims > TensorShape::MaxDimensions()) { return absl::InvalidArgumentError( absl::StrCat("Value specified for `", attr_name, "` has ", num_dims, " dimensions which is over the limit of ", TensorShape::MaxDimensions(), ".")); } TensorShapeProto proto; if (num_dims < 0) { proto.set_unknown_rank(true); } else { for (int d = 0; d < num_dims; ++d) { proto.add_dim()->set_size(dims[d]); } } forward_op_->attrs.Set(attr_name, proto); return op_->SetAttrShape(attr_name, dims, num_dims); } absl::Status SetAttrFunction(AbstractOperation* op_, const char* attr_name, const AbstractOperation* value, ForwardOperation* forward_op_) { return absl::UnimplementedError( "SetAttrFunction has not been implemented yet."); } absl::Status SetAttrFunctionName(AbstractOperation* op_, const char* attr_name, const char* value, size_t length, ForwardOperation* forward_op_) { return absl::UnimplementedError( "SetAttrFunctionName has not been implemented " "yet."); } absl::Status SetAttrTensor(AbstractOperation* op_, const char* attr_name, AbstractTensorInterface* tensor, ForwardOperation* forward_op_) { return absl::UnimplementedError( "SetAttrTensor has not been implemented yet."); } absl::Status SetAttrStringList(AbstractOperation* op_, const char* attr_name, const void* const* values, const size_t* lengths, int num_values, ForwardOperation* forward_op_) { std::vector v(num_values); for (int i = 0; i < num_values; ++i) { v[i] = absl::string_view(static_cast(values[i]), lengths[i]); } forward_op_->attrs.Set(attr_name, v); return op_->SetAttrStringList(attr_name, values, lengths, num_values); } absl::Status SetAttrFloatList(AbstractOperation* op_, const char* attr_name, const float* values, int num_values, ForwardOperation* forward_op_) { forward_op_->attrs.Set(attr_name, gtl::ArraySlice(values, num_values)); return op_->SetAttrFloatList(attr_name, values, num_values); } absl::Status SetAttrIntList(AbstractOperation* op_, const char* attr_name, const int64_t* values, int num_values, ForwardOperation* forward_op_) { forward_op_->attrs.Set( attr_name, gtl::ArraySlice( reinterpret_cast(values), num_values)); return op_->SetAttrIntList(attr_name, values, num_values); } absl::Status SetAttrTypeList(AbstractOperation* op_, const char* attr_name, const DataType* values, int num_values, ForwardOperation* forward_op_) { forward_op_->attrs.Set(attr_name, gtl::ArraySlice(values, num_values)); return op_->SetAttrTypeList(attr_name, values, num_values); } absl::Status SetAttrBoolList(AbstractOperation* op_, const char* attr_name, const unsigned char* values, int num_values, ForwardOperation* forward_op_) { std::unique_ptr b(new bool[num_values]); for (int i = 0; i < num_values; ++i) { b[i] = values[i]; } forward_op_->attrs.Set(attr_name, gtl::ArraySlice(b.get(), num_values)); return op_->SetAttrBoolList(attr_name, values, num_values); } absl::Status SetAttrShapeList(AbstractOperation* op_, const char* attr_name, const int64_t** dims, const int* num_dims, int num_values, ForwardOperation* forward_op_) { std::unique_ptr proto(new TensorShapeProto[num_values]); for (int i = 0; i < num_values; ++i) { const auto num_dims_i = num_dims[i]; if (num_dims_i > TensorShape::MaxDimensions()) { return absl::InvalidArgumentError( absl::StrCat("Value specified for `", attr_name, "` has ", num_dims_i, " dimensions which is over the limit of ", TensorShape::MaxDimensions(), ".")); } if (num_dims_i < 0) { proto[i].set_unknown_rank(true); } else { const int64_t* dims_i = dims[i]; auto proto_i = &proto[i]; for (int d = 0; d < num_dims_i; ++d) { proto_i->add_dim()->set_size(dims_i[d]); } } } forward_op_->attrs.Set( attr_name, absl::Span(proto.get(), num_values)); return op_->SetAttrShapeList(attr_name, dims, num_dims, num_values); } absl::Status SetAttrFunctionList(AbstractOperation* op_, const char* attr_name, absl::Span values, ForwardOperation* forward_op_) { return absl::UnimplementedError( "SetAttrFunctionList has not been " "implemented yet."); } absl::Status Execute(AbstractOperation* op_, AbstractContext* ctx, absl::Span retvals, int* num_retvals, ForwardOperation* forward_op_, Tape* tape, const GradientRegistry& registry) { TF_RETURN_IF_ERROR(op_->Execute(retvals, num_retvals)); for (int i = 0; i < *num_retvals; i++) { // TODO(srbs): Manage refcount of ForwardOperation's inputs/outputs. forward_op_->outputs.push_back(retvals[i]); } // TODO(b/166669239): This is needed to support AttrBuilder::Get for string // attributes. Number type attrs and DataType attrs work fine without this. // Consider getting rid of this and making the behavior between number types // and string consistent. forward_op_->attrs.BuildNodeDef(); std::unique_ptr gradient_fn; TF_RETURN_IF_ERROR(registry.Lookup(*forward_op_, &gradient_fn)); tape->RecordOperation(forward_op_->inputs, retvals.subspan(0, *num_retvals), gradient_fn.release(), op_->Name()); return absl::OkStatus(); } } // namespace internal } // namespace gradients } // namespace tensorflow