// tensor/linear-ops.cc

// Copyright 2019 Johns Hopkins University (author: Daniel Povey)

// See ../../COPYING for clarification regarding multiple authors

//

// 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

//

// THIS CODE IS PROVIDED *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY

// KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED

// WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,

// MERCHANTABLITY OR NON-INFRINGEMENT.

// See the Apache 2 License for the specific language governing permissions and

// limitations under the License.

#include "tensor/linear-ops.h"

namespace kaldi {

namespace tensor {

void AddOp::Expand(std::vector<std::unique_ptr<Op> > *ops) const {

Pattern a_pattern = a_.Impl().pattern,

b_pattern = b_.Impl().pattern;

NormalizePatterns({a_pattern, b_pattern});

Tensor a(a_), b(b_);

if (a_pattern != a_.Impl().pattern)

a = WithPattern(a, a_pattern);

if (b_pattern != b_.Impl().pattern)

b = WithPattern(b, b_pattern);

/*

The case-statement values in the switch statement below may be

interpreted in groups of 3 hex characters, are 0xAAABBBCCC,

pertaining to Tensors a, b and c respectively. See

GetPatternCode() in pattern-utils.h for documentation on

the meanings of the values and our notation with X,x,1.

*/

int64 combined_code = CombineCodes(a_pattern.GetCode(),

b_pattern.GetCode());

// We are doing a += b.

switch(combined_code) {

// A scalar plus a scalar

case 0x000000000:

}

inline static void AddProductScalar3(

float alpha, float beta,

const TensorImpl &a, const TensorImpl &b, const TensorImpl *c) {

switch (a.device.device_type) {

case kCpuDevice:

AddProductScalar3Cpu(alpha, beta, a, b, c);

return;

#ifdef HAVE_CUDA

case kCudaDevice:

AddProductScalar3Gpu(alpha, beta, a, b, c);

return;

#endif

default:

KALDI_ERR << "Unsupported device type " << a.ToString();

}

}

void AddProduct(float alpha, float beta,

const TensorImpl &a, const TensorImpl &b, const TensorImpl *c){

if (a.pattern.code < b.pattern.code) {

// Ensure, via a recursion, that a.pattern.code >= b.pattern.code.

// This avoids us having to test for the swapped versions of the patterns.

AddProduct(alpha, beta, b, a, c);

return;

}

CheckDeviceAndDtype(a, b, *c);

int64 combined_code = CombineCodes(a.pattern.code, b.pattern.code,

c->pattern.code);

/*

The case-statement values in the switch statement below may be

interpreted in groups of 3 hex characters, are 0xAAABBBCCC,

pertaining to Tensors a, b and c respectively. See

GetPatternCode() in pattern-utils.h for documentation on

the meanings of the values and our notation with X,x,1.

*/

switch(combined_code) {

case 0x000000000:

// () * () -> ()

// scalar * scalar -> scalar

AddProductScalar3(a, b, c);

return;

case 0x101000101:

// (X) * ()-> (X)

// vector * scalar -> vector

AddProductVecScalarVec(a, b, c);

return;

case 0x101101101:

// (X) * (X) -> (X)

// vector .* vector -> vector

AddProductVec3(a, b, c);

return;

case 0x103101202:

// (x,X) * (X) -> (X,1)

// vector * matrix -> vector.unsqueeze(-1)

AddProductMatVecVec(a, b, c);

return;

case 0x203101202:

// (X,x) * (X) -> (X,1)

// transposed-matrix * vector -> vector.unsqueeze(-1)

AddProductTmatVecVec(a, b, c);

return;

case 0x202101103:

// (X,1) * (X) -> (x,X)

// vector * vector -> matrix (outer product)

AddProductVec2Mat(a, b, c);

return;

default:

break;

}

// If we reached this point, it means we could

// not handle this request with any of the basic operations above.

// Something is a little differ

SubTensor a_temp(a), b_temp(b), c_temp(*c);

PadAxes(&(a.pattern), &(b.pattern), &(c.pattern));

CompressPatterns({&a_temp, &b_temp, &c_temp});

}

} // namespace kaldi

} // namespace tensor