/* Copyright 2017 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. ==============================================================================*/ // Utilities for dealing with Literal protobufs. #ifndef TENSORFLOW_COMPILER_XLA_LITERAL_UTIL_H_ #define TENSORFLOW_COMPILER_XLA_LITERAL_UTIL_H_ #include #include #include #include #include #include #include #include #include "absl/memory/memory.h" #include "absl/strings/string_view.h" #include "absl/types/span.h" #include "tensorflow/compiler/xla/array2d.h" #include "tensorflow/compiler/xla/array3d.h" #include "tensorflow/compiler/xla/array4d.h" #include "tensorflow/compiler/xla/index_util.h" #include "tensorflow/compiler/xla/layout_util.h" #include "tensorflow/compiler/xla/literal.h" #include "tensorflow/compiler/xla/primitive_util.h" #include "tensorflow/compiler/xla/shape_util.h" #include "tensorflow/compiler/xla/sparse_index_array.h" #include "tensorflow/compiler/xla/status_macros.h" #include "tensorflow/compiler/xla/types.h" #include "tensorflow/compiler/xla/util.h" #include "tensorflow/compiler/xla/xla_data.pb.h" #include "tensorflow/core/lib/core/bitmap.h" #include "tensorflow/core/lib/core/status.h" #include "tensorflow/core/platform/logging.h" #include "tensorflow/core/platform/macros.h" #include "tensorflow/core/platform/protobuf.h" #include "tensorflow/core/platform/types.h" namespace xla { class LiteralUtil { public: LiteralUtil() = delete; // Returns a literal scalar representing the first element. static Literal GetFirstScalarLiteral(const LiteralSlice& literal); // Creates a new literal of a given rank. To minimize ambiguity (for users // and the compiler) these CreateR[0-2] methods should explicitly specify the // native type. For example: // // CreateR1({1.0, 42.0}); // CreateR2({{1, 2}, {3, 4}}); // // The variants not ending with WithLayout use the default XLA layout for the // literal's linear representation in memory. template static Literal CreateR0(NativeT value); template static Literal CreateR1(absl::Span values); static Literal CreateR1(const tensorflow::core::Bitmap& values); template static Literal CreateR2( std::initializer_list> values); template static Literal CreateR2WithLayout( std::initializer_list> values, const Layout& layout); template static Literal CreateR3(std::initializer_list< std::initializer_list>> values); template static Literal CreateR3WithLayout( std::initializer_list< std::initializer_list>> values, const Layout& layout); template static Literal CreateR4( std::initializer_list>>> values); template static Literal CreateR4WithLayout( std::initializer_list>>> values, const Layout& layout); // Creates a literal with a sparse layout and the given indices and values. // The shape is initialized from the given dimensions. The minor dimension of // the indices array must equal the rank of the shape (i.e. size of the // dimensions array). The major dimension of the indices array must equal the // number of elements in the values array. The maximum number of elements in // the array is taken from the max_indices() value of the index array. // // XLA assumes that sparse literals are in sorted order for all operations. If // the `sort` argument is true, then the indices and values will be sorted // while copying them into the literal. If you have ensured that the indices // and values are already sorted, then you may set the `sort` argument to // false to skip the sorting step. // // For example: // // CreateSparse( // {12, 12, 12}, // SparseIndexArray(10, 3, // Array2D{ // {0, 1, 2}, // {3, 4, 5}, // {6, 7, 8}, // {9, 10, 11}, // }), // {1.0, 2.0 3.0, 4.0}) // // This creates an array with shape F64[12,12,12]sparse{10}, that has the // following non-zero values: // // [0, 1, 2]: 1.0 // [3, 4, 5]: 2.0 // [6, 7, 8]: 3.0 // [9, 10, 11]: 4.0 // template static Literal CreateSparse(absl::Span dimensions, SparseIndexArray indices, absl::Span values, bool sort = true); // Creates a scalar literal value zero of the given primitive type. static Literal Zero(PrimitiveType primitive_type); // Creates a scalar literal value one of the given primitive type. static Literal One(PrimitiveType primitive_type); // Creates a scalar literal value containing the minimum value of the given // primitive type. For floating-point types, returns -inf. static Literal MinValue(PrimitiveType primitive_type); // Creates a scalar literal value containing the maximum value of the given // primitive type. For floating-point types, returns inf. static Literal MaxValue(PrimitiveType primitive_type); // Creates a literal of the given shape where each element is `value`. template static Literal CreateFullWithDescendingLayout( absl::Span dimensions, NativeT value); // Creates a new literal from an Array type. The variants not ending with // WithLayout use the default XLA layout for the literal's linear // representation in memory. template static Literal CreateFromArray(const Array& values); template static Literal CreateFromArrayWithLayout(const Array& values, const Layout& layout); template static Literal CreateR2FromArray2D(const Array2D& values); template static Literal CreateR2FromArray2DWithLayout(const Array2D& values, const Layout& layout); template static Literal CreateR3FromArray3D(const Array3D& values); template static Literal CreateR3FromArray3DWithLayout(const Array3D& values, const Layout& layout); template static Literal CreateR4FromArray4D(const Array4D& values); template static Literal CreateR4FromArray4DWithLayout(const Array4D& values, const Layout& layout); // Creates a new vector of U8s literal value from a string. static Literal CreateR1U8(absl::string_view value); // Creates a linspace-populated literal with the given number of rows and // columns. static Literal CreateR2F32Linspace(float from, float to, int64 rows, int64 cols); // Creates a literal that projects the (x, y) dimensions given in values into // the z dimension given by "projection". template static Literal CreateR3Projected( std::initializer_list> values, int64 projection); // Creates a literal that projects the (x, y) dimensions given in values into // the z and p dimensions given. template static Literal CreateR4Projected( std::initializer_list> values, int64 projection_p, int64 projection_z); // Returns an identity matrix (rank 2) with the given row and column count. template static Literal MakeIdentityR2(int64 size); // Returns a tuple literal composed of given literals. Data is copied from the // given elements into the returned literal. static Literal MakeTuple(absl::Span elements); static Literal MakeTupleFromSlices(absl::Span elements); // As above, but intended to be invoked with move semantics; i.e. // // std::vector elements = ...; // auto result = LiteralUtil::MakeTupleOwned(std::move(elements)); // // This would have been declared as an overload, but there is ambiguity // in invocation between the above signature and this one. static Literal MakeTupleOwned(std::vector elements); // This overload lets you pass a braced list of Literals to // MakeTupleOwned: // // LiteralUtil::MakeTupleOwned(LiteralUtil::CreateR1(...), ...). // // Simply relying on the MakeTupleOwned(std::vector) // overload doesn't work because std::initializer_list's elements are always // const. // // The arguments to this function must all be Literal. template static Literal MakeTupleOwned(Ts... elements) { std::array arr{std::move(elements)...}; std::vector v; v.insert(v.begin(), std::make_move_iterator(arr.begin()), std::make_move_iterator(arr.end())); return MakeTupleOwned(std::move(v)); } // Create a constant token literal. Token types have no value. static Literal CreateToken(); // Creates a new Literal object with its values havings the primitive_type // type, and with dimensions defined by the dimensions parameter. // The content of the literal values is the default value of the primitive // type of literal itself (0 for numeric types, and false for predicates). static Literal CreateFromDimensions(PrimitiveType primitive_type, absl::Span dimensions); // If the given literal's data type is bfloat16, converts it to a float // literal; otherwise, returns a copy of it. If the literal is a tuple, // recursively converts its elements. static Literal ConvertBF16ToF32(const LiteralSlice& bf16_literal); // If the given literal's data type is float, converts it to a bfloat16 // literal; otherwise, returns a copy of it. If the literal is a tuple, // recursively converts its elements. static Literal ConvertF32ToBF16(const LiteralSlice& f32_literal); // Creates a literal with a new shape with the given new dimensions using the // data in the given input literal. For reshaping purposes the (flat) data // buffer of the input literal is assumed to have the given minor_to_major // layout order. static Literal ReshapeSlice(absl::Span new_dimensions, absl::Span minor_to_major, const LiteralSlice& literal); // Creates a literal with the supplied shape, and uses the provided value // generator to populate the literal's values. // Returns the new literal object, or an error Status if failed. template < PrimitiveType type, typename T = typename primitive_util::PrimitiveTypeToNative::type> static StatusOr CreateRandomLiteral( const Shape& shape, const std::function)>& generator); // Creates a literal with the supplied shape, and initializes the literal // values using a normal distribution with given mean and stddev standard // deviation, and using the engine as entropy generator. // Returns the new literal object, or an error Status if failed. template < PrimitiveType type, typename E, typename T = typename primitive_util::PrimitiveTypeToNative::type> static StatusOr CreateRandomLiteral(const Shape& shape, E* engine, T mean, T stddev); // Creates a literal with the supplied shape, and initializes the literal // values using a normal distribution with given mean and stddev standard // deviation. // Returns the new literal object, or an error Status if failed. template < PrimitiveType type, typename T = typename primitive_util::PrimitiveTypeToNative::type> static StatusOr CreateRandomLiteral(const Shape& shape, T mean, T stddev); // // End of factory methods. // Returns a multi-dimensional index as a string. For example: '{7, 8}' will // be returned for a 2-dimensional index with dimension 0 index equal to 7, // dimension 1 equal to 8. static string MultiIndexAsString(absl::Span multi_index); }; std::ostream& operator<<(std::ostream& out, const Literal& literal); template /* static */ Literal LiteralUtil::CreateR0(NativeT value) { Literal literal(ShapeUtil::MakeShape( primitive_util::NativeToPrimitiveType(), {})); literal.Set({}, value); return literal; } template /* static */ Literal LiteralUtil::CreateR1(absl::Span values) { Literal literal( ShapeUtil::MakeShape(primitive_util::NativeToPrimitiveType(), {static_cast(values.size())})); literal.PopulateR1(values); return literal; } template /* static */ Literal LiteralUtil::CreateR2WithLayout( std::initializer_list> values, const Layout& layout) { Literal literal(ShapeUtil::MakeShapeWithLayout( primitive_util::NativeToPrimitiveType(), {static_cast(values.size()), static_cast(values.begin()->size())}, AsInt64Slice(layout.minor_to_major()))); literal.PopulateR2(values); return literal; } template /* static */ Literal LiteralUtil::CreateR2( std::initializer_list> values) { return CreateR2WithLayout(values, LayoutUtil::GetDefaultLayoutForR2()); } template /* static */ Literal LiteralUtil::CreateR3WithLayout( std::initializer_list>> values, const Layout& layout) { const int64 d0 = values.size(); const int64 d1 = values.begin()->size(); const int64 d2 = values.begin()->begin()->size(); Array3D tmp(d0, d1, d2); int64 i0 = 0; for (auto d1_values : values) { int64 i1 = 0; for (auto d2_values : d1_values) { int64 i2 = 0; for (auto value : d2_values) { tmp(i0, i1, i2) = value; ++i2; } ++i1; } ++i0; } return CreateR3FromArray3DWithLayout(tmp, layout); } template /* static */ Literal LiteralUtil::CreateR3( std::initializer_list>> values) { return CreateR3WithLayout(values, LayoutUtil::GetDefaultLayoutForR3()); } template /* static */ Literal LiteralUtil::CreateR4WithLayout( std::initializer_list>>> values, const Layout& layout) { const int64 d0 = values.size(); const int64 d1 = values.begin()->size(); const int64 d2 = values.begin()->begin()->size(); const int64 d3 = values.begin()->begin()->begin()->size(); Array4D tmp(d0, d1, d2, d3); int64 i0 = 0; for (auto d1_values : values) { int64 i1 = 0; for (auto d2_values : d1_values) { int64 i2 = 0; for (auto d3_values : d2_values) { int64 i3 = 0; for (auto value : d3_values) { tmp(i0, i1, i2, i3) = value; ++i3; } ++i2; } ++i1; } ++i0; } return CreateR4FromArray4DWithLayout(tmp, layout); } template /* static */ Literal LiteralUtil::CreateSparse( absl::Span dimensions, SparseIndexArray indices, absl::Span values, bool sort) { int64 num_elements = values.size(); int64 rank = dimensions.size(); CHECK_EQ(num_elements, indices.index_count()); CHECK_EQ(rank, indices.rank()); Literal literal(ShapeUtil::MakeShapeWithSparseLayout( primitive_util::NativeToPrimitiveType(), dimensions, indices.max_indices())); literal.PopulateSparse(indices, values, sort); return literal; } template /* static */ Literal LiteralUtil::CreateR4( std::initializer_list>>> values) { return CreateR4WithLayout(values, LayoutUtil::GetDefaultLayoutForR4()); } template /* static */ Literal LiteralUtil::CreateFromArrayWithLayout( const Array& values, const Layout& layout) { Literal literal(ShapeUtil::MakeShapeWithLayout( primitive_util::NativeToPrimitiveType(), values.dimensions(), AsInt64Slice(layout.minor_to_major()))); literal.PopulateFromArray(values); return literal; } template /* static */ Literal LiteralUtil::CreateFromArray( const Array& values) { return CreateFromArrayWithLayout( values, LayoutUtil::GetDefaultLayoutForRank(values.num_dimensions())); } template /* static */ Literal LiteralUtil::CreateR2FromArray2DWithLayout( const Array2D& values, const Layout& layout) { return CreateFromArrayWithLayout(values, layout); } template /* static */ Literal LiteralUtil::CreateR2FromArray2D( const Array2D& values) { return CreateFromArray(values); } template /* static */ Literal LiteralUtil::CreateR3FromArray3DWithLayout( const Array3D& values, const Layout& layout) { return CreateFromArrayWithLayout(values, layout); } template /* static */ Literal LiteralUtil::CreateR3FromArray3D( const Array3D& values) { return CreateFromArray(values); } template /* static */ Literal LiteralUtil::CreateR3Projected( std::initializer_list> values, int64 projection) { int64 dim0_size = projection; int64 dim1_size = values.size(); int64 dim2_size = values.begin()->size(); Array3D array(dim0_size, dim1_size, dim2_size); for (int64 dim0 = 0; dim0 < dim0_size; ++dim0) { int64 dim1 = 0; for (auto inner_list : values) { int64 dim2 = 0; for (auto value : inner_list) { array(dim0, dim1, dim2) = value; ++dim2; } CHECK_EQ(dim2_size, dim2); ++dim1; } CHECK_EQ(dim1_size, dim1); } return CreateR3FromArray3D(array); } template /* static */ Literal LiteralUtil::CreateR4Projected( std::initializer_list> values, int64 projection_p, int64 projection_z) { int64 dim0_size = projection_p; int64 dim1_size = projection_z; int64 dim2_size = values.size(); int64 dim3_size = values.begin()->size(); Array4D array(dim0_size, dim1_size, dim2_size, dim3_size); for (int64 dim0 = 0; dim0 < dim0_size; ++dim0) { for (int64 dim1 = 0; dim1 < dim1_size; ++dim1) { int64 dim2 = 0; for (auto inner_list : values) { int64 dim3 = 0; for (auto value : inner_list) { array(dim0, dim1, dim2, dim3) = value; ++dim3; } CHECK_EQ(dim3_size, dim3); ++dim2; } CHECK_EQ(dim2_size, dim2); } } return CreateR4FromArray4D(array); } template /* static */ Literal LiteralUtil::CreateR4FromArray4D( const Array4D& values) { return CreateFromArray(values); } template /* static */ Literal LiteralUtil::CreateR4FromArray4DWithLayout( const Array4D& values, const Layout& layout) { return CreateFromArrayWithLayout(values, layout); } // Returns an identity matrix (rank 2) with the given row and column count. template /* static */ Literal LiteralUtil::MakeIdentityR2(int64 size) { Array2D array(size, size, 0); for (int64 i = 0; i < size; ++i) { array(i, i) = 1; } return CreateR2FromArray2D(array); } template /* static */ Literal LiteralUtil::CreateFullWithDescendingLayout( absl::Span dimensions, NativeT value) { Literal literal(ShapeUtil::MakeShapeWithDescendingLayout( primitive_util::NativeToPrimitiveType(), dimensions)); literal.PopulateWithValue(value); return literal; } template /* static */ StatusOr LiteralUtil::CreateRandomLiteral( const Shape& shape, const std::function)>& generator) { using NativeT = typename primitive_util::PrimitiveTypeToNative::type; TF_RET_CHECK(shape.element_type() == type); Literal literal(shape); TF_RETURN_IF_ERROR(literal.Populate( [&](absl::Span indexes) { return generator(indexes); })); return std::move(literal); } template /* static */ StatusOr LiteralUtil::CreateRandomLiteral( const Shape& shape, E* engine, T mean, T stddev) { using NativeT = typename primitive_util::PrimitiveTypeToNative::type; std::normal_distribution generator(mean, stddev); return CreateRandomLiteral( shape, [&](absl::Span /*indexes*/) { return generator(*engine); }); } template /* static */ StatusOr LiteralUtil::CreateRandomLiteral( const Shape& shape, T mean, T stddev) { std::minstd_rand0 engine; return CreateRandomLiteral(shape, &engine, mean, stddev); } } // namespace xla #endif // TENSORFLOW_COMPILER_XLA_LITERAL_UTIL_H_